Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. unPrimeIntSet :: PrimeIntSet -> IntSet

    arithmoi Math.NumberTheory.Primes.IntSet

    Convert to a set of integers.

  2. fromAdjacencyIntSets :: [(Int, IntSet)] -> AdjacencyIntMap

    algebraic-graphs Algebra.Graph.AdjacencyIntMap

    Construct a graph from a list of adjacency sets; a variation of stars. Complexity: O((n + m) * log(n)) time and O(n + m) memory. 

    fromAdjacencyIntSets []                                     == empty
fromAdjacencyIntSets [(x, IntSet.empty)]                    == vertex x
fromAdjacencyIntSets [(x, IntSet.singleton y)]              == edge x y
fromAdjacencyIntSets . map (fmap IntSet.fromList)           == stars
overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)

  3. postIntSet :: Int -> AdjacencyIntMap -> IntSet

    algebraic-graphs Algebra.Graph.AdjacencyIntMap

    The postset (here postIntSet) of a vertex is the set of its direct successors. 

    postIntSet x empty      == IntSet.empty
postIntSet x (vertex x) == IntSet.empty
postIntSet x (edge x y) == IntSet.fromList [y]
postIntSet 2 (edge 1 2) == IntSet.empty

  4. preIntSet :: Int -> AdjacencyIntMap -> IntSet

    algebraic-graphs Algebra.Graph.AdjacencyIntMap

    The preset (here preIntSet) of an element x is the set of its direct predecessors. Complexity: O(n * log(n)) time and O(n) memory. 

    preIntSet x empty      == Set.empty
preIntSet x (vertex x) == Set.empty
preIntSet 1 (edge 1 2) == Set.empty
preIntSet y (edge x y) == Set.fromList [x]

  5. vertexIntSet :: AdjacencyIntMap -> IntSet

    algebraic-graphs Algebra.Graph.AdjacencyIntMap

    The set of vertices of a given graph. Complexity: O(n) time and memory. 

    vertexIntSet empty      == IntSet.empty
vertexIntSet . vertex   == IntSet.singleton
vertexIntSet . vertices == IntSet.fromList
vertexIntSet . clique   == IntSet.fromList

  6. postIntSet :: ToGraph t => Int -> t -> IntSet

    algebraic-graphs Algebra.Graph.ToGraph

    The postset (here postIntSet) of a vertex is the set of its direct successors. Like postSet but specialised for graphs with vertices of type Int. 

    postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap

  7. preIntSet :: ToGraph t => Int -> t -> IntSet

    algebraic-graphs Algebra.Graph.ToGraph

    The preset (here preIntSet) of a vertex is the set of its direct predecessors. Like preSet but specialised for graphs with vertices of type Int. 

    preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap

  8. vertexIntSet :: ToGraph t => t -> IntSet

    algebraic-graphs Algebra.Graph.ToGraph

    The set of vertices of a graph. Like vertexSet but specialised for graphs with vertices of type Int. 

    vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union

  9. ConstraintSetupCabalMaxVersion :: ConstraintSource

    cabal-install-solver Distribution.Solver.Types.ConstraintSource

    An internal constraint due to compatibility issues with the Setup.hs command line interface requires a maximum upper bound on Cabal

  10. ConstraintSetupCabalMinVersion :: ConstraintSource

    cabal-install-solver Distribution.Solver.Types.ConstraintSource

    An internal constraint due to compatibility issues with the Setup.hs command line interface requires a minimum lower bound on Cabal

Page 6 of many | Previous | Next