Hoogle Search

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

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

Exact lookup

1. getMergeNESet :: MergeNESet a -> NESet a

   nonempty-containers	Data.Set.NonEmpty.Internal

   No documentation available.

2. insertMaxSet :: a -> Set a -> Set a

   nonempty-containers	Data.Set.NonEmpty.Internal

   O(log n). Insert new value into a set where values are /strictly less than the new value. That is, the new value must be strictly greater than all values present in the Set. The precondition is not checked./ While this has the same asymptotics as Data.Set.insert, it saves a constant factor for value comparison (so may be helpful if comparison is expensive) and also does not require an Ord instance for the value type.

3. insertMinSet :: a -> Set a -> Set a

   nonempty-containers	Data.Set.NonEmpty.Internal

   O(log n). Insert new value into a set where values are strictly greater than the new values That is, the new value must be strictly less than all values present in the Set. /The precondition is not checked./ While this has the same asymptotics as Data.Set.insert, it saves a constant factor for value comparison (so may be helpful if comparison is expensive) and also does not require an Ord instance for the value type.

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

   nonempty-containers	Data.Set.NonEmpty.Internal

   No documentation available.

5. 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]))
   

6. 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")]
   

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

   patch	Data.Patch.MapWithMove

   Set the To field of a NodeInfo

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

   patch	Data.Patch.MapWithPatchingMove

   Set the To field of a NodeInfo

9. module Rebase.Data.HashSet

   No documentation available.

10. module Rebase.Data.IntSet

    No documentation available.

Page 128 of many | Previous | Next