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
There is an explanation for how to declare a BPTREE_DEF* separately from a BPTREE_MULTI_DEF* and how it affects the storage logic and key uniqueness, but I don't see a way to actually access multiple values under the same key except for iterating over all of the items in the tree (which would defeat the purpose of using a tree for fast lookup).
Is there a separate API for looking up a BPTREE iterator from a key, or some other way of accessing the multiple possible values within a BPTREE_MULTI? There may already be so, I just cant find any documentation or explanation of it.
The text was updated successfully, but these errors were encountered:
There is an explanation for how to declare a
BPTREE_DEF*
separately from aBPTREE_MULTI_DEF*
and how it affects the storage logic and key uniqueness, but I don't see a way to actually access multiple values under the same key except for iterating over all of the items in the tree (which would defeat the purpose of using a tree for fast lookup).Is there a separate API for looking up a BPTREE iterator from a key, or some other way of accessing the multiple possible values within a
BPTREE_MULTI
? There may already be so, I just cant find any documentation or explanation of it.The text was updated successfully, but these errors were encountered: