I'm learning OCaml and re-learning some data structures.
- Stack (tests) - A simple stack implementation that pops, pushes, and peeks.
- Trie (tests) - An implementation of a trie which can map strings to values in a performant way.
- Setoid (tests) - Contract for setoids, which have an equivalence operation that allows these items to be placed into sets. The unit tests include an implementation to "uniquify" a list of "Person" setoids.
- Functor (tests) - Haskell-type functors which implement an
fmapfunction. Unit tests include implementations forMaybeandEither. - Algebra (tests) - Mechanism for representing algebraic instructions, with the ability to compute their derivatives.
- Queue (tests) - An immutable queue, built from two
Stacks. - Finite State Machine (tests) - Contracts for implementing a finite state machine (see unit tests for
TrafficLightandTurnstileimplementations). Built during @DavidKPiano's excellent ReactRally talk! - Wire (tests) - A mechanism which allows you to write procedures and populate their arguments later (, based on a really interesting Advent of Code problem.
- Binary Search Tree (tests) - A binary search tree parameterized over a general
Ordtype (any struct with acompare: t -> t -> intoperation). - Red-Black Tree (tests) - A Red-black tree implementation, which is a more specific type of binary search tree that self-balances on insert.
- Levenshtein Distance (tests) - A Levenshtein distance calculator, or the number of insertions, deletions, modification required to get from one sequence to another.
- Binary Heap (tests) - A binary heap data structure parameterized with a comparable type to define min- and max- heaps.
- Huffman Coding (tests) - Huffman coding implementation which losslessly compresses strings and is built using Binary Heap.
# Build all the things
make
# Run the tests
make test