Library with an implementation of sets as redblack trees.
All the operations on sets are generic, i.e., one has to provide
an explicit order predicate (<)
(lessthan) on elements.
Author: Johannes Koj, Michael Hanus, Bernd Brassel
Version: December 2018
empty
:: Eq a => (a > a > Bool) > RedBlackTree a
Returns an empty set, i.e., an empty redblack tree augmented with an order predicate. 
emptyOrd
:: Ord a => RedBlackTree a
Returns an empty set that uses the Ord's ordering predicate. 
null
:: RedBlackTree a > Bool
Test for an empty set. 
member
:: a > RedBlackTree a > Bool
Returns true if an element is contained in a (redblack tree) set. 
insert
:: a > RedBlackTree a > RedBlackTree a
Inserts an element into a set if it is not already there. 
insertMulti
:: Eq a => a > RedBlackTree a > RedBlackTree a
Inserts an element into a multiset. 
delete
:: a > RedBlackTree a > RedBlackTree a
delete an element from a set. 
toList
:: RedBlackTree a > [a]
Transforms a (redblack tree) set into an ordered list of its elements. 
union
:: RedBlackTree a > RedBlackTree a > RedBlackTree a
Computes the union of two (redblack tree) sets. 
intersection
:: RedBlackTree a > RedBlackTree a > RedBlackTree a
Computes the intersection of two (redblack tree) sets. 
sortBy
:: Eq a => (a > a > Bool) > [a] > [a]
Generic sort based on insertion into redblack trees. 
Type synonym: SetRBT a = RedBlackTree a
Returns an empty set, i.e., an empty redblack tree augmented with an order predicate. 
Returns an empty set that uses the Ord's ordering predicate. 
Test for an empty set.

Returns true if an element is contained in a (redblack tree) set.

Inserts an element into a set if it is not already there. 
Inserts an element into a multiset. Thus, the same element can have several occurrences in the multiset. 
delete an element from a set. Deletes only a single element from a multi set 
Transforms a (redblack tree) set into an ordered list of its elements.

Computes the union of two (redblack tree) sets. This is done by inserting all elements of the first set into the second set. 
Computes the intersection of two (redblack tree) sets. This is done by inserting all elements of the first set contained in the second set into a new set, which order is taken from the first set. 
Generic sort based on insertion into redblack trees. The first argument is the order for the elements. 