Copyright	(C) 2015, Yu Fukuzawa
License	BSD3
Maintainer	minpou.primer@email.com
Stability	experimental
Portability	portable
Safe Haskell	None
Language	Haskell2010

Data.UnionIntMap

Contents

Types
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

Types

data UnionIntMap r Source

Instances

Monoid (UnionIntMap r)

type Key = Int Source

Operators

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

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

Construction

empty :: UnionIntMap r Source

singleton :: Member as a => 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 as a => Key -> UnionIntMap as -> Maybe a Source

lookupU :: Key -> UnionIntMap r -> Maybe (K0 :| r) Source

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

findU :: Key -> UnionIntMap r -> K0 :| r Source

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

Insertion

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

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

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

Delete/Update

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

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

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

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

updateWithKey :: Member as a => (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 s r => UnionIntMap r -> UnionIntMap s Source

Map

mapU :: ((K0 :| r) -> K0 :| s) -> UnionIntMap r -> UnionIntMap s Source

mapWithKeyU :: (Key -> (K0 :| r) -> K0 :| s) -> UnionIntMap r -> UnionIntMap s Source

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

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

Filter

filterU :: ((K0 :| r) -> Bool) -> UnionIntMap r -> UnionIntMap r Source

filterWithKeyU :: (Key -> (K0 :| r) -> Bool) -> UnionIntMap r -> UnionIntMap r Source

Folds

foldrU :: ((K0 :| r) -> b -> b) -> b -> UnionIntMap r -> b Source

foldrWithKeyU :: (Key -> (K0 :| r) -> b -> b) -> b -> UnionIntMap r -> b Source

foldlU' :: (a -> (K0 :| r) -> a) -> a -> UnionIntMap r -> a Source

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

Debugging

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