Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

  1. adjacencyMap :: (ToGraph t, Ord (ToVertex t)) => t -> Map (ToVertex t) (Set (ToVertex t))

    algebraic-graphs Algebra.Graph.ToGraph

    The adjacency map of a graph: each vertex is associated with a set of its direct successors. 

    adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap

  2. adjacencyMapTranspose :: (ToGraph t, Ord (ToVertex t)) => t -> Map (ToVertex t) (Set (ToVertex t))

    algebraic-graphs Algebra.Graph.ToGraph

    The transposed adjacency map of a graph: each vertex is associated with a set of its direct predecessors. 

    adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose

  3. toAdjacencyIntMap :: ToGraph t => t -> AdjacencyIntMap

    algebraic-graphs Algebra.Graph.ToGraph

    Convert a value to the corresponding AdjacencyIntMap. 

    toAdjacencyIntMap == foldg empty vertex overlay connect

  4. toAdjacencyIntMapTranspose :: ToGraph t => t -> AdjacencyIntMap

    algebraic-graphs Algebra.Graph.ToGraph

    Convert a value to the corresponding AdjacencyIntMap and transpose the result. 

    toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)

  5. toAdjacencyMap :: ToGraph t => t -> AdjacencyMap (ToVertex t)

    algebraic-graphs Algebra.Graph.ToGraph

    Convert a value to the corresponding AdjacencyMap. 

    toAdjacencyMap == foldg empty vertex overlay connect

  6. toAdjacencyMapTranspose :: ToGraph t => t -> AdjacencyMap (ToVertex t)

    algebraic-graphs Algebra.Graph.ToGraph

    Convert a value to the corresponding AdjacencyMap and transpose the result. 

    toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)

  7. fromAdjacencyIntMap :: AdjacencyIntMap -> GraphKL Int

    algebraic-graphs Data.Graph.Typed

    Build GraphKL from an AdjacencyIntMap. If fromAdjacencyIntMap g == h then the following holds: 

    map (fromVertexKL h) (vertices $ toGraphKL h)                               == toAscList (vertexIntSet g)
map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1))                             == array (0,2) [(0,[1]), (1,[]), (2,[0])]
toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1))                             == array (0,1) [(0,[1]), (1,[0])]

  8. fromAdjacencyMap :: Ord a => AdjacencyMap a -> GraphKL a

    algebraic-graphs Data.Graph.Typed

    Build GraphKL from an AdjacencyMap. If fromAdjacencyMap g == h then the following holds: 

    map (fromVertexKL h) (vertices $ toGraphKL h)                               == vertexList g
map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1))                                == array (0,2) [(0,[1]), (1,[]), (2,[0])]
toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1))                                == array (0,1) [(0,[1]), (1,[0])]

  9. canMmapSampleResolution :: T i y Bool

    alsa-pcm Sound.ALSA.PCM.Parameters.Hardware

    No documentation available.

  10. timestampMmap :: TimestampMode

    alsa-pcm Sound.ALSA.PCM.Parameters.Software

    No documentation available.

Page 1017 of many | Previous | Next