Sealed
Private
a_Private
offset_offset of array
Protected
opts_Private
size_queue size
returns the capacity of the queue
Returns true if there is no data in the container
Returns true if the container has reached the container limit
Returns true if there is data in the container
Returns true if the container has not reached the container limit
returns the length of the queue
Sealed
Returns an object that implements a js Iterable, but it traverses the data in reverse
clear the queue
Optional
callback: DeleteCallback<T>call the callback on the removed element
Create a full copy of the container
Optional
callback: CloneCallback<T>How to create a duplicate copy of an element
Returns true if the data depth of the two containers is consistent
Optional
callback: CompareCallback<T>Traverse the container looking for elements until the callback returns true, then stop looking
whether the element was found
Determine whether it is the element to be found
Optional
reverse: booleanIf true, traverse the container in reverse order
call callback on each element in the container in turn
Optional
reverse: booleanIf true, traverse the container in reverse order
Returns whether the data data exists in the container
Optional
reverse: booleanOptional
callback: CompareCallback<T>Adds all the elements of an container into a string, separated by the specified separator string.
Optional
separator: stringA string used to separate one element of the container from the next in the resulting string. If omitted, the array elements are separated with a comma.
Optional
callback: MapCallback<T, TO>Optional
reverse: booleanIf true, traverse the container in reverse order
Convert container to array
Optional
reverse: booleanIf true, traverse the container in reverse order
If the queue is not empty delete the element at the back
deleted data
Optional
callback: DeleteCallback<T>call the callback on the removed element
If the queue is not empty delete the element at the back
deleted data
Optional
callback: DeleteCallback<T>call the callback on the removed element
If the queue is not empty delete the element at the front
deleted data
Optional
callback: DeleteCallback<T>call the callback on the removed element
If the queue is not empty delete the element at the front
deleted data
Optional
callback: DeleteCallback<T>call the callback on the removed element
push a copy of another container of queue.
Optional
callback: CloneCallback<T>Generated using TypeDoc
A queue implemented using fixed-length arrays