PrimitiveExtras.SparseSmallArray

Documentation

data SparseSmallArray e

An immutable space-efficient sparse array, which can only store not more than 32 or 64 elements depending on the system architecure.

Instances

Foldable SparseSmallArray

Defined in PrimitiveExtras.SparseSmallArray

Methods

fold :: Monoid m => SparseSmallArray m -> m

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

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

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

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

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

foldr1 :: (a -> a -> a) -> SparseSmallArray a -> a

foldl1 :: (a -> a -> a) -> SparseSmallArray a -> a

toList :: SparseSmallArray a -> [a]

null :: SparseSmallArray a -> Bool

length :: SparseSmallArray a -> Int

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

maximum :: Ord a => SparseSmallArray a -> a

minimum :: Ord a => SparseSmallArray a -> a

sum :: Num a => SparseSmallArray a -> a

product :: Num a => SparseSmallArray a -> a

Eq a => Eq (SparseSmallArray a)

Defined in PrimitiveExtras.SparseSmallArray

Methods

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

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

Show a => Show (SparseSmallArray a)

Defined in PrimitiveExtras.SparseSmallArray

Methods

showsPrec :: Int -> SparseSmallArray a -> ShowS

show :: SparseSmallArray a -> String

showList :: [SparseSmallArray a] -> ShowS

empty :: SparseSmallArray e

singleton :: Int -> e -> SparseSmallArray e

An array with a single element at the specified index.

maybeList :: [Maybe e] -> SparseSmallArray e

pair :: Int -> e -> Int -> e -> SparseSmallArray e

insert :: Int -> e -> SparseSmallArray e -> SparseSmallArray e

Insert an element value at the index. It's your obligation to ensure that the index is empty before the operation.

replace :: Int -> e -> SparseSmallArray e -> SparseSmallArray e

unset :: Int -> SparseSmallArray e -> SparseSmallArray e

Remove an element.

lookup :: Int -> SparseSmallArray e -> Maybe e

Lookup an item at the index.

focusAt :: Monad m => Focus a m b -> Int -> SparseSmallArray a -> m (b, SparseSmallArray a)

toMaybeList :: SparseSmallArray e -> [Maybe e]

Convert into a list representation.

elementsUnfold :: SparseSmallArray e -> Unfold e

elementsUnfoldM :: Monad m => SparseSmallArray a -> UnfoldM m a

onElementAtFocus :: Monad m => Int -> Focus a m b -> Focus (SparseSmallArray a) m b

null :: SparseSmallArray a -> Bool

Orphan instances

Foldable SparseSmallArray

Methods

fold :: Monoid m => SparseSmallArray m -> m

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

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

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

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

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

foldr1 :: (a -> a -> a) -> SparseSmallArray a -> a

foldl1 :: (a -> a -> a) -> SparseSmallArray a -> a

toList :: SparseSmallArray a -> [a]

null :: SparseSmallArray a -> Bool

length :: SparseSmallArray a -> Int

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

maximum :: Ord a => SparseSmallArray a -> a

minimum :: Ord a => SparseSmallArray a -> a

sum :: Num a => SparseSmallArray a -> a

product :: Num a => SparseSmallArray a -> a

Eq a => Eq (SparseSmallArray a)

Methods

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

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

Show a => Show (SparseSmallArray a)

Methods

showsPrec :: Int -> SparseSmallArray a -> ShowS

show :: SparseSmallArray a -> String

showList :: [SparseSmallArray a] -> ShowS