MemoTrie-0.4.10: Trie-based memo functions

Stabilityexperimental
Maintainerconal@conal.net
Safe HaskellSafe-Infered

Data.MemoTrie

Description

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

Synopsis

Documentation

class HasTrie a whereSource

Mapping from all elements of a to the results of some function

Associated Types

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

Representation of trie with domain type a

Methods

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

Create the trie for the entire domain of a function

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

Convert a trie to a function, i.e., access a field of the trie

enumerate :: (a :->: b) -> [(a, b)]Source

List the trie elements. Order of keys (:: a) is always the same.

domain :: HasTrie a => [a]Source

Domain elements of a trie

idTrie :: HasTrie a => a :->: aSource

Identity trie

(@.@) :: (HasTrie a, HasTrie b) => (b :->: c) -> (a :->: b) -> a :->: cSource

Trie composition

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

Trie-based function memoizer

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

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 -> aSource

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

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

Lift a memoizer to work with one more argument.

inTrie :: (HasTrie a, HasTrie c) => ((a -> b) -> c -> d) -> (a :->: b) -> c :->: dSource

Apply a unary function inside of a trie

inTrie2 :: (HasTrie a, HasTrie c, HasTrie e) => ((a -> b) -> (c -> d) -> e -> f) -> (a :->: b) -> (c :->: d) -> e :->: fSource

Apply a binary function inside of a trie

inTrie3 :: (HasTrie a, HasTrie c, HasTrie e, HasTrie g) => ((a -> b) -> (c -> d) -> (e -> f) -> g -> h) -> (a :->: b) -> (c :->: d) -> (e :->: f) -> g :->: hSource

Apply a ternary function inside of a trie