@effect-ts/system
Version:
Effect-TS is a zero dependency set of libraries to write highly productive, purely functional TypeScript at scale.
63 lines (59 loc) • 2.17 kB
text/typescript
// ets_tracing: off
import type * as Tp from "../../../Collections/Immutable/Tuple/index.js"
import * as T from "../../../Effect/index.js"
import type * as OD from "../../../Ord/index.js"
import type * as S from "../_internal/core.js"
import type * as C from "./core.js"
import * as ZipAllSortedByKeyWithExec from "./zipAllSortedByKeyWithExec.js"
/**
* Zips this stream that is sorted by distinct keys and the specified
* stream that is sorted by distinct keys to produce a new stream that is
* sorted by distinct keys. Uses the functions `left`, `right`, and `both`
* to handle the cases where a key and value exist in this stream, that
* stream, or both streams.
*
* This allows zipping potentially unbounded streams of data by key in
* constant space but the caller is responsible for ensuring that the
* streams are sorted by distinct keys.
*/
export function zipAllSortedByKeyWith_<R, R1, E, E1, K, A, B, C1, C2, C3>(
self: C.SortedByKey<R, E, K, A>,
that: C.SortedByKey<R1, E1, K, B>,
left: (a: A) => C1,
right: (b: B) => C2,
both: (a: A, b: B) => C3,
ord: OD.Ord<K>
): S.Stream<R & R1, E | E1, Tp.Tuple<[K, C1 | C2 | C3]>> {
return ZipAllSortedByKeyWithExec.zipAllSortedByKeyWithExec_(
self,
that,
left,
right,
both,
ord,
T.parallel
)
}
/**
* Zips this stream that is sorted by distinct keys and the specified
* stream that is sorted by distinct keys to produce a new stream that is
* sorted by distinct keys. Uses the functions `left`, `right`, and `both`
* to handle the cases where a key and value exist in this stream, that
* stream, or both streams.
*
* This allows zipping potentially unbounded streams of data by key in
* constant space but the caller is responsible for ensuring that the
* streams are sorted by distinct keys.
*
* @ets_data_first zipAllSortedByKeyWith_
*/
export function zipAllSortedByKeyWith<R1, E1, K, A, B, C1, C2, C3>(
that: C.SortedByKey<R1, E1, K, B>,
left: (a: A) => C1,
right: (b: B) => C2,
both: (a: A, b: B) => C3,
ord: OD.Ord<K>
) {
return <R, E>(self: C.SortedByKey<R, E, K, A>) =>
zipAllSortedByKeyWith_(self, that, left, right, both, ord)
}