fpottier/patricia
1
2
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
A minimal implementation of integer maps based on Patricia trees
7 commits 1 branch 0 tags 43 KiB
  • OCaml 84.3%
  • Makefile 13.8%
  • Dune 1.9%
Find a file
Exact
François Pottier 625291f8d2 [make versions]
2025-11-27 09:44:39 +01:00
src Fix incorrect iteration order in [iter], [fold], [fold_rev]. New function [bindings]. Test all of these functions. 2025-11-27 09:42:32 +01:00
test Fix incorrect iteration order in [iter], [fold], [fold_rev]. New function [bindings]. Test all of these functions. 2025-11-27 09:42:32 +01:00
.gitattributes Clean up, simplify, improve and test my 25-year-old implementation of Patricia trees. 2025-09-27 19:30:40 +02:00
.gitignore Clean up, simplify, improve and test my 25-year-old implementation of Patricia trees. 2025-09-27 19:30:40 +02:00
AUTHORS.md Clean up, simplify, improve and test my 25-year-old implementation of Patricia trees. 2025-09-27 19:30:40 +02:00
dune-project Fix incorrect iteration order in [iter], [fold], [fold_rev]. New function [bindings]. Test all of these functions. 2025-11-27 09:42:32 +01:00
headache.config Clean up, simplify, improve and test my 25-year-old implementation of Patricia trees. 2025-09-27 19:30:40 +02:00
header.txt Clean up, simplify, improve and test my 25-year-old implementation of Patricia trees. 2025-09-27 19:30:40 +02:00
Makefile [make versions] 2025-11-27 09:44:39 +01:00
README.md Clean up, simplify, improve and test my 25-year-old implementation of Patricia trees. 2025-09-27 19:30:40 +02:00

README.md

Patricia

This OCaml library offers a minimal implementation of integer maps using big-endian Patricia trees. It is based Chris Okasaki's paper at the 1998 ML Workshop in Baltimore.

This library is currently not published. Its code is used inside Menhir.