feat(entity/search): add LinearPool/BlockHeap, refac entity layout and access. - #450
Merged
Conversation
luoxiaojian
requested review from
chinaux,
feihongxu0824,
iaojnh and
richyreachy
as code owners
June 2, 2026 09:00
luoxiaojian
force-pushed
the
opt-merge
branch
4 times, most recently
from
June 5, 2026 07:00
58a404c to
c9d4ae0
Compare
…y layout and add direct-pointer fast search path Introduce single-heap candidate structures (LinearPool/BlockHeap) and refactor greedy search to dispatch between pool and dual-heap paths. Split node layout into separate vector/graph arrays for better cache locality, add zero-copy get_vector_ptr() on the hot path, and extract huge-page allocation into MemoryHelper. Also adds pyglass attribution.
richyreachy
approved these changes
Jun 8, 2026
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Introduce single-heap candidate structures (LinearPool/BlockHeap) and refactor greedy search to dispatch between pool and dual-heap paths. Split node layout into separate vector/graph arrays for better cache locality, add zero-copy get_vector_ptr() on the hot path, and extract huge-page allocation into MemoryHelper. Also adds pyglass attribution.