list-tries 0.6.5 → 0.6.6
raw patch · 5 files changed
+134/−129 lines, 5 filesdep ~QuickCheckdep ~basedep ~binaryPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: QuickCheck, base, binary, containers, template-haskell, test-framework, test-framework-hunit, test-framework-quickcheck2
API changes (from Hackage documentation)
- Data.ListTrie.Map: instance Data.ListTrie.Base.Map.Map map k => Data.ListTrie.Base.Trie Data.ListTrie.Map.TrieMap GHC.Base.Maybe map k
- Data.ListTrie.Map: instance Data.ListTrie.Base.Map.Map map k => Data.Semigroup.Semigroup (Data.ListTrie.Map.TrieMap map k a)
- Data.ListTrie.Patricia.Map: instance Data.ListTrie.Base.Map.Map map k => Data.ListTrie.Patricia.Base.Trie Data.ListTrie.Patricia.Map.TrieMap GHC.Base.Maybe map k
- Data.ListTrie.Patricia.Map: instance Data.ListTrie.Base.Map.Map map k => Data.Semigroup.Semigroup (Data.ListTrie.Patricia.Map.TrieMap map k a)
- Data.ListTrie.Patricia.Set: instance Data.ListTrie.Base.Map.Map map a => Data.Semigroup.Semigroup (Data.ListTrie.Patricia.Set.TrieSet map a)
- Data.ListTrie.Set: instance Data.ListTrie.Base.Map.Map map a => Data.Semigroup.Semigroup (Data.ListTrie.Set.TrieSet map a)
+ Data.ListTrie.Map: instance Data.ListTrie.Base.Map.Map map k => Data.ListTrie.Base.Trie Data.ListTrie.Map.TrieMap GHC.Maybe.Maybe map k
+ Data.ListTrie.Map: instance Data.ListTrie.Base.Map.Map map k => GHC.Base.Semigroup (Data.ListTrie.Map.TrieMap map k a)
+ Data.ListTrie.Map.Enum: addPrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: adjust :: Map map k => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: adjust' :: Map map k => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: alter :: Map map k => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: alter' :: Map map k => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: children :: Map map k => TrieMap map k a -> map k (TrieMap map k a)
+ Data.ListTrie.Map.Enum: children1 :: Map map k => TrieMap map k a -> map k (TrieMap map k a)
+ Data.ListTrie.Map.Enum: delete :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: deleteMax :: OrdMap map k => TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: deleteMin :: OrdMap map k => TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: deletePrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: deleteSuffixes :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: difference :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map.Enum: differenceWith :: Map map k => (a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map.Enum: differenceWithKey :: Map map k => ([k] -> a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map.Enum: empty :: Map map k => TrieMap map k a
+ Data.ListTrie.Map.Enum: filter :: Map map k => (a -> Bool) -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: filterWithKey :: Map map k => ([k] -> a -> Bool) -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: findMax :: OrdMap map k => TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Map.Enum: findMin :: OrdMap map k => TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Map.Enum: findPredecessor :: OrdMap map k => [k] -> TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Map.Enum: findSuccessor :: OrdMap map k => [k] -> TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Map.Enum: foldl :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldl' :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldlAsc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldlAsc' :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldlAscWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldlAscWithKey' :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldlDesc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldlDesc' :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldlDescWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldlDescWithKey' :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldlWithKey :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldlWithKey' :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldr :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldrAsc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldrAscWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldrDesc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldrDescWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: foldrWithKey :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Enum: fromList :: Map map k => [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map.Enum: fromListWith :: Map map k => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map.Enum: fromListWith' :: Map map k => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map.Enum: fromListWithKey :: Map map k => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map.Enum: fromListWithKey' :: Map map k => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map.Enum: insert :: Map map k => [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: insert' :: Map map k => [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: insertWith :: Map map k => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: insertWith' :: Map map k => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: intersection :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map.Enum: intersection' :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map.Enum: intersectionWith :: Map map k => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Map.Enum: intersectionWith' :: Map map k => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Map.Enum: intersectionWithKey :: Map map k => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Map.Enum: intersectionWithKey' :: Map map k => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Map.Enum: isProperSubmapOf :: (Map map k, Eq a) => TrieMap map k a -> TrieMap map k a -> Bool
+ Data.ListTrie.Map.Enum: isProperSubmapOfBy :: Map map k => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
+ Data.ListTrie.Map.Enum: isSubmapOf :: (Map map k, Eq a) => TrieMap map k a -> TrieMap map k a -> Bool
+ Data.ListTrie.Map.Enum: isSubmapOfBy :: Map map k => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
+ Data.ListTrie.Map.Enum: lookup :: Map map k => [k] -> TrieMap map k a -> Maybe a
+ Data.ListTrie.Map.Enum: lookupPrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: lookupWithDefault :: Map map k => a -> [k] -> TrieMap map k a -> a
+ Data.ListTrie.Map.Enum: map :: Map map k => (a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Enum: map' :: Map map k => (a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Enum: mapAccum :: Map map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Enum: mapAccum' :: Map map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Enum: mapAccumAsc :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Enum: mapAccumAsc' :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Enum: mapAccumAscWithKey :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Enum: mapAccumAscWithKey' :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Enum: mapAccumDesc :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Enum: mapAccumDesc' :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Enum: mapAccumDescWithKey :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Enum: mapAccumDescWithKey' :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Enum: mapAccumWithKey :: Map map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Enum: mapAccumWithKey' :: Map map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Enum: mapEither :: Map map k => (a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
+ Data.ListTrie.Map.Enum: mapEitherWithKey :: Map map k => ([k] -> a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
+ Data.ListTrie.Map.Enum: mapInKeys :: (Map map k1, Map map k2) => (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Enum: mapInKeys' :: (Map map k1, Map map k2) => (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Enum: mapInKeysWith :: (Map map k1, Map map k2) => (a -> a -> a) -> (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Enum: mapInKeysWith' :: (Map map k1, Map map k2) => (a -> a -> a) -> (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Enum: mapKeys :: (Map map k1, Map map k2) => ([k1] -> [k2]) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Enum: mapKeysWith :: (Map map k1, Map map k2) => (a -> a -> a) -> ([k1] -> [k2]) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Enum: mapMaybe :: Map map k => (a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Enum: mapMaybeWithKey :: Map map k => ([k] -> a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Enum: mapWithKey :: Map map k => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Enum: mapWithKey' :: Map map k => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Enum: maxView :: OrdMap map k => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
+ Data.ListTrie.Map.Enum: member :: Map map k => [k] -> TrieMap map k a -> Bool
+ Data.ListTrie.Map.Enum: minView :: OrdMap map k => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
+ Data.ListTrie.Map.Enum: notMember :: Map map k => [k] -> TrieMap map k a -> Bool
+ Data.ListTrie.Map.Enum: null :: Map map k => TrieMap map k a -> Bool
+ Data.ListTrie.Map.Enum: partition :: Map map k => (a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Map.Enum: partitionWithKey :: Map map k => ([k] -> a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Map.Enum: showTrie :: (Show k, Show a, Map map k) => TrieMap map k a -> ShowS
+ Data.ListTrie.Map.Enum: showTrieWith :: (Show k, Map map k) => (Maybe a -> ShowS) -> TrieMap map k a -> ShowS
+ Data.ListTrie.Map.Enum: singleton :: Map map k => [k] -> a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: size :: (Map map k, Num n) => TrieMap map k a -> n
+ Data.ListTrie.Map.Enum: size' :: (Map map k, Num n) => TrieMap map k a -> n
+ Data.ListTrie.Map.Enum: split :: OrdMap map k => [k] -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Map.Enum: splitLookup :: OrdMap map k => [k] -> TrieMap map k a -> (TrieMap map k a, Maybe a, TrieMap map k a)
+ Data.ListTrie.Map.Enum: splitPrefix :: Map map k => TrieMap map k a -> ([k], Maybe a, TrieMap map k a)
+ Data.ListTrie.Map.Enum: toAscList :: OrdMap map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Map.Enum: toDescList :: OrdMap map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Map.Enum: toList :: Map map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Map.Enum: union :: Map map k => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: union' :: Map map k => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: unionWith :: Map map k => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: unionWith' :: Map map k => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: unionWithKey :: Map map k => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: unionWithKey' :: Map map k => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: unions :: Map map k => [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Enum: unions' :: Map map k => [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Enum: unionsWith :: Map map k => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Enum: unionsWith' :: Map map k => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Enum: unionsWithKey :: Map map k => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Enum: unionsWithKey' :: Map map k => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Enum: update :: Map map k => (a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Enum: updateLookup :: Map map k => (a -> Maybe a) -> [k] -> TrieMap map k a -> (Maybe a, TrieMap map k a)
+ Data.ListTrie.Map.Eq: addPrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: adjust :: Map map k => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: adjust' :: Map map k => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: alter :: Map map k => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: alter' :: Map map k => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: children :: Map map k => TrieMap map k a -> map k (TrieMap map k a)
+ Data.ListTrie.Map.Eq: children1 :: Map map k => TrieMap map k a -> map k (TrieMap map k a)
+ Data.ListTrie.Map.Eq: delete :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: deleteMax :: OrdMap map k => TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: deleteMin :: OrdMap map k => TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: deletePrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: deleteSuffixes :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: difference :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map.Eq: differenceWith :: Map map k => (a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map.Eq: differenceWithKey :: Map map k => ([k] -> a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map.Eq: empty :: Map map k => TrieMap map k a
+ Data.ListTrie.Map.Eq: filter :: Map map k => (a -> Bool) -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: filterWithKey :: Map map k => ([k] -> a -> Bool) -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: findMax :: OrdMap map k => TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Map.Eq: findMin :: OrdMap map k => TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Map.Eq: findPredecessor :: OrdMap map k => [k] -> TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Map.Eq: findSuccessor :: OrdMap map k => [k] -> TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Map.Eq: foldl :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldl' :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldlAsc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldlAsc' :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldlAscWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldlAscWithKey' :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldlDesc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldlDesc' :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldlDescWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldlDescWithKey' :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldlWithKey :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldlWithKey' :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldr :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldrAsc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldrAscWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldrDesc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldrDescWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: foldrWithKey :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Eq: fromList :: Map map k => [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map.Eq: fromListWith :: Map map k => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map.Eq: fromListWith' :: Map map k => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map.Eq: fromListWithKey :: Map map k => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map.Eq: fromListWithKey' :: Map map k => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map.Eq: insert :: Map map k => [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: insert' :: Map map k => [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: insertWith :: Map map k => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: insertWith' :: Map map k => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: intersection :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map.Eq: intersection' :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map.Eq: intersectionWith :: Map map k => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Map.Eq: intersectionWith' :: Map map k => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Map.Eq: intersectionWithKey :: Map map k => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Map.Eq: intersectionWithKey' :: Map map k => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Map.Eq: isProperSubmapOf :: (Map map k, Eq a) => TrieMap map k a -> TrieMap map k a -> Bool
+ Data.ListTrie.Map.Eq: isProperSubmapOfBy :: Map map k => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
+ Data.ListTrie.Map.Eq: isSubmapOf :: (Map map k, Eq a) => TrieMap map k a -> TrieMap map k a -> Bool
+ Data.ListTrie.Map.Eq: isSubmapOfBy :: Map map k => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
+ Data.ListTrie.Map.Eq: lookup :: Map map k => [k] -> TrieMap map k a -> Maybe a
+ Data.ListTrie.Map.Eq: lookupPrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: lookupWithDefault :: Map map k => a -> [k] -> TrieMap map k a -> a
+ Data.ListTrie.Map.Eq: map :: Map map k => (a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Eq: map' :: Map map k => (a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Eq: mapAccum :: Map map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Eq: mapAccum' :: Map map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Eq: mapAccumAsc :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Eq: mapAccumAsc' :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Eq: mapAccumAscWithKey :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Eq: mapAccumAscWithKey' :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Eq: mapAccumDesc :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Eq: mapAccumDesc' :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Eq: mapAccumDescWithKey :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Eq: mapAccumDescWithKey' :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Eq: mapAccumWithKey :: Map map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Eq: mapAccumWithKey' :: Map map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Eq: mapEither :: Map map k => (a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
+ Data.ListTrie.Map.Eq: mapEitherWithKey :: Map map k => ([k] -> a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
+ Data.ListTrie.Map.Eq: mapInKeys :: (Map map k1, Map map k2) => (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Eq: mapInKeys' :: (Map map k1, Map map k2) => (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Eq: mapInKeysWith :: (Map map k1, Map map k2) => (a -> a -> a) -> (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Eq: mapInKeysWith' :: (Map map k1, Map map k2) => (a -> a -> a) -> (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Eq: mapKeys :: (Map map k1, Map map k2) => ([k1] -> [k2]) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Eq: mapKeysWith :: (Map map k1, Map map k2) => (a -> a -> a) -> ([k1] -> [k2]) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Eq: mapMaybe :: Map map k => (a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Eq: mapMaybeWithKey :: Map map k => ([k] -> a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Eq: mapWithKey :: Map map k => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Eq: mapWithKey' :: Map map k => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Eq: maxView :: OrdMap map k => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
+ Data.ListTrie.Map.Eq: member :: Map map k => [k] -> TrieMap map k a -> Bool
+ Data.ListTrie.Map.Eq: minView :: OrdMap map k => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
+ Data.ListTrie.Map.Eq: notMember :: Map map k => [k] -> TrieMap map k a -> Bool
+ Data.ListTrie.Map.Eq: null :: Map map k => TrieMap map k a -> Bool
+ Data.ListTrie.Map.Eq: partition :: Map map k => (a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Map.Eq: partitionWithKey :: Map map k => ([k] -> a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Map.Eq: showTrie :: (Show k, Show a, Map map k) => TrieMap map k a -> ShowS
+ Data.ListTrie.Map.Eq: showTrieWith :: (Show k, Map map k) => (Maybe a -> ShowS) -> TrieMap map k a -> ShowS
+ Data.ListTrie.Map.Eq: singleton :: Map map k => [k] -> a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: size :: (Map map k, Num n) => TrieMap map k a -> n
+ Data.ListTrie.Map.Eq: size' :: (Map map k, Num n) => TrieMap map k a -> n
+ Data.ListTrie.Map.Eq: split :: OrdMap map k => [k] -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Map.Eq: splitLookup :: OrdMap map k => [k] -> TrieMap map k a -> (TrieMap map k a, Maybe a, TrieMap map k a)
+ Data.ListTrie.Map.Eq: splitPrefix :: Map map k => TrieMap map k a -> ([k], Maybe a, TrieMap map k a)
+ Data.ListTrie.Map.Eq: toAscList :: OrdMap map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Map.Eq: toDescList :: OrdMap map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Map.Eq: toList :: Map map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Map.Eq: union :: Map map k => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: union' :: Map map k => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: unionWith :: Map map k => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: unionWith' :: Map map k => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: unionWithKey :: Map map k => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: unionWithKey' :: Map map k => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: unions :: Map map k => [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Eq: unions' :: Map map k => [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Eq: unionsWith :: Map map k => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Eq: unionsWith' :: Map map k => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Eq: unionsWithKey :: Map map k => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Eq: unionsWithKey' :: Map map k => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Eq: update :: Map map k => (a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Eq: updateLookup :: Map map k => (a -> Maybe a) -> [k] -> TrieMap map k a -> (Maybe a, TrieMap map k a)
+ Data.ListTrie.Map.Ord: addPrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: adjust :: Map map k => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: adjust' :: Map map k => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: alter :: Map map k => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: alter' :: Map map k => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: children :: Map map k => TrieMap map k a -> map k (TrieMap map k a)
+ Data.ListTrie.Map.Ord: children1 :: Map map k => TrieMap map k a -> map k (TrieMap map k a)
+ Data.ListTrie.Map.Ord: delete :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: deleteMax :: OrdMap map k => TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: deleteMin :: OrdMap map k => TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: deletePrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: deleteSuffixes :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: difference :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map.Ord: differenceWith :: Map map k => (a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map.Ord: differenceWithKey :: Map map k => ([k] -> a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map.Ord: empty :: Map map k => TrieMap map k a
+ Data.ListTrie.Map.Ord: filter :: Map map k => (a -> Bool) -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: filterWithKey :: Map map k => ([k] -> a -> Bool) -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: findMax :: OrdMap map k => TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Map.Ord: findMin :: OrdMap map k => TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Map.Ord: findPredecessor :: OrdMap map k => [k] -> TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Map.Ord: findSuccessor :: OrdMap map k => [k] -> TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Map.Ord: foldl :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldl' :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldlAsc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldlAsc' :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldlAscWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldlAscWithKey' :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldlDesc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldlDesc' :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldlDescWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldlDescWithKey' :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldlWithKey :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldlWithKey' :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldr :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldrAsc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldrAscWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldrDesc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldrDescWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: foldrWithKey :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map.Ord: fromList :: Map map k => [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map.Ord: fromListWith :: Map map k => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map.Ord: fromListWith' :: Map map k => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map.Ord: fromListWithKey :: Map map k => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map.Ord: fromListWithKey' :: Map map k => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map.Ord: insert :: Map map k => [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: insert' :: Map map k => [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: insertWith :: Map map k => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: insertWith' :: Map map k => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: intersection :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map.Ord: intersection' :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map.Ord: intersectionWith :: Map map k => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Map.Ord: intersectionWith' :: Map map k => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Map.Ord: intersectionWithKey :: Map map k => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Map.Ord: intersectionWithKey' :: Map map k => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Map.Ord: isProperSubmapOf :: (Map map k, Eq a) => TrieMap map k a -> TrieMap map k a -> Bool
+ Data.ListTrie.Map.Ord: isProperSubmapOfBy :: Map map k => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
+ Data.ListTrie.Map.Ord: isSubmapOf :: (Map map k, Eq a) => TrieMap map k a -> TrieMap map k a -> Bool
+ Data.ListTrie.Map.Ord: isSubmapOfBy :: Map map k => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
+ Data.ListTrie.Map.Ord: lookup :: Map map k => [k] -> TrieMap map k a -> Maybe a
+ Data.ListTrie.Map.Ord: lookupPrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: lookupWithDefault :: Map map k => a -> [k] -> TrieMap map k a -> a
+ Data.ListTrie.Map.Ord: map :: Map map k => (a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Ord: map' :: Map map k => (a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Ord: mapAccum :: Map map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Ord: mapAccum' :: Map map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Ord: mapAccumAsc :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Ord: mapAccumAsc' :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Ord: mapAccumAscWithKey :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Ord: mapAccumAscWithKey' :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Ord: mapAccumDesc :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Ord: mapAccumDesc' :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Ord: mapAccumDescWithKey :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Ord: mapAccumDescWithKey' :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Ord: mapAccumWithKey :: Map map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Ord: mapAccumWithKey' :: Map map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map.Ord: mapEither :: Map map k => (a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
+ Data.ListTrie.Map.Ord: mapEitherWithKey :: Map map k => ([k] -> a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
+ Data.ListTrie.Map.Ord: mapInKeys :: (Map map k1, Map map k2) => (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Ord: mapInKeys' :: (Map map k1, Map map k2) => (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Ord: mapInKeysWith :: (Map map k1, Map map k2) => (a -> a -> a) -> (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Ord: mapInKeysWith' :: (Map map k1, Map map k2) => (a -> a -> a) -> (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Ord: mapKeys :: (Map map k1, Map map k2) => ([k1] -> [k2]) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Ord: mapKeysWith :: (Map map k1, Map map k2) => (a -> a -> a) -> ([k1] -> [k2]) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Map.Ord: mapMaybe :: Map map k => (a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Ord: mapMaybeWithKey :: Map map k => ([k] -> a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Ord: mapWithKey :: Map map k => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Ord: mapWithKey' :: Map map k => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map.Ord: maxView :: OrdMap map k => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
+ Data.ListTrie.Map.Ord: member :: Map map k => [k] -> TrieMap map k a -> Bool
+ Data.ListTrie.Map.Ord: minView :: OrdMap map k => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
+ Data.ListTrie.Map.Ord: notMember :: Map map k => [k] -> TrieMap map k a -> Bool
+ Data.ListTrie.Map.Ord: null :: Map map k => TrieMap map k a -> Bool
+ Data.ListTrie.Map.Ord: partition :: Map map k => (a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Map.Ord: partitionWithKey :: Map map k => ([k] -> a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Map.Ord: showTrie :: (Show k, Show a, Map map k) => TrieMap map k a -> ShowS
+ Data.ListTrie.Map.Ord: showTrieWith :: (Show k, Map map k) => (Maybe a -> ShowS) -> TrieMap map k a -> ShowS
+ Data.ListTrie.Map.Ord: singleton :: Map map k => [k] -> a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: size :: (Map map k, Num n) => TrieMap map k a -> n
+ Data.ListTrie.Map.Ord: size' :: (Map map k, Num n) => TrieMap map k a -> n
+ Data.ListTrie.Map.Ord: split :: OrdMap map k => [k] -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Map.Ord: splitLookup :: OrdMap map k => [k] -> TrieMap map k a -> (TrieMap map k a, Maybe a, TrieMap map k a)
+ Data.ListTrie.Map.Ord: splitPrefix :: Map map k => TrieMap map k a -> ([k], Maybe a, TrieMap map k a)
+ Data.ListTrie.Map.Ord: toAscList :: OrdMap map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Map.Ord: toDescList :: OrdMap map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Map.Ord: toList :: Map map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Map.Ord: union :: Map map k => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: union' :: Map map k => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: unionWith :: Map map k => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: unionWith' :: Map map k => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: unionWithKey :: Map map k => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: unionWithKey' :: Map map k => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: unions :: Map map k => [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Ord: unions' :: Map map k => [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Ord: unionsWith :: Map map k => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Ord: unionsWith' :: Map map k => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Ord: unionsWithKey :: Map map k => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Ord: unionsWithKey' :: Map map k => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map.Ord: update :: Map map k => (a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map.Ord: updateLookup :: Map map k => (a -> Maybe a) -> [k] -> TrieMap map k a -> (Maybe a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map: instance Data.ListTrie.Base.Map.Map map k => Data.ListTrie.Patricia.Base.Trie Data.ListTrie.Patricia.Map.TrieMap GHC.Maybe.Maybe map k
+ Data.ListTrie.Patricia.Map: instance Data.ListTrie.Base.Map.Map map k => GHC.Base.Semigroup (Data.ListTrie.Patricia.Map.TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Enum: addPrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: adjust :: Map map k => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: adjust' :: Map map k => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: alter :: Map map k => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: alter' :: Map map k => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: children :: Map map k => TrieMap map k a -> map k (TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Enum: children1 :: Map map k => TrieMap map k a -> map k (TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Enum: delete :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: deleteMax :: OrdMap map k => TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: deleteMin :: OrdMap map k => TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: deletePrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: deleteSuffixes :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: difference :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: differenceWith :: Map map k => (a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: differenceWithKey :: Map map k => ([k] -> a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: empty :: Map map k => TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: filter :: Map map k => (a -> Bool) -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: filterWithKey :: Map map k => ([k] -> a -> Bool) -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: findMax :: OrdMap map k => TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Patricia.Map.Enum: findMin :: OrdMap map k => TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Patricia.Map.Enum: findPredecessor :: OrdMap map k => [k] -> TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Patricia.Map.Enum: findSuccessor :: OrdMap map k => [k] -> TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Patricia.Map.Enum: foldl :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldl' :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldlAsc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldlAsc' :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldlAscWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldlAscWithKey' :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldlDesc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldlDesc' :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldlDescWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldlDescWithKey' :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldlWithKey :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldlWithKey' :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldr :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldrAsc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldrAscWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldrDesc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldrDescWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: foldrWithKey :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Enum: fromList :: Map map k => [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: fromListWith :: Map map k => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: fromListWith' :: Map map k => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: fromListWithKey :: Map map k => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: fromListWithKey' :: Map map k => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: insert :: Map map k => [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: insert' :: Map map k => [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: insertWith :: Map map k => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: insertWith' :: Map map k => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: intersection :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: intersection' :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: intersectionWith :: Map map k => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Patricia.Map.Enum: intersectionWith' :: Map map k => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Patricia.Map.Enum: intersectionWithKey :: Map map k => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Patricia.Map.Enum: intersectionWithKey' :: Map map k => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Patricia.Map.Enum: isProperSubmapOf :: (Map map k, Eq a) => TrieMap map k a -> TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map.Enum: isProperSubmapOfBy :: Map map k => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
+ Data.ListTrie.Patricia.Map.Enum: isSubmapOf :: (Map map k, Eq a) => TrieMap map k a -> TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map.Enum: isSubmapOfBy :: Map map k => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
+ Data.ListTrie.Patricia.Map.Enum: lookup :: Map map k => [k] -> TrieMap map k a -> Maybe a
+ Data.ListTrie.Patricia.Map.Enum: lookupPrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: lookupWithDefault :: Map map k => a -> [k] -> TrieMap map k a -> a
+ Data.ListTrie.Patricia.Map.Enum: map :: Map map k => (a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Enum: map' :: Map map k => (a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Enum: mapAccum :: Map map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Enum: mapAccum' :: Map map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Enum: mapAccumAsc :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Enum: mapAccumAsc' :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Enum: mapAccumAscWithKey :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Enum: mapAccumAscWithKey' :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Enum: mapAccumDesc :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Enum: mapAccumDesc' :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Enum: mapAccumDescWithKey :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Enum: mapAccumDescWithKey' :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Enum: mapAccumWithKey :: Map map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Enum: mapAccumWithKey' :: Map map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Enum: mapEither :: Map map k => (a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
+ Data.ListTrie.Patricia.Map.Enum: mapEitherWithKey :: Map map k => ([k] -> a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
+ Data.ListTrie.Patricia.Map.Enum: mapInKeys :: (Map map k1, Map map k2) => (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Enum: mapInKeys' :: (Map map k1, Map map k2) => (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Enum: mapInKeysWith :: (Map map k1, Map map k2) => (a -> a -> a) -> (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Enum: mapInKeysWith' :: (Map map k1, Map map k2) => (a -> a -> a) -> (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Enum: mapKeys :: (Map map k1, Map map k2) => ([k1] -> [k2]) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Enum: mapKeysWith :: (Map map k1, Map map k2) => (a -> a -> a) -> ([k1] -> [k2]) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Enum: mapMaybe :: Map map k => (a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Enum: mapMaybeWithKey :: Map map k => ([k] -> a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Enum: mapWithKey :: Map map k => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Enum: mapWithKey' :: Map map k => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Enum: maxView :: OrdMap map k => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Enum: member :: Map map k => [k] -> TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map.Enum: minView :: OrdMap map k => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Enum: notMember :: Map map k => [k] -> TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map.Enum: null :: Map map k => TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map.Enum: partition :: Map map k => (a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Enum: partitionWithKey :: Map map k => ([k] -> a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Enum: showTrie :: (Show k, Show a, Map map k) => TrieMap map k a -> ShowS
+ Data.ListTrie.Patricia.Map.Enum: showTrieWith :: (Show k, Map map k) => (Maybe a -> ShowS) -> TrieMap map k a -> ShowS
+ Data.ListTrie.Patricia.Map.Enum: singleton :: Map map k => [k] -> a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: size :: (Map map k, Num n) => TrieMap map k a -> n
+ Data.ListTrie.Patricia.Map.Enum: size' :: (Map map k, Num n) => TrieMap map k a -> n
+ Data.ListTrie.Patricia.Map.Enum: split :: OrdMap map k => [k] -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Enum: splitLookup :: OrdMap map k => [k] -> TrieMap map k a -> (TrieMap map k a, Maybe a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Enum: splitPrefix :: Map map k => TrieMap map k a -> ([k], Maybe a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Enum: toAscList :: OrdMap map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Patricia.Map.Enum: toDescList :: OrdMap map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Patricia.Map.Enum: toList :: Map map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Patricia.Map.Enum: union :: Map map k => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: union' :: Map map k => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: unionWith :: Map map k => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: unionWith' :: Map map k => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: unionWithKey :: Map map k => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: unionWithKey' :: Map map k => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: unions :: Map map k => [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: unions' :: Map map k => [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: unionsWith :: Map map k => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: unionsWith' :: Map map k => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: unionsWithKey :: Map map k => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: unionsWithKey' :: Map map k => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: update :: Map map k => (a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Enum: updateLookup :: Map map k => (a -> Maybe a) -> [k] -> TrieMap map k a -> (Maybe a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Eq: addPrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: adjust :: Map map k => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: adjust' :: Map map k => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: alter :: Map map k => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: alter' :: Map map k => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: children :: Map map k => TrieMap map k a -> map k (TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Eq: children1 :: Map map k => TrieMap map k a -> map k (TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Eq: delete :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: deleteMax :: OrdMap map k => TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: deleteMin :: OrdMap map k => TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: deletePrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: deleteSuffixes :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: difference :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: differenceWith :: Map map k => (a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: differenceWithKey :: Map map k => ([k] -> a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: empty :: Map map k => TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: filter :: Map map k => (a -> Bool) -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: filterWithKey :: Map map k => ([k] -> a -> Bool) -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: findMax :: OrdMap map k => TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Patricia.Map.Eq: findMin :: OrdMap map k => TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Patricia.Map.Eq: findPredecessor :: OrdMap map k => [k] -> TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Patricia.Map.Eq: findSuccessor :: OrdMap map k => [k] -> TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Patricia.Map.Eq: foldl :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldl' :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldlAsc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldlAsc' :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldlAscWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldlAscWithKey' :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldlDesc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldlDesc' :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldlDescWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldlDescWithKey' :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldlWithKey :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldlWithKey' :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldr :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldrAsc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldrAscWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldrDesc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldrDescWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: foldrWithKey :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Eq: fromList :: Map map k => [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: fromListWith :: Map map k => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: fromListWith' :: Map map k => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: fromListWithKey :: Map map k => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: fromListWithKey' :: Map map k => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: insert :: Map map k => [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: insert' :: Map map k => [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: insertWith :: Map map k => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: insertWith' :: Map map k => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: intersection :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: intersection' :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: intersectionWith :: Map map k => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Patricia.Map.Eq: intersectionWith' :: Map map k => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Patricia.Map.Eq: intersectionWithKey :: Map map k => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Patricia.Map.Eq: intersectionWithKey' :: Map map k => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Patricia.Map.Eq: isProperSubmapOf :: (Map map k, Eq a) => TrieMap map k a -> TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map.Eq: isProperSubmapOfBy :: Map map k => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
+ Data.ListTrie.Patricia.Map.Eq: isSubmapOf :: (Map map k, Eq a) => TrieMap map k a -> TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map.Eq: isSubmapOfBy :: Map map k => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
+ Data.ListTrie.Patricia.Map.Eq: lookup :: Map map k => [k] -> TrieMap map k a -> Maybe a
+ Data.ListTrie.Patricia.Map.Eq: lookupPrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: lookupWithDefault :: Map map k => a -> [k] -> TrieMap map k a -> a
+ Data.ListTrie.Patricia.Map.Eq: map :: Map map k => (a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Eq: map' :: Map map k => (a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Eq: mapAccum :: Map map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Eq: mapAccum' :: Map map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Eq: mapAccumAsc :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Eq: mapAccumAsc' :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Eq: mapAccumAscWithKey :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Eq: mapAccumAscWithKey' :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Eq: mapAccumDesc :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Eq: mapAccumDesc' :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Eq: mapAccumDescWithKey :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Eq: mapAccumDescWithKey' :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Eq: mapAccumWithKey :: Map map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Eq: mapAccumWithKey' :: Map map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Eq: mapEither :: Map map k => (a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
+ Data.ListTrie.Patricia.Map.Eq: mapEitherWithKey :: Map map k => ([k] -> a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
+ Data.ListTrie.Patricia.Map.Eq: mapInKeys :: (Map map k1, Map map k2) => (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Eq: mapInKeys' :: (Map map k1, Map map k2) => (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Eq: mapInKeysWith :: (Map map k1, Map map k2) => (a -> a -> a) -> (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Eq: mapInKeysWith' :: (Map map k1, Map map k2) => (a -> a -> a) -> (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Eq: mapKeys :: (Map map k1, Map map k2) => ([k1] -> [k2]) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Eq: mapKeysWith :: (Map map k1, Map map k2) => (a -> a -> a) -> ([k1] -> [k2]) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Eq: mapMaybe :: Map map k => (a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Eq: mapMaybeWithKey :: Map map k => ([k] -> a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Eq: mapWithKey :: Map map k => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Eq: mapWithKey' :: Map map k => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Eq: maxView :: OrdMap map k => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Eq: member :: Map map k => [k] -> TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map.Eq: minView :: OrdMap map k => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Eq: notMember :: Map map k => [k] -> TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map.Eq: null :: Map map k => TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map.Eq: partition :: Map map k => (a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Eq: partitionWithKey :: Map map k => ([k] -> a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Eq: showTrie :: (Show k, Show a, Map map k) => TrieMap map k a -> ShowS
+ Data.ListTrie.Patricia.Map.Eq: showTrieWith :: (Show k, Map map k) => (Maybe a -> ShowS) -> TrieMap map k a -> ShowS
+ Data.ListTrie.Patricia.Map.Eq: singleton :: Map map k => [k] -> a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: size :: (Map map k, Num n) => TrieMap map k a -> n
+ Data.ListTrie.Patricia.Map.Eq: size' :: (Map map k, Num n) => TrieMap map k a -> n
+ Data.ListTrie.Patricia.Map.Eq: split :: OrdMap map k => [k] -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Eq: splitLookup :: OrdMap map k => [k] -> TrieMap map k a -> (TrieMap map k a, Maybe a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Eq: splitPrefix :: Map map k => TrieMap map k a -> ([k], Maybe a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Eq: toAscList :: OrdMap map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Patricia.Map.Eq: toDescList :: OrdMap map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Patricia.Map.Eq: toList :: Map map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Patricia.Map.Eq: union :: Map map k => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: union' :: Map map k => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: unionWith :: Map map k => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: unionWith' :: Map map k => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: unionWithKey :: Map map k => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: unionWithKey' :: Map map k => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: unions :: Map map k => [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: unions' :: Map map k => [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: unionsWith :: Map map k => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: unionsWith' :: Map map k => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: unionsWithKey :: Map map k => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: unionsWithKey' :: Map map k => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: update :: Map map k => (a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Eq: updateLookup :: Map map k => (a -> Maybe a) -> [k] -> TrieMap map k a -> (Maybe a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Ord: addPrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: adjust :: Map map k => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: adjust' :: Map map k => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: alter :: Map map k => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: alter' :: Map map k => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: children :: Map map k => TrieMap map k a -> map k (TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Ord: children1 :: Map map k => TrieMap map k a -> map k (TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Ord: delete :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: deleteMax :: OrdMap map k => TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: deleteMin :: OrdMap map k => TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: deletePrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: deleteSuffixes :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: difference :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: differenceWith :: Map map k => (a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: differenceWithKey :: Map map k => ([k] -> a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: empty :: Map map k => TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: filter :: Map map k => (a -> Bool) -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: filterWithKey :: Map map k => ([k] -> a -> Bool) -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: findMax :: OrdMap map k => TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Patricia.Map.Ord: findMin :: OrdMap map k => TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Patricia.Map.Ord: findPredecessor :: OrdMap map k => [k] -> TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Patricia.Map.Ord: findSuccessor :: OrdMap map k => [k] -> TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Patricia.Map.Ord: foldl :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldl' :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldlAsc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldlAsc' :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldlAscWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldlAscWithKey' :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldlDesc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldlDesc' :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldlDescWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldlDescWithKey' :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldlWithKey :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldlWithKey' :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldr :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldrAsc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldrAscWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldrDesc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldrDescWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: foldrWithKey :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map.Ord: fromList :: Map map k => [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: fromListWith :: Map map k => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: fromListWith' :: Map map k => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: fromListWithKey :: Map map k => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: fromListWithKey' :: Map map k => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: insert :: Map map k => [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: insert' :: Map map k => [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: insertWith :: Map map k => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: insertWith' :: Map map k => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: intersection :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: intersection' :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: intersectionWith :: Map map k => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Patricia.Map.Ord: intersectionWith' :: Map map k => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Patricia.Map.Ord: intersectionWithKey :: Map map k => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Patricia.Map.Ord: intersectionWithKey' :: Map map k => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Patricia.Map.Ord: isProperSubmapOf :: (Map map k, Eq a) => TrieMap map k a -> TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map.Ord: isProperSubmapOfBy :: Map map k => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
+ Data.ListTrie.Patricia.Map.Ord: isSubmapOf :: (Map map k, Eq a) => TrieMap map k a -> TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map.Ord: isSubmapOfBy :: Map map k => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
+ Data.ListTrie.Patricia.Map.Ord: lookup :: Map map k => [k] -> TrieMap map k a -> Maybe a
+ Data.ListTrie.Patricia.Map.Ord: lookupPrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: lookupWithDefault :: Map map k => a -> [k] -> TrieMap map k a -> a
+ Data.ListTrie.Patricia.Map.Ord: map :: Map map k => (a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Ord: map' :: Map map k => (a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Ord: mapAccum :: Map map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Ord: mapAccum' :: Map map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Ord: mapAccumAsc :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Ord: mapAccumAsc' :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Ord: mapAccumAscWithKey :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Ord: mapAccumAscWithKey' :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Ord: mapAccumDesc :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Ord: mapAccumDesc' :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Ord: mapAccumDescWithKey :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Ord: mapAccumDescWithKey' :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Ord: mapAccumWithKey :: Map map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Ord: mapAccumWithKey' :: Map map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map.Ord: mapEither :: Map map k => (a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
+ Data.ListTrie.Patricia.Map.Ord: mapEitherWithKey :: Map map k => ([k] -> a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
+ Data.ListTrie.Patricia.Map.Ord: mapInKeys :: (Map map k1, Map map k2) => (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Ord: mapInKeys' :: (Map map k1, Map map k2) => (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Ord: mapInKeysWith :: (Map map k1, Map map k2) => (a -> a -> a) -> (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Ord: mapInKeysWith' :: (Map map k1, Map map k2) => (a -> a -> a) -> (k1 -> k2) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Ord: mapKeys :: (Map map k1, Map map k2) => ([k1] -> [k2]) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Ord: mapKeysWith :: (Map map k1, Map map k2) => (a -> a -> a) -> ([k1] -> [k2]) -> TrieMap map k1 a -> TrieMap map k2 a
+ Data.ListTrie.Patricia.Map.Ord: mapMaybe :: Map map k => (a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Ord: mapMaybeWithKey :: Map map k => ([k] -> a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Ord: mapWithKey :: Map map k => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Ord: mapWithKey' :: Map map k => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map.Ord: maxView :: OrdMap map k => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Ord: member :: Map map k => [k] -> TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map.Ord: minView :: OrdMap map k => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Ord: notMember :: Map map k => [k] -> TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map.Ord: null :: Map map k => TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map.Ord: partition :: Map map k => (a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Ord: partitionWithKey :: Map map k => ([k] -> a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Ord: showTrie :: (Show k, Show a, Map map k) => TrieMap map k a -> ShowS
+ Data.ListTrie.Patricia.Map.Ord: showTrieWith :: (Show k, Map map k) => (Maybe a -> ShowS) -> TrieMap map k a -> ShowS
+ Data.ListTrie.Patricia.Map.Ord: singleton :: Map map k => [k] -> a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: size :: (Map map k, Num n) => TrieMap map k a -> n
+ Data.ListTrie.Patricia.Map.Ord: size' :: (Map map k, Num n) => TrieMap map k a -> n
+ Data.ListTrie.Patricia.Map.Ord: split :: OrdMap map k => [k] -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Ord: splitLookup :: OrdMap map k => [k] -> TrieMap map k a -> (TrieMap map k a, Maybe a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Ord: splitPrefix :: Map map k => TrieMap map k a -> ([k], Maybe a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map.Ord: toAscList :: OrdMap map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Patricia.Map.Ord: toDescList :: OrdMap map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Patricia.Map.Ord: toList :: Map map k => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Patricia.Map.Ord: union :: Map map k => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: union' :: Map map k => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: unionWith :: Map map k => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: unionWith' :: Map map k => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: unionWithKey :: Map map k => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: unionWithKey' :: Map map k => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: unions :: Map map k => [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: unions' :: Map map k => [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: unionsWith :: Map map k => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: unionsWith' :: Map map k => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: unionsWithKey :: Map map k => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: unionsWithKey' :: Map map k => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: update :: Map map k => (a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map.Ord: updateLookup :: Map map k => (a -> Maybe a) -> [k] -> TrieMap map k a -> (Maybe a, TrieMap map k a)
+ Data.ListTrie.Patricia.Set: instance Data.ListTrie.Base.Map.Map map a => GHC.Base.Semigroup (Data.ListTrie.Patricia.Set.TrieSet map a)
+ Data.ListTrie.Patricia.Set.Enum: addPrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Enum: children :: Map map a => TrieSet map a -> map a (TrieSet map a)
+ Data.ListTrie.Patricia.Set.Enum: children1 :: Map map a => TrieSet map a -> map a (TrieSet map a)
+ Data.ListTrie.Patricia.Set.Enum: delete :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Enum: deleteMax :: OrdMap map a => TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Enum: deleteMin :: OrdMap map a => TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Enum: deletePrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Enum: deleteSuffixes :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Enum: difference :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Enum: empty :: Map map a => TrieSet map a
+ Data.ListTrie.Patricia.Set.Enum: filter :: Map map a => ([a] -> Bool) -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Enum: findMax :: OrdMap map a => TrieSet map a -> Maybe [a]
+ Data.ListTrie.Patricia.Set.Enum: findMin :: OrdMap map a => TrieSet map a -> Maybe [a]
+ Data.ListTrie.Patricia.Set.Enum: findPredecessor :: OrdMap map a => [a] -> TrieSet map a -> Maybe [a]
+ Data.ListTrie.Patricia.Set.Enum: findSuccessor :: OrdMap map a => [a] -> TrieSet map a -> Maybe [a]
+ Data.ListTrie.Patricia.Set.Enum: foldl :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Enum: foldl' :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Enum: foldlAsc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Enum: foldlAsc' :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Enum: foldlDesc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Enum: foldlDesc' :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Enum: foldr :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Enum: foldrAsc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Enum: foldrDesc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Enum: fromList :: Map map a => [[a]] -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Enum: insert :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Enum: intersection :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Enum: isProperSubsetOf :: Map map a => TrieSet map a -> TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set.Enum: isSubsetOf :: Map map a => TrieSet map a -> TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set.Enum: lookupPrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Enum: map :: (Map map a, Map map b) => ([a] -> [b]) -> TrieSet map a -> TrieSet map b
+ Data.ListTrie.Patricia.Set.Enum: mapIn :: (Map map a, Map map b) => (a -> b) -> TrieSet map a -> TrieSet map b
+ Data.ListTrie.Patricia.Set.Enum: maxView :: OrdMap map a => TrieSet map a -> (Maybe [a], TrieSet map a)
+ Data.ListTrie.Patricia.Set.Enum: member :: Map map a => [a] -> TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set.Enum: minView :: OrdMap map a => TrieSet map a -> (Maybe [a], TrieSet map a)
+ Data.ListTrie.Patricia.Set.Enum: notMember :: Map map a => [a] -> TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set.Enum: null :: Map map a => TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set.Enum: partition :: Map map a => ([a] -> Bool) -> TrieSet map a -> (TrieSet map a, TrieSet map a)
+ Data.ListTrie.Patricia.Set.Enum: showTrie :: (Show a, Map map a) => TrieSet map a -> ShowS
+ Data.ListTrie.Patricia.Set.Enum: singleton :: Map map a => [a] -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Enum: size :: (Map map a, Num n) => TrieSet map a -> n
+ Data.ListTrie.Patricia.Set.Enum: size' :: (Map map a, Num n) => TrieSet map a -> n
+ Data.ListTrie.Patricia.Set.Enum: split :: OrdMap map a => [a] -> TrieSet map a -> (TrieSet map a, TrieSet map a)
+ Data.ListTrie.Patricia.Set.Enum: splitMember :: OrdMap map a => [a] -> TrieSet map a -> (TrieSet map a, Bool, TrieSet map a)
+ Data.ListTrie.Patricia.Set.Enum: splitPrefix :: Map map a => TrieSet map a -> ([a], Bool, TrieSet map a)
+ Data.ListTrie.Patricia.Set.Enum: toAscList :: OrdMap map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Patricia.Set.Enum: toDescList :: OrdMap map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Patricia.Set.Enum: toList :: Map map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Patricia.Set.Enum: union :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Enum: unions :: Map map a => [TrieSet map a] -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Eq: addPrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Eq: children :: Map map a => TrieSet map a -> map a (TrieSet map a)
+ Data.ListTrie.Patricia.Set.Eq: children1 :: Map map a => TrieSet map a -> map a (TrieSet map a)
+ Data.ListTrie.Patricia.Set.Eq: delete :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Eq: deleteMax :: OrdMap map a => TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Eq: deleteMin :: OrdMap map a => TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Eq: deletePrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Eq: deleteSuffixes :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Eq: difference :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Eq: empty :: Map map a => TrieSet map a
+ Data.ListTrie.Patricia.Set.Eq: filter :: Map map a => ([a] -> Bool) -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Eq: findMax :: OrdMap map a => TrieSet map a -> Maybe [a]
+ Data.ListTrie.Patricia.Set.Eq: findMin :: OrdMap map a => TrieSet map a -> Maybe [a]
+ Data.ListTrie.Patricia.Set.Eq: findPredecessor :: OrdMap map a => [a] -> TrieSet map a -> Maybe [a]
+ Data.ListTrie.Patricia.Set.Eq: findSuccessor :: OrdMap map a => [a] -> TrieSet map a -> Maybe [a]
+ Data.ListTrie.Patricia.Set.Eq: foldl :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Eq: foldl' :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Eq: foldlAsc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Eq: foldlAsc' :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Eq: foldlDesc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Eq: foldlDesc' :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Eq: foldr :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Eq: foldrAsc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Eq: foldrDesc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Eq: fromList :: Map map a => [[a]] -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Eq: insert :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Eq: intersection :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Eq: isProperSubsetOf :: Map map a => TrieSet map a -> TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set.Eq: isSubsetOf :: Map map a => TrieSet map a -> TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set.Eq: lookupPrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Eq: map :: (Map map a, Map map b) => ([a] -> [b]) -> TrieSet map a -> TrieSet map b
+ Data.ListTrie.Patricia.Set.Eq: mapIn :: (Map map a, Map map b) => (a -> b) -> TrieSet map a -> TrieSet map b
+ Data.ListTrie.Patricia.Set.Eq: maxView :: OrdMap map a => TrieSet map a -> (Maybe [a], TrieSet map a)
+ Data.ListTrie.Patricia.Set.Eq: member :: Map map a => [a] -> TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set.Eq: minView :: OrdMap map a => TrieSet map a -> (Maybe [a], TrieSet map a)
+ Data.ListTrie.Patricia.Set.Eq: notMember :: Map map a => [a] -> TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set.Eq: null :: Map map a => TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set.Eq: partition :: Map map a => ([a] -> Bool) -> TrieSet map a -> (TrieSet map a, TrieSet map a)
+ Data.ListTrie.Patricia.Set.Eq: showTrie :: (Show a, Map map a) => TrieSet map a -> ShowS
+ Data.ListTrie.Patricia.Set.Eq: singleton :: Map map a => [a] -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Eq: size :: (Map map a, Num n) => TrieSet map a -> n
+ Data.ListTrie.Patricia.Set.Eq: size' :: (Map map a, Num n) => TrieSet map a -> n
+ Data.ListTrie.Patricia.Set.Eq: split :: OrdMap map a => [a] -> TrieSet map a -> (TrieSet map a, TrieSet map a)
+ Data.ListTrie.Patricia.Set.Eq: splitMember :: OrdMap map a => [a] -> TrieSet map a -> (TrieSet map a, Bool, TrieSet map a)
+ Data.ListTrie.Patricia.Set.Eq: splitPrefix :: Map map a => TrieSet map a -> ([a], Bool, TrieSet map a)
+ Data.ListTrie.Patricia.Set.Eq: toAscList :: OrdMap map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Patricia.Set.Eq: toDescList :: OrdMap map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Patricia.Set.Eq: toList :: Map map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Patricia.Set.Eq: union :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Eq: unions :: Map map a => [TrieSet map a] -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Ord: addPrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Ord: children :: Map map a => TrieSet map a -> map a (TrieSet map a)
+ Data.ListTrie.Patricia.Set.Ord: children1 :: Map map a => TrieSet map a -> map a (TrieSet map a)
+ Data.ListTrie.Patricia.Set.Ord: delete :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Ord: deleteMax :: OrdMap map a => TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Ord: deleteMin :: OrdMap map a => TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Ord: deletePrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Ord: deleteSuffixes :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Ord: difference :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Ord: empty :: Map map a => TrieSet map a
+ Data.ListTrie.Patricia.Set.Ord: filter :: Map map a => ([a] -> Bool) -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Ord: findMax :: OrdMap map a => TrieSet map a -> Maybe [a]
+ Data.ListTrie.Patricia.Set.Ord: findMin :: OrdMap map a => TrieSet map a -> Maybe [a]
+ Data.ListTrie.Patricia.Set.Ord: findPredecessor :: OrdMap map a => [a] -> TrieSet map a -> Maybe [a]
+ Data.ListTrie.Patricia.Set.Ord: findSuccessor :: OrdMap map a => [a] -> TrieSet map a -> Maybe [a]
+ Data.ListTrie.Patricia.Set.Ord: foldl :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Ord: foldl' :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Ord: foldlAsc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Ord: foldlAsc' :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Ord: foldlDesc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Ord: foldlDesc' :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Ord: foldr :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Ord: foldrAsc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Ord: foldrDesc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set.Ord: fromList :: Map map a => [[a]] -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Ord: insert :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Ord: intersection :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Ord: isProperSubsetOf :: Map map a => TrieSet map a -> TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set.Ord: isSubsetOf :: Map map a => TrieSet map a -> TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set.Ord: lookupPrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Ord: map :: (Map map a, Map map b) => ([a] -> [b]) -> TrieSet map a -> TrieSet map b
+ Data.ListTrie.Patricia.Set.Ord: mapIn :: (Map map a, Map map b) => (a -> b) -> TrieSet map a -> TrieSet map b
+ Data.ListTrie.Patricia.Set.Ord: maxView :: OrdMap map a => TrieSet map a -> (Maybe [a], TrieSet map a)
+ Data.ListTrie.Patricia.Set.Ord: member :: Map map a => [a] -> TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set.Ord: minView :: OrdMap map a => TrieSet map a -> (Maybe [a], TrieSet map a)
+ Data.ListTrie.Patricia.Set.Ord: notMember :: Map map a => [a] -> TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set.Ord: null :: Map map a => TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set.Ord: partition :: Map map a => ([a] -> Bool) -> TrieSet map a -> (TrieSet map a, TrieSet map a)
+ Data.ListTrie.Patricia.Set.Ord: showTrie :: (Show a, Map map a) => TrieSet map a -> ShowS
+ Data.ListTrie.Patricia.Set.Ord: singleton :: Map map a => [a] -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Ord: size :: (Map map a, Num n) => TrieSet map a -> n
+ Data.ListTrie.Patricia.Set.Ord: size' :: (Map map a, Num n) => TrieSet map a -> n
+ Data.ListTrie.Patricia.Set.Ord: split :: OrdMap map a => [a] -> TrieSet map a -> (TrieSet map a, TrieSet map a)
+ Data.ListTrie.Patricia.Set.Ord: splitMember :: OrdMap map a => [a] -> TrieSet map a -> (TrieSet map a, Bool, TrieSet map a)
+ Data.ListTrie.Patricia.Set.Ord: splitPrefix :: Map map a => TrieSet map a -> ([a], Bool, TrieSet map a)
+ Data.ListTrie.Patricia.Set.Ord: toAscList :: OrdMap map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Patricia.Set.Ord: toDescList :: OrdMap map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Patricia.Set.Ord: toList :: Map map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Patricia.Set.Ord: union :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set.Ord: unions :: Map map a => [TrieSet map a] -> TrieSet map a
+ Data.ListTrie.Set: instance Data.ListTrie.Base.Map.Map map a => GHC.Base.Semigroup (Data.ListTrie.Set.TrieSet map a)
+ Data.ListTrie.Set.Enum: addPrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Enum: children :: Map map a => TrieSet map a -> map a (TrieSet map a)
+ Data.ListTrie.Set.Enum: children1 :: Map map a => TrieSet map a -> map a (TrieSet map a)
+ Data.ListTrie.Set.Enum: delete :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Enum: deleteMax :: OrdMap map a => TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Enum: deleteMin :: OrdMap map a => TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Enum: deletePrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Enum: deleteSuffixes :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Enum: difference :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Enum: empty :: Map map a => TrieSet map a
+ Data.ListTrie.Set.Enum: filter :: Map map a => ([a] -> Bool) -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Enum: findMax :: OrdMap map a => TrieSet map a -> Maybe [a]
+ Data.ListTrie.Set.Enum: findMin :: OrdMap map a => TrieSet map a -> Maybe [a]
+ Data.ListTrie.Set.Enum: findPredecessor :: OrdMap map a => [a] -> TrieSet map a -> Maybe [a]
+ Data.ListTrie.Set.Enum: findSuccessor :: OrdMap map a => [a] -> TrieSet map a -> Maybe [a]
+ Data.ListTrie.Set.Enum: foldl :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Enum: foldl' :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Enum: foldlAsc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Enum: foldlAsc' :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Enum: foldlDesc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Enum: foldlDesc' :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Enum: foldr :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Enum: foldrAsc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Enum: foldrDesc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Enum: fromList :: Map map a => [[a]] -> TrieSet map a
+ Data.ListTrie.Set.Enum: insert :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Enum: intersection :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Enum: isProperSubsetOf :: Map map a => TrieSet map a -> TrieSet map a -> Bool
+ Data.ListTrie.Set.Enum: isSubsetOf :: Map map a => TrieSet map a -> TrieSet map a -> Bool
+ Data.ListTrie.Set.Enum: lookupPrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Enum: map :: (Map map a, Map map b) => ([a] -> [b]) -> TrieSet map a -> TrieSet map b
+ Data.ListTrie.Set.Enum: mapIn :: (Map map a, Map map b) => (a -> b) -> TrieSet map a -> TrieSet map b
+ Data.ListTrie.Set.Enum: maxView :: OrdMap map a => TrieSet map a -> (Maybe [a], TrieSet map a)
+ Data.ListTrie.Set.Enum: member :: Map map a => [a] -> TrieSet map a -> Bool
+ Data.ListTrie.Set.Enum: minView :: OrdMap map a => TrieSet map a -> (Maybe [a], TrieSet map a)
+ Data.ListTrie.Set.Enum: notMember :: Map map a => [a] -> TrieSet map a -> Bool
+ Data.ListTrie.Set.Enum: null :: Map map a => TrieSet map a -> Bool
+ Data.ListTrie.Set.Enum: partition :: Map map a => ([a] -> Bool) -> TrieSet map a -> (TrieSet map a, TrieSet map a)
+ Data.ListTrie.Set.Enum: showTrie :: (Show a, Map map a) => TrieSet map a -> ShowS
+ Data.ListTrie.Set.Enum: singleton :: Map map a => [a] -> TrieSet map a
+ Data.ListTrie.Set.Enum: size :: (Map map a, Num n) => TrieSet map a -> n
+ Data.ListTrie.Set.Enum: size' :: (Map map a, Num n) => TrieSet map a -> n
+ Data.ListTrie.Set.Enum: split :: OrdMap map a => [a] -> TrieSet map a -> (TrieSet map a, TrieSet map a)
+ Data.ListTrie.Set.Enum: splitMember :: OrdMap map a => [a] -> TrieSet map a -> (TrieSet map a, Bool, TrieSet map a)
+ Data.ListTrie.Set.Enum: splitPrefix :: Map map a => TrieSet map a -> ([a], Bool, TrieSet map a)
+ Data.ListTrie.Set.Enum: toAscList :: OrdMap map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Set.Enum: toDescList :: OrdMap map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Set.Enum: toList :: Map map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Set.Enum: union :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Enum: unions :: Map map a => [TrieSet map a] -> TrieSet map a
+ Data.ListTrie.Set.Eq: addPrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Eq: children :: Map map a => TrieSet map a -> map a (TrieSet map a)
+ Data.ListTrie.Set.Eq: children1 :: Map map a => TrieSet map a -> map a (TrieSet map a)
+ Data.ListTrie.Set.Eq: delete :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Eq: deleteMax :: OrdMap map a => TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Eq: deleteMin :: OrdMap map a => TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Eq: deletePrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Eq: deleteSuffixes :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Eq: difference :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Eq: empty :: Map map a => TrieSet map a
+ Data.ListTrie.Set.Eq: filter :: Map map a => ([a] -> Bool) -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Eq: findMax :: OrdMap map a => TrieSet map a -> Maybe [a]
+ Data.ListTrie.Set.Eq: findMin :: OrdMap map a => TrieSet map a -> Maybe [a]
+ Data.ListTrie.Set.Eq: findPredecessor :: OrdMap map a => [a] -> TrieSet map a -> Maybe [a]
+ Data.ListTrie.Set.Eq: findSuccessor :: OrdMap map a => [a] -> TrieSet map a -> Maybe [a]
+ Data.ListTrie.Set.Eq: foldl :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Eq: foldl' :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Eq: foldlAsc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Eq: foldlAsc' :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Eq: foldlDesc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Eq: foldlDesc' :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Eq: foldr :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Eq: foldrAsc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Eq: foldrDesc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Eq: fromList :: Map map a => [[a]] -> TrieSet map a
+ Data.ListTrie.Set.Eq: insert :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Eq: intersection :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Eq: isProperSubsetOf :: Map map a => TrieSet map a -> TrieSet map a -> Bool
+ Data.ListTrie.Set.Eq: isSubsetOf :: Map map a => TrieSet map a -> TrieSet map a -> Bool
+ Data.ListTrie.Set.Eq: lookupPrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Eq: map :: (Map map a, Map map b) => ([a] -> [b]) -> TrieSet map a -> TrieSet map b
+ Data.ListTrie.Set.Eq: mapIn :: (Map map a, Map map b) => (a -> b) -> TrieSet map a -> TrieSet map b
+ Data.ListTrie.Set.Eq: maxView :: OrdMap map a => TrieSet map a -> (Maybe [a], TrieSet map a)
+ Data.ListTrie.Set.Eq: member :: Map map a => [a] -> TrieSet map a -> Bool
+ Data.ListTrie.Set.Eq: minView :: OrdMap map a => TrieSet map a -> (Maybe [a], TrieSet map a)
+ Data.ListTrie.Set.Eq: notMember :: Map map a => [a] -> TrieSet map a -> Bool
+ Data.ListTrie.Set.Eq: null :: Map map a => TrieSet map a -> Bool
+ Data.ListTrie.Set.Eq: partition :: Map map a => ([a] -> Bool) -> TrieSet map a -> (TrieSet map a, TrieSet map a)
+ Data.ListTrie.Set.Eq: showTrie :: (Show a, Map map a) => TrieSet map a -> ShowS
+ Data.ListTrie.Set.Eq: singleton :: Map map a => [a] -> TrieSet map a
+ Data.ListTrie.Set.Eq: size :: (Map map a, Num n) => TrieSet map a -> n
+ Data.ListTrie.Set.Eq: size' :: (Map map a, Num n) => TrieSet map a -> n
+ Data.ListTrie.Set.Eq: split :: OrdMap map a => [a] -> TrieSet map a -> (TrieSet map a, TrieSet map a)
+ Data.ListTrie.Set.Eq: splitMember :: OrdMap map a => [a] -> TrieSet map a -> (TrieSet map a, Bool, TrieSet map a)
+ Data.ListTrie.Set.Eq: splitPrefix :: Map map a => TrieSet map a -> ([a], Bool, TrieSet map a)
+ Data.ListTrie.Set.Eq: toAscList :: OrdMap map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Set.Eq: toDescList :: OrdMap map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Set.Eq: toList :: Map map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Set.Eq: union :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Eq: unions :: Map map a => [TrieSet map a] -> TrieSet map a
+ Data.ListTrie.Set.Ord: addPrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Ord: children :: Map map a => TrieSet map a -> map a (TrieSet map a)
+ Data.ListTrie.Set.Ord: children1 :: Map map a => TrieSet map a -> map a (TrieSet map a)
+ Data.ListTrie.Set.Ord: delete :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Ord: deleteMax :: OrdMap map a => TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Ord: deleteMin :: OrdMap map a => TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Ord: deletePrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Ord: deleteSuffixes :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Ord: difference :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Ord: empty :: Map map a => TrieSet map a
+ Data.ListTrie.Set.Ord: filter :: Map map a => ([a] -> Bool) -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Ord: findMax :: OrdMap map a => TrieSet map a -> Maybe [a]
+ Data.ListTrie.Set.Ord: findMin :: OrdMap map a => TrieSet map a -> Maybe [a]
+ Data.ListTrie.Set.Ord: findPredecessor :: OrdMap map a => [a] -> TrieSet map a -> Maybe [a]
+ Data.ListTrie.Set.Ord: findSuccessor :: OrdMap map a => [a] -> TrieSet map a -> Maybe [a]
+ Data.ListTrie.Set.Ord: foldl :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Ord: foldl' :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Ord: foldlAsc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Ord: foldlAsc' :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Ord: foldlDesc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Ord: foldlDesc' :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Ord: foldr :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Ord: foldrAsc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Ord: foldrDesc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set.Ord: fromList :: Map map a => [[a]] -> TrieSet map a
+ Data.ListTrie.Set.Ord: insert :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Ord: intersection :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Ord: isProperSubsetOf :: Map map a => TrieSet map a -> TrieSet map a -> Bool
+ Data.ListTrie.Set.Ord: isSubsetOf :: Map map a => TrieSet map a -> TrieSet map a -> Bool
+ Data.ListTrie.Set.Ord: lookupPrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Ord: map :: (Map map a, Map map b) => ([a] -> [b]) -> TrieSet map a -> TrieSet map b
+ Data.ListTrie.Set.Ord: mapIn :: (Map map a, Map map b) => (a -> b) -> TrieSet map a -> TrieSet map b
+ Data.ListTrie.Set.Ord: maxView :: OrdMap map a => TrieSet map a -> (Maybe [a], TrieSet map a)
+ Data.ListTrie.Set.Ord: member :: Map map a => [a] -> TrieSet map a -> Bool
+ Data.ListTrie.Set.Ord: minView :: OrdMap map a => TrieSet map a -> (Maybe [a], TrieSet map a)
+ Data.ListTrie.Set.Ord: notMember :: Map map a => [a] -> TrieSet map a -> Bool
+ Data.ListTrie.Set.Ord: null :: Map map a => TrieSet map a -> Bool
+ Data.ListTrie.Set.Ord: partition :: Map map a => ([a] -> Bool) -> TrieSet map a -> (TrieSet map a, TrieSet map a)
+ Data.ListTrie.Set.Ord: showTrie :: (Show a, Map map a) => TrieSet map a -> ShowS
+ Data.ListTrie.Set.Ord: singleton :: Map map a => [a] -> TrieSet map a
+ Data.ListTrie.Set.Ord: size :: (Map map a, Num n) => TrieSet map a -> n
+ Data.ListTrie.Set.Ord: size' :: (Map map a, Num n) => TrieSet map a -> n
+ Data.ListTrie.Set.Ord: split :: OrdMap map a => [a] -> TrieSet map a -> (TrieSet map a, TrieSet map a)
+ Data.ListTrie.Set.Ord: splitMember :: OrdMap map a => [a] -> TrieSet map a -> (TrieSet map a, Bool, TrieSet map a)
+ Data.ListTrie.Set.Ord: splitPrefix :: Map map a => TrieSet map a -> ([a], Bool, TrieSet map a)
+ Data.ListTrie.Set.Ord: toAscList :: OrdMap map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Set.Ord: toDescList :: OrdMap map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Set.Ord: toList :: Map map a => TrieSet map a -> [[a]]
+ Data.ListTrie.Set.Ord: union :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set.Ord: unions :: Map map a => [TrieSet map a] -> TrieSet map a
Files
- CHANGELOG.md +106/−0
- CHANGELOG.txt +0/−112
- Data/ListTrie/Base/Map.hs +10/−4
- README.md +3/−0
- list-tries.cabal +15/−13
+ CHANGELOG.md view
@@ -0,0 +1,106 @@+# list-tries-0.6.6 (2018-11-20)+* Updated dependencies and code for GHC 8.6.1, thanks as usual to Mikhail+ Glushenkov.++# list-tries-0.6.5 (2018-03-20)+* Updated dependencies and code for GHC 8.4.1 and QuickCheck-2.11,+ thanks again to Mikhail Glushenkov.++# list-tries-0.6.4 (2017-05-27)+* Updated dependencies for GHC 8.2.1 (release candidate 2) and+ binary-0.9, thanks to Mikhail Glushenkov for helping with this.+* Also a code change due to a newly problematic type inference.++# list-tries-0.6.3 (2016-07-18)+* Dependency update to allow dlist-0.8.++# list-tries-0.6.2 (2016-06-28)+* Updated dependencies for GHC 8.0.1.+* Added Semigroup instances, bringing in a new dependency on semigroups+ on pre-8.0 GHC versions.++# list-tries-0.6.1 (2015-04-03)+* Fixed build on base < 4.8.++# list-tries-0.6.0 (2015-03-28)+* Updated dependencies for GHC 7.10.+* Fixed library vs. test executable dlist dependency mismatch.+* Renamed `Map.toList` to `toListKV` to avoid conflicts with the new+ `Foldable` class. Also renamed `Map.fromList` and `Map.fromListWith`+ to `fromListKV` and `fromListKVWith` to match. Thanks to davean for+ the patch.+* Added Cabal source-repository metadata, pointing to GitHub.++# list-tries-0.5.2 (2014-03-20)+* Updated dependencies, for GHC 7.8 and other new packages.++# list-tries-0.5.1 (2013-05-10)+* Fix cabal build.+* Minor documentation clarification.+* Update `binary` dependency.++# list-tries-0.5 (2013-05-09)+* Added the `lookupPrefix` and `deleteSuffixes` functions, of which especially+ the former was an embarrassing omission:++ lookupPrefix :: [k] -> trie map k a -> trie map k a+ deleteSuffixes :: [k] -> trie map k a -> trie map k a++* Fixed the documentation headers to refer to 's' instead of 'k' as what we+ use for the length of the given key.+* Fixed documentation of 'deletePrefix': its complexity is O(s), not O(m).+* Some dependency updates.++# list-tries-0.4.3 (2012-10-18)+* Dependency updates for GHC 7.6 and otherwise.++# list-tries-0.4.2 (2012-05-23)+* Dependency updates for GHC 7.4, thanks to Anders Kaseorg.++# list-tries-0.4.1 (2011-03-17)+* Dependency update and Cabalization of the test executable, thanks to JP+ Moresmau.++# list-tries-0.4 (2010-09-11)+* Fixed documentation of the `deletePrefix` function: if the given key is not+ a prefix of any key, an empty, not unchanged, map/set is returned. Thanks to+ Brian Bloniarz for the bug report.+* Fixed bug in the Patricia version of `deletePrefix` causing it to not delete+ anything if the prefix to be deleted was a proper prefix of the common+ prefix.+* Changed `children` to return the map as-is instead of converting it into a+ list first:++ children :: Trie trie st map k => trie map k a -> CMap trie map k a++* Added the `children1` function as a single-level equivalent of `children`,+ more directly reflecting the structure of the non-Patricia tries. Requested+ by Brian Bloniarz.++ children1 :: Trie trie st map k => trie map k a -> CMap trie map k a++# list-tries-0.3 (2010-09-09)+* Fixed strictness of the strict versions of the following+ non-Patricia functions: `insert`, `adjust`, `alter`, `union`,+ `difference`, `intersection`, `mapInKeys`; as well as the Patricia+ versions of `insert` and `adjust`. Thanks to Brian Bloniarz for the+ bug report.+* Applied the static argument transformation throughout, improving+ performance.+* Dropped support for containers < 0.3; GHC 6.12 has been out long+ enough, and support for older versions is too crippled to make it+ worthwhile.++# list-tries-0.2 (2010-04-06)+* Dependency update, nothing more.++# list-tries-0.1 (2009-07-05)+* All tries are now instances of `Binary`, thanks to Gregory Crosswhite. Adds a+ dependency on the `binary` library as well as the following two methods to+ the `Map` class in `Base.Map`:++ serializeToList :: m k a -> [(k,a)]+ deserializeFromList :: [(k,a)] -> m k a++# list-tries-0.0 (2009-04-21)+* Initial release.
− CHANGELOG.txt
@@ -1,112 +0,0 @@-2018-03-20, 0.6.5:- Updated dependencies and code for GHC 8.4.1 and QuickCheck-2.11, thanks- again to Mikhail Glushenkov.--2017-05-27, 0.6.4:- Updated dependencies for GHC 8.2.1 (release candidate 2) and- binary-0.9, thanks to Mikhail Glushenkov for helping with this.-- Also a code change due to a newly problematic type inference.--2016-07-18, 0.6.3:- Dependency update to allow dlist-0.8.--2016-06-28, 0.6.2:- Updated dependencies for GHC 8.0.1.-- Added Semigroup instances, bringing in a new dependency on semigroups- on pre-8.0 GHC versions.--2015-04-03, 0.6.1:- Fixed build on base < 4.8.--2015-03-28, 0.6.0:- Updated dependencies for GHC 7.10.-- Fixed library vs. test executable dlist dependency mismatch.-- Renamed Map.toList to toListKV to avoid conflicts with the new Foldable- class. Also renamed Map.fromList and Map.fromListWith to fromListKV and- fromListKVWith to match. Thanks to davean for the patch.-- Added Cabal source-repository metadata, pointing to GitHub.--2014-03-20, 0.5.2:- Updated dependencies, for GHC 7.8 and other new packages.--2013-05-10, 0.5.1:- Fix cabal build.-- Minor documentation clarification.-- Update binary dependency.--2013-05-09, 0.5:- Added the 'lookupPrefix' and 'deleteSuffixes' functions, of which especially- the former was an embarrassing omission:-- lookupPrefix :: [k] -> trie map k a -> trie map k a- deleteSuffixes :: [k] -> trie map k a -> trie map k a-- Fixed the documentation headers to refer to 's' instead of 'k' as what we- use for the length of the given key.-- Fixed documentation of 'deletePrefix': its complexity is O(s), not O(m).-- Some dependency updates.--2012-10-18, 0.4.3:- Dependency updates for GHC 7.6 and otherwise.--2012-05-23, 0.4.2:- Dependency updates for GHC 7.4, thanks to Anders Kaseorg.--2011-03-17, 0.4.1:- Dependency update and Cabalization of the test executable, thanks to JP- Moresmau.--2010-09-11, 0.4:- Fixed documentation of the 'deletePrefix' function: if the given key is not- a prefix of any key, an empty, not unchanged, map/set is returned. Thanks to- Brian Bloniarz for the bug report.-- Fixed bug in the Patricia version of 'deletePrefix' causing it to not delete- anything if the prefix to be deleted was a proper prefix of the common- prefix.-- Changed 'children' to return the map as-is instead of converting it into a- list first:-- children :: Trie trie st map k => trie map k a -> CMap trie map k a-- Added the 'children1' function as a single-level equivalent of 'children',- more directly reflecting the structure of the non-Patricia tries. Requested- by Brian Bloniarz.-- children1 :: Trie trie st map k => trie map k a -> CMap trie map k a--2010-09-09, 0.3:- Fixed strictness of the strict versions of the following non-Patricia- functions: insert, adjust, alter, union, difference, intersection,- mapInKeys; as well as the Patricia versions of insert and adjust. Thanks to- Brian Bloniarz for the bug report.-- Applied the static argument transformation throughout, improving- performance.-- Dropped support for containers < 0.3; GHC 6.12 has been out long enough, and- support for older versions is too crippled to make it worthwhile.--2010-04-06, 0.2:- Dependency update, nothing more.--2009-07-05, 0.1:- All tries are now instances of Binary, thanks to Gregory Crosswhite. Adds a- dependency on the 'binary' library as well as the following two methods to- the Map class in Base.Map:-- serializeToList :: m k a -> [(k,a)]- deserializeFromList :: [(k,a)] -> m k a--2009-04-21, 0.0:- Initial release.
Data/ListTrie/Base/Map.hs view
@@ -1,6 +1,6 @@ -- File created: 2008-11-07 17:30:16 -{-# LANGUAGE MultiParamTypeClasses, FlexibleInstances #-}+{-# LANGUAGE CPP, MultiParamTypeClasses, FlexibleInstances #-} module Data.ListTrie.Base.Map ( Map(..), OrdMap(..)@@ -15,9 +15,11 @@ import Data.List (foldl1', mapAccumL, nubBy, partition, sort, sortBy) import Data.Ord (comparing) import Data.Traversable (Traversable(..), mapAccumR)-import qualified Data.IntMap as IM-import qualified Data.Map as M-+import qualified Data.IntMap as IM+import qualified Data.Map as M+#if MIN_VERSION_containers(0,5,0)+import qualified Data.Map.Strict as M.Strict+#endif import Prelude hiding ( filter, foldl, foldl1, foldr, foldr1, lookup, null , mapM, sequence )@@ -343,7 +345,11 @@ null = M.null lookup = M.lookup +#if MIN_VERSION_containers(0,5,0)+ insertWith = M.Strict.insertWith+#else insertWith = M.insertWith'+#endif update = M.update adjust = M.adjust
+ README.md view
@@ -0,0 +1,3 @@+# list-tries [](https://hackage.haskell.org/package/list-tries) [](http://travis-ci.org/Deewiant/list-tries)++Tries and Patricia tries: finite sets and maps for list keys.
list-tries.cabal view
@@ -1,7 +1,7 @@ Cabal-Version: >= 1.9.2 Name: list-tries-Version: 0.6.5+Version: 0.6.6 Homepage: http://iki.fi/matti.niemenmaa/list-tries/ Synopsis: Tries and Patricia tries: finite sets and maps for list keys Category: Data, Data Structures@@ -28,11 +28,13 @@ License-File: LICENSE.txt Tested-With: GHC == 7.0.4, GHC == 7.2.2, GHC == 7.4.2, GHC == 7.6.3, GHC == 7.8.4, GHC == 7.10.3,- GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.1+ GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.4,+ GHC == 8.6.2 Build-Type: Simple -Extra-Source-Files: CHANGELOG.txt+Extra-Source-Files: README.md+ CHANGELOG.md CREDITS.txt headers/*.h tests/README.txt@@ -44,10 +46,10 @@ location: https://github.com/Deewiant/list-tries Library- Build-Depends: base >= 4.3 && < 4.12- , containers >= 0.4 && < 0.6+ Build-Depends: base >= 4.3 && < 4.13+ , containers >= 0.4 && < 0.7 , dlist >= 0.4 && < 0.9- , binary >= 0.5 && < 0.10+ , binary >= 0.5 && < 0.11 if impl(ghc < 8.0) Build-Depends: semigroups >= 0.18 && < 0.19@@ -93,14 +95,14 @@ main-is: Main.hs Build-Depends: list-tries- , base >= 4.3 && < 4.12- , binary >= 0.5 && < 0.10- , template-haskell >= 2.3 && < 2.14+ , base >= 4.3 && < 4.13+ , binary >= 0.5 && < 0.11+ , template-haskell >= 2.3 && < 2.15 , HUnit >= 1.2 && < 1.7- , QuickCheck >= 2.1 && < 2.12- , test-framework >= 0.2 && < 0.9- , test-framework-hunit >= 0.2 && < 0.4- , test-framework-quickcheck2 >= 0.2 && < 0.4+ , QuickCheck >= 2.1 && < 3+ , test-framework >= 0.2 && < 1+ , test-framework-hunit >= 0.2 && < 1+ , test-framework-quickcheck2 >= 0.2 && < 1 , ChasingBottoms >= 1.2 && < 1.4 Other-Modules: Tests.Base