Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Map difference #12

Merged
merged 15 commits into from
Jul 24, 2024
4 changes: 3 additions & 1 deletion CHANGELOG.md
Original file line number Diff line number Diff line change
@@ -1,6 +1,8 @@
# v0.11.0 - Unreleased

No public changes yet, but internal refactors.
- Add `difference` and `symmetric_difference` function to maps (and add `difference` to `WithForeign`)
- Add `diff` functions to sets
- Internal refactor.

# v0.10.0 - 2024-06-01

Expand Down
9 changes: 5 additions & 4 deletions src/PatriciaTree.mli
Original file line number Diff line number Diff line change
Expand Up @@ -44,12 +44,12 @@
{td {!MakeHeterogeneousSet}}
}
{tr
{th {{!hash_consed}hashconsed} Homogeneous}
{th {{!hash_consed}Hash-consed} Homogeneous}
{td {!MakeHashconsedMap}}
{td {!MakeHashconsedSet}}
}
{tr
{th {{!hash_consed}Hashconsed} Heterogeneous}
{th {{!hash_consed}Hash-consed} Heterogeneous}
{td {!MakeHashconsedHeterogeneousMap}}
{td {!MakeHashconsedHeterogeneousSet}}
}
Expand Down Expand Up @@ -87,8 +87,9 @@
The main benefit of Patricia Tree is that their representation
is stable (contrary to maps, inserting nodes in any order will
return the same shape), which allows different versions of a map
to share more subtrees in memory, and the operations over two
maps to benefit from this sharing. The functions in this library
to share more subtrees in memory, and the
{{!BASE_MAP.functions_on_pairs}operations over two maps}
to benefit from this sharing. The functions in this library
attempt to maximally preserve sharing and benefit from sharing,
allowing very important improvements in complexity and running
time when combining maps or sets is a frequent operation.}
Expand Down
Loading