Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. mergeSubset :: forall (f :: Type -> Type) k (p :: k ~> Type) (q :: k ~> Type) (r :: k ~> Type) (as :: f k) . (forall (a :: k) . () => Decision (p @@ a) -> Decision (q @@ a) -> Decision (r @@ a)) -> (Subset f p @@ as) -> (Subset f q @@ as) -> Subset f r @@ as

   decidable	Data.Type.Universe.Subset

   Combine two subsets based on a decision function

2. runWitSubset :: WitSubset (f :: Type -> Type) (p :: k ~> Type) (as :: f k) -> forall (a :: k) . () => Elem f as a -> Decision (p @@ a)

   decidable	Data.Type.Universe.Subset

   No documentation available.

3. data DeltaSet a

   delta-types	Data.Delta.Set

   Delta type for a Set where collections of elements are inserted or deleted.

4. data DeltaSet1 a

   delta-types	Data.Delta.Set

   Delta type for Set where a single element is deleted or added.

5. deltaSetFromList :: Ord a => [DeltaSet1 a] -> DeltaSet a

   delta-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
   

6. diffSet :: Ord a => Set a -> Set a -> DeltaSet a

   delta-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']
   

7. 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.

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

   digraph	Data.DiGraph

   The adjacency sets of a graph.

9. type AdjacencySets = HashMap Int HashSet Int

   digraph	Data.DiGraph.FloydWarshall

   Adjacency set representation of a directed graph.

10. 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.

Page 185 of many | Previous | Next