Data.IMap

Documentation

data IMap a

Semantically, IMap and IntMap are identical; but IMap is more efficient when large sequences of contiguous keys are mapped to the same value.

Instances

Applicative IMap

Zippy: (<*>) combines values at equal keys, discarding any values whose key is in only one of its two arguments.

Defined in Data.IMap

Methods

pure :: a -> IMap a

(<*>) :: IMap (a -> b) -> IMap a -> IMap b

liftA2 :: (a -> b -> c) -> IMap a -> IMap b -> IMap c

(*>) :: IMap a -> IMap b -> IMap b

(<*) :: IMap a -> IMap b -> IMap a

Functor IMap

Defined in Data.IMap

Methods

fmap :: (a -> b) -> IMap a -> IMap b

(<$) :: a -> IMap b -> IMap a

Generic (IMap a)

Defined in Data.IMap

Associated Types

type Rep (IMap a) :: Type -> Type

Methods

from :: IMap a -> Rep (IMap a) x

to :: Rep (IMap a) x -> IMap a

Read a => Read (IMap a)

Defined in Data.IMap

Methods

readsPrec :: Int -> ReadS (IMap a)

readList :: ReadS [IMap a]

readPrec :: ReadPrec (IMap a)

readListPrec :: ReadPrec [IMap a]

Show a => Show (IMap a)

Defined in Data.IMap

Methods

showsPrec :: Int -> IMap a -> ShowS

show :: IMap a -> String

showList :: [IMap a] -> ShowS

NFData a => NFData (IMap a)

Defined in Data.IMap

Methods

rnf :: IMap a -> ()

Eq a => Eq (IMap a)

Defined in Data.IMap

Methods

(==) :: IMap a -> IMap a -> Bool

(/=) :: IMap a -> IMap a -> Bool

Ord a => Ord (IMap a)

Defined in Data.IMap

Methods

compare :: IMap a -> IMap a -> Ordering

(<) :: IMap a -> IMap a -> Bool

(<=) :: IMap a -> IMap a -> Bool

(>) :: IMap a -> IMap a -> Bool

(>=) :: IMap a -> IMap a -> Bool

max :: IMap a -> IMap a -> IMap a

min :: IMap a -> IMap a -> IMap a

type Rep (IMap a)

Defined in Data.IMap

type Rep (IMap a) = D1 ('MetaData "IMap" "Data.IMap" "brick-2.6-inplace" 'True) (C1 ('MetaCons "IMap" 'PrefixI 'True) (S1 ('MetaSel ('Just "_runs") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (IntMap (Run a)))))

data Run a

Run n a represents n copies of the value a.

Constructors

Run

Fields

• len :: !Int
• val :: !a

Instances

Foldable Run

Defined in Data.IMap

Methods

fold :: Monoid m => Run m -> m

foldMap :: Monoid m => (a -> m) -> Run a -> m

foldMap' :: Monoid m => (a -> m) -> Run a -> m

foldr :: (a -> b -> b) -> b -> Run a -> b

foldr' :: (a -> b -> b) -> b -> Run a -> b

foldl :: (b -> a -> b) -> b -> Run a -> b

foldl' :: (b -> a -> b) -> b -> Run a -> b

foldr1 :: (a -> a -> a) -> Run a -> a

foldl1 :: (a -> a -> a) -> Run a -> a

toList :: Run a -> [a]

null :: Run a -> Bool

length :: Run a -> Int

elem :: Eq a => a -> Run a -> Bool

maximum :: Ord a => Run a -> a

minimum :: Ord a => Run a -> a

sum :: Num a => Run a -> a

product :: Num a => Run a -> a

Traversable Run

Defined in Data.IMap

Methods

traverse :: Applicative f => (a -> f b) -> Run a -> f (Run b)

sequenceA :: Applicative f => Run (f a) -> f (Run a)

mapM :: Monad m => (a -> m b) -> Run a -> m (Run b)

sequence :: Monad m => Run (m a) -> m (Run a)

Functor Run

Defined in Data.IMap

Methods

fmap :: (a -> b) -> Run a -> Run b

(<$) :: a -> Run b -> Run a

Generic (Run a)

Defined in Data.IMap

Associated Types

type Rep (Run a) :: Type -> Type

Methods

from :: Run a -> Rep (Run a) x

to :: Rep (Run a) x -> Run a

Read a => Read (Run a)

Defined in Data.IMap

Methods

readsPrec :: Int -> ReadS (Run a)

readList :: ReadS [Run a]

readPrec :: ReadPrec (Run a)

readListPrec :: ReadPrec [Run a]

Show a => Show (Run a)

Defined in Data.IMap

Methods

showsPrec :: Int -> Run a -> ShowS

show :: Run a -> String

showList :: [Run a] -> ShowS

NFData a => NFData (Run a)

Defined in Data.IMap

Methods

rnf :: Run a -> ()

Eq a => Eq (Run a)

Defined in Data.IMap

Methods

(==) :: Run a -> Run a -> Bool

(/=) :: Run a -> Run a -> Bool

Ord a => Ord (Run a)

Defined in Data.IMap

Methods

compare :: Run a -> Run a -> Ordering

(<) :: Run a -> Run a -> Bool

(<=) :: Run a -> Run a -> Bool

(>) :: Run a -> Run a -> Bool

(>=) :: Run a -> Run a -> Bool

max :: Run a -> Run a -> Run a

min :: Run a -> Run a -> Run a

type Rep (Run a)

Defined in Data.IMap

type Rep (Run a) = D1 ('MetaData "Run" "Data.IMap" "brick-2.6-inplace" 'False) (C1 ('MetaCons "Run" 'PrefixI 'True) (S1 ('MetaSel ('Just "len") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Int) :*: S1 ('MetaSel ('Just "val") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a)))

empty :: IMap a

null :: IMap a -> Bool

singleton :: Int -> Run a -> IMap a

insert :: Int -> Run a -> IMap a -> IMap a

delete :: Int -> Run ignored -> IMap a -> IMap a

restrict :: Int -> Run ignored -> IMap a -> IMap a

Given a range of keys (as specified by a starting key and a length for consistency with other functions in this module), restrict the map to keys in that range. restrict k r m is equivalent to intersectionWith const m (insert k r empty) but potentially more efficient.

lookup :: Int -> IMap a -> Maybe a

splitLE :: Int -> IMap a -> (IMap a, IMap a)

splitLE n m produces a tuple (le, gt) where le has all the associations of m where the keys are <= n and gt has all the associations of m where the keys are > n.

intersectionWith :: (a -> b -> c) -> IMap a -> IMap b -> IMap c

mapMaybe :: (a -> Maybe b) -> IMap a -> IMap b

addToKeys :: Int -> IMap a -> IMap a

Increment all keys by the given amount. This is like mapKeysMonotonic, but restricted to partially-applied addition.

unsafeUnion :: IMap a -> IMap a -> IMap a

This function is unsafe because it assumes there is no overlap between its arguments. That is, in the call unsafeUnion a b, the caller must guarantee that if lookup k a = Just v then lookup k b = Nothing and vice versa.

fromList :: [(Int, Run a)] -> IMap a

unsafeRuns :: IMap a -> IntMap (Run a)

This function is unsafe because IMaps that compare equal may split their runs into different chunks; consumers must promise that they do not treat run boundaries specially.

unsafeToAscList :: IMap a -> [(Int, Run a)]

This function is unsafe because IMaps that compare equal may split their runs into different chunks; consumers must promise that they do not treat run boundaries specially.