Data.Set.StringSet

Documentation

data StringSet

StringSet is ternary tree. It is commonly used for storing word lists like dictionaries for spell checking etc.

Instances

Eq StringSet

Show StringSet

Binary StringSet

A rather long Binary instance, that uses binary numbers to indicate where Ends are efficiently.

insert :: String -> StringSet -> StringSet

Inserts a new list of elements into a tree.

singleton :: String -> StringSet

Quickly build an initial tree.

member :: String -> StringSet -> Bool

Returns true if the string is in the StringSet

size :: StringSet -> Int

Counts how many entries there are in the tree.

fromList :: [String] -> StringSet

Creates a new tree from a list of strings

null :: StringSet -> Bool

Returns true if the set is empty.

elems :: StringSet -> [String]

Returns a (sorted) list of all strings inserted into the set.

 (elems . fromList) xs == (nub . sort) xs