Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

  1. fork :: ParIVar ivar m => m () -> m ()

    abstract-par Control.Monad.Par.Class

    Forks a computation to happen in parallel. The forked computation may exchange values with other computations using IVars.

  2. formatPointer :: Pointer -> Text

    aeson-diff Data.Aeson.Pointer

    Format a Pointer as described in RFC 6901. 

    >>> formatPointer (Pointer [])
""

>>> formatPointer (Pointer [OKey ""])
"/"

>>> formatPointer (Pointer [OKey " "])
"/ "

>>> formatPointer (Pointer [OKey "foo"])
"/foo"

>>> formatPointer (Pointer [OKey "foo", AKey 0])
"/foo/0"

>>> formatPointer (Pointer [OKey "a/b"])
"/a~1b"

>>> formatPointer (Pointer [OKey "c%d"])
"/c%d"

>>> formatPointer (Pointer [OKey "e^f"])
"/e^f"

>>> formatPointer (Pointer [OKey "g|h"])
"/g|h"

>>> formatPointer (Pointer [OKey "i\\j"])
"/i\\j"

>>> formatPointer (Pointer [OKey "k\"l"])
"/k\"l"

>>> formatPointer (Pointer [OKey "m~n"])
"/m~0n"

  3. forest :: Forest a -> Graph a

    algebraic-graphs Algebra.Graph

    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

  4. forest :: Forest Int -> AdjacencyIntMap

    algebraic-graphs Algebra.Graph.AdjacencyIntMap

    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

  5. forest :: Ord a => Forest a -> AdjacencyMap a

    algebraic-graphs Algebra.Graph.AdjacencyMap

    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

  6. forest :: Graph g => Forest (Vertex g) -> g

    algebraic-graphs Algebra.Graph.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

  7. 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

  8. 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

  9. 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

  10. 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

Page 131 of many | Previous | Next