Consolidate algorithms for incremental array growth
---------------------------------------------------
Key: LUCY-97
URL: https://issues.apache.org/jira/browse/LUCY-97
Project: Lucy
Issue Type: Improvement
Components: Core
Reporter: Marvin Humphrey
Assignee: Marvin Humphrey
The problem of incremental array growth affects several of our classes:
CharBuf, ByteBuf, BitVector, VArray, and others yet to be submitted. Ideally,
the growth algorithm should...
* Overestimate by enough to prevent pathological reallocation, but not by
so much as to significantly increase overall memory footprint.
* Round up so that allocation requests are multiples of the architecture's
word size.
* Grow faster at small sizes.
To apply this logic consistently, we can isolate it in a new function,
Memory_oversize().
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
