Rework component_pool chunk storage #219

Activity

1. kgorking

   self-assigned this

   on Oct 4, 2023
2. kgorking

   changed the title [-]Rework component_pool chunc storage to avoid moves[/-] [+]Rework component_pool chunk storage to avoid moves[/+] on Oct 4, 2023
3. kgorking

   changed the title [-]Rework component_pool chunk storage to avoid moves[/-] [+]Rework component_pool chunk storage[/+] on Mar 18, 2024
4. kgorking commented on Mar 18, 2024

   

   kgorking

   on Mar 18, 2024

   Last edited by kgorking

   OwnerAuthor

   More actions

   Reason:

   • The current implementation was a fun experiment, but it has gotten unwieldy and hard to maintain.

   References:

   • Array layouts for comparison-based searching
   • AA tree
   • AA tree paper: Balanced search trees made simple
   • Join-based tree algorithms

   Plan:

   • Create a self-contained range tree that can hold ranges and their data
     • Implement as an AA tree
     • Use a compact layout. New data is filled into current holes or appended to the end.
   • Write algo for tree diff/intersection
5. kgorking commented on Mar 20, 2024

   

   kgorking

   on Mar 20, 2024

   OwnerAuthor

   More actions

   Well nuts to that. Wrote an allocator instead.