text-trie alternatives and similar packages
Based on the "text" category.
Alternatively, view text-trie alternatives based on common mentions on social networks and blogs.
text9.8 7.3 text-trie VS textHaskell library for space- and time-efficient operations over Unicode text.
text-icu9.2 1.6 text-trie VS text-icuThis package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text.
text-conversions8.2 3.5 text-trie VS text-conversionsSafe conversions between Haskell textual types
text-short7.9 0.0 text-trie VS text-shortMemory-efficient representation of Unicode text strings
text-containers5.2 0.0 text-trie VS text-containersMemory-efficient string-indexed container types.
text-ansi4.0 0.0 text-trie VS text-ansiText styling for ANSI terminals.
text-stream-decode3.5 0.0 text-trie VS text-stream-decodeStreaming decoding functions for UTF encodings.
text-binary3.1 0.0 text-trie VS text-binaryBinary instances for strict and lazy Text data types
text-time2.8 0.0 text-trie VS text-timeFast time parser for Text
text-plusUtils for text
Static code analysis for 29 languages.
Do you think we are missing an alternative of text-trie or a related project?
text-trie package is a lightweight adaptation of
For the differences in performance, see bench.md.
The bytestring-trie package provides an efficient implementation
of tries mapping
ByteString to values. The implementation is
based on Okasaki's big-endian patricia trees, à la
first trie on the elements of
ByteString and then trie on the
big-endian bit representation of those elements. Patricia trees
have efficient algorithms for union and other merging operations,
but they're also quick for lookups and insertions.
If you are only interested in being able to associate individual
ByteStrings to values, then you may prefer the
which is faster for those only needing a map-like structure. This
package is intended for those who need the extra capabilities that
a trie-like structure can offer (e.g., structure sharing to reduce
memory costs for highly redundant keys, taking the submap of all
keys with a given prefix, contextual mapping, extracting the minimum
and maximum keys, etc.)
This is a simple package and should be easy to install. You should be able to use one of the following standard methods to install it.
-- With stack and without the source: $> stack install text-trie -- With stack and with the source already: $> cd text-trie $> stack install
The implementation only relies on a few basic
language extensions and
DeriveGeneric. The complete list of extensions used is: