| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.RandomAccessList.SkewBinary
Synopsis
- data RAList a where
- contIndexZero :: forall a b. b -> (a -> b) -> RAList a -> Word64 -> b
- contIndexOne :: forall a b. b -> (a -> b) -> RAList a -> Word64 -> b
- safeIndexZero :: RAList a -> Word64 -> Maybe a
- unsafeIndexZero :: RAList a -> Word64 -> a
- safeIndexOne :: RAList a -> Word64 -> Maybe a
- unsafeIndexOne :: RAList a -> Word64 -> a
- null :: RAList a -> Bool
- uncons :: RAList a -> Maybe (a, RAList a)
Documentation
A strict list of complete binary trees accompanied by their size. The trees appear in >=-size order. Note: this list is strict in its spine, unlike the Prelude list
Constructors
| Nil |
Instances
| NonEmptyVector (Element (RAList a)) -> RAList a -> RAList a # indexZero :: RAList a -> Word64 -> Maybe (Element (RAList a)) # indexOne :: RAList a -> Word64 -> Maybe (Element (RAList a)) # unsafeIndexZero :: RAList a -> Word64 -> Element (RAList a) # unsafeIndexOne :: RAList a -> Word64 -> Element (RAList a) # | |
| type Item (RAList a) # | |
| type Element (RAList a) # | |
Defined in Data.RandomAccessList.SkewBinary | |
contIndexZero :: forall a b. b -> (a -> b) -> RAList a -> Word64 -> b #
contIndexOne :: forall a b. b -> (a -> b) -> RAList a -> Word64 -> b #
safeIndexZero :: RAList a -> Word64 -> Maybe a #
unsafeIndexZero :: RAList a -> Word64 -> a #
safeIndexOne :: RAList a -> Word64 -> Maybe a #
unsafeIndexOne :: RAList a -> Word64 -> a #