Hoogle Search
Within Stackage Nightly 2025-10-12 (ghc-9.12.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
delta-types Data.Delta.Set Delta type for a Set where collections of elements are inserted or deleted.
-
delta-types Data.Delta.Set Delta type for Set where a single element is deleted or added.
deltaSetFromList :: Ord a => [DeltaSet1 a] -> DeltaSet adelta-types Data.Delta.Set Collect insertions or deletions of elements into a DeltaSet. To save space, combinations of Insert and Delete for the same element are simplified when possible. These simplifications always preserve the property
apply (deltaSetFromList ds) = apply ds
diffSet :: Ord a => Set a -> Set a -> DeltaSet adelta-types Data.Delta.Set The smallest delta that changes the second argument to the first argument.
new = apply (diffSet new old) old
diffSet (Set.fromList "ac") (Set.fromList "ab") = deltaSetFromList [Insert 'c', Delete 'b']
listFromDeltaSet :: DeltaSet a -> [DeltaSet1 a]delta-types Data.Delta.Set Flatten a DeltaSet to a list of DeltaSet1. In the result list, the set of a appearing as Insert a is disjoint from the set of a appearing as Delete a.
adjacencySets :: DiGraph a -> HashMap a (HashSet a)digraph Data.DiGraph The adjacency sets of a graph.
type
AdjacencySets = HashMap Int HashSet Intdigraph Data.DiGraph.FloydWarshall Adjacency set representation of a directed graph.
fromAdjacencySets :: AdjacencySets -> DenseAdjMatrixdigraph Data.DiGraph.FloydWarshall Assumes that the input is an directed graph and that the vertex set is a prefix of the natural numbers.
toAdjacencySets :: DenseAdjMatrix -> AdjacencySetsdigraph Data.DiGraph.FloydWarshall Converts an adjacency matrix into a graph in adjacnency set representation.
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.