Data.MemoTrie

Trie-based memoizer Adapted from sjanssen's paste: a lazy trie http://hpaste.org/3839.

Documentation

class HasTrie a where

Associated Types

data :->: a :: * -> *

Methods

trie :: (a -> b) -> a :->: b

untrie :: (a :->: b) -> a -> b

Instances

HasTrie Bool

HasTrie Int

HasTrie Word

HasTrie ()

HasTrie x => HasTrie [x]

(HasTrie a, HasTrie b) => HasTrie (Either a b)

(HasTrie a, HasTrie b) => HasTrie (a, b)

(HasTrie a, HasTrie b, HasTrie c) => HasTrie (a, b, c)

memo :: HasTrie t => (t -> a) -> t -> a

Trie-based function memoizer

memo2 :: (HasTrie s, HasTrie t) => (s -> t -> a) -> s -> t -> a

Memoize a binary function, on its first argument and then on its second. Take care to exploit any partial evaluation.

memo3 :: (HasTrie r, HasTrie s, HasTrie t) => (r -> s -> t -> a) -> r -> s -> t -> a

Memoize a ternary function on successive arguments. Take care to exploit any partial evaluation.

mup :: HasTrie t => (b -> c) -> (t -> b) -> t -> c

Lift a memoizer to work with one more argument.

trieBits :: Bits t => (t -> a) -> [Bool] :->: a

Handy for trie in a bits-based Trie instance

untrieBits :: Bits t => ([Bool] :->: a) -> t -> a

Handy for untrie in a bits-based Trie instance