ir-regular/okasaki-clj

A Clojure reimplementation of examples and exercises from Okasaki's Purely Functional Data Structures

An experiment in implementing examples and exercises from Chris Okasaki's Purely Functional Data Structures in pure Clojure.

Although I mostly stick to function names selected in the book, sometimes I modify them to follow Clojure naming conventions (for example using empty? over isEmpty.)

Chapter 2

Data structures

• Stack definition
  • built-in (vector) implementation
  • Cons implementation
• FiniteMap definition
  • UnbalancedBST implementation
• Set definition
  • UnbalancedBST implementation

Exercises

• Exercise 2.1
• Exercise 2.2
• Exercise 2.3
• Exercise 2.4
• Exercise 2.5.a
• Exercise 2.5.b
• Exercise 2.6

Chapter 3

Data structures

• Heap definition
  • LeftistHeap implementation

Exercises

• Exercise 3.2
• Exercise 3.3