Initial length
Comparison function for sorting
The array which stores actual content
The actual count of data object
Clear the cache. The length will be set to 0, but the internal array will keep its size.
Add all elements of a given array to the end of the current array
The given array to be appended
Clear the cache. The length will be set to 0, and clear the internal array.
Delete the element at the specified location and move the last element to that location.
The index of the element to be deleted
Get the element at the specified index of the array
The index of the requested element
The element at given index
Returns the first index at which a given element can be found in the array.
The element
Pop the last element in the array. The length will reduce, but the internal array will keep its size.
The last element.
Push an element to the end of the array
The item to be added
Sort the existing elements in cache
Generated using TypeDoc
Cached array is a data structure for objects cache, it's designed for persistent data. Its content array length will keep grow.