Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 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 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 | 1x 1x 1x 1x 1x 1x 1x 1x 290x 47x 47x 47x 47x 47x 47x 47x 47x 7x 7x 4x 4x 4x 4x 4x 4x 4x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 7x 47x 47x 47x 1x 1x 1x 1x 46x 46x 46x 46x 46x 46x 46x 46x 1x 1x 2x 1x 1x 1x 1x 1x 1x 47x 47x 47x 47x 7x 7x 7x 12x 7x 47x | import {
Applicative,
SemiApplicative,
Traversable as traversable,
} from '@effect/typeclass'
import {Traversable as ArrayTraversable} from '@effect/typeclass/data/Array'
import {getApplicative as getEffectApplicative} from '@effect/typeclass/data/Effect'
import {Effect, flow, Function, HKT, identity, pipe} from 'effect'
import {succeedBy} from 'effect-ts-folds'
import {leaf, match, tree} from '../tree/index.js'
import type {Tree, TreeTypeLambda} from '../tree/types.js'
// Two types of depth-first order for N-ary trees.
type DepthFirst = 'pre' | 'post'
const orderedTraverseEffect =
(order: DepthFirst) =>
<F extends HKT.TypeLambda>(F: Applicative.Applicative<F>) =>
<A, B, E1 = unknown, R1 = unknown, I = never, E2 = never, R2 = never>(
f: (a: A) => Effect.Effect<HKT.Kind<F, I, R1, E1, B>, E2, R2>,
) =>
(self: Tree<A>): Effect.Effect<HKT.Kind<F, I, R1, E1, Tree<B>>, E2, R2> => {
const buildTree = treeK(F)
const run: (
self: Tree<A>,
) => Effect.Effect<HKT.Kind<F, I, R1, E1, Tree<B>>, E2, R2> = match({
onLeaf: flow(f, Effect.map(F.map(leaf))),
onBranch: (value, forest) =>
Effect.suspend(() => {
return order === 'post'
? pipe(
forest,
Effect.forEach(run),
Effect.flatMap(forest =>
Effect.map(f(value), buildTree(forest)),
),
)
: pipe(
value,
f,
Effect.flatMap(value =>
pipe(
forest,
Effect.forEach(run),
Effect.map(forest => buildTree(value, forest)),
),
),
)
}),
})
return run(self)
}
/**
* Like {@link traverse} but leaves the result in an effect.
* @category instances
* @function
*/
export const traverseEffect = Object.assign(orderedTraverseEffect('pre'), {
post: orderedTraverseEffect('post'),
})
/**
* `traverse` for {@link Tree}.
* @category instances
* @function
*/
export const traverse: traversable.Traversable<TreeTypeLambda>['traverse'] = <
F extends HKT.TypeLambda,
>(
F: Applicative.Applicative<F>,
) =>
Function.dual(
2,
<I, R1, E1, A, _1, _2, _3, B>(
self: Tree<A>,
f: (a: A) => HKT.Kind<F, I, R1, E1, B>,
) => pipe(self, traverseEffect(F)(succeedBy(f)), Effect.runSync),
)
/**
* Convert a `Tree<F<A>>` into a `F<Tree<A>>`.
* @category instances
* @function
*/
export const sequence: <F extends HKT.TypeLambda>(
F: Applicative.Applicative<F>,
) => <A, E = unknown, R = unknown, I = never>(
self: Tree<HKT.Kind<F, I, R, E, A>>,
) => HKT.Kind<F, I, R, E, Tree<A>> = F => self =>
pipe(self, traverse(F)(identity))
/**
* Traversable instance for {@link Tree}.
* @category instances
*/
export const Traversable: traversable.Traversable<TreeTypeLambda> = {traverse}
/**
* Convert a `Tree<Effect<A>>` into an `Effect<Tree<A>>`.
* @category instances
* @function
*/
export const sequenceEffect: <A, E = unknown, O = unknown>(
self: Tree<Effect.Effect<A, E, O>>,
) => Effect.Effect<Tree<A>, E, O> = traversable.sequence(Traversable)(
getEffectApplicative(),
)
/**
* Like the {@link tree} constructor, creates a new tree from its node and
* forest, except both are inside some data type whose applicative is
* given in the first argument.
* @category instances
* @function
*/
export const treeK = <F extends HKT.TypeLambda>(
F: Applicative.Applicative<F>,
): {
<A, E = unknown, O = unknown, R = never>(
value: HKT.Kind<F, R, O, E, A>,
forest: HKT.Kind<F, R, O, E, Tree<A>>[],
): HKT.Kind<F, R, O, E, Tree<A>>
<A, E = unknown, O = unknown, R = never>(
forest: HKT.Kind<F, R, O, E, Tree<A>>[],
): (value: HKT.Kind<F, R, O, E, A>) => HKT.Kind<F, R, O, E, Tree<A>>
} =>
Function.dual(
2,
<A, E = unknown, O = unknown, R = never>(
value: HKT.Kind<F, R, O, E, A>,
forest: HKT.Kind<F, R, O, E, Tree<A>>[],
): HKT.Kind<F, R, O, E, Tree<A>> =>
SemiApplicative.lift2(F)((self: A, that: readonly Tree<A>[]) =>
tree(self, that),
)(value, pipe(forest, traversable.sequence(ArrayTraversable)(F))),
)
|