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.

Sign up for GitHub

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

Jump to bottom

Implement efficient clearing of the Hashtable #106

Open
wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Implement efficient clearing of the Hashtable #106

wants to merge 2 commits into from

Commits on Apr 12, 2024

  1. Add "backlink" from value array to bucket array in FUM 

    This allows us to directly find the bucket that points to each value in
the value array, which makes erasing elements given an iterator faster
(before we needed one key lookup for each element erased). Practically,
this makes clearing large "chunks" of the FixedMap faster.
    @Bobobalink
    Bobobalink committed Apr 12, 2024
    Configuration menu
    Copy the full SHA
    55857e1 View commit details
    Browse the repository at this point in the history

  2. Implement efficient clearing of the Hashtable 

    Instead of iterating over the linked list (also requires hash lookups)
and erasing one by one, just reset the backing linked list and value
storage, then 0 out the bucket array.
    @Bobobalink
    Bobobalink committed Apr 12, 2024
    Configuration menu
    Copy the full SHA
    219a7aa View commit details
    Browse the repository at this point in the history