HORIZON HASKELLDocslts/ghc-9.10.x248f8f02026-10-05Search names, modules, packages, or :: a typeCtrl K

GHC 9.10.3 · lts/ghc-9.10.x · 248f8f0 · 2026-10-05

Moduleregex-tdfa-1.3.2.5Haskell2010

Text.Regex.TDFA.IntArrTrieSet

This creates a lazy Trie based on a finite range of Ints and is used to memorize a function over the subsets of this range.

To create a Trie you need two supply 2 things * Range of keys to bound * A function or functions used to construct the value for a subset of keys

The Trie uses the Array type internally.

  • 1 type
  • 4 values
  • Packageregex-tdfa-1.3.2.5
  • Exports5
  • LanguageHaskell2010
  • LicenceBSD-3-Clause
  • SourceIntArrTrieSet.hs
valuelookupAsc :: TrieSet v -> [Int] -> v
#

This is the accessor for the Trie. The list of keys should be sorted.

valuefromBounds
  1. :: (Int, Int)

    (lower,upper) range of keys, lower<=upper

  2. -> ([Int] -> v)

    Function from list of keys to its value. It must work for distinct ascending lists.

  3. -> TrieSet v

    The constructed Trie

#

This is a Trie constructor for a complete range of keys.

valuefromSinglesMerge
  1. :: v

    value for (lookupAsc trie [])

  2. -> (v -> v -> v)

    merge operation on values

  3. -> (Int, Int)

    (lower,upper) range of keys, lower<=upper

  4. -> (Int -> v)

    Function from a single key to its value

  5. -> TrieSet v

    The constructed Trie

#

This is a Trie constructor for a complete range of keys that uses a function from single values and a merge operation on values to fill the Trie.

valuefromSinglesSum
  1. :: ([v] -> v)

    summation operation for values

  2. -> (Int, Int)

    (lower,upper) range of keys, lower <= upper

  3. -> (Int -> v)

    Function from a single key to its value

  4. -> TrieSet v

    The constructed Trie

#

This is a Trie constructor for a complete range of keys that uses a function from single values and a sum operation of values to fill the Trie.