PrimitiveExtras.By6Bits

Documentation

data By6Bits e

An immutable space-efficient sparse array, which can only store not more than 64 elements.

Instances

Foldable By6Bits

Defined in PrimitiveExtras.By6Bits

Methods

fold :: Monoid m => By6Bits m -> m

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

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

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

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

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

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

foldr1 :: (a -> a -> a) -> By6Bits a -> a

foldl1 :: (a -> a -> a) -> By6Bits a -> a

toList :: By6Bits a -> [a]

null :: By6Bits a -> Bool

length :: By6Bits a -> Int

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

maximum :: Ord a => By6Bits a -> a

minimum :: Ord a => By6Bits a -> a

sum :: Num a => By6Bits a -> a

product :: Num a => By6Bits a -> a

Show a => Show (By6Bits a)

Defined in PrimitiveExtras.By6Bits

Methods

showsPrec :: Int -> By6Bits a -> ShowS

show :: By6Bits a -> String

showList :: [By6Bits a] -> ShowS

Eq a => Eq (By6Bits a)

Defined in PrimitiveExtras.By6Bits

Methods

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

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

empty :: By6Bits e

singleton :: Int -> e -> By6Bits e

An array with a single element at the specified index.

maybeList :: [Maybe e] -> By6Bits e

pair :: Int -> e -> Int -> e -> By6Bits e

insert :: Int -> e -> By6Bits e -> By6Bits 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 -> By6Bits e -> By6Bits e

adjust :: (e -> e) -> Int -> By6Bits e -> By6Bits e

unset :: Int -> By6Bits e -> By6Bits e

Remove an element.

lookup :: Int -> By6Bits e -> Maybe e

Lookup an item at the index.

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

toMaybeList :: By6Bits e -> [Maybe e]

Convert into a list representation.

toIndexedList :: By6Bits e -> [(Int, e)]

elementsUnfoldl :: By6Bits e -> Unfoldl e

elementsUnfoldlM :: Monad m => By6Bits a -> UnfoldlM m a

elementsListT :: By6Bits a -> ListT STM a

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

null :: By6Bits a -> Bool

Orphan instances

Foldable By6Bits

Methods

fold :: Monoid m => By6Bits m -> m

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

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

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

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

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

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

foldr1 :: (a -> a -> a) -> By6Bits a -> a

foldl1 :: (a -> a -> a) -> By6Bits a -> a

toList :: By6Bits a -> [a]

null :: By6Bits a -> Bool

length :: By6Bits a -> Int

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

maximum :: Ord a => By6Bits a -> a

minimum :: Ord a => By6Bits a -> a

sum :: Num a => By6Bits a -> a

product :: Num a => By6Bits a -> a

Show a => Show (By6Bits a)

Methods

showsPrec :: Int -> By6Bits a -> ShowS

show :: By6Bits a -> String

showList :: [By6Bits a] -> ShowS

Eq a => Eq (By6Bits a)

Methods

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

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