The current algorithm uses a simple monotonically increasing id scheme. This is simple, but potentially wasteful of the id space. This bug is to investigate and implement a scheme to reuse empty id slots. The investigation must take into account the complexity/performance/memory tradeoffs involved.
Simon & Alan - is this something needed now? Thanks!
No.