Deque.Strict · deque-0.4.4.1 · horizon-platform

datadata Deque a

#

Strict double-ended queue (aka Dequeue or Deque) based on head-tail linked list.

Instances21Monad, Functor, MonadFail, Applicative, Foldable, Traversable, …

Monad DequeDefined in deque-0.4.4.1 · Deque.Strict.Defs
Functor DequeDefined in deque-0.4.4.1 · Deque.Strict.Defs
MonadFail DequeDefined in deque-0.4.4.1 · Deque.Strict.Defs
Applicative DequeDefined in deque-0.4.4.1 · Deque.Strict.Defs
Foldable DequeDefined in deque-0.4.4.1 · Deque.Strict.Defs
Traversable DequeDefined in deque-0.4.4.1 · Deque.Strict.Defs
Alternative DequeDefined in deque-0.4.4.1 · Deque.Strict.Defs
MonadPlus DequeDefined in deque-0.4.4.1 · Deque.Strict.Defs
NFData1 DequeDefined in deque-0.4.4.1 · Deque.Strict.Defs
Generic1 DequeDefined in deque-0.4.4.1 · Deque.Strict.Defs
IsList (Deque a)Defined in deque-0.4.4.1 · Deque.Strict.Defs
Eq a => Eq (Deque a)Defined in deque-0.4.4.1 · Deque.Strict.Defs
Show a => Show (Deque a)Defined in deque-0.4.4.1 · Deque.Strict.Defs
Generic (Deque a)Defined in deque-0.4.4.1 · Deque.Strict.Defs
Semigroup (Deque a)Defined in deque-0.4.4.1 · Deque.Strict.Defs
Monoid (Deque a)Defined in deque-0.4.4.1 · Deque.Strict.Defs
NFData a => NFData (Deque a)Defined in deque-0.4.4.1 · Deque.Strict.Defs
Hashable a => Hashable (Deque a)Defined in deque-0.4.4.1 · Deque.Strict.Defs
type Rep (Deque a) = D1 ('MetaData "Deque" "Deque.Strict.Defs" "deque-0.4.4.1-43DUACHeZfD5clnYwLXAE" 'False) (C1 ('MetaCons "Deque" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (List a)) :*: S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (List a))))Defined in deque-0.4.4.1 · Deque.Strict.Defs
type Rep1 Deque = D1 ('MetaData "Deque" "Deque.Strict.Defs" "deque-0.4.4.1-43DUACHeZfD5clnYwLXAE" 'False) (C1 ('MetaCons "Deque" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec1 List) :*: S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec1 List)))Defined in deque-0.4.4.1 · Deque.Strict.Defs
type Item (Deque a) = aDefined in deque-0.4.4.1 · Deque.Strict.Defs

valuefromLazy :: Deque a -> Deque a

#

Convert lazy deque to strict deque.

valuetoLazy :: Deque a -> Deque a

#

Convert strict deque to lazy deque.

valuefromConsAndSnocLists :: [a] -> [a] -> Deque a

#

\mathcal{O}(n). Construct from cons and snoc lists.

valuecons :: a -> Deque a -> Deque a

#

\mathcal{O}(1). Add element in the beginning.

valuesnoc :: a -> Deque a -> Deque a

#

\mathcal{O}(1). Add element in the ending.

valuereverse :: Deque a -> Deque a

#

\mathcal{O}(1). Reverse the deque.

valueshiftLeft :: Deque a -> Deque a

#

\mathcal{O}(1), occasionally \mathcal{O}(n). Move the first element to the end.

λ toList . shiftLeft $ fromList [1,2,3]
[2,3,1]

valueshiftRight :: Deque a -> Deque a

#

\mathcal{O}(1), occasionally \mathcal{O}(n). Move the last element to the beginning.

λ toList . shiftRight $ fromList [1,2,3]
[3,1,2]

valuefilter :: (a -> Bool) -> Deque a -> Deque a

#

\mathcal{O}(n). Leave only the elements satisfying the predicate.

valuetake :: Int -> Deque a -> Deque a

#

\mathcal{O}(n). Leave only the specified amount of first elements.

valuedrop :: Int -> Deque a -> Deque a

#

\mathcal{O}(n). Drop the specified amount of first elements.

valuetakeWhile :: (a -> Bool) -> Deque a -> Deque a

#

\mathcal{O}(n). Leave only the first elements satisfying the predicate.

valuedropWhile :: (a -> Bool) -> Deque a -> Deque a

#

\mathcal{O}(n). Drop the first elements satisfying the predicate.

valuespan :: (a -> Bool) -> Deque a -> (Deque a, Deque a)

#

\mathcal{O}(n). Perform takeWhile and dropWhile in a single operation.

valueuncons :: Deque a -> Maybe (a, Deque a)

#

\mathcal{O}(1), occasionally \mathcal{O}(n). Get the first element and deque without it if it's not empty.

valueunsnoc :: Deque a -> Maybe (a, Deque a)

#

\mathcal{O}(1), occasionally \mathcal{O}(n). Get the last element and deque without it if it's not empty.

valuenull :: Deque a -> Bool

#

\mathcal{O}(1). Check whether deque is empty.

valuehead :: Deque a -> Maybe a

#

\mathcal{O}(1), occasionally \mathcal{O}(n). Get the first element if deque is not empty.

valuelast :: Deque a -> Maybe a

#

\mathcal{O}(1), occasionally \mathcal{O}(n). Get the last element if deque is not empty.

valuetail :: Deque a -> Deque a

#

\mathcal{O}(1), occasionally \mathcal{O}(n). Keep all elements but the first one.

In case of empty deque returns an empty deque.

valueinit :: Deque a -> Deque a

#

\mathcal{O}(1), occasionally \mathcal{O}(n). Keep all elements but the last one.

In case of empty deque returns an empty deque.