Key : Typedata BitMap : Type -> TypeEmpty : BitMap aLeaf : a -> BitMap aBranch : BitMap a -> BitMap a -> BitMap a -> BitMap a -> BitMap aisEmpty : BitMap v -> BoolnonEmpty : BitMap v -> Boollookup : Key -> BitMap a -> Maybe apairs : BitMap v -> List (Key, v)foldlKV : (acc -> Key -> v -> acc) -> acc -> BitMap v -> acctraverseWithKey : Applicative f => (Key -> v -> f w) -> BitMap v -> f (BitMap w)mapWithKey : (Key -> v -> w) -> BitMap v -> BitMap wkeys : BitMap v -> List KeyGets the keys of the map.
values : BitMap v -> List vempty : BitMap vsingleton : Key -> a -> BitMap amapMaybe : (a -> Maybe b) -> BitMap a -> BitMap bfilter : (a -> Bool) -> BitMap a -> BitMap ainsert : Key -> a -> BitMap a -> BitMap afromList : List (Key, v) -> BitMap vinsertWith : (a -> a -> a) -> Key -> a -> BitMap a -> BitMap aupdate : Key -> (a -> a) -> BitMap a -> BitMap aunion : BitMap a -> BitMap a -> BitMap adelete : Key -> BitMap a -> BitMap adata DecompAt : Type -> TypedecompAt : Key -> BitMap a -> DecompAt adata Decomp : Type -> Typedecomp : BitMap a -> Decomp a