Safe Haskell	None
Language	Haskell2010

Data.UnionIntMap

Contents

Map type
Operators
Construction
Query
- Insertion
- Delete/Update
Set Operation
Conversion
Map
Filter
Folds
Debugging

Description

An implementation of heterogeneous tree-map by open unions. This module uses the Data.IntMap inside, see also https://hackage.haskell.org/package/containers.

Synopsis

Map type

data UnionIntMap r Source

Instances

All Show r => Show (UnionIntMap r)
Monoid (UnionIntMap r)

Operators

(\\) :: UnionIntMap r -> UnionIntMap r -> UnionIntMap r Source

(!) :: Member a as => UnionIntMap as -> Key -> a Source

Construction

empty :: UnionIntMap r Source

singleton :: Member a as => Key -> a -> UnionIntMap as Source

Query

null :: UnionIntMap r -> Bool Source

size :: UnionIntMap r -> Int Source

member :: Key -> UnionIntMap r -> Bool Source

notMember :: Key -> UnionIntMap r -> Bool Source

lookup :: Member a as => Key -> UnionIntMap as -> Maybe a Source

lookupU :: Key -> UnionIntMap r -> Maybe (Union r) Source

find :: Member a as => Key -> UnionIntMap as -> a Source

findU :: Key -> UnionIntMap r -> Union r Source

findWithDefault :: Member a as => a -> Key -> UnionIntMap as -> a Source

Insertion

insert :: Member a as => Key -> a -> UnionIntMap as -> UnionIntMap as Source

insertWith :: Member a as => (a -> a -> a) -> Key -> a -> UnionIntMap as -> UnionIntMap as Source

insertWithKey :: Member a as => (Key -> a -> a -> a) -> Key -> a -> UnionIntMap as -> UnionIntMap as Source

Delete/Update

delete :: Key -> UnionIntMap as -> UnionIntMap as Source

adjust :: Member a as => (a -> a) -> Key -> UnionIntMap as -> UnionIntMap as Source

adjustWithKey :: Member a as => (Key -> a -> a) -> Key -> UnionIntMap as -> UnionIntMap as Source

update :: Member a as => (a -> Maybe a) -> Key -> UnionIntMap as -> UnionIntMap as Source

updateWithKey :: Member a as => (Key -> a -> Maybe a) -> Key -> UnionIntMap as -> UnionIntMap as Source

Set Operation

union :: UnionIntMap r -> UnionIntMap r -> UnionIntMap r Source

unions :: [UnionIntMap r] -> UnionIntMap r Source

difference :: UnionIntMap r -> UnionIntMap r -> UnionIntMap r Source

intersection :: UnionIntMap r -> UnionIntMap r -> UnionIntMap r Source

Conversion

keys :: UnionIntMap r -> [Key] Source

rebuild :: Include r s => UnionIntMap r -> UnionIntMap s Source

Map

mapU :: (Union r -> Union s) -> UnionIntMap r -> UnionIntMap s Source

mapWithKeyU :: (Key -> Union r -> Union s) -> UnionIntMap r -> UnionIntMap s Source

mapU' :: (Union r -> a) -> UnionIntMap r -> IntMap a Source

mapWithKeyU' :: (Key -> Union r -> a) -> UnionIntMap r -> IntMap a Source

Filter

filterU :: (Union r -> Bool) -> UnionIntMap r -> UnionIntMap r Source

filterWithKeyU :: (Key -> Union r -> Bool) -> UnionIntMap r -> UnionIntMap r Source

Folds

foldrU :: (Union r -> b -> b) -> b -> UnionIntMap r -> b Source

foldrWithKeyU :: (Key -> Union r -> b -> b) -> b -> UnionIntMap r -> b Source

foldlU' :: (a -> Union r -> a) -> a -> UnionIntMap r -> a Source

foldlWithKeyU' :: (a -> Key -> Union r -> a) -> a -> UnionIntMap r -> a Source

Debugging

showTree :: Show (Union r) => UnionIntMap r -> String Source