Z.Data.Vector.FlatMap

This module provides a simple key value map based on sorted vector and binary search. It's particularly suitable for small sized key value collections such as deserializing intermediate representation. But can also used in various place where insertion and deletion is rare but require fast lookup.

FlatMap backed by sorted vector

data FlatMap k v

Instances

Functor (FlatMap k)

Defined in Z.Data.Vector.FlatMap

Methods

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

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

Foldable (FlatMap k)

Defined in Z.Data.Vector.FlatMap

Methods

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

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

foldMap' :: Monoid m => (a -> m) -> FlatMap k a -> m

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

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

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

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

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

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

toList :: FlatMap k a -> [a]

null :: FlatMap k a -> Bool

length :: FlatMap k a -> Int

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

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

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

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

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

Traversable (FlatMap k)

Defined in Z.Data.Vector.FlatMap

Methods

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

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

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

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

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

Defined in Z.Data.Vector.FlatMap

Methods

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

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

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

Defined in Z.Data.Vector.FlatMap

Methods

compare :: FlatMap k v -> FlatMap k v -> Ordering

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

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

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

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

max :: FlatMap k v -> FlatMap k v -> FlatMap k v

min :: FlatMap k v -> FlatMap k v -> FlatMap k v

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

Defined in Z.Data.Vector.FlatMap

Methods

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

show :: FlatMap k v -> String

showList :: [FlatMap k v] -> ShowS

Ord k => Semigroup (FlatMap k v)

Defined in Z.Data.Vector.FlatMap

Methods

(<>) :: FlatMap k v -> FlatMap k v -> FlatMap k v

sconcat :: NonEmpty (FlatMap k v) -> FlatMap k v

stimes :: Integral b => b -> FlatMap k v -> FlatMap k v

Ord k => Monoid (FlatMap k v)

Defined in Z.Data.Vector.FlatMap

Methods

mempty :: FlatMap k v

mappend :: FlatMap k v -> FlatMap k v -> FlatMap k v

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

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

Defined in Z.Data.Vector.FlatMap

Methods

arbitrary :: Gen (FlatMap k v)

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

(CoArbitrary k, CoArbitrary v) => CoArbitrary (FlatMap k v)

Defined in Z.Data.Vector.FlatMap

Methods

coarbitrary :: FlatMap k v -> Gen b -> Gen b

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

Defined in Z.Data.Vector.FlatMap

Methods

rnf :: FlatMap k v -> ()

(Print k, Print v) => Print (FlatMap k v)

Defined in Z.Data.Vector.FlatMap

Methods

toUTF8BuilderP :: Int -> FlatMap k v -> Builder ()

JSON a => JSON (FlatMap Text a)

default instance prefer later key

Defined in Z.Data.JSON.Base

Methods

fromValue :: Value -> Converter (FlatMap Text a)

toValue :: FlatMap Text a -> Value

encodeJSON :: FlatMap Text a -> Builder ()

sortedKeyValues :: FlatMap k v -> Vector (k, v)

size :: FlatMap k v -> Int

null :: FlatMap k v -> Bool

empty :: FlatMap k v

O(1) empty flat map.

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

kmap' :: (k -> v -> v') -> FlatMap k v -> FlatMap k v'

pack :: Ord k => [(k, v)] -> FlatMap k v

O(N*logN) Pack list of key values, on key duplication prefer left one.

packN :: Ord k => Int -> [(k, v)] -> FlatMap k v

O(N*logN) Pack list of key values with suggested size, on key duplication prefer left one.

packR :: Ord k => [(k, v)] -> FlatMap k v

O(N*logN) Pack list of key values, on key duplication prefer right one.

packRN :: Ord k => Int -> [(k, v)] -> FlatMap k v

O(N*logN) Pack list of key values with suggested size, on key duplication prefer right one.

unpack :: FlatMap k v -> [(k, v)]

O(N) Unpack key value pairs to a list sorted by keys in ascending order.

This function works with foldr/build fusion in base.

unpackR :: FlatMap k v -> [(k, v)]

O(N) Unpack key value pairs to a list sorted by keys in descending order.

This function works with foldr/build fusion in base.

packVector :: Ord k => Vector (k, v) -> FlatMap k v

O(N*logN) Pack vector of key values, on key duplication prefer left one.

packVectorR :: Ord k => Vector (k, v) -> FlatMap k v

O(N*logN) Pack vector of key values, on key duplication prefer right one.

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

O(logN) Binary search on flat map.

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

O(N) Delete a key value pair by key.

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

O(N) Insert new key value into map, replace old one if key exists.

adjust' :: Ord k => (v -> v) -> k -> FlatMap k v -> FlatMap k v

O(N) Modify a value by key.

The value is evaluated to WHNF before writing into map.

merge :: forall k v. Ord k => FlatMap k v -> FlatMap k v -> FlatMap k v

O(n+m) Merge two FlatMap, prefer right value on key duplication.

mergeWithKey' :: forall k v. Ord k => (k -> v -> v -> v) -> FlatMap k v -> FlatMap k v -> FlatMap k v

O(n+m) Merge two FlatMap with a merge function.

fold and traverse

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

O(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator).

During folding k is in descending order.

foldrWithKey' :: (k -> v -> a -> a) -> a -> FlatMap k v -> a

O(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator).

During folding k is in descending order.

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

O(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator).

During folding k is in ascending order.

foldlWithKey' :: (a -> k -> v -> a) -> a -> FlatMap k v -> a

O(n) Reduce this map by applying a binary operator to all elements, using the given starting value (typically the right-identity of the operator).

During folding k is in ascending order.

traverseWithKey :: Applicative t => (k -> a -> t b) -> FlatMap k a -> t (FlatMap k b)

O(n).

traverseWithKey f s == pack <$> traverse ((k, v) -> (,) k <$> f k v) (unpack m) That is, behaves exactly like a regular traverse except that the traversing function also has access to the key associated with a value.

binary search on vectors

binarySearch :: Ord k => Vector (k, v) -> k -> Either Int Int

Find the key's index in the vector slice, if key exists return Right, otherwise Left, i.e. the insert index

This function only works on ascending sorted vectors.