[LUCY-97] Consolidate algorithms for incremental array growth

• Type: Improvement
• Status: Resolved
• Priority: Major
• Resolution: Fixed
• Component/s: Core
• Assignee: Marvin Humphrey
• Reporter: Marvin Humphrey
• Created: 30/Jan/10 01:25
• Updated: 30/Jan/10 01:49
• Resolved: 30/Jan/10 01:49

Description

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().