(chickadee data array-list) module provides an array/vector
that dynamically expands to hold all of the data that is added to it.
It is named after the
ArrayList class in Java.
In addition to being used as a dynamic vector, it can also be used as
a stack via the
array-list-push! and array-list-pop!
Return a new empty array list with an initial capacity of initial-capacity, or 32 by default.
Return a new array list with items in it.
#t if obj is an array list.
#t if array-list is empty.
Return the current size of array-list.
Return the item in array-list at index i.
Set the value in array-list at index i to value.
Append item to array-list.
Remove and return the last object in array-list.
Delete item from array-list. Use equal? as the
equivalence predicate, which defaults to Guile’s
procedure. By default, deletion preserves the order of the array, but
takes linear time in the worst case. If fast? is
item will deleted in constant time, but order is not preserved.
Remove all items from array-list.
Apply PROC with each item in array-list.
Apply proc to all items in array-list to build a result and return that result. init is the initial result. If there are no objects in the vicinity of rect, just init is returned.