| Copyright | (C) 2012-16 Edward Kmett |
|---|---|
| License | BSD-style (see the file LICENSE) |
| Maintainer | Edward Kmett <ekmett@gmail.com> |
| Stability | experimental |
| Portability | non-portable |
| Safe Haskell | Safe |
| Language | Haskell2010 |
Control.Lens.Internal.Deque
Description
This module is designed to be imported qualified.
Documentation
A Banker's deque based on Chris Okasaki's "Purely Functional Data Structures"
Constructors
| BD !Int [a] !Int [a] |
Instances
| Monad Deque Source # | |
| Functor Deque Source # | |
| Applicative Deque Source # | |
| Foldable Deque Source # | |
Defined in Control.Lens.Internal.Deque Methods fold :: Monoid m => Deque m -> m foldMap :: Monoid m => (a -> m) -> Deque a -> m foldMap' :: Monoid m => (a -> m) -> Deque a -> m foldr :: (a -> b -> b) -> b -> Deque a -> b foldr' :: (a -> b -> b) -> b -> Deque a -> b foldl :: (b -> a -> b) -> b -> Deque a -> b foldl' :: (b -> a -> b) -> b -> Deque a -> b foldr1 :: (a -> a -> a) -> Deque a -> a foldl1 :: (a -> a -> a) -> Deque a -> a elem :: Eq a => a -> Deque a -> Bool maximum :: Ord a => Deque a -> a | |
| Traversable Deque Source # | |
| MonadPlus Deque Source # | |
| Alternative Deque Source # | |
| Plus Deque Source # | |
Defined in Control.Lens.Internal.Deque | |
| Alt Deque Source # | |
| Apply Deque Source # | |
| Bind Deque Source # | |
| TraversableWithIndex Int Deque Source # | |
Defined in Control.Lens.Internal.Deque | |
| FoldableWithIndex Int Deque Source # | |
Defined in Control.Lens.Internal.Deque Methods ifoldMap :: Monoid m => (Int -> a -> m) -> Deque a -> m Source # ifolded :: IndexedFold Int (Deque a) a Source # ifoldr :: (Int -> a -> b -> b) -> b -> Deque a -> b Source # ifoldl :: (Int -> b -> a -> b) -> b -> Deque a -> b Source # ifoldr' :: (Int -> a -> b -> b) -> b -> Deque a -> b Source # ifoldl' :: (Int -> b -> a -> b) -> b -> Deque a -> b Source # | |
| FunctorWithIndex Int Deque Source # | |
| Eq a => Eq (Deque a) Source # | |
| Ord a => Ord (Deque a) Source # | |
| Show a => Show (Deque a) Source # | |
| Semigroup (Deque a) Source # | |
| Monoid (Deque a) Source # | |
| Reversing (Deque a) Source # | |
| Snoc (Deque a) (Deque b) a b Source # | |
| Cons (Deque a) (Deque b) a b Source # | |
fromList :: [a] -> Deque a Source #
O(n) amortized. Construct a Deque from a list of values.
>>>fromList [1,2]BD 1 [1] 1 [2]