Hoogle Search

Within Stackage Nightly 2025-10-11 (ghc-9.12.2)

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

Exact lookup

1. nesSet :: NESet a -> !Set a

   nonempty-containers	Data.Set.NonEmpty.Internal

   No documentation available.

2. nonEmptySet :: Set a -> Maybe (NESet a)

   nonempty-containers	Data.Set.NonEmpty.Internal

   O(log n). Smart constructor for an NESet from a Set. Returns Nothing if the Set was originally actually empty, and Just n with an NESet, if the Set was not empty. nonEmptySet and maybe empty toSet form an isomorphism: they are perfect structure-preserving inverses of eachother. See IsNonEmpty for a pattern synonym that lets you "match on" the possiblity of a Set being an NESet.

   nonEmptySet (Data.Set.fromList [3,5]) == Just (fromList (3:|[5]))
   

3. toSet :: NESet a -> Set a

   nonempty-containers	Data.Set.NonEmpty.Internal

   O(log n). Convert a non-empty set back into a normal possibly-empty map, for usage with functions that expect Set. Can be thought of as "obscuring" the non-emptiness of the set in its type. See the IsNotEmpty pattern. nonEmptySet and maybe empty toSet form an isomorphism: they are perfect structure-preserving inverses of eachother.

   toSet (fromList ((3,"a") :| [(5,"b")])) == Data.Set.fromList [(3,"a"), (5,"b")]
   

4. nodeInfoSetTo :: To k -> NodeInfo k v -> NodeInfo k v

   patch	Data.Patch.MapWithMove

   Set the To field of a NodeInfo

5. nodeInfoSetTo :: To k -> NodeInfo k v -> NodeInfo k v

   patch	Data.Patch.MapWithPatchingMove

   Set the To field of a NodeInfo

6. module Rebase.Data.HashSet

   No documentation available.

7. module Rebase.Data.IntSet

   No documentation available.

8. eraseTypes :: forall (ins :: [Type]) (out :: [Type]) . Registry ins out -> Registry '[ERASED_TYPES] '[ERASED_TYPES]

   registry	Data.Registry.Registry

   Remove the parameters list of the registry and replace it with an empty type This makes it easier to read compilation errors where less types are being displayed On the other hand the resulting registry cannot be type-checked anymore when trying to get values out of it

9. class AreSubset (ins :: [Type]) (out :: [Type]) (targets :: [Type])

   registry	Data.Registry.Solver

   Compute if each element of a list of types is contained in another list when trying to append 2 registries together where target is the list of inputs of the first registry

10. class IsSameSet (types1 :: [Type]) (types2 :: [Type])

    registry	Data.Registry.Solver

    Compute if each element of a list of types is the same as another in a different order

Page 130 of many | Previous | Next