Data.Map.Ordered

An ordered, strict map.

One might think that Strict already provides such a data type. This is not correct. Lazy and Strict use the same, non-strict Map datatype. Strict just provides functions that evaluate the value argument before inserting it in the Map. The problem is that the typeclass instances of the shared Map datatype use the non-strict functions.

Documentation

data OSMap k v

Instances

Functor (OSMap k)

Methods

fmap :: (a -> b) -> OSMap k a -> OSMap k b

(<$) :: a -> OSMap k b -> OSMap k a

Foldable (OSMap k)

Methods

fold :: Monoid m => OSMap k m -> m

foldMap :: Monoid m => (a -> m) -> OSMap k a -> m

foldr :: (a -> b -> b) -> b -> OSMap k a -> b

foldr' :: (a -> b -> b) -> b -> OSMap k a -> b

foldl :: (b -> a -> b) -> b -> OSMap k a -> b

foldl' :: (b -> a -> b) -> b -> OSMap k a -> b

foldr1 :: (a -> a -> a) -> OSMap k a -> a

foldl1 :: (a -> a -> a) -> OSMap k a -> a

toList :: OSMap k a -> [a]

null :: OSMap k a -> Bool

length :: OSMap k a -> Int

elem :: Eq a => a -> OSMap k a -> Bool

maximum :: Ord a => OSMap k a -> a

minimum :: Ord a => OSMap k a -> a

sum :: Num a => OSMap k a -> a

product :: Num a => OSMap k a -> a

Traversable (OSMap k)

Methods

traverse :: Applicative f => (a -> f b) -> OSMap k a -> f (OSMap k b)

sequenceA :: Applicative f => OSMap k (f a) -> f (OSMap k a)

mapM :: Monad m => (a -> m b) -> OSMap k a -> m (OSMap k b)

sequence :: Monad m => OSMap k (m a) -> m (OSMap k a)

(Eq v, Eq k) => Eq (OSMap k v)

Methods

(==) :: OSMap k v -> OSMap k v -> Bool

(/=) :: OSMap k v -> OSMap k v -> Bool

(Ord k, Data v, Data k) => Data (OSMap k v)

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> OSMap k v -> c (OSMap k v)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (OSMap k v)

toConstr :: OSMap k v -> Constr

dataTypeOf :: OSMap k v -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (OSMap k v))

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (OSMap k v))

gmapT :: (forall b. Data b => b -> b) -> OSMap k v -> OSMap k v

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> OSMap k v -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> OSMap k v -> r

gmapQ :: (forall d. Data d => d -> u) -> OSMap k v -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> OSMap k v -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> OSMap k v -> m (OSMap k v)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> OSMap k v -> m (OSMap k v)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> OSMap k v -> m (OSMap k v)

(Ord v, Ord k) => Ord (OSMap k v)

Methods

compare :: OSMap k v -> OSMap k v -> Ordering

(<) :: OSMap k v -> OSMap k v -> Bool

(<=) :: OSMap k v -> OSMap k v -> Bool

(>) :: OSMap k v -> OSMap k v -> Bool

(>=) :: OSMap k v -> OSMap k v -> Bool

max :: OSMap k v -> OSMap k v -> OSMap k v

min :: OSMap k v -> OSMap k v -> OSMap k v

(Read v, Read k, Ord k) => Read (OSMap k v)

Methods

readsPrec :: Int -> ReadS (OSMap k v)

readList :: ReadS [OSMap k v]

readPrec :: ReadPrec (OSMap k v)

readListPrec :: ReadPrec [OSMap k v]

(Show v, Show k) => Show (OSMap k v)

Methods

showsPrec :: Int -> OSMap k v -> ShowS

show :: OSMap k v -> String

showList :: [OSMap k v] -> ShowS

Ord k => Monoid (OSMap k v)

Methods

mempty :: OSMap k v

mappend :: OSMap k v -> OSMap k v -> OSMap k v

mconcat :: [OSMap k v] -> OSMap k v

(Ord k, Arbitrary k, Arbitrary v) => Arbitrary (OSMap k v)

Methods

arbitrary :: Gen (OSMap k v)

shrink :: OSMap k v -> [OSMap k v]

(Hashable k, Hashable v) => Hashable (OSMap k v)

Methods

hashWithSalt :: Int -> OSMap k v -> Int

hash :: OSMap k v -> Int

(NFData v, NFData k) => NFData (OSMap k v)

Methods

rnf :: OSMap k v -> ()

type Map = OSMap

empty :: OSMap k v

lookup :: Ord k => k -> OSMap k v -> Maybe v

insert :: Ord k => k -> v -> OSMap k v -> OSMap k v

delete :: Ord k => k -> OSMap k v -> OSMap k v

fromList :: Ord k => [(k, v)] -> OSMap k v

fromListWith :: Ord k => (v -> v -> v) -> [(k, v)] -> OSMap k v

toList :: OSMap k v -> [(k, v)]

map :: (v -> v') -> OSMap k v -> OSMap k v'

mapMaybe :: (v -> Maybe v') -> OSMap k v -> OSMap k v'

lookupLT :: Ord k => k -> OSMap k v -> Maybe (k, v)

lookupGT :: Ord k => k -> OSMap k v -> Maybe (k, v)

lookupLE :: Ord k => k -> OSMap k v -> Maybe (k, v)

lookupGE :: Ord k => k -> OSMap k v -> Maybe (k, v)

lookupM :: (Show k, Ord k, Monad m) => k -> OSMap k v -> m v

elemAt :: Int -> OSMap k a -> (k, a)

singleton :: k -> v -> OSMap k v

insertWith :: Ord k => (v -> v -> v) -> k -> v -> OSMap k v -> OSMap k v

member :: Ord k => k -> OSMap k v -> Bool

elems :: OSMap k v -> [v]

unionWith :: Ord k => (v -> v -> v) -> OSMap k v -> OSMap k v -> OSMap k v

difference :: Ord k => OSMap k v -> OSMap k w -> OSMap k v

union :: Ord k => OSMap k v -> OSMap k v -> OSMap k v

findWithDefault :: Ord k => a -> k -> OSMap k a -> a

size :: OSMap k v -> Int

null :: OSMap k v -> Bool

isSubmapOf :: (Ord k, Eq a) => OSMap k a -> OSMap k a -> Bool

unions :: Ord k => [OSMap k v] -> OSMap k v

intersection :: Ord k => OSMap k v -> OSMap k w -> OSMap k v

foldrWithKey :: (k -> v -> a -> a) -> a -> OSMap k v -> a

foldlWithKey :: (a -> k -> v -> a) -> a -> OSMap k v -> a

filter :: (v -> Bool) -> OSMap k v -> OSMap k v

filterWithKey :: (k -> v -> Bool) -> OSMap k v -> OSMap k v

keys :: OSMap k v -> [k]

toDescList :: OSMap k v -> [(k, v)]

updateLookupWithKey :: Ord k => (k -> a -> Maybe a) -> k -> OSMap k a -> (Maybe a, OSMap k a)

deleteLookup :: Ord k => k -> OSMap k v -> (Maybe v, OSMap k v)

insertLookupWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> OSMap k a -> (Maybe a, OSMap k a)

adjust :: Ord k => (a -> a) -> k -> Map k a -> Map k a

assocs :: OSMap k a -> [(k, a)]

insertWith' :: Ord k => (a -> a -> a) -> k -> a -> OSMap k a -> OSMap k a

alter :: Ord k => (Maybe a -> Maybe a) -> k -> OSMap k a -> OSMap k a

differenceWith :: Ord k => (a -> b -> Maybe a) -> OSMap k a -> OSMap k b -> OSMap k a

updateWithKey :: Ord k => (k -> a -> Maybe a) -> k -> OSMap k a -> OSMap k a

update :: Ord k => (a -> Maybe a) -> k -> OSMap k a -> OSMap k a

mapKeys :: Ord k2 => (k1 -> k2) -> OSMap k1 a -> OSMap k2 a

insertWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> Map k a

insertWithKey' :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> Map k a

keysSet :: OSMap k v -> Set k

maxView :: OSMap k a -> Maybe (a, OSMap k a)

maxViewWithKey :: OSMap k a -> Maybe ((k, a), OSMap k a)

minView :: OSMap k a -> Maybe (a, OSMap k a)

minViewWithKey :: OSMap k a -> Maybe ((k, a), OSMap k a)

intersectionWith :: Ord k => (a -> b -> c) -> OSMap k a -> OSMap k b -> OSMap k c

fromDistinctAscList :: [(k, v)] -> OSMap k v

toDataMap :: OSMap k v -> Map k v

fromDataMap :: Map k v -> OSMap k v

hasKey :: Int -> OSMap Int Int -> Bool

hasValue :: Int -> OSMap Int Int -> Bool