Data.SortedSet

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

delete : k -> SortedSet k -> SortedSet k

Visibility: export

contains : k -> SortedSet k -> Bool

Visibility: export

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

Visibility: export

toList : SortedSet k -> List k

Visibility: 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 elments 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

keySet : SortedMap k v -> SortedSet k

Visibility: export

keySet : SortedDMap k v -> SortedSet k

Visibility: export

singleton : Ord k => k -> SortedSet k

Visibility: export