-
Notifications
You must be signed in to change notification settings - Fork 7
/
Copy pathreduce.ts
118 lines (101 loc) · 3.36 KB
/
reduce.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
// Copyright (c) 2020 Jozty. All rights reserved. MIT license.
import { isArrayLike, isIterable, isIterator } from './utils/is.ts';
import { getIterator, getTransformer } from './utils/get.ts';
import curryN from './utils/curry_n.ts';
import type { FuncArr2, FunctorWithArLk, PH } from './utils/types.ts';
import {
AbstractTransformer,
ReducedTransformer,
TransformerFunc,
} from './utils/Transformers/transformers.ts';
import { throwFunctorError } from './utils/throw.ts';
// @types
type Reducer<R, T> =
| FuncArr2<R, T, R | ReducedTransformer<R>>
| AbstractTransformer<R, T>;
type Reduce_1<R, T> = (func: Reducer<R, T>) => R;
type Reduce_2<R> = (acc: R) => R;
type Reduce_3<R, T> = (functor: FunctorWithArLk<T>) => R;
type Reduce_2_3<R, T> =
& ((acc: R) => Reduce_3<R, T>)
& (<T>(acc: PH, functor: FunctorWithArLk<T>) => Reduce_2<R>)
& (<T>(acc: R, functor: FunctorWithArLk<T>) => R);
type Reduce_1_3<R> =
& (<T>(func: Reducer<R, T>) => Reduce_3<R, T>)
& (<T>(func: PH, functor: FunctorWithArLk<T>) => Reduce_1<R, T>)
& (<T>(func: Reducer<R, T>, functor: FunctorWithArLk<T>) => R);
type Reduce_1_2<T> =
& (<R>(func: Reducer<R, T>) => Reduce_2<R>)
& (<R>(func: PH, acc: R) => Reduce_1<R, T>)
& (<R>(func: Reducer<R, T>, acc: R) => R);
type Reduce =
& (<R, T>(func: Reducer<R, T>) => Reduce_2_3<R, T>)
& (<R>(func: PH, acc: R) => Reduce_1_3<R>)
& (<T>(func: PH, acc: PH, functor: FunctorWithArLk<T>) => Reduce_1_2<T>)
& (<R, T>(func: Reducer<R, T>, acc: R) => Reduce_3<R, T>)
& (<R, T>(
func: Reducer<R, T>,
acc: PH,
functor: FunctorWithArLk<T>,
) => Reduce_2<R>)
& (<R, T>(func: PH, acc: R, functor: FunctorWithArLk<T>) => Reduce_1<R, T>)
& (<R, T>(func: Reducer<R, T>, acc: R, functor: FunctorWithArLk<T>) => R);
function _arrayReduce<R, T>(
trans: AbstractTransformer<R, T>,
acc: R,
list: ArrayLike<T>,
): R {
for (let i = 0, l = list.length; i < l; i++) {
const reducedAcc = trans.step(acc, list[i]);
if (reducedAcc && reducedAcc instanceof ReducedTransformer) {
acc = reducedAcc.value;
break;
} else {
acc = reducedAcc;
}
}
return trans.result(acc) as R;
}
function _iterableReduce<R, T>(
trans: AbstractTransformer<R, T>,
acc: R,
it: Iterator<T>,
): R {
let step = it.next();
while (!step.done) {
const reducedAcc = trans.step(acc, step.value);
if (reducedAcc && reducedAcc instanceof ReducedTransformer) {
acc = reducedAcc.value;
break;
} else {
acc = reducedAcc;
}
step = it.next();
}
return trans.result(acc) as R;
}
function _reduce<R, T>(
func: Reducer<R, T>,
acc: R,
functor: FunctorWithArLk<T>,
): R {
const trans = getTransformer<R, T>(func as TransformerFunc<R, T>);
if (isArrayLike(functor)) return _arrayReduce<R, T>(trans, acc, functor);
if (isIterable(functor)) {
return _iterableReduce(trans, acc, getIterator<T>(functor));
}
if (isIterator(functor)) return _iterableReduce(trans, acc, functor);
throwFunctorError();
}
/**
* Returns a single value by iterating though `functor`
* calling the iterator function `func`. `func` takes two arguments.
* First - `acc`, Second - `value`.
*
* It may stop the reduction in between by means of `ReducedTransformer`.
*
* Acts as a transducer if a transformer is given in `functor`.
*
* Works on array-like/iterable/iterator
*/
export const reduce = curryN(3, _reduce) as Reduce;