list-tries 0.4 → 0.4.1
raw patch · 2 files changed
+63/−3 lines, 2 filesdep +ChasingBottomsdep +HUnitdep +QuickCheckdep ~basedep ~containersnew-component:exe:list-tries-testsPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependencies added: ChasingBottoms, HUnit, QuickCheck, template-haskell, test-framework, test-framework-hunit, test-framework-quickcheck2
Dependency ranges changed: base, containers
API changes (from Hackage documentation)
- Data.ListTrie.Base.Map: instance (Enum k) => Map WrappedIntMap k
- Data.ListTrie.Base.Map: instance (Enum k) => OrdMap WrappedIntMap k
- Data.ListTrie.Base.Map: instance (Eq k) => Map AList k
- Data.ListTrie.Base.Map: instance (Eq v) => Eq (WrappedIntMap k v)
- Data.ListTrie.Base.Map: instance (Ord k) => Map Map k
- Data.ListTrie.Base.Map: instance (Ord k) => OrdMap AList k
- Data.ListTrie.Base.Map: instance (Ord k) => OrdMap Map k
- Data.ListTrie.Base.Map: instance (Ord v) => Ord (WrappedIntMap k v)
- Data.ListTrie.Map: instance (Map map k) => Foldable (TrieMap map k)
- Data.ListTrie.Map: instance (Map map k) => Functor (TrieMap map k)
- Data.ListTrie.Map: instance (Map map k) => Monoid (TrieMap map k a)
- Data.ListTrie.Map: instance (Map map k) => Trie TrieMap Maybe map k
- Data.ListTrie.Patricia.Map: instance (Map map k) => Foldable (TrieMap map k)
- Data.ListTrie.Patricia.Map: instance (Map map k) => Functor (TrieMap map k)
- Data.ListTrie.Patricia.Map: instance (Map map k) => Monoid (TrieMap map k a)
- Data.ListTrie.Patricia.Map: instance (Map map k) => Trie TrieMap Maybe map k
- Data.ListTrie.Patricia.Set: instance (Map map a) => Monoid (TrieSet map a)
- Data.ListTrie.Patricia.Set: instance (Map map k) => Trie TrieSetBase Identity map k
- Data.ListTrie.Set: instance (Eq (CMap map a Bool)) => Eq (TrieSet map a)
- Data.ListTrie.Set: instance (Eq (CMap map a Bool)) => Eq (TrieSetBase map a Bool)
- Data.ListTrie.Set: instance (Map map a) => Monoid (TrieSet map a)
- Data.ListTrie.Set: instance (Map map k) => Trie TrieSetBase Identity map k
+ Data.ListTrie.Base.Map: instance Enum k => Map WrappedIntMap k
+ Data.ListTrie.Base.Map: instance Enum k => OrdMap WrappedIntMap k
+ Data.ListTrie.Base.Map: instance Eq k => Map AList k
+ Data.ListTrie.Base.Map: instance Eq v => Eq (WrappedIntMap k v)
+ Data.ListTrie.Base.Map: instance Ord k => Map Map k
+ Data.ListTrie.Base.Map: instance Ord k => OrdMap AList k
+ Data.ListTrie.Base.Map: instance Ord k => OrdMap Map k
+ Data.ListTrie.Base.Map: instance Ord v => Ord (WrappedIntMap k v)
+ Data.ListTrie.Map: instance Map map k => Foldable (TrieMap map k)
+ Data.ListTrie.Map: instance Map map k => Functor (TrieMap map k)
+ Data.ListTrie.Map: instance Map map k => Monoid (TrieMap map k a)
+ Data.ListTrie.Map: instance Map map k => Trie TrieMap Maybe map k
+ Data.ListTrie.Patricia.Map: instance Map map k => Foldable (TrieMap map k)
+ Data.ListTrie.Patricia.Map: instance Map map k => Functor (TrieMap map k)
+ Data.ListTrie.Patricia.Map: instance Map map k => Monoid (TrieMap map k a)
+ Data.ListTrie.Patricia.Map: instance Map map k => Trie TrieMap Maybe map k
+ Data.ListTrie.Patricia.Set: instance Map map a => Monoid (TrieSet map a)
+ Data.ListTrie.Patricia.Set: instance Map map k => Trie TrieSetBase Identity map k
+ Data.ListTrie.Set: instance Eq (CMap map a Bool) => Eq (TrieSet map a)
+ Data.ListTrie.Set: instance Eq (CMap map a Bool) => Eq (TrieSetBase map a Bool)
+ Data.ListTrie.Set: instance Map map a => Monoid (TrieSet map a)
+ Data.ListTrie.Set: instance Map map k => Trie TrieSetBase Identity map k
- Data.ListTrie.Base.Map: adjust :: (Map m k) => (a -> a) -> k -> m k a -> m k a
+ Data.ListTrie.Base.Map: adjust :: Map m k => (a -> a) -> k -> m k a -> m k a
- Data.ListTrie.Base.Map: alter :: (Map m k) => (Maybe a -> Maybe a) -> k -> m k a -> m k a
+ Data.ListTrie.Base.Map: alter :: Map m k => (Maybe a -> Maybe a) -> k -> m k a -> m k a
- Data.ListTrie.Base.Map: class (Foldable (m k)) => Map m k
+ Data.ListTrie.Base.Map: class Foldable (m k) => Map m k
- Data.ListTrie.Base.Map: class (Map m k) => OrdMap m k
+ Data.ListTrie.Base.Map: class Map m k => OrdMap m k
- Data.ListTrie.Base.Map: delete :: (Map m k) => k -> m k a -> m k a
+ Data.ListTrie.Base.Map: delete :: Map m k => k -> m k a -> m k a
- Data.ListTrie.Base.Map: deserializeFromList :: (Map m k) => [(k, a)] -> m k a
+ Data.ListTrie.Base.Map: deserializeFromList :: Map m k => [(k, a)] -> m k a
- Data.ListTrie.Base.Map: differenceWith :: (Map m k) => (a -> b -> Maybe a) -> m k a -> m k b -> m k a
+ Data.ListTrie.Base.Map: differenceWith :: Map m k => (a -> b -> Maybe a) -> m k a -> m k b -> m k a
- Data.ListTrie.Base.Map: differenceWithKey :: (Map m k) => (k -> a -> b -> Maybe a) -> m k a -> m k b -> m k a
+ Data.ListTrie.Base.Map: differenceWithKey :: Map m k => (k -> a -> b -> Maybe a) -> m k a -> m k b -> m k a
- Data.ListTrie.Base.Map: doubleton :: (Map m k) => k -> a -> k -> a -> m k a
+ Data.ListTrie.Base.Map: doubleton :: Map m k => k -> a -> k -> a -> m k a
- Data.ListTrie.Base.Map: empty :: (Map m k) => m k a
+ Data.ListTrie.Base.Map: empty :: Map m k => m k a
- Data.ListTrie.Base.Map: eqCmp :: (Map m k) => m k a -> k -> k -> Bool
+ Data.ListTrie.Base.Map: eqCmp :: Map m k => m k a -> k -> k -> Bool
- Data.ListTrie.Base.Map: filter :: (Map m k) => (a -> Bool) -> m k a -> m k a
+ Data.ListTrie.Base.Map: filter :: Map m k => (a -> Bool) -> m k a -> m k a
- Data.ListTrie.Base.Map: findPredecessor :: (OrdMap m k) => k -> m k a -> Maybe (k, a)
+ Data.ListTrie.Base.Map: findPredecessor :: OrdMap m k => k -> m k a -> Maybe (k, a)
- Data.ListTrie.Base.Map: findSuccessor :: (OrdMap m k) => k -> m k a -> Maybe (k, a)
+ Data.ListTrie.Base.Map: findSuccessor :: OrdMap m k => k -> m k a -> Maybe (k, a)
- Data.ListTrie.Base.Map: fromList :: (Map m k) => [(k, a)] -> m k a
+ Data.ListTrie.Base.Map: fromList :: Map m k => [(k, a)] -> m k a
- Data.ListTrie.Base.Map: fromListWith :: (Map m k) => (a -> a -> a) -> [(k, a)] -> m k a
+ Data.ListTrie.Base.Map: fromListWith :: Map m k => (a -> a -> a) -> [(k, a)] -> m k a
- Data.ListTrie.Base.Map: insert :: (Map m k) => k -> a -> m k a -> m k a
+ Data.ListTrie.Base.Map: insert :: Map m k => k -> a -> m k a -> m k a
- Data.ListTrie.Base.Map: insertWith :: (Map m k) => (a -> a -> a) -> k -> a -> m k a -> m k a
+ Data.ListTrie.Base.Map: insertWith :: Map m k => (a -> a -> a) -> k -> a -> m k a -> m k a
- Data.ListTrie.Base.Map: intersectionWith :: (Map m k) => (a -> b -> c) -> m k a -> m k b -> m k c
+ Data.ListTrie.Base.Map: intersectionWith :: Map m k => (a -> b -> c) -> m k a -> m k b -> m k c
- Data.ListTrie.Base.Map: intersectionWithKey :: (Map m k) => (k -> a -> b -> c) -> m k a -> m k b -> m k c
+ Data.ListTrie.Base.Map: intersectionWithKey :: Map m k => (k -> a -> b -> c) -> m k a -> m k b -> m k c
- Data.ListTrie.Base.Map: isSubmapOfBy :: (Map m k) => (a -> b -> Bool) -> m k a -> m k b -> Bool
+ Data.ListTrie.Base.Map: isSubmapOfBy :: Map m k => (a -> b -> Bool) -> m k a -> m k b -> Bool
- Data.ListTrie.Base.Map: lookup :: (Map m k) => k -> m k a -> Maybe a
+ Data.ListTrie.Base.Map: lookup :: Map m k => k -> m k a -> Maybe a
- Data.ListTrie.Base.Map: map :: (Map m k) => (a -> b) -> m k a -> m k b
+ Data.ListTrie.Base.Map: map :: Map m k => (a -> b) -> m k a -> m k b
- Data.ListTrie.Base.Map: mapAccum :: (Map m k) => (a -> b -> (a, c)) -> a -> m k b -> (a, m k c)
+ Data.ListTrie.Base.Map: mapAccum :: Map m k => (a -> b -> (a, c)) -> a -> m k b -> (a, m k c)
- Data.ListTrie.Base.Map: mapAccumAsc :: (OrdMap m k) => (a -> b -> (a, c)) -> a -> m k b -> (a, m k c)
+ Data.ListTrie.Base.Map: mapAccumAsc :: OrdMap m k => (a -> b -> (a, c)) -> a -> m k b -> (a, m k c)
- Data.ListTrie.Base.Map: mapAccumAscWithKey :: (OrdMap m k) => (a -> k -> b -> (a, c)) -> a -> m k b -> (a, m k c)
+ Data.ListTrie.Base.Map: mapAccumAscWithKey :: OrdMap m k => (a -> k -> b -> (a, c)) -> a -> m k b -> (a, m k c)
- Data.ListTrie.Base.Map: mapAccumDesc :: (OrdMap m k) => (a -> b -> (a, c)) -> a -> m k b -> (a, m k c)
+ Data.ListTrie.Base.Map: mapAccumDesc :: OrdMap m k => (a -> b -> (a, c)) -> a -> m k b -> (a, m k c)
- Data.ListTrie.Base.Map: mapAccumDescWithKey :: (OrdMap m k) => (a -> k -> b -> (a, c)) -> a -> m k b -> (a, m k c)
+ Data.ListTrie.Base.Map: mapAccumDescWithKey :: OrdMap m k => (a -> k -> b -> (a, c)) -> a -> m k b -> (a, m k c)
- Data.ListTrie.Base.Map: mapAccumWithKey :: (Map m k) => (a -> k -> b -> (a, c)) -> a -> m k b -> (a, m k c)
+ Data.ListTrie.Base.Map: mapAccumWithKey :: Map m k => (a -> k -> b -> (a, c)) -> a -> m k b -> (a, m k c)
- Data.ListTrie.Base.Map: mapWithKey :: (Map m k) => (k -> a -> b) -> m k a -> m k b
+ Data.ListTrie.Base.Map: mapWithKey :: Map m k => (k -> a -> b) -> m k a -> m k b
- Data.ListTrie.Base.Map: maxViewWithKey :: (OrdMap m k) => m k a -> (Maybe (k, a), m k a)
+ Data.ListTrie.Base.Map: maxViewWithKey :: OrdMap m k => m k a -> (Maybe (k, a), m k a)
- Data.ListTrie.Base.Map: minViewWithKey :: (OrdMap m k) => m k a -> (Maybe (k, a), m k a)
+ Data.ListTrie.Base.Map: minViewWithKey :: OrdMap m k => m k a -> (Maybe (k, a), m k a)
- Data.ListTrie.Base.Map: null :: (Map m k) => m k a -> Bool
+ Data.ListTrie.Base.Map: null :: Map m k => m k a -> Bool
- Data.ListTrie.Base.Map: ordCmp :: (OrdMap m k) => m k a -> k -> k -> Ordering
+ Data.ListTrie.Base.Map: ordCmp :: OrdMap m k => m k a -> k -> k -> Ordering
- Data.ListTrie.Base.Map: serializeToList :: (Map m k) => m k a -> [(k, a)]
+ Data.ListTrie.Base.Map: serializeToList :: Map m k => m k a -> [(k, a)]
- Data.ListTrie.Base.Map: singleton :: (Map m k) => k -> a -> m k a
+ Data.ListTrie.Base.Map: singleton :: Map m k => k -> a -> m k a
- Data.ListTrie.Base.Map: singletonView :: (Map m k) => m k a -> Maybe (k, a)
+ Data.ListTrie.Base.Map: singletonView :: Map m k => m k a -> Maybe (k, a)
- Data.ListTrie.Base.Map: split :: (OrdMap m k) => k -> m k a -> (m k a, m k a)
+ Data.ListTrie.Base.Map: split :: OrdMap m k => k -> m k a -> (m k a, m k a)
- Data.ListTrie.Base.Map: splitLookup :: (OrdMap m k) => k -> m k a -> (m k a, Maybe a, m k a)
+ Data.ListTrie.Base.Map: splitLookup :: OrdMap m k => k -> m k a -> (m k a, Maybe a, m k a)
- Data.ListTrie.Base.Map: toAscList :: (OrdMap m k) => m k a -> [(k, a)]
+ Data.ListTrie.Base.Map: toAscList :: OrdMap m k => m k a -> [(k, a)]
- Data.ListTrie.Base.Map: toDescList :: (OrdMap m k) => m k a -> [(k, a)]
+ Data.ListTrie.Base.Map: toDescList :: OrdMap m k => m k a -> [(k, a)]
- Data.ListTrie.Base.Map: toList :: (Map m k) => m k a -> [(k, a)]
+ Data.ListTrie.Base.Map: toList :: Map m k => m k a -> [(k, a)]
- Data.ListTrie.Base.Map: unionWith :: (Map m k) => (a -> a -> a) -> m k a -> m k a -> m k a
+ Data.ListTrie.Base.Map: unionWith :: Map m k => (a -> a -> a) -> m k a -> m k a -> m k a
- Data.ListTrie.Base.Map: unionWithKey :: (Map m k) => (k -> a -> a -> a) -> m k a -> m k a -> m k a
+ Data.ListTrie.Base.Map: unionWithKey :: Map m k => (k -> a -> a -> a) -> m k a -> m k a -> m k a
- Data.ListTrie.Base.Map: update :: (Map m k) => (a -> Maybe a) -> k -> m k a -> m k a
+ Data.ListTrie.Base.Map: update :: Map m k => (a -> Maybe a) -> k -> m k a -> m k a
- Data.ListTrie.Map: addPrefix :: (Map map k) => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: addPrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: adjust :: (Map map k) => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: adjust :: Map map k => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: adjust' :: (Map map k) => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: adjust' :: Map map k => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: alter :: (Map map k) => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: alter :: Map map k => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: alter' :: (Map map k) => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: alter' :: Map map k => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: children :: (Map map k) => TrieMap map k a -> map k (TrieMap map k a)
+ Data.ListTrie.Map: children :: Map map k => TrieMap map k a -> map k (TrieMap map k a)
- Data.ListTrie.Map: children1 :: (Map map k) => TrieMap map k a -> map k (TrieMap map k a)
+ Data.ListTrie.Map: children1 :: Map map k => TrieMap map k a -> map k (TrieMap map k a)
- Data.ListTrie.Map: delete :: (Map map k) => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: delete :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: deleteMax :: (OrdMap map k) => TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: deleteMax :: OrdMap map k => TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: deleteMin :: (OrdMap map k) => TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: deleteMin :: OrdMap map k => TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: deletePrefix :: (Map map k) => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: deletePrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: difference :: (Map map k) => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map: difference :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
- Data.ListTrie.Map: differenceWith :: (Map map k) => (a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map: differenceWith :: Map map k => (a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
- Data.ListTrie.Map: differenceWithKey :: (Map map k) => ([k] -> a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map: differenceWithKey :: Map map k => ([k] -> a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
- Data.ListTrie.Map: empty :: (Map map k) => TrieMap map k a
+ Data.ListTrie.Map: empty :: Map map k => TrieMap map k a
- Data.ListTrie.Map: filter :: (Map map k) => (a -> Bool) -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: filter :: Map map k => (a -> Bool) -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: filterWithKey :: (Map map k) => ([k] -> a -> Bool) -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: filterWithKey :: Map map k => ([k] -> a -> Bool) -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: findMax :: (OrdMap map k) => TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Map: findMax :: OrdMap map k => TrieMap map k a -> Maybe ([k], a)
- Data.ListTrie.Map: findMin :: (OrdMap map k) => TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Map: findMin :: OrdMap map k => TrieMap map k a -> Maybe ([k], a)
- Data.ListTrie.Map: findPredecessor :: (OrdMap map k) => [k] -> TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Map: findPredecessor :: OrdMap map k => [k] -> TrieMap map k a -> Maybe ([k], a)
- Data.ListTrie.Map: findSuccessor :: (OrdMap map k) => [k] -> TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Map: findSuccessor :: OrdMap map k => [k] -> TrieMap map k a -> Maybe ([k], a)
- Data.ListTrie.Map: foldl :: (Map map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldl :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldl' :: (Map map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldl' :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldlAsc :: (OrdMap map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldlAsc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldlAsc' :: (OrdMap map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldlAsc' :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldlAscWithKey :: (OrdMap map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldlAscWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldlAscWithKey' :: (OrdMap map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldlAscWithKey' :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldlDesc :: (OrdMap map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldlDesc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldlDesc' :: (OrdMap map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldlDesc' :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldlDescWithKey :: (OrdMap map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldlDescWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldlDescWithKey' :: (OrdMap map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldlDescWithKey' :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldlWithKey :: (Map map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldlWithKey :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldlWithKey' :: (Map map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldlWithKey' :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldr :: (Map map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldr :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldrAsc :: (OrdMap map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldrAsc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldrAscWithKey :: (OrdMap map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldrAscWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldrDesc :: (OrdMap map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldrDesc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldrDescWithKey :: (OrdMap map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldrDescWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: foldrWithKey :: (Map map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Map: foldrWithKey :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Map: fromList :: (Map map k) => [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map: fromList :: Map map k => [([k], a)] -> TrieMap map k a
- Data.ListTrie.Map: fromListWith :: (Map map k) => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map: fromListWith :: Map map k => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
- Data.ListTrie.Map: fromListWith' :: (Map map k) => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map: fromListWith' :: Map map k => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
- Data.ListTrie.Map: fromListWithKey :: (Map map k) => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map: fromListWithKey :: Map map k => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
- Data.ListTrie.Map: fromListWithKey' :: (Map map k) => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Map: fromListWithKey' :: Map map k => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
- Data.ListTrie.Map: insert :: (Map map k) => [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: insert :: Map map k => [k] -> a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: insert' :: (Map map k) => [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: insert' :: Map map k => [k] -> a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: insertWith :: (Map map k) => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: insertWith :: Map map k => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: insertWith' :: (Map map k) => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: insertWith' :: Map map k => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: intersection :: (Map map k) => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map: intersection :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
- Data.ListTrie.Map: intersection' :: (Map map k) => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Map: intersection' :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
- Data.ListTrie.Map: intersectionWith :: (Map map k) => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Map: intersectionWith :: Map map k => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
- Data.ListTrie.Map: intersectionWith' :: (Map map k) => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Map: intersectionWith' :: Map map k => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
- Data.ListTrie.Map: intersectionWithKey :: (Map map k) => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Map: intersectionWithKey :: Map map k => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
- Data.ListTrie.Map: intersectionWithKey' :: (Map map k) => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Map: intersectionWithKey' :: Map map k => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
- Data.ListTrie.Map: isProperSubmapOfBy :: (Map map k) => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
+ Data.ListTrie.Map: isProperSubmapOfBy :: Map map k => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
- Data.ListTrie.Map: isSubmapOfBy :: (Map map k) => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
+ Data.ListTrie.Map: isSubmapOfBy :: Map map k => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
- Data.ListTrie.Map: lookup :: (Map map k) => [k] -> TrieMap map k a -> Maybe a
+ Data.ListTrie.Map: lookup :: Map map k => [k] -> TrieMap map k a -> Maybe a
- Data.ListTrie.Map: lookupWithDefault :: (Map map k) => a -> [k] -> TrieMap map k a -> a
+ Data.ListTrie.Map: lookupWithDefault :: Map map k => a -> [k] -> TrieMap map k a -> a
- Data.ListTrie.Map: map :: (Map map k) => (a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map: map :: Map map k => (a -> b) -> TrieMap map k a -> TrieMap map k b
- Data.ListTrie.Map: map' :: (Map map k) => (a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map: map' :: Map map k => (a -> b) -> TrieMap map k a -> TrieMap map k b
- Data.ListTrie.Map: mapAccum :: (Map map k) => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map: mapAccum :: Map map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Map: mapAccum' :: (Map map k) => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map: mapAccum' :: Map map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Map: mapAccumAsc :: (OrdMap map k) => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map: mapAccumAsc :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Map: mapAccumAsc' :: (OrdMap map k) => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map: mapAccumAsc' :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Map: mapAccumAscWithKey :: (OrdMap map k) => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map: mapAccumAscWithKey :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Map: mapAccumAscWithKey' :: (OrdMap map k) => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map: mapAccumAscWithKey' :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Map: mapAccumDesc :: (OrdMap map k) => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map: mapAccumDesc :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Map: mapAccumDesc' :: (OrdMap map k) => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map: mapAccumDesc' :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Map: mapAccumDescWithKey :: (OrdMap map k) => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map: mapAccumDescWithKey :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Map: mapAccumDescWithKey' :: (OrdMap map k) => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map: mapAccumDescWithKey' :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Map: mapAccumWithKey :: (Map map k) => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map: mapAccumWithKey :: Map map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Map: mapAccumWithKey' :: (Map map k) => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Map: mapAccumWithKey' :: Map map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Map: mapEither :: (Map map k) => (a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
+ Data.ListTrie.Map: mapEither :: Map map k => (a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
- Data.ListTrie.Map: mapEitherWithKey :: (Map map k) => ([k] -> a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
+ Data.ListTrie.Map: mapEitherWithKey :: Map map k => ([k] -> a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
- Data.ListTrie.Map: mapMaybe :: (Map map k) => (a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map: mapMaybe :: Map map k => (a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
- Data.ListTrie.Map: mapMaybeWithKey :: (Map map k) => ([k] -> a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map: mapMaybeWithKey :: Map map k => ([k] -> a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
- Data.ListTrie.Map: mapWithKey :: (Map map k) => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map: mapWithKey :: Map map k => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
- Data.ListTrie.Map: mapWithKey' :: (Map map k) => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Map: mapWithKey' :: Map map k => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
- Data.ListTrie.Map: maxView :: (OrdMap map k) => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
+ Data.ListTrie.Map: maxView :: OrdMap map k => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
- Data.ListTrie.Map: member :: (Map map k) => [k] -> TrieMap map k a -> Bool
+ Data.ListTrie.Map: member :: Map map k => [k] -> TrieMap map k a -> Bool
- Data.ListTrie.Map: minView :: (OrdMap map k) => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
+ Data.ListTrie.Map: minView :: OrdMap map k => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
- Data.ListTrie.Map: notMember :: (Map map k) => [k] -> TrieMap map k a -> Bool
+ Data.ListTrie.Map: notMember :: Map map k => [k] -> TrieMap map k a -> Bool
- Data.ListTrie.Map: null :: (Map map k) => TrieMap map k a -> Bool
+ Data.ListTrie.Map: null :: Map map k => TrieMap map k a -> Bool
- Data.ListTrie.Map: partition :: (Map map k) => (a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Map: partition :: Map map k => (a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
- Data.ListTrie.Map: partitionWithKey :: (Map map k) => ([k] -> a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Map: partitionWithKey :: Map map k => ([k] -> a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
- Data.ListTrie.Map: singleton :: (Map map k) => [k] -> a -> TrieMap map k a
+ Data.ListTrie.Map: singleton :: Map map k => [k] -> a -> TrieMap map k a
- Data.ListTrie.Map: split :: (OrdMap map k) => [k] -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Map: split :: OrdMap map k => [k] -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
- Data.ListTrie.Map: splitLookup :: (OrdMap map k) => [k] -> TrieMap map k a -> (TrieMap map k a, Maybe a, TrieMap map k a)
+ Data.ListTrie.Map: splitLookup :: OrdMap map k => [k] -> TrieMap map k a -> (TrieMap map k a, Maybe a, TrieMap map k a)
- Data.ListTrie.Map: splitPrefix :: (Map map k) => TrieMap map k a -> ([k], Maybe a, TrieMap map k a)
+ Data.ListTrie.Map: splitPrefix :: Map map k => TrieMap map k a -> ([k], Maybe a, TrieMap map k a)
- Data.ListTrie.Map: toAscList :: (OrdMap map k) => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Map: toAscList :: OrdMap map k => TrieMap map k a -> [([k], a)]
- Data.ListTrie.Map: toDescList :: (OrdMap map k) => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Map: toDescList :: OrdMap map k => TrieMap map k a -> [([k], a)]
- Data.ListTrie.Map: toList :: (Map map k) => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Map: toList :: Map map k => TrieMap map k a -> [([k], a)]
- Data.ListTrie.Map: union :: (Map map k) => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: union :: Map map k => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: union' :: (Map map k) => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: union' :: Map map k => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: unionWith :: (Map map k) => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: unionWith :: Map map k => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: unionWith' :: (Map map k) => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: unionWith' :: Map map k => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: unionWithKey :: (Map map k) => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: unionWithKey :: Map map k => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: unionWithKey' :: (Map map k) => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: unionWithKey' :: Map map k => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: unions :: (Map map k) => [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map: unions :: Map map k => [TrieMap map k a] -> TrieMap map k a
- Data.ListTrie.Map: unions' :: (Map map k) => [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map: unions' :: Map map k => [TrieMap map k a] -> TrieMap map k a
- Data.ListTrie.Map: unionsWith :: (Map map k) => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map: unionsWith :: Map map k => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
- Data.ListTrie.Map: unionsWith' :: (Map map k) => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map: unionsWith' :: Map map k => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
- Data.ListTrie.Map: unionsWithKey :: (Map map k) => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map: unionsWithKey :: Map map k => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
- Data.ListTrie.Map: unionsWithKey' :: (Map map k) => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Map: unionsWithKey' :: Map map k => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
- Data.ListTrie.Map: update :: (Map map k) => (a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Map: update :: Map map k => (a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Map: updateLookup :: (Map map k) => (a -> Maybe a) -> [k] -> TrieMap map k a -> (Maybe a, TrieMap map k a)
+ Data.ListTrie.Map: updateLookup :: Map map k => (a -> Maybe a) -> [k] -> TrieMap map k a -> (Maybe a, TrieMap map k a)
- Data.ListTrie.Patricia.Map: addPrefix :: (Map map k) => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: addPrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: adjust :: (Map map k) => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: adjust :: Map map k => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: adjust' :: (Map map k) => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: adjust' :: Map map k => (a -> a) -> [k] -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: alter :: (Map map k) => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: alter :: Map map k => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: alter' :: (Map map k) => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: alter' :: Map map k => (Maybe a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: children :: (Map map k) => TrieMap map k a -> map k (TrieMap map k a)
+ Data.ListTrie.Patricia.Map: children :: Map map k => TrieMap map k a -> map k (TrieMap map k a)
- Data.ListTrie.Patricia.Map: children1 :: (Map map k) => TrieMap map k a -> map k (TrieMap map k a)
+ Data.ListTrie.Patricia.Map: children1 :: Map map k => TrieMap map k a -> map k (TrieMap map k a)
- Data.ListTrie.Patricia.Map: delete :: (Map map k) => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: delete :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: deleteMax :: (OrdMap map k) => TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: deleteMax :: OrdMap map k => TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: deleteMin :: (OrdMap map k) => TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: deleteMin :: OrdMap map k => TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: deletePrefix :: (Map map k) => [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: deletePrefix :: Map map k => [k] -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: difference :: (Map map k) => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: difference :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
- Data.ListTrie.Patricia.Map: differenceWith :: (Map map k) => (a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: differenceWith :: Map map k => (a -> b -> Maybe a) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k a
- Data.ListTrie.Patricia.Map: 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: 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: empty :: (Map map k) => TrieMap map k a
+ Data.ListTrie.Patricia.Map: empty :: Map map k => TrieMap map k a
- Data.ListTrie.Patricia.Map: filter :: (Map map k) => (a -> Bool) -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: filter :: Map map k => (a -> Bool) -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: filterWithKey :: (Map map k) => ([k] -> a -> Bool) -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: filterWithKey :: Map map k => ([k] -> a -> Bool) -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: findMax :: (OrdMap map k) => TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Patricia.Map: findMax :: OrdMap map k => TrieMap map k a -> Maybe ([k], a)
- Data.ListTrie.Patricia.Map: findMin :: (OrdMap map k) => TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Patricia.Map: findMin :: OrdMap map k => TrieMap map k a -> Maybe ([k], a)
- Data.ListTrie.Patricia.Map: findPredecessor :: (OrdMap map k) => [k] -> TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Patricia.Map: findPredecessor :: OrdMap map k => [k] -> TrieMap map k a -> Maybe ([k], a)
- Data.ListTrie.Patricia.Map: findSuccessor :: (OrdMap map k) => [k] -> TrieMap map k a -> Maybe ([k], a)
+ Data.ListTrie.Patricia.Map: findSuccessor :: OrdMap map k => [k] -> TrieMap map k a -> Maybe ([k], a)
- Data.ListTrie.Patricia.Map: foldl :: (Map map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldl :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldl' :: (Map map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldl' :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldlAsc :: (OrdMap map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldlAsc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldlAsc' :: (OrdMap map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldlAsc' :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldlAscWithKey :: (OrdMap map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldlAscWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldlAscWithKey' :: (OrdMap map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldlAscWithKey' :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldlDesc :: (OrdMap map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldlDesc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldlDesc' :: (OrdMap map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldlDesc' :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldlDescWithKey :: (OrdMap map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldlDescWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldlDescWithKey' :: (OrdMap map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldlDescWithKey' :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldlWithKey :: (Map map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldlWithKey :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldlWithKey' :: (Map map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldlWithKey' :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldr :: (Map map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldr :: Map map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldrAsc :: (OrdMap map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldrAsc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldrAscWithKey :: (OrdMap map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldrAscWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldrDesc :: (OrdMap map k) => (a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldrDesc :: OrdMap map k => (a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldrDescWithKey :: (OrdMap map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldrDescWithKey :: OrdMap map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: foldrWithKey :: (Map map k) => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
+ Data.ListTrie.Patricia.Map: foldrWithKey :: Map map k => ([k] -> a -> b -> b) -> b -> TrieMap map k a -> b
- Data.ListTrie.Patricia.Map: fromList :: (Map map k) => [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: fromList :: Map map k => [([k], a)] -> TrieMap map k a
- Data.ListTrie.Patricia.Map: fromListWith :: (Map map k) => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: fromListWith :: Map map k => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
- Data.ListTrie.Patricia.Map: fromListWith' :: (Map map k) => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: fromListWith' :: Map map k => (a -> a -> a) -> [([k], a)] -> TrieMap map k a
- Data.ListTrie.Patricia.Map: fromListWithKey :: (Map map k) => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: fromListWithKey :: Map map k => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
- Data.ListTrie.Patricia.Map: fromListWithKey' :: (Map map k) => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: fromListWithKey' :: Map map k => ([k] -> a -> a -> a) -> [([k], a)] -> TrieMap map k a
- Data.ListTrie.Patricia.Map: insert :: (Map map k) => [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: insert :: Map map k => [k] -> a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: insert' :: (Map map k) => [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: insert' :: Map map k => [k] -> a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: insertWith :: (Map map k) => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: insertWith :: Map map k => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: insertWith' :: (Map map k) => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: insertWith' :: Map map k => (a -> a -> a) -> [k] -> a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: intersection :: (Map map k) => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: intersection :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
- Data.ListTrie.Patricia.Map: intersection' :: (Map map k) => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: intersection' :: Map map k => TrieMap map k a -> TrieMap map k b -> TrieMap map k a
- Data.ListTrie.Patricia.Map: intersectionWith :: (Map map k) => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Patricia.Map: intersectionWith :: Map map k => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
- Data.ListTrie.Patricia.Map: intersectionWith' :: (Map map k) => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Patricia.Map: intersectionWith' :: Map map k => (a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
- Data.ListTrie.Patricia.Map: intersectionWithKey :: (Map map k) => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Patricia.Map: intersectionWithKey :: Map map k => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
- Data.ListTrie.Patricia.Map: intersectionWithKey' :: (Map map k) => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
+ Data.ListTrie.Patricia.Map: intersectionWithKey' :: Map map k => ([k] -> a -> b -> c) -> TrieMap map k a -> TrieMap map k b -> TrieMap map k c
- Data.ListTrie.Patricia.Map: isProperSubmapOfBy :: (Map map k) => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
+ Data.ListTrie.Patricia.Map: isProperSubmapOfBy :: Map map k => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
- Data.ListTrie.Patricia.Map: isSubmapOfBy :: (Map map k) => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
+ Data.ListTrie.Patricia.Map: isSubmapOfBy :: Map map k => (a -> b -> Bool) -> TrieMap map k a -> TrieMap map k b -> Bool
- Data.ListTrie.Patricia.Map: lookup :: (Map map k) => [k] -> TrieMap map k a -> Maybe a
+ Data.ListTrie.Patricia.Map: lookup :: Map map k => [k] -> TrieMap map k a -> Maybe a
- Data.ListTrie.Patricia.Map: lookupWithDefault :: (Map map k) => a -> [k] -> TrieMap map k a -> a
+ Data.ListTrie.Patricia.Map: lookupWithDefault :: Map map k => a -> [k] -> TrieMap map k a -> a
- Data.ListTrie.Patricia.Map: map :: (Map map k) => (a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map: map :: Map map k => (a -> b) -> TrieMap map k a -> TrieMap map k b
- Data.ListTrie.Patricia.Map: map' :: (Map map k) => (a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map: map' :: Map map k => (a -> b) -> TrieMap map k a -> TrieMap map k b
- Data.ListTrie.Patricia.Map: mapAccum :: (Map map k) => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map: mapAccum :: Map map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Patricia.Map: mapAccum' :: (Map map k) => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map: mapAccum' :: Map map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Patricia.Map: mapAccumAsc :: (OrdMap map k) => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map: mapAccumAsc :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Patricia.Map: mapAccumAsc' :: (OrdMap map k) => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map: mapAccumAsc' :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Patricia.Map: mapAccumAscWithKey :: (OrdMap map k) => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map: mapAccumAscWithKey :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Patricia.Map: mapAccumAscWithKey' :: (OrdMap map k) => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map: mapAccumAscWithKey' :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Patricia.Map: mapAccumDesc :: (OrdMap map k) => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map: mapAccumDesc :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Patricia.Map: mapAccumDesc' :: (OrdMap map k) => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map: mapAccumDesc' :: OrdMap map k => (acc -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Patricia.Map: mapAccumDescWithKey :: (OrdMap map k) => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map: mapAccumDescWithKey :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Patricia.Map: mapAccumDescWithKey' :: (OrdMap map k) => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map: mapAccumDescWithKey' :: OrdMap map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Patricia.Map: mapAccumWithKey :: (Map map k) => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map: mapAccumWithKey :: Map map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Patricia.Map: mapAccumWithKey' :: (Map map k) => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
+ Data.ListTrie.Patricia.Map: mapAccumWithKey' :: Map map k => (acc -> [k] -> a -> (acc, b)) -> acc -> TrieMap map k a -> (acc, TrieMap map k b)
- Data.ListTrie.Patricia.Map: mapEither :: (Map map k) => (a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
+ Data.ListTrie.Patricia.Map: mapEither :: Map map k => (a -> Either b c) -> TrieMap map k a -> (TrieMap map k b, TrieMap map k c)
- Data.ListTrie.Patricia.Map: 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: 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: mapMaybe :: (Map map k) => (a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map: mapMaybe :: Map map k => (a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
- Data.ListTrie.Patricia.Map: mapMaybeWithKey :: (Map map k) => ([k] -> a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map: mapMaybeWithKey :: Map map k => ([k] -> a -> Maybe b) -> TrieMap map k a -> TrieMap map k b
- Data.ListTrie.Patricia.Map: mapWithKey :: (Map map k) => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map: mapWithKey :: Map map k => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
- Data.ListTrie.Patricia.Map: mapWithKey' :: (Map map k) => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
+ Data.ListTrie.Patricia.Map: mapWithKey' :: Map map k => ([k] -> a -> b) -> TrieMap map k a -> TrieMap map k b
- Data.ListTrie.Patricia.Map: maxView :: (OrdMap map k) => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
+ Data.ListTrie.Patricia.Map: maxView :: OrdMap map k => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
- Data.ListTrie.Patricia.Map: member :: (Map map k) => [k] -> TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map: member :: Map map k => [k] -> TrieMap map k a -> Bool
- Data.ListTrie.Patricia.Map: minView :: (OrdMap map k) => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
+ Data.ListTrie.Patricia.Map: minView :: OrdMap map k => TrieMap map k a -> (Maybe ([k], a), TrieMap map k a)
- Data.ListTrie.Patricia.Map: notMember :: (Map map k) => [k] -> TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map: notMember :: Map map k => [k] -> TrieMap map k a -> Bool
- Data.ListTrie.Patricia.Map: null :: (Map map k) => TrieMap map k a -> Bool
+ Data.ListTrie.Patricia.Map: null :: Map map k => TrieMap map k a -> Bool
- Data.ListTrie.Patricia.Map: partition :: (Map map k) => (a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map: partition :: Map map k => (a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
- Data.ListTrie.Patricia.Map: partitionWithKey :: (Map map k) => ([k] -> a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map: partitionWithKey :: Map map k => ([k] -> a -> Bool) -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
- Data.ListTrie.Patricia.Map: singleton :: (Map map k) => [k] -> a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: singleton :: Map map k => [k] -> a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: split :: (OrdMap map k) => [k] -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map: split :: OrdMap map k => [k] -> TrieMap map k a -> (TrieMap map k a, TrieMap map k a)
- Data.ListTrie.Patricia.Map: splitLookup :: (OrdMap map k) => [k] -> TrieMap map k a -> (TrieMap map k a, Maybe a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map: splitLookup :: OrdMap map k => [k] -> TrieMap map k a -> (TrieMap map k a, Maybe a, TrieMap map k a)
- Data.ListTrie.Patricia.Map: splitPrefix :: (Map map k) => TrieMap map k a -> ([k], Maybe a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map: splitPrefix :: Map map k => TrieMap map k a -> ([k], Maybe a, TrieMap map k a)
- Data.ListTrie.Patricia.Map: toAscList :: (OrdMap map k) => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Patricia.Map: toAscList :: OrdMap map k => TrieMap map k a -> [([k], a)]
- Data.ListTrie.Patricia.Map: toDescList :: (OrdMap map k) => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Patricia.Map: toDescList :: OrdMap map k => TrieMap map k a -> [([k], a)]
- Data.ListTrie.Patricia.Map: toList :: (Map map k) => TrieMap map k a -> [([k], a)]
+ Data.ListTrie.Patricia.Map: toList :: Map map k => TrieMap map k a -> [([k], a)]
- Data.ListTrie.Patricia.Map: union :: (Map map k) => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: union :: Map map k => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: union' :: (Map map k) => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: union' :: Map map k => TrieMap map k a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: unionWith :: (Map map k) => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: unionWith :: Map map k => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: unionWith' :: (Map map k) => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: unionWith' :: Map map k => (a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: unionWithKey :: (Map map k) => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: unionWithKey :: Map map k => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: unionWithKey' :: (Map map k) => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: unionWithKey' :: Map map k => ([k] -> a -> a -> a) -> TrieMap map k a -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: unions :: (Map map k) => [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: unions :: Map map k => [TrieMap map k a] -> TrieMap map k a
- Data.ListTrie.Patricia.Map: unions' :: (Map map k) => [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: unions' :: Map map k => [TrieMap map k a] -> TrieMap map k a
- Data.ListTrie.Patricia.Map: unionsWith :: (Map map k) => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: unionsWith :: Map map k => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
- Data.ListTrie.Patricia.Map: unionsWith' :: (Map map k) => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: unionsWith' :: Map map k => (a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
- Data.ListTrie.Patricia.Map: unionsWithKey :: (Map map k) => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: unionsWithKey :: Map map k => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
- Data.ListTrie.Patricia.Map: unionsWithKey' :: (Map map k) => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: unionsWithKey' :: Map map k => ([k] -> a -> a -> a) -> [TrieMap map k a] -> TrieMap map k a
- Data.ListTrie.Patricia.Map: update :: (Map map k) => (a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
+ Data.ListTrie.Patricia.Map: update :: Map map k => (a -> Maybe a) -> [k] -> TrieMap map k a -> TrieMap map k a
- Data.ListTrie.Patricia.Map: updateLookup :: (Map map k) => (a -> Maybe a) -> [k] -> TrieMap map k a -> (Maybe a, TrieMap map k a)
+ Data.ListTrie.Patricia.Map: updateLookup :: Map map k => (a -> Maybe a) -> [k] -> TrieMap map k a -> (Maybe a, TrieMap map k a)
- Data.ListTrie.Patricia.Set: addPrefix :: (Map map a) => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set: addPrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
- Data.ListTrie.Patricia.Set: children :: (Map map a) => TrieSet map a -> map a (TrieSet map a)
+ Data.ListTrie.Patricia.Set: children :: Map map a => TrieSet map a -> map a (TrieSet map a)
- Data.ListTrie.Patricia.Set: children1 :: (Map map a) => TrieSet map a -> map a (TrieSet map a)
+ Data.ListTrie.Patricia.Set: children1 :: Map map a => TrieSet map a -> map a (TrieSet map a)
- Data.ListTrie.Patricia.Set: delete :: (Map map a) => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set: delete :: Map map a => [a] -> TrieSet map a -> TrieSet map a
- Data.ListTrie.Patricia.Set: deleteMax :: (OrdMap map a) => TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set: deleteMax :: OrdMap map a => TrieSet map a -> TrieSet map a
- Data.ListTrie.Patricia.Set: deleteMin :: (OrdMap map a) => TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set: deleteMin :: OrdMap map a => TrieSet map a -> TrieSet map a
- Data.ListTrie.Patricia.Set: deletePrefix :: (Map map a) => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set: deletePrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
- Data.ListTrie.Patricia.Set: difference :: (Map map a) => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set: difference :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
- Data.ListTrie.Patricia.Set: empty :: (Map map a) => TrieSet map a
+ Data.ListTrie.Patricia.Set: empty :: Map map a => TrieSet map a
- Data.ListTrie.Patricia.Set: filter :: (Map map a) => ([a] -> Bool) -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set: filter :: Map map a => ([a] -> Bool) -> TrieSet map a -> TrieSet map a
- Data.ListTrie.Patricia.Set: findMax :: (OrdMap map a) => TrieSet map a -> Maybe [a]
+ Data.ListTrie.Patricia.Set: findMax :: OrdMap map a => TrieSet map a -> Maybe [a]
- Data.ListTrie.Patricia.Set: findMin :: (OrdMap map a) => TrieSet map a -> Maybe [a]
+ Data.ListTrie.Patricia.Set: findMin :: OrdMap map a => TrieSet map a -> Maybe [a]
- Data.ListTrie.Patricia.Set: findPredecessor :: (OrdMap map a) => [a] -> TrieSet map a -> Maybe [a]
+ Data.ListTrie.Patricia.Set: findPredecessor :: OrdMap map a => [a] -> TrieSet map a -> Maybe [a]
- Data.ListTrie.Patricia.Set: findSuccessor :: (OrdMap map a) => [a] -> TrieSet map a -> Maybe [a]
+ Data.ListTrie.Patricia.Set: findSuccessor :: OrdMap map a => [a] -> TrieSet map a -> Maybe [a]
- Data.ListTrie.Patricia.Set: foldl :: (Map map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set: foldl :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Patricia.Set: foldl' :: (Map map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set: foldl' :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Patricia.Set: foldlAsc :: (OrdMap map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set: foldlAsc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Patricia.Set: foldlAsc' :: (OrdMap map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set: foldlAsc' :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Patricia.Set: foldlDesc :: (OrdMap map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set: foldlDesc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Patricia.Set: foldlDesc' :: (OrdMap map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set: foldlDesc' :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Patricia.Set: foldr :: (Map map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set: foldr :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Patricia.Set: foldrAsc :: (OrdMap map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set: foldrAsc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Patricia.Set: foldrDesc :: (OrdMap map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Patricia.Set: foldrDesc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Patricia.Set: fromList :: (Map map a) => [[a]] -> TrieSet map a
+ Data.ListTrie.Patricia.Set: fromList :: Map map a => [[a]] -> TrieSet map a
- Data.ListTrie.Patricia.Set: insert :: (Map map a) => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set: insert :: Map map a => [a] -> TrieSet map a -> TrieSet map a
- Data.ListTrie.Patricia.Set: intersection :: (Map map a) => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set: intersection :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
- Data.ListTrie.Patricia.Set: isProperSubsetOf :: (Map map a) => TrieSet map a -> TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set: isProperSubsetOf :: Map map a => TrieSet map a -> TrieSet map a -> Bool
- Data.ListTrie.Patricia.Set: isSubsetOf :: (Map map a) => TrieSet map a -> TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set: isSubsetOf :: Map map a => TrieSet map a -> TrieSet map a -> Bool
- Data.ListTrie.Patricia.Set: maxView :: (OrdMap map a) => TrieSet map a -> (Maybe [a], TrieSet map a)
+ Data.ListTrie.Patricia.Set: maxView :: OrdMap map a => TrieSet map a -> (Maybe [a], TrieSet map a)
- Data.ListTrie.Patricia.Set: member :: (Map map a) => [a] -> TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set: member :: Map map a => [a] -> TrieSet map a -> Bool
- Data.ListTrie.Patricia.Set: minView :: (OrdMap map a) => TrieSet map a -> (Maybe [a], TrieSet map a)
+ Data.ListTrie.Patricia.Set: minView :: OrdMap map a => TrieSet map a -> (Maybe [a], TrieSet map a)
- Data.ListTrie.Patricia.Set: notMember :: (Map map a) => [a] -> TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set: notMember :: Map map a => [a] -> TrieSet map a -> Bool
- Data.ListTrie.Patricia.Set: null :: (Map map a) => TrieSet map a -> Bool
+ Data.ListTrie.Patricia.Set: null :: Map map a => TrieSet map a -> Bool
- Data.ListTrie.Patricia.Set: partition :: (Map map a) => ([a] -> Bool) -> TrieSet map a -> (TrieSet map a, TrieSet map a)
+ Data.ListTrie.Patricia.Set: partition :: Map map a => ([a] -> Bool) -> TrieSet map a -> (TrieSet map a, TrieSet map a)
- Data.ListTrie.Patricia.Set: singleton :: (Map map a) => [a] -> TrieSet map a
+ Data.ListTrie.Patricia.Set: singleton :: Map map a => [a] -> TrieSet map a
- Data.ListTrie.Patricia.Set: split :: (OrdMap map a) => [a] -> TrieSet map a -> (TrieSet map a, TrieSet map a)
+ Data.ListTrie.Patricia.Set: split :: OrdMap map a => [a] -> TrieSet map a -> (TrieSet map a, TrieSet map a)
- Data.ListTrie.Patricia.Set: splitMember :: (OrdMap map a) => [a] -> TrieSet map a -> (TrieSet map a, Bool, TrieSet map a)
+ Data.ListTrie.Patricia.Set: splitMember :: OrdMap map a => [a] -> TrieSet map a -> (TrieSet map a, Bool, TrieSet map a)
- Data.ListTrie.Patricia.Set: splitPrefix :: (Map map a) => TrieSet map a -> ([a], Bool, TrieSet map a)
+ Data.ListTrie.Patricia.Set: splitPrefix :: Map map a => TrieSet map a -> ([a], Bool, TrieSet map a)
- Data.ListTrie.Patricia.Set: toAscList :: (OrdMap map a) => TrieSet map a -> [[a]]
+ Data.ListTrie.Patricia.Set: toAscList :: OrdMap map a => TrieSet map a -> [[a]]
- Data.ListTrie.Patricia.Set: toDescList :: (OrdMap map a) => TrieSet map a -> [[a]]
+ Data.ListTrie.Patricia.Set: toDescList :: OrdMap map a => TrieSet map a -> [[a]]
- Data.ListTrie.Patricia.Set: toList :: (Map map a) => TrieSet map a -> [[a]]
+ Data.ListTrie.Patricia.Set: toList :: Map map a => TrieSet map a -> [[a]]
- Data.ListTrie.Patricia.Set: union :: (Map map a) => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Patricia.Set: union :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
- Data.ListTrie.Patricia.Set: unions :: (Map map a) => [TrieSet map a] -> TrieSet map a
+ Data.ListTrie.Patricia.Set: unions :: Map map a => [TrieSet map a] -> TrieSet map a
- Data.ListTrie.Set: addPrefix :: (Map map a) => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set: addPrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
- Data.ListTrie.Set: children :: (Map map a) => TrieSet map a -> map a (TrieSet map a)
+ Data.ListTrie.Set: children :: Map map a => TrieSet map a -> map a (TrieSet map a)
- Data.ListTrie.Set: children1 :: (Map map a) => TrieSet map a -> map a (TrieSet map a)
+ Data.ListTrie.Set: children1 :: Map map a => TrieSet map a -> map a (TrieSet map a)
- Data.ListTrie.Set: delete :: (Map map a) => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set: delete :: Map map a => [a] -> TrieSet map a -> TrieSet map a
- Data.ListTrie.Set: deleteMax :: (OrdMap map a) => TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set: deleteMax :: OrdMap map a => TrieSet map a -> TrieSet map a
- Data.ListTrie.Set: deleteMin :: (OrdMap map a) => TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set: deleteMin :: OrdMap map a => TrieSet map a -> TrieSet map a
- Data.ListTrie.Set: deletePrefix :: (Map map a) => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set: deletePrefix :: Map map a => [a] -> TrieSet map a -> TrieSet map a
- Data.ListTrie.Set: difference :: (Map map a) => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set: difference :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
- Data.ListTrie.Set: empty :: (Map map a) => TrieSet map a
+ Data.ListTrie.Set: empty :: Map map a => TrieSet map a
- Data.ListTrie.Set: filter :: (Map map a) => ([a] -> Bool) -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set: filter :: Map map a => ([a] -> Bool) -> TrieSet map a -> TrieSet map a
- Data.ListTrie.Set: findMax :: (OrdMap map a) => TrieSet map a -> Maybe [a]
+ Data.ListTrie.Set: findMax :: OrdMap map a => TrieSet map a -> Maybe [a]
- Data.ListTrie.Set: findMin :: (OrdMap map a) => TrieSet map a -> Maybe [a]
+ Data.ListTrie.Set: findMin :: OrdMap map a => TrieSet map a -> Maybe [a]
- Data.ListTrie.Set: findPredecessor :: (OrdMap map a) => [a] -> TrieSet map a -> Maybe [a]
+ Data.ListTrie.Set: findPredecessor :: OrdMap map a => [a] -> TrieSet map a -> Maybe [a]
- Data.ListTrie.Set: findSuccessor :: (OrdMap map a) => [a] -> TrieSet map a -> Maybe [a]
+ Data.ListTrie.Set: findSuccessor :: OrdMap map a => [a] -> TrieSet map a -> Maybe [a]
- Data.ListTrie.Set: foldl :: (Map map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set: foldl :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Set: foldl' :: (Map map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set: foldl' :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Set: foldlAsc :: (OrdMap map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set: foldlAsc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Set: foldlAsc' :: (OrdMap map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set: foldlAsc' :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Set: foldlDesc :: (OrdMap map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set: foldlDesc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Set: foldlDesc' :: (OrdMap map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set: foldlDesc' :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Set: foldr :: (Map map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set: foldr :: Map map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Set: foldrAsc :: (OrdMap map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set: foldrAsc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Set: foldrDesc :: (OrdMap map a) => ([a] -> b -> b) -> b -> TrieSet map a -> b
+ Data.ListTrie.Set: foldrDesc :: OrdMap map a => ([a] -> b -> b) -> b -> TrieSet map a -> b
- Data.ListTrie.Set: fromList :: (Map map a) => [[a]] -> TrieSet map a
+ Data.ListTrie.Set: fromList :: Map map a => [[a]] -> TrieSet map a
- Data.ListTrie.Set: insert :: (Map map a) => [a] -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set: insert :: Map map a => [a] -> TrieSet map a -> TrieSet map a
- Data.ListTrie.Set: intersection :: (Map map a) => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set: intersection :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
- Data.ListTrie.Set: isProperSubsetOf :: (Map map a) => TrieSet map a -> TrieSet map a -> Bool
+ Data.ListTrie.Set: isProperSubsetOf :: Map map a => TrieSet map a -> TrieSet map a -> Bool
- Data.ListTrie.Set: isSubsetOf :: (Map map a) => TrieSet map a -> TrieSet map a -> Bool
+ Data.ListTrie.Set: isSubsetOf :: Map map a => TrieSet map a -> TrieSet map a -> Bool
- Data.ListTrie.Set: maxView :: (OrdMap map a) => TrieSet map a -> (Maybe [a], TrieSet map a)
+ Data.ListTrie.Set: maxView :: OrdMap map a => TrieSet map a -> (Maybe [a], TrieSet map a)
- Data.ListTrie.Set: member :: (Map map a) => [a] -> TrieSet map a -> Bool
+ Data.ListTrie.Set: member :: Map map a => [a] -> TrieSet map a -> Bool
- Data.ListTrie.Set: minView :: (OrdMap map a) => TrieSet map a -> (Maybe [a], TrieSet map a)
+ Data.ListTrie.Set: minView :: OrdMap map a => TrieSet map a -> (Maybe [a], TrieSet map a)
- Data.ListTrie.Set: notMember :: (Map map a) => [a] -> TrieSet map a -> Bool
+ Data.ListTrie.Set: notMember :: Map map a => [a] -> TrieSet map a -> Bool
- Data.ListTrie.Set: null :: (Map map a) => TrieSet map a -> Bool
+ Data.ListTrie.Set: null :: Map map a => TrieSet map a -> Bool
- Data.ListTrie.Set: partition :: (Map map a) => ([a] -> Bool) -> TrieSet map a -> (TrieSet map a, TrieSet map a)
+ Data.ListTrie.Set: partition :: Map map a => ([a] -> Bool) -> TrieSet map a -> (TrieSet map a, TrieSet map a)
- Data.ListTrie.Set: singleton :: (Map map a) => [a] -> TrieSet map a
+ Data.ListTrie.Set: singleton :: Map map a => [a] -> TrieSet map a
- Data.ListTrie.Set: split :: (OrdMap map a) => [a] -> TrieSet map a -> (TrieSet map a, TrieSet map a)
+ Data.ListTrie.Set: split :: OrdMap map a => [a] -> TrieSet map a -> (TrieSet map a, TrieSet map a)
- Data.ListTrie.Set: splitMember :: (OrdMap map a) => [a] -> TrieSet map a -> (TrieSet map a, Bool, TrieSet map a)
+ Data.ListTrie.Set: splitMember :: OrdMap map a => [a] -> TrieSet map a -> (TrieSet map a, Bool, TrieSet map a)
- Data.ListTrie.Set: splitPrefix :: (Map map a) => TrieSet map a -> ([a], Bool, TrieSet map a)
+ Data.ListTrie.Set: splitPrefix :: Map map a => TrieSet map a -> ([a], Bool, TrieSet map a)
- Data.ListTrie.Set: toAscList :: (OrdMap map a) => TrieSet map a -> [[a]]
+ Data.ListTrie.Set: toAscList :: OrdMap map a => TrieSet map a -> [[a]]
- Data.ListTrie.Set: toDescList :: (OrdMap map a) => TrieSet map a -> [[a]]
+ Data.ListTrie.Set: toDescList :: OrdMap map a => TrieSet map a -> [[a]]
- Data.ListTrie.Set: toList :: (Map map a) => TrieSet map a -> [[a]]
+ Data.ListTrie.Set: toList :: Map map a => TrieSet map a -> [[a]]
- Data.ListTrie.Set: union :: (Map map a) => TrieSet map a -> TrieSet map a -> TrieSet map a
+ Data.ListTrie.Set: union :: Map map a => TrieSet map a -> TrieSet map a -> TrieSet map a
- Data.ListTrie.Set: unions :: (Map map a) => [TrieSet map a] -> TrieSet map a
+ Data.ListTrie.Set: unions :: Map map a => [TrieSet map a] -> TrieSet map a
Files
- CHANGELOG.txt +4/−0
- list-tries.cabal +59/−3
CHANGELOG.txt view
@@ -1,3 +1,7 @@+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
list-tries.cabal view
@@ -1,7 +1,7 @@ Cabal-Version: >= 1.6 Name: list-tries-Version: 0.4+Version: 0.4.1 Homepage: http://iki.fi/matti.niemenmaa/list-tries/ Synopsis: Tries and Patricia tries: finite sets and maps for list keys Category: Data, Data Structures@@ -36,11 +36,15 @@ tests/*.hs tests/Tests/*.hs +flag testing+ description: Enable building a test executable+ default: False+ Library Extensions: CPP - Build-Depends: base >= 3 && < 4.3- , containers >= 0.3 && < 0.4+ Build-Depends: base >= 3 && < 4.4+ , containers >= 0.3 && < 0.5 , dlist >= 0.4 && < 0.6 , binary >= 0.5 && < 0.6 @@ -66,5 +70,57 @@ Data.ListTrie.Base.Map.Internal Data.ListTrie.Patricia.Base Data.ListTrie.Util++ Include-Dirs: headers++executable list-tries-tests+ if !flag(testing)+ buildable: False++ main-is: Main.hs+ hs-source-dirs: ., tests+ Extensions: CPP++ Build-Depends: base >= 3 && < 4.4+ , containers >= 0.3 && < 0.5+ , dlist >= 0.4 && < 0.6+ , binary >= 0.5 && < 0.6++ if flag(testing)+ Build-Depends: template-haskell >= 2.3 && < 2.6+ , HUnit >= 1.2 && < 1.3+ , QuickCheck >= 2.1 && < 2.5+ , test-framework >= 0.2 && < 0.4+ , test-framework-hunit >= 0.2 && < 0.3+ , test-framework-quickcheck2 >= 0.2 && < 0.3+ , ChasingBottoms >= 1.2 && < 1.4++ Other-Modules: Data.ListTrie.Base.Map+ Data.ListTrie.Map+ Data.ListTrie.Map.Eq+ Data.ListTrie.Map.Ord+ Data.ListTrie.Map.Enum+ Data.ListTrie.Set+ Data.ListTrie.Set.Eq+ Data.ListTrie.Set.Ord+ Data.ListTrie.Set.Enum+ Data.ListTrie.Patricia.Map+ Data.ListTrie.Patricia.Map.Eq+ Data.ListTrie.Patricia.Map.Ord+ Data.ListTrie.Patricia.Map.Enum+ Data.ListTrie.Patricia.Set+ Data.ListTrie.Patricia.Set.Eq+ Data.ListTrie.Patricia.Set.Ord+ Data.ListTrie.Patricia.Set.Enum+ Data.ListTrie.Base+ Data.ListTrie.Base.Classes+ Data.ListTrie.Base.Map.Internal+ Data.ListTrie.Patricia.Base+ Data.ListTrie.Util+ Tests.Base+ Tests.Cases+ Tests.Properties+ Tests.Strictness+ Tests.TH Include-Dirs: headers