-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | A transparent nested Map structure
--   
--   A transparent nested Map structure
@package NMap
@version 0.12

module Data.NMap
data NMap k a
(.<) :: Ord k => t -> [(k, NMap k a)] -> (t, NMap k a)
infixr 0 .<
(.>) :: t -> a -> (t, NMap k a)
infixr 0 .>
drawNMap :: (Show k, Show a) => NMap k a -> String
mapKeys :: Ord k2 => (k1 -> k2) -> NMap k1 a -> NMap k2 a
mapWithKey :: (k -> a -> b) -> NMap k a -> NMap k b
mapWithKey0 :: (k -> a -> b) -> k -> NMap k a -> NMap k b
traverseKeys :: (Ord k2, Applicative t) => (k1 -> t k2) -> NMap k1 a -> t (NMap k2 a)
traverseWithKey :: (Ord k, Applicative t) => (k -> a -> t b) -> NMap k a -> t (NMap k b)
bitraverse :: (Applicative t, Ord k2) => (k1 -> t k2) -> (a1 -> t a2) -> NMap k1 a1 -> t (NMap k2 a2)
bisequence :: (Applicative t, Ord k) => NMap (t k) (t a) -> t (NMap k a)
mapKeysM :: (Ord k2, Monad m) => (k1 -> m k2) -> NMap k1 a -> m (NMap k2 a)
fromList :: Ord k => [(k, NMap k a)] -> NMap k a
elems :: NMap k a -> [a]
delete :: Ord k => [k] -> NMap k a -> NMap k a
delete0 :: Ord k => k -> NMap k a -> NMap k a
rootKeys :: NMap k a -> [k]
roots :: NMap k a -> Map k (NMap k a)
lookup :: Ord k => k -> NMap k a -> Maybe (Either (NMap k a) a)
(!) :: Ord k => NMap k a -> [k] -> a
member :: Ord k => k -> NMap k a -> Bool
branch :: Ord k => [k] -> a -> NMap k a
branch0 :: Ord k => k -> a -> NMap k a
insert :: Ord k => [k] -> a -> NMap k a -> NMap k a
insert0 :: Ord k => k -> a -> NMap k a -> NMap k a
instance (GHC.Classes.Eq a, GHC.Classes.Eq k) => GHC.Classes.Eq (Data.NMap.NMap k a)
instance (GHC.Show.Show a, GHC.Show.Show b) => GHC.Show.Show (Data.NMap.NMap a b)
instance GHC.Classes.Ord k => GHC.Base.Monoid (Data.NMap.NMap k b)
instance GHC.Base.Functor (Data.NMap.NMap k)
instance GHC.Base.Applicative (Data.NMap.NMap k)
instance GHC.Base.Monad (Data.NMap.NMap k)
instance Data.Foldable.Foldable (Data.NMap.NMap k)
instance Data.Traversable.Traversable (Data.NMap.NMap k)