Data.Functor.Representable.Trie

Contents

• Representations of polynomial functors
• Memoizing functions
• Workarounds for current GHC limitations

Description

Synopsis

• class (Adjustable (BaseTrie a), TraversableWithKey1 (BaseTrie a), Representable (BaseTrie a)) => HasTrie a where
  • type BaseTrie a :: * -> *
  • embedKey :: a -> Key (BaseTrie a)
  • projectKey :: Key (BaseTrie a) -> a
• mup :: HasTrie t => (b -> c) -> (t -> b) -> t -> c
• memo :: HasTrie t => (t -> a) -> t -> a
• memo2 :: (HasTrie s, HasTrie t) => (s -> t -> a) -> s -> t -> a
• memo3 :: (HasTrie r, HasTrie s, HasTrie t) => (r -> s -> t -> a) -> r -> s -> t -> a
• inTrie :: (HasTrie a, HasTrie c) => ((a -> b) -> c -> d) -> (a :->: b) -> c :->: d
• inTrie2 :: (HasTrie a, HasTrie c, HasTrie e) => ((a -> b) -> (c -> d) -> e -> f) -> (a :->: b) -> (c :->: d) -> e :->: f
• inTrie3 :: (HasTrie a, HasTrie c, HasTrie e, HasTrie g) => ((a -> b) -> (c -> d) -> (e -> f) -> g -> h) -> (a :->: b) -> (c :->: d) -> (e :->: f) -> g :->: h
• trie :: HasTrie t => (t -> a) -> t :->: a
• untrie :: HasTrie t => (t :->: a) -> t -> a
• newtype a :->: b = Trie {
  • runTrie :: BaseTrie a b
  }
• data Entry a b = Entry a b

Representations of polynomial functors

Memoizing functions

Workarounds for current GHC limitations