Closed ysono closed 3 years ago
Each secondary index wraps a LSMTree<SubValueAndKey, Bool>, and abstracts a TreeMap<(SubValue, Key), bool>.
LSMTree<SubValueAndKey, Bool>
TreeMap<(SubValue, Key), bool>
For a query, a given SubValue is matched against what's contained in the LSMTree.
For a query by SubValue and Key boundaries, ditto.
I'm merging this now, but I welcome any retroactive review.
I might continue making PRs, for major changes, to host scoped conversation.
Each secondary index wraps a
LSMTree<SubValueAndKey, Bool>
, and abstracts aTreeMap<(SubValue, Key), bool>
.For a query, a given SubValue is matched against what's contained in the LSMTree.
For a query by SubValue and Key boundaries, ditto.