Hoogle Search

Within LTS Haskell 24.60 (ghc-9.10.3)

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

  1. adjacencySets :: DiGraph a -> HashMap a (HashSet a)

    digraph Data.DiGraph

    The adjacency sets of a graph.

  2. type AdjacencySets = HashMap Int HashSet Int

    digraph Data.DiGraph.FloydWarshall

    Adjacency set representation of a directed graph.

  3. fromAdjacencySets :: AdjacencySets -> DenseAdjMatrix

    digraph Data.DiGraph.FloydWarshall

    Assumes that the input is an directed graph and that the vertex set is a prefix of the natural numbers.

  4. toAdjacencySets :: DenseAdjMatrix -> AdjacencySets

    digraph Data.DiGraph.FloydWarshall

    Converts an adjacency matrix into a graph in adjacnency set representation.

  5. sortingSet :: Foldable f => Sort k -> Sort (f k)

    discrimination Data.Discrimination

    Construct a stable ordered discriminator that sorts a list as sets of elements from another stable ordered discriminator. The resulting discriminator only cares about the set of keys, and is sorted as if we'd sorted each key in turn before comparing.

  6. toIntSet :: [Int] -> IntSet

    discrimination Data.Discrimination

    O(n). Construct an IntSet in linear time. This is an asymptotically faster version of fromList, which exploits ordered discrimination.

  7. toSet :: Sorting k => [k] -> Set k

    discrimination Data.Discrimination

    O(n). Construct a Set in linear time. This is an asymptotically faster version of fromList, which exploits ordered discrimination.

  8. updateSet :: [Int] -> Int -> [Int]

    discrimination Data.Discrimination.Internal

    No documentation available.

  9. sortingSet :: Foldable f => Sort k -> Sort (f k)

    discrimination Data.Discrimination.Sorting

    Construct a stable ordered discriminator that sorts a list as sets of elements from another stable ordered discriminator. The resulting discriminator only cares about the set of keys, and is sorted as if we'd sorted each key in turn before comparing.

  10. toIntSet :: [Int] -> IntSet

    discrimination Data.Discrimination.Sorting

    O(n). Construct an IntSet in linear time. This is an asymptotically faster version of fromList, which exploits ordered discrimination.

Page 186 of many | Previous | Next