Portability | non-portable |
---|---|

Stability | experimental |

Maintainer | Edward Kmett <ekmett@gmail.com> |

Safe Haskell | Trustworthy |

This module is designed to be imported qualified.

# Documentation

A Banker's deque based on Chris Okasaki's "Purely Functional Data Structures"

Monad Deque | |

Functor Deque | |

MonadPlus Deque | |

Applicative Deque | |

Foldable Deque | |

Traversable Deque | |

Alternative Deque | |

Plus Deque | |

Alt Deque | |

Apply Deque | |

Bind Deque | |

TraversableWithIndex Int Deque | |

FoldableWithIndex Int Deque | |

FunctorWithIndex Int Deque | |

(Profunctor p, Functor f, Choice p, Applicative f) => Snoc p f (Deque a) (Deque b) a b | |

(Profunctor p, Functor f, Choice p, Applicative f) => Cons p f (Deque a) (Deque b) a b | |

Eq a => Eq (Deque a) | |

(Eq (Deque a), Ord a) => Ord (Deque a) | |

Show a => Show (Deque a) | |

Monoid (Deque a) | |

Semigroup (Deque a) |

fromList :: [a] -> Deque aSource

*O(n)* amortized. Construct a `Deque`

from a list of values.

`>>>`

BD 1 [1] 1 [2]`fromList [1,2]`