@hackage bytestring-trie0.2.2

An efficient finite map from (byte)strings to values.

  • Installation

  • Dependencies (0)

  • Dependents (9)

    @hackage/critbit, @hackage/dprox, @hackage/weigh, @hackage/seonbi, @hackage/airship, @hackage/text-trie, Show all…

    • Package Flags

      base4
       (on by default)

      base-4.0 deprecated Prelude which is imported qualified

      usecinternal
       (off by default)

      Use optimized C implementation for indexOfDifference. See notes in Data.Trie.ByteStringInternal.

      applicativeinbase
       (on by default)

      Applicative functors were added in base-2.0

      bytestringinbase
       (off by default)

      The bytestring library was included in base-2.0 and base-2.1.1, but for base-1.0 and base-3.0 it was a separate package

An efficient finite map from (byte)strings to values.

The implementation is based on big-endian patricia trees, like Data.IntMap. We first trie on the elements of Data.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.