effect-tree
    Preparing search index...

    Variable treeFConst

    treeF: {
        flip: {
            <A, C>(forest: readonly C[], value: A): TreeF.TreeF<A, C>;
            <A>(value: A): <C>(forest: readonly C[]) => TreeF.TreeF<A, C>;
        };
        <A, C>(value: A, forest: readonly C[]): TreeF.TreeF<A, C>;
        <C>(forest: readonly C[]): <A>(value: A) => TreeF.TreeF<A, C>;
    } = ...

    Create a new TreeF from a node value and a possibly empty list of child nodes.

    Type Declaration

      • <A, C>(value: A, forest: readonly C[]): TreeF.TreeF<A, C>
      • Type Parameters

        • A
        • C

        Parameters

        • value: A
        • forest: readonly C[]

        Returns TreeF.TreeF<A, C>

      • <C>(forest: readonly C[]): <A>(value: A) => TreeF.TreeF<A, C>
      • Type Parameters

        • C

        Parameters

        • forest: readonly C[]

        Returns <A>(value: A) => TreeF.TreeF<A, C>

    • flip: {
          <A, C>(forest: readonly C[], value: A): TreeF.TreeF<A, C>;
          <A>(value: A): <C>(forest: readonly C[]) => TreeF.TreeF<A, C>;
      }

    The underlying type of the tree. For example, in a numeric tree it would be number.

    The child node type, also called the carrier type.