Std.Data.Vector.FlatIntSet

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

FlatIntSet backed by sorted vector

data FlatIntSet

Instances

Eq FlatIntSet

Defined in Std.Data.Vector.FlatIntSet

Methods

(==) :: FlatIntSet -> FlatIntSet -> Bool

(/=) :: FlatIntSet -> FlatIntSet -> Bool

Ord FlatIntSet

Defined in Std.Data.Vector.FlatIntSet

Methods

compare :: FlatIntSet -> FlatIntSet -> Ordering

(<) :: FlatIntSet -> FlatIntSet -> Bool

(<=) :: FlatIntSet -> FlatIntSet -> Bool

(>) :: FlatIntSet -> FlatIntSet -> Bool

(>=) :: FlatIntSet -> FlatIntSet -> Bool

max :: FlatIntSet -> FlatIntSet -> FlatIntSet

min :: FlatIntSet -> FlatIntSet -> FlatIntSet

Show FlatIntSet

Defined in Std.Data.Vector.FlatIntSet

Methods

showsPrec :: Int -> FlatIntSet -> ShowS

show :: FlatIntSet -> String

showList :: [FlatIntSet] -> ShowS

Semigroup FlatIntSet

Defined in Std.Data.Vector.FlatIntSet

Methods

(<>) :: FlatIntSet -> FlatIntSet -> FlatIntSet

sconcat :: NonEmpty FlatIntSet -> FlatIntSet

stimes :: Integral b => b -> FlatIntSet -> FlatIntSet

Monoid FlatIntSet

Defined in Std.Data.Vector.FlatIntSet

Methods

mempty :: FlatIntSet

mappend :: FlatIntSet -> FlatIntSet -> FlatIntSet

mconcat :: [FlatIntSet] -> FlatIntSet

NFData FlatIntSet

Defined in Std.Data.Vector.FlatIntSet

Methods

rnf :: FlatIntSet -> ()

Arbitrary FlatIntSet

Defined in Std.Data.Vector.FlatIntSet

Methods

arbitrary :: Gen FlatIntSet

shrink :: FlatIntSet -> [FlatIntSet]

CoArbitrary FlatIntSet

Defined in Std.Data.Vector.FlatIntSet

Methods

coarbitrary :: FlatIntSet -> Gen b -> Gen b

ToText FlatIntSet

Defined in Std.Data.Vector.FlatIntSet

Methods

toTextBuilder :: Int -> FlatIntSet -> TextBuilder ()

FromValue FlatIntSet

Defined in Std.Data.JSON.Base

Methods

fromValue :: Value -> Converter FlatIntSet

EncodeJSON FlatIntSet

Defined in Std.Data.JSON.Base

Methods

encodeJSON :: FlatIntSet -> Builder ()

ToValue FlatIntSet

Defined in Std.Data.JSON.Base

Methods

toValue :: FlatIntSet -> Value

sortedValues :: FlatIntSet -> PrimVector Int

size :: FlatIntSet -> Int

null :: FlatIntSet -> Bool

empty :: FlatIntSet

O(1) empty flat map.

map' :: (Int -> Int) -> FlatIntSet -> FlatIntSet

Mapping values of within a set, the result size may change if there're duplicated values after mapping.

pack :: [Int] -> FlatIntSet

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

packN :: Int -> [Int] -> FlatIntSet

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

packR :: [Int] -> FlatIntSet

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

packRN :: Int -> [Int] -> FlatIntSet

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

unpack :: FlatIntSet -> [Int]

O(N) Unpack a set of values to a list s in ascending order.

This function works with foldr/build fusion in base.

unpackR :: FlatIntSet -> [Int]

O(N) Unpack a set of values to a list s in descending order.

This function works with foldr/build fusion in base.

packVector :: PrimVector Int -> FlatIntSet

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

packVectorR :: PrimVector Int -> FlatIntSet

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

elem :: Int -> FlatIntSet -> Bool

O(logN) Binary search on flat map.

delete :: Int -> FlatIntSet -> FlatIntSet

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

insert :: Int -> FlatIntSet -> FlatIntSet

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

merge :: FlatIntSet -> FlatIntSet -> FlatIntSet

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

binary & linear search on vectors

binarySearch :: PrimVector Int -> Int -> 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.