DataStructures.jl

This package implements a variety of data structures, including

• Deque (based on block-list)

• CircularBuffer

• CircularDeque (based on a circular buffer)

• Stack

• Queue

• Priority 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

• DataStructures.jl
• Contents
• Deque
• CircularBuffer
• CircularDeque
• Stack and Queue
• Priority Queue
• Accumulators and Counters
• Disjoint Sets
• Heaps
• Functions using heaps
• OrderedDicts and OrderedSets
• DefaultDict and DefaultOrderedDict
• Trie
• Linked List
• DataStructures.IntSet
• Sorted Containers
• Tokens for Sorted Containers
• Constructors for Sorted Containers
• Complexity of Sorted Containers
• Inserting & Deleting in Sorted Containers
• Iteration Over Sorted Containers
• Cautionary note on mutable keys
• Performance of Sorted Containers