package patricia-tree
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page
Patricia Tree data structure in OCaml for maps and sets. Supports generic key-value pairs
Install
dune-project
Dependency
Authors
Maintainers
Sources
patricia-tree-0.10.0.tbz
sha256=10b4d793f5b8d30ce8ee072624134595040949b9653079cf3431c64f1fd29dc6
sha512=608a735220a5dde2c5674719d0c1fc29714436147fbc0d30b58adf75b95b883e561004ca98f9091b319d2432d728fb84b026a5431d93414005803e3059d13061
doc/CHANGELOG.html
v0.10.0 - Unreleased
Main changes
- Added hash-consed nodes and functors to build hash-consed maps and sets.
- Added new functions
fold_on_nonequal_interandfold_on_nonequal_unionto maps. - Now support using negative keys, removed
zarithdependency. - Fixed some bugs
Detailed changes
Breaking changes:
- Renamed
MakeCustomtoMakeCustomMap, added new functorMakeCustomSet.MakeCustomMapchanged to take a new argument to specify the'a valuetype. - Renamed
MakeCustomHeterogeneoustoMakeCustomHeterogeneousMap, added new functorMakeCustomHeterogeneousSet. - Renamed
NODE_WITH_ID.get_idtoNODE_WITH_ID.to_int, this allows using instancesNODE_WITH_IDdirectly as aKEY. - Renamed
VALUEtoHETEROGENEOUS_VALUE, added aVALUEmodule type (previously unnamed). - Renamed
min_binding,max_binding,pop_minimum,pop_maximum,min_eltandmax_elttounsigned_min_binding,unsigned_max_binding,pop_unsigned_minimum,pop_unsigned_maximum,unsigned_min_eltandunsigned_max_eltrespectively, to clarify that these functions consider negative numbers as larger than positive ones.
New features:
- Added new interface
MAP_WITH_VALUEwhich is the same asMAPbut with a custom type'a valueinstead of just'a. - Added
HashconsedNode,HashconsedSetNodeas well as four functors to create hash-consed heterogeneous/homogeneous maps/sets:MakeHashconsedMap,MakeHashconsedSet,MakeHashconsedHeterogeneousMapandMakeHashconsedHeterogeneousSet. - Now support using negative keys. Trees are built using the bitwise representation of integer, meaning they effectively use an unsigned order. Negative keys are considered bigger than positive keys,
0is the minimal number and-1the maximal one. - Added new functions
fold_on_nonequal_interandfold_on_nonequal_unionto maps.
Bug fixes:
- Fixed a bug where
NodeWithIdwasn't incrementing ids properly zarithis no longer a dependency, used GCC's__builtin_clzas a faster method of finding an integer's highest bit.- Fixed a bug where
pop_minimumandpop_maximumcould throw a private exceptionDissappearedwhen usingWeakNode. - Fixed a possible assertion error when using
idempotent_subset_domain_forall2withWeakNode. - Fix compilation warnings when compiling on ocaml 5.2.
v0.9.0 - 2024-04-18
- Initial release of Patricia Tree
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page