Hoogle Search

Within LTS Haskell 24.48 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. forest :: Graph g => Forest a -> g a

    algebraic-graphs Algebra.Graph.HigherKinded.Class

    The forest graph constructed from a given Forest data structure. Complexity: O(F) time, memory and size, where F is the size of the given forest (i.e. the number of vertices in the forest). 

    forest []                                                  == empty
forest [x]                                                 == tree x
forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
forest                                                     == overlays . map tree

  2. forest :: Ord a => Forest a -> Relation a

    algebraic-graphs Algebra.Graph.Relation

    The forest graph constructed from a given Forest data structure. Complexity: O((n + m) * log(n)) time and O(n + m) memory. 

    forest []                                                  == empty
forest [x]                                                 == tree x
forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
forest                                                     == overlays . map tree

  3. forest :: Ord a => Forest a -> Relation a

    algebraic-graphs Algebra.Graph.Relation.Symmetric

    The forest graph constructed from a given Forest data structure. Complexity: O((n + m) * log(n)) time and O(n + m) memory. 

    forest []                                                  == empty
forest [x]                                                 == tree x
forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
forest                                                     == overlays . map tree

  4. forest :: Forest a -> Graph a

    algebraic-graphs Algebra.Graph.Undirected

    The forest graph constructed from a given Forest data structure. Complexity: O(F) time, memory and size, where F is the size of the given forest (i.e. the number of vertices in the forest). 

    forest []                                                  == empty
forest [x]                                                 == tree x
forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
forest                                                     == overlays . map tree

  5. forceBVar :: BVar s a -> ()

    backprop Numeric.Backprop.Internal

    No documentation available.

  6. forceInpRef :: InpRef a -> ()

    backprop Numeric.Backprop.Internal

    No documentation available.

  7. forceSomeTapeNode :: SomeTapeNode -> ()

    backprop Numeric.Backprop.Internal

    No documentation available.

  8. forceTapeNode :: TapeNode a -> ()

    backprop Numeric.Backprop.Internal

    No documentation available.

  9. forEach :: forall a b (es :: Effects) r . (forall (e1 :: Effects) . () => Coroutine a b e1 -> Eff (e1 :& es) r) -> (a -> Eff es b) -> Eff es r

    bluefin-internal Bluefin.Internal

    Apply an effectful function to each element yielded to the stream. 

    >>> runPureEff $ yieldToList $ \y -> do
for_ [0 .. 4] $ \i -> do
yield y i
yield y (i * 10)
([0, 0, 1, 10, 2, 20, 3, 30], ())

  10. forEachExample :: ([Int], ())

    bluefin-internal Bluefin.Internal.Examples

    No documentation available.

Page 132 of many | Previous | Next