DataStructures.jl
====================

This package implements a variety of data structures, including

* Deque (based on block-list)
* CircularDeque (based on a circular buffer)
* Stack
* Queue
* Accumulators and Counters
* Disjoint Sets
* Binary Heap
* Mutable Binary Heap
* Ordered Dicts and Sets
* Dictionaries with Defaults
* Trie
* Linked List
* Sorted Dict, Sorted Multi-Dict and Sorted Set
* DataStructures.IntSet

Contents:

.. toctree::
   :maxdepth: 2

   deque.rst
   circ_deque.rst
   stack_and_queue.rst
   accumulators.rst
   disjoint_sets.rst
   heaps.rst
   ordered_containers.rst
   default_dict.rst
   trie.rst
   linked_list.rst
   intset.rst
   sorted_containers.rst


Indices and tables
==================

* :ref:`genindex`
* :ref:`modindex`
* :ref:`search`

