DataStructures.jl

Julia implementation of Data structures
Popularity
343 Stars
Updated Last
19 Days Ago
Started In
March 2013

Travis Build Status Appveyor Build Status Test Coverage Test Coverage Documentation

DataStructures.jl

This package implements a variety of data structures, including

  • Deque (implemented with an unrolled linked list)
  • CircularBuffer
  • CircularDeque (based on a circular buffer)
  • Stack
  • Queue
  • Priority Queue
  • Fenwick Tree
  • Accumulators and Counters (i.e. Multisets / Bags)
  • Disjoint Sets
  • Binary Heap
  • Mutable Binary Heap
  • Ordered Dicts and Sets
  • RobinDict (implemented with Robin Hood Hashing)
  • Dictionaries with Defaults
  • Trie
  • Linked List and Mutable Linked List
  • Sorted Dict, Sorted Multi-Dict and Sorted Set
  • DataStructures.IntSet
  • SparseIntSet
  • DiBitVector (in which each element can store two bits)

Resources

Required Packages