You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Can I somehow make work *Tree with a sort of "Combiner" (like from DynamicIntervalTree)?
I would like to have a balanced binary tree with a custom metadata inside and a hook from a tree implementation to recalculate metadata, based on children metadata.
For example, if I want to have (key -> value) mapping, sorted by key. And in each node as a metadata: sum of values in a subtree, number of elements in that subtree available.
Is this somehow possible with that library? (I'm looking for some solution to replace gnu::pb_ds in my project)
Thank you for answer!
The text was updated successfully, but these errors were encountered:
Hi!
Can I somehow make work
*Tree
with a sort of"Combiner"
(like fromDynamicIntervalTree
)?I would like to have a balanced binary tree with a custom metadata inside and a hook from a tree implementation to recalculate metadata, based on children metadata.
For example, if I want to have
(key -> value)
mapping, sorted by key. And in each node as a metadata: sum ofvalue
s in a subtree, number of elements in that subtree available.Is this somehow possible with that library? (I'm looking for some solution to replace
gnu::pb_ds
in my project)Thank you for answer!
The text was updated successfully, but these errors were encountered: