Details
-
Sub-task
-
Status: Patch Available
-
Major
-
Resolution: Unresolved
-
2.4.1
-
None
Description
BlockList - An efficient array based list that can extend its capacity with two main features:
1. Gaps (result of remove operations) are managed internally without the need for extra memory - We create a linked list of gaps by using the array index as references + An int to the head of the gaps list. In every insert operation, we first use any available gap before extending the array.
2. Array extension is done by chaining different arrays, not by allocating a larger array and copying all its data across. This is a lot less heavy in terms of latency for that particular call. It also avoids having large amount of contiguous heap space and so behaves nicer with garbage collection.