Data.StringMap.StringSet

A simplified version of StringMap for implementing sets.

There is one important difference to the StringMap implementation: The fields are not marked to be strict. This enables building the set on the fly.

This feature is used in fuzzy search, when an index tree is restricted to a set of keys, e.g. the set of all none case significant keys

Documentation

data StringSet

Set of strings implemented as lazy prefix tree. type StringSet = StringMap () is not feasable because of the strict fields in the StringMap definition

Constructors

PSempty

PSelem StringSet

PSnext Sym StringSet StringSet

Instances

Show StringSet

emptyPS :: StringSet

elemPS :: StringSet -> StringSet

elem0PS :: StringSet

nextPS :: Sym -> StringSet -> StringSet -> StringSet

lastPS :: Sym -> StringSet -> StringSet

nullPS :: StringSet -> Bool

singlePS :: Key -> StringSet

prefixPS :: Key -> StringSet

unionPS :: StringSet -> StringSet -> StringSet

foldPS :: (Key -> b -> b) -> b -> (Key -> Key) -> StringSet -> b

foldWithKeyPS :: (Key -> b -> b) -> b -> StringSet -> b

elemsPS :: StringSet -> [Key]

fuzzyCharPS :: (Sym -> [Sym]) -> StringSet -> StringSet

fuzzyCharsPS :: (Sym -> [Key]) -> StringSet -> StringSet