▼Functional Data Structures in Typed Racket
On this page:
Functional Data Structures in Typed Racket
7.7
  top  ← prev  up  next → 

Functional Data Structures in Typed Racket

Hari Prashanth K R

The data structures in this library are based on the work of Chris Okasaki and Phil Bagwell, including those in the Purely Functional Data Structures by Okasaki. All of the data structures are implemented in Typed Racket.

    1 Queues

      1.1 Banker’s Queue

      1.2 Physicist’s Queue

      1.3 Implicit Queue

      1.4 Bootstraped Queue

      1.5 Real-Time Queue

      1.6 Hood-Melville Queue

    2 Deques

      2.1 Bankers Deque

      2.2 Implicit Deque

      2.3 Real-Time Deque

    3 Heaps

      3.1 Binomial Heap

      3.2 Skew Binomial Heap

      3.3 Leftist Heap

      3.4 Splay Heap

      3.5 Pairing Heap

      3.6 Lazy Pairing Heap

      3.7 Bootstrapped Heap

    4 Random Access Lists

      4.1 Binary Random Access List

      4.2 Skew Binary Random Access List

    5 VList

    6 Streams

    7 Red-Black Trees

    8 Tries

    9 Treap

      9.1 Priorities

  top  ← prev  up  next →