| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
PrimitiveExtras.By6Bits
Contents
Synopsis
- data By6Bits e
- empty :: By6Bits e
- singleton :: Int -> e -> By6Bits e
- maybeList :: [Maybe e] -> By6Bits e
- pair :: Int -> e -> Int -> e -> By6Bits e
- insert :: Int -> e -> By6Bits e -> By6Bits e
- replace :: Int -> e -> By6Bits e -> By6Bits e
- adjust :: (e -> e) -> Int -> By6Bits e -> By6Bits e
- unset :: Int -> By6Bits e -> By6Bits e
- lookup :: Int -> By6Bits e -> Maybe e
- focusAt :: Monad m => Focus a m b -> Int -> By6Bits a -> m (b, By6Bits a)
- toMaybeList :: By6Bits e -> [Maybe e]
- toIndexedList :: By6Bits e -> [(Int, e)]
- elementsUnfoldl :: By6Bits e -> Unfoldl e
- elementsUnfoldlM :: Monad m => By6Bits a -> UnfoldlM m a
- elementsListT :: Monad m => By6Bits a -> ListT m a
- onElementAtFocus :: Monad m => Int -> Focus a m b -> Focus (By6Bits a) m b
- null :: By6Bits a -> Bool
Documentation
An immutable space-efficient sparse array, which can only store not more than 64 elements.
Instances
| Foldable By6Bits Source # | |
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 # elem :: Eq a => a -> By6Bits a -> Bool # maximum :: Ord a => By6Bits a -> a # minimum :: Ord a => By6Bits a -> a # | |
| Show a => Show (By6Bits a) Source # | |
| Eq a => Eq (By6Bits a) Source # | |
insert :: Int -> e -> By6Bits e -> By6Bits e Source #
Insert an element value at the index. It's your obligation to ensure that the index is empty before the operation.
toMaybeList :: By6Bits e -> [Maybe e] Source #
Convert into a list representation.
toIndexedList :: By6Bits e -> [(Int, e)] Source #
elementsUnfoldl :: By6Bits e -> Unfoldl e Source #
Orphan instances
| Foldable By6Bits Source # | |
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 # elem :: Eq a => a -> By6Bits a -> Bool # maximum :: Ord a => By6Bits a -> a # minimum :: Ord a => By6Bits a -> a # | |
| Show a => Show (By6Bits a) Source # | |
| Eq a => Eq (By6Bits a) Source # | |