FunctorCombo.StrictMemo

Functor-based memo tries (strict for now)

Documentation

class Functor (Trie k) => HasTrie k where

Domain types with associated memo tries

Associated Types

type Trie k :: * -> *

Representation of trie with domain type a

Methods

trie :: (k -> v) -> k :->: v

Create the trie for the entire domain of a function

untrie :: (k :->: v) -> k -> v

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

Instances

HasTrie Bool

HasTrie Int

HasTrie Integer

HasTrie ()

HasTrie a => HasTrie [a]

HasTrie a => HasTrie (Id a)

HasTrie a => HasTrie (Tree a)

HasTrie a => HasTrie (Pair a)

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

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

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

HasTrie x => HasTrie (Const x a)

(HasTrie k, Functor (Trie k), IsNat n) => HasTrie (Vec n k)

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

HasTrie (g (f a)) => HasTrie ((:.) g f a)

(HasTrie (f a), HasTrie (g a)) => HasTrie ((:+:) f g a)

(HasTrie (f a), HasTrie (g a)) => HasTrie ((:*:) f g a)

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

type (:->:) k v = Trie k v infixr 0

Memo trie from k to v

(!) :: HasTrie k => (k :->: v) -> k -> v

Indexing. Synonym for untrie.

memo :: HasTrie k => Unop (k -> v)

Trie-based function memoizer

memo2 :: (HasTrie s, HasTrie t) => Unop (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) => Unop (r -> s -> t -> a)

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

idTrie :: HasTrie k => k :->: k

onUntrie :: (HasTrie a, HasTrie b) => ((a -> a') -> b -> b') -> (a :->: a') -> b :->: b'

onUntrie2 :: (HasTrie a, HasTrie b, HasTrie c) => ((a -> a') -> (b -> b') -> c -> c') -> (a :->: a') -> (b :->: b') -> c :->: c'

data TrieTree :: * -> * -> * -> * where

Constructors

L :: a -> TrieTree Z k a

B :: (k :->: TrieTree n k a) -> TrieTree (S n) k a

Instances

Functor (Trie k) => Functor (TrieTree n k)

(Applicative (Trie k), IsNat n) => Applicative (TrieTree n k)

Foldable (Trie k) => Foldable (TrieTree n k)

(Functor (Trie k), Foldable (Trie k), Traversable (Trie k)) => Traversable (TrieTree n k)