EagerRoseTree (FSharpx.Collections)

EagerRoseTree Module

Namespace: FSharpx.Collections.Experimental
Assembly: FSharpx.Collections.Experimental.dll

Functions and values

Function or value	Description
`EagerRoseTree.ap x f` Full Usage: `EagerRoseTree.ap x f` Parameters: x : `EagerRoseTree<'a>` f : `EagerRoseTree<('a -> 'b)>` Returns: `EagerRoseTree<'b>`	x : `EagerRoseTree<'a>` f : `EagerRoseTree<('a -> 'b)>` Returns: `EagerRoseTree<'b>`
`EagerRoseTree.bind f x` Full Usage: `EagerRoseTree.bind f x` Parameters: f : `'a -> EagerRoseTree<'b>` x : `EagerRoseTree<'a>` Returns: `EagerRoseTree<'b>`	f : `'a -> EagerRoseTree<'b>` x : `EagerRoseTree<'a>` Returns: `EagerRoseTree<'b>`
`EagerRoseTree.create root children` Full Usage: `EagerRoseTree.create root children` Parameters: root : `'a` children : `EagerRoseForest<'a>` Returns: `EagerRoseTree<'a>`	root : `'a` children : `EagerRoseForest<'a>` Returns: `EagerRoseTree<'a>`
`EagerRoseTree.dfsPost x` Full Usage: `EagerRoseTree.dfsPost x` Parameters: x : `EagerRoseTree<'a>` Returns: `seq<'a>`	x : `EagerRoseTree<'a>` Returns: `seq<'a>`
`EagerRoseTree.dfsPre x` Full Usage: `EagerRoseTree.dfsPre x` Parameters: x : `EagerRoseTree<'a>` Returns: `seq<'a>`	x : `EagerRoseTree<'a>` Returns: `seq<'a>`
`EagerRoseTree.lift2 f a b` Full Usage: `EagerRoseTree.lift2 f a b` Parameters: f : `'a -> 'b -> 'c` a : `EagerRoseTree<'a>` b : `EagerRoseTree<'b>` Returns: `EagerRoseTree<'c>`	f : `'a -> 'b -> 'c` a : `EagerRoseTree<'a>` b : `EagerRoseTree<'b>` Returns: `EagerRoseTree<'c>`
`EagerRoseTree.map f x` Full Usage: `EagerRoseTree.map f x` Parameters: f : `'a -> 'b` x : `EagerRoseTree<'a>` Returns: `EagerRoseTree<'b>`	f : `'a -> 'b` x : `EagerRoseTree<'a>` Returns: `EagerRoseTree<'b>`
`EagerRoseTree.mapAccum f state tree` Full Usage: `EagerRoseTree.mapAccum f state tree` Parameters: f : `'a -> 'b -> 'a * 'c` state : `'a` tree : `EagerRoseTree<'b>` Returns: `'a * EagerRoseTree<'c>`	Behaves like a combination of map and fold; it applies a function to each element of a tree, passing an accumulating parameter, and returning a final value of this accumulator together with the new tree. f : `'a -> 'b -> 'a * 'c` state : `'a` tree : `EagerRoseTree<'b>` Returns: `'a * EagerRoseTree<'c>`
`EagerRoseTree.singleton x` Full Usage: `EagerRoseTree.singleton x` Parameters: x : `'a` Returns: `EagerRoseTree<'a>`	x : `'a` Returns: `EagerRoseTree<'a>`
`EagerRoseTree.unfold f seed` Full Usage: `EagerRoseTree.unfold f seed` Parameters: f : `'a -> 'b * 'a list` seed : `'a` Returns: `EagerRoseTree<'b>`	f : `'a -> 'b * 'a list` seed : `'a` Returns: `EagerRoseTree<'b>`
`EagerRoseTree.unfoldForest f` Full Usage: `EagerRoseTree.unfoldForest f` Parameters: f : `'a -> 'b * 'a list` Returns: `'a list -> EagerRoseForest<'b>`	f : `'a -> 'b * 'a list` Returns: `'a list -> EagerRoseForest<'b>`