Holumbus-Searchengine-1.2.3: A search and indexing engine.

Portabilitynot portable
Stabilityexperimental
MaintainerUwe Schmidt (uwe@fh-wedel.de)
Safe HaskellNone

Holumbus.Data.PrefixTree.PrefixSet

Description

A simplified version of PrefixTree for implementing sets.

There is one important difference to the PrefixTree 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

Synopsis

Documentation

data PrefixSet Source

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

Instances

foldPS :: (Key -> b -> b) -> b -> (Key -> Key) -> PrefixSet -> bSource

foldWithKeyPS :: (Key -> b -> b) -> b -> PrefixSet -> bSource