Typed Racket data structure libraries
Switch branches/tags
Nothing to show
Pull request Compare This branch is 50 commits behind takikawa:master.
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
deque
heap
queue
ralist
scribblings
tests
.gitignore
Makefile
README.md
catenable-list.rkt
info.rkt
red-black-tree.rkt
set.rkt
stream.rkt
treap.rkt
trie.rkt
vlist.rkt

README.md

Functional Data Structures for Typed Racket

This library provides several functional data structures based on the work of Chris Okasaki and Phil Bagwell.

The original library was implemented by Hari Prashanth.

The following data structures are implemented:

  • Deques
    • Bankers Deque
    • Implicit Deque
    • Real-Time Deque
  • Heaps
    • Binomial Heap
    • Skew Binomial Heap
    • Leftist Heap
    • Splay Heap
    • Pairing Heap
    • Lazy Pairing Heap
    • Bootstrapped Heap
  • Random Access Lists
    • Binary Random Access List
    • Skew Binary Random Access List
  • Catenable List
  • VList
  • Streams
  • Red-Black Trees
  • Tries
  • Sets
  • Treap