I've read this and the bug report and think one could argue
it from both points of view...
Couple of other (maybe already there) possibilities:
.. a 'condense' operation that removes empty slots
.. versions of Sorts that automatically condense before/during sorting
.. all Sorts condense
btw, I should also point out that the trunk version already has a delete
method on array, which will remove an item and shift all of the following
elements up one.
Rick
On Fri, Aug 24, 2012 at 9:28 AM, Rick McGuire object.r...@gmail.com wrote:
On Fri, Aug 24, 2012 at 9:23 AM, Mike Cowlishaw
This is only a problem if you use the remove method which creates a sparse
array - right?
From a users point of view there are several things here which are not
straightforward.
1) The makeArray method everywhere else creates an array from a collection,
but the array class makearray method packs
