data-stringmap-1.0.1.1: An efficient implementation of maps from strings to arbitrary values

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

Data.StringMap.StringSet

Description

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

Synopsis

Documentation

data StringSet Source

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

Instances

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

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