Data.GenericTrie.Internal

Contents

• Generic derivation implementation

Description

Synopsis

• class TrieKey k where
  • type TrieRep k :: * -> *
  • trieEmpty :: Trie k a
  • trieNull :: Trie k a -> Bool
  • trieLookup :: k -> Trie k a -> Maybe a
  • trieInsert :: k -> a -> Trie k a -> Trie k a
  • trieDelete :: k -> Trie k a -> Trie k a
  • trieAt :: Functor f => k -> (Maybe a -> f (Maybe a)) -> Trie k a -> f (Trie k a)
  • trieSingleton :: k -> a -> Trie k a
  • trieMap :: (a -> b) -> Trie k a -> Trie k b
  • trieTraverse :: Applicative f => (a -> f b) -> Trie k a -> f (Trie k b)
  • trieShowsPrec :: Show a => Int -> Trie k a -> ShowS
  • trieMapMaybeWithKey :: (k -> a -> Maybe b) -> Trie k a -> Trie k b
  • trieFoldWithKey :: (k -> a -> r -> r) -> r -> Trie k a -> r
  • trieTraverseWithKey :: Applicative f => (k -> a -> f b) -> Trie k a -> f (Trie k b)
  • trieMergeWithKey :: (k -> a -> b -> Maybe c) -> (Trie k a -> Trie k c) -> (Trie k b -> Trie k c) -> Trie k a -> Trie k b -> Trie k c
• newtype Trie k a = MkTrie (TrieRep k a)
• newtype OrdKey k = OrdKey {
  • getOrdKey :: k
  }
• genericTrieNull :: (TrieRep k ~ TrieRepDefault k) => Trie k a -> Bool
• genericTrieMap :: (GTrieKey (Rep k), TrieRep k ~ TrieRepDefault k) => (a -> b) -> Trie k a -> Trie k b
• genericTrieTraverse :: (GTrieKey (Rep k), TrieRep k ~ TrieRepDefault k, Applicative f) => (a -> f b) -> Trie k a -> f (Trie k b)
• genericTrieShowsPrec :: (Show a, GTrieKeyShow (Rep k), TrieRep k ~ TrieRepDefault k) => Int -> Trie k a -> ShowS
• genericInsert :: (GTrieKey (Rep k), Generic k, TrieRep k ~ TrieRepDefault k) => k -> a -> Trie k a -> Trie k a
• genericLookup :: (GTrieKey (Rep k), Generic k, TrieRep k ~ TrieRepDefault k) => k -> Trie k a -> Maybe a
• genericDelete :: (GTrieKey (Rep k), Generic k, TrieRep k ~ TrieRepDefault k) => k -> Trie k a -> Trie k a
• genericMapMaybeWithKey :: (GTrieKey (Rep k), Generic k, TrieRep k ~ TrieRepDefault k) => (k -> a -> Maybe b) -> Trie k a -> Trie k b
• genericSingleton :: (GTrieKey (Rep k), Generic k, TrieRep k ~ TrieRepDefault k) => k -> a -> Trie k a
• genericEmpty :: (TrieRep k ~ TrieRepDefault k) => Trie k a
• genericAt :: (GTrieKey (Rep k), Generic k, TrieRep k ~ TrieRepDefault k, Functor f) => k -> (Maybe a -> f (Maybe a)) -> Trie k a -> f (Trie k a)
• genericFoldWithKey :: (GTrieKey (Rep k), Generic k, TrieRep k ~ TrieRepDefault k) => (k -> a -> r -> r) -> r -> Trie k a -> r
• genericTraverseWithKey :: (GTrieKey (Rep k), Generic k, TrieRep k ~ TrieRepDefault k, Applicative f) => (k -> a -> f b) -> Trie k a -> f (Trie k b)
• type TrieRepDefault k = Compose Maybe (GTrie (Rep k))
• class GTrieKey f where
  • gtrieLookup :: f p -> GTrie f a -> Maybe a
  • gtrieInsert :: f p -> a -> GTrie f a -> GTrie f a
  • gtrieSingleton :: f p -> a -> GTrie f a
  • gtrieDelete :: f p -> GTrie f a -> Maybe (GTrie f a)
  • gtrieMap :: (a -> b) -> GTrie f a -> GTrie f b
  • gtrieTraverse :: Applicative m => (a -> m b) -> GTrie f a -> m (GTrie f b)
  • gmapMaybeWithKey :: (f p -> a -> Maybe b) -> GTrie f a -> Maybe (GTrie f b)
  • gfoldWithKey :: (f p -> a -> r -> r) -> r -> GTrie f a -> r
  • gtraverseWithKey :: Applicative m => (f p -> a -> m b) -> GTrie f a -> m (GTrie f b)
  • gmergeWithKey :: (f p -> a -> b -> Maybe c) -> (GTrie f a -> Maybe (GTrie f c)) -> (GTrie f b -> Maybe (GTrie f c)) -> GTrie f a -> GTrie f b -> Maybe (GTrie f c)
  • gtrieAt :: Functor m => (Maybe (GTrie f a) -> r) -> f p -> (Maybe a -> m (Maybe a)) -> GTrie f a -> m r
• data family GTrie f a

Documentation

Generic derivation implementation