Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

  1. dfsForestFrom :: GraphKL a -> [a] -> Forest a

    algebraic-graphs Data.Graph.Typed

    Compute the depth-first search forest of a graph, searching from each of the given vertices in order. Note that the resulting forest does not necessarily span the whole graph, as some vertices may be unreachable. In the following examples we will use the helper function: 

    (%) :: Ord a => (GraphKL a -> b) -> AdjacencyMap a -> b
f % x = f (fromAdjacencyMap x)
    for greater clarity. 
    forest $ (dfsForestFrom % edge 1 1) [1]          == vertex 1
forest $ (dfsForestFrom % edge 1 2) [0]          == empty
forest $ (dfsForestFrom % edge 1 2) [1]          == edge 1 2
forest $ (dfsForestFrom % edge 1 2) [2]          == vertex 2
forest $ (dfsForestFrom % edge 1 2) [2,1]        == vertices [1,2]
isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
dfsForestFrom % x $ vertexList x                 == dfsForest % x
dfsForestFrom % vertices vs $ vs                 == map (\v -> Node v []) (nub vs)
dfsForestFrom % x $ []                           == []
dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4]  == [ Node { rootLabel = 1
, subForest = [ Node { rootLabel = 5
, subForest = [] }
, Node { rootLabel = 4
, subForest = [] }]

  2. sampleFmtToPcmFormat :: SampleFmt y => y -> Format

    alsa-pcm Sound.ALSA.PCM

    No documentation available.

  3. c'GLFW_FORMAT_UNAVAILABLE :: Num a => a

    bindings-GLFW Bindings.GLFW

    No documentation available.

  4. c'GLFW_OPENGL_FORWARD_COMPAT :: Num a => a

    bindings-GLFW Bindings.GLFW

    No documentation available.

  5. c'GLFW_PLATFORM_ERROR :: Num a => a

    bindings-GLFW Bindings.GLFW

    No documentation available.

  6. isUniform :: Ix i => BitArray i -> Maybe Bool

    bitwise Data.Array.BitArray

    Short-circuit bitwise reduction: Nothing if any bits differ.

  7. isUniform :: Ix i => IOBitArray i -> IO (Maybe Bool)

    bitwise Data.Array.BitArray.IO

    Short-circuit bitwise reduction: Nothing when any bits differ, Just when all bits are the same.

  8. isUniform :: Ix i => STBitArray s i -> ST s (Maybe Bool)

    bitwise Data.Array.BitArray.ST

    Short-circuit bitwise reduction: Nothing when any bits differ, Just when all bits are the same.

  9. isUniform :: Bits b => b -> Maybe Bool

    bitwise Data.Bits.Bitwise

    Determine if a Bits is all 1s, all 0s, or neither.

  10. doubleNestedForEach :: forall (es :: Effects) . (forall (e :: Effects) . () => Stream () e -> Eff (e :& es) ()) -> Eff es ()

    bluefin-internal Bluefin.Internal.Examples

    No documentation available.

Page 1381 of many | Previous | Next