Data.Set.TernarySet

Documentation

data Elem a

Elem a is used to hold elements of a list after insertion, and indicate that we've reached the end of the list.

Constructors

C !a

Null

Instances

Eq a => Eq (Elem a)

Ord a => Ord (Elem a)

All elements are greater than the Null Elem, otherwise they are ordered according to their own ord instance (for the `compare (C x) (C y)` case).

Show a => Show (Elem a)

Binary a => Binary (Elem a)

data TernarySet a

TernarySet a is ternary tree. It is commonly used for storing word lists like dictionaries.

Constructors

TNode !(Elem a) !(TernarySet a) !(TernarySet a) !(TernarySet a)

TEnd

Instances

Eq a => Eq (TernarySet a)

Show a => Show (TernarySet a)

Binary a => Binary (TernarySet a)

This binary instance saves some space by making special cases of some commonly encountered structures in the trees.

insert' :: Ord a => [a] -> TernarySet a

Quickly build a tree without an initial tree. This should be used to create an initial tree, using insert there after.

insert :: Ord a => [a] -> TernarySet a -> TernarySet a

Inserts an entries into a tree.

isElem :: Ord a => [a] -> TernarySet a -> Bool

Returns true if the `[a]` is in the TernarySet

treeSize :: TernarySet a -> Int

Returns the number of non-Null Elems

numEntries :: TernarySet a -> Int

Counts how many entries there are in the tree.

fromList :: Ord a => [[a]] -> TernarySet a

Creates a new tree from a list of strings