Data.SortedSet(source)

Definitions

data SortedSet : Type -> Type

Totality: total
Visibility: export
Constructor: 

SetWrapper : SortedMap k () -> SortedSet k

Hints:

Eq k => Eq (SortedSet k)

Foldable SortedSet

Ord k => Monoid (SortedSet k)

Ord k => Semigroup (SortedSet k)

Show k => Show (SortedSet k)

empty : Ord k => SortedSet k

Visibility: export

insert : k -> SortedSet k -> SortedSet k

Visibility: export

insert' : SortedSet k -> k -> SortedSet k

Visibility: public export

delete : k -> SortedSet k -> SortedSet k

Visibility: export

delete' : SortedSet k -> k -> SortedSet k

Visibility: public export

contains : k -> SortedSet k -> Bool

Visibility: export

contains' : SortedSet k -> k -> Bool

Visibility: public export

fromList : Ord k => List k -> SortedSet k

Visibility: export

=DEPRECATED=

toList : SortedSet k -> List k

  Use `Prelude.toList` instead

Visibility: public export

union : SortedSet k -> SortedSet k -> SortedSet k

  Set union. Inserts all elements of x into y

Visibility: export

difference : SortedSet k -> SortedSet k -> SortedSet k

  Set difference. Delete all elements in y from x

Visibility: export

symDifference : SortedSet k -> SortedSet k -> SortedSet k

  Set symmetric difference. Uses the union of the differences.

Visibility: export

intersection : SortedSet k -> SortedSet k -> SortedSet k

  Set intersection. Implemented as the difference of the union and the symetric difference.

Visibility: export

leftMost : SortedSet k -> Maybe k

  Returns the leftmost (least) value

Visibility: export

rightMost : SortedSet k -> Maybe k

  Returns the rightmost (greatest) value

Visibility: export

keySet : SortedMap k v -> SortedSet k

Visibility: export

keySet : SortedDMap k v -> SortedSet k

Visibility: export

differenceMap : SortedMap k v -> SortedSet k -> SortedMap k v

  Removes all given keys from the given map

Visibility: export

intersectionMap : SortedMap k v -> SortedSet k -> SortedMap k v

  Leaves only given keys in the given map

Visibility: export

singleton : Ord k => k -> SortedSet k

Visibility: export

toSortedMap : SortedSet k -> SortedMap k ()

Visibility: export

fromSortedMap : SortedMap k () -> SortedSet k

Visibility: export

pop : SortedSet k -> Maybe (k, SortedSet k)

  Pops the leftmost element from the set

Visibility: export