The elements function returns the elements of this set.
An array of the elements in the stack
Time Complexity: O(1) Space Complexity: O(1)
The first function returns the first element of the array _elements if it exists, otherwise it returns undefined.
The get first() method returns the first element of the data structure, represented by the _elements array at
the _offset index. If the data structure is empty (size is 0), it returns undefined.
Time Complexity: O(1) Space Complexity: O(1)
The last function returns the last element in an array-like data structure, or undefined if the structure is empty.
The method get last() returns the last element of the _elements array if the array is not empty. If the
array is empty, it returns undefined.
The offset function returns the offset of the current page.
The value of the protected variable _offset
The size function returns the number of elements in an array.
The size of the array, which is the difference between the length of the array and the offset.
The function returns the _toElementFn property, which is a function that converts a raw element to a specific type.
The function get toElementFn() is returning either a function that takes a raw element
rawElement of type R and returns an element E, or undefined if no function is assigned to
_toElementFn.
Time Complexity: O(n) Space Complexity: O(1)
The function is an implementation of the Symbol.iterator method that returns an IterableIterator.
Rest ...args: any[]The args parameter in the code snippet represents a rest parameter. It
allows the function to accept any number of arguments as an array. In this case, the args
parameter is used to pass any number of arguments to the _getIterator method.
Protected _getTime Complexity: O(n) Space Complexity: O(1)
The every function checks if every element in the array satisfies a given predicate.
The predicate parameter is a callback function that takes three arguments:
the current element being processed, its index, and the array it belongs to. It should return a
boolean value indicating whether the element satisfies a certain condition or not.
Optional thisArg: anyThe thisArg parameter is an optional argument that specifies the value
to be used as this when executing the predicate function. If thisArg is provided, it will be
passed as the this value to the predicate function. If thisArg is
The every method is returning a boolean value. It returns true if every element in
the array satisfies the provided predicate function, and false otherwise.
Time Complexity: O(n) Space Complexity: O(n)
The filter function creates a new Queue object containing elements from the original Queue
that satisfy a given predicate function.
The predicate parameter is a callback function that takes three arguments:
the current element being iterated over, the index of the current element, and the queue itself.
It should return a boolean value indicating whether the element should be included in the filtered
queue or not.
Optional thisArg: anyThe thisArg parameter is an optional argument that specifies the value
to be used as this when executing the predicate function. If thisArg is provided, it will be
passed as the this value to the predicate function. If thisArg is
The filter method is returning a new Queue object that contains the elements that
satisfy the given predicate function.
Time Complexity: O(n) Space Complexity: O(1)
The find function iterates over the elements of an array-like object and returns the first
element that satisfies the provided callback function.
The callbackfn parameter is a function that will be called for each element in the array. It takes three arguments: the current element being processed, the index of the current element, and the array itself. The function should return a boolean value indicating whether the current element matches the desired condition.
Optional thisArg: anyThe thisArg parameter is an optional argument that specifies the value
to be used as this when executing the callbackfn function. If thisArg is provided, it will
be passed as the this value to the callbackfn function. If thisArg @returns The findmethod returns the first element in the array that satisfies the provided callback function. If no element satisfies the callback function,undefined` is returned.
Time Complexity: O(n) Space Complexity: O(1)
The forEach function iterates over each element in an array-like object and calls a callback
function for each element.
The callbackfn parameter is a function that will be called for each element in the array. It takes three arguments: the current element being processed, the index of the current element, and the array that forEach was called upon.
Optional thisArg: anyThe thisArg parameter is an optional argument that specifies the value
to be used as this when executing the callbackfn function. If thisArg is provided, it will
be passed as the this value to the callbackfn function. If `thisArg
Time Complexity: O(n) Space Complexity: O(1)
The function checks if a given element exists in a collection.
The parameter "element" is of type E, which means it can be any type. It represents the element that we want to check for existence in the collection.
a boolean value. It returns true if the element is found in the collection, and false otherwise.
Time Complexity: O(n) Space Complexity: O(n)
Optional toElementFn: ((rawElement) => EM)Optional thisArg: anyTime Complexity: O(1) Space Complexity: O(1)
The push function adds an element to the end of the queue and returns the updated queue.Adds an element at the back of the queue.
The element parameter represents the element that you want to add to the queue.
The add method is returning a Queue<E> object.
Time Complexity: O(n) Space Complexity: O(1)
The reduce function iterates over the elements of an array-like object and applies a callback
function to reduce them into a single value.
The callbackfn parameter is a function that will be called for each element in the array. It takes four arguments:
The initialValue parameter is the initial value of the accumulator. It is the value that the accumulator starts with before the reduction operation begins.
The reduce method is returning the final value of the accumulator after iterating over
all the elements in the array and applying the callback function to each element.
Time Complexity: O(1) Space Complexity: O(1)
The shift function removes and returns the first element in the queue, and adjusts the internal data structure if
necessary to optimize performance.
The function shift() returns either the first element in the queue or undefined if the queue is empty.
Time Complexity: O(n) Space Complexity: O(1)
The "some" function checks if at least one element in a collection satisfies a given predicate.
The predicate parameter is a callback function that takes three arguments:
value, index, and array. It should return a boolean value indicating whether the current
element satisfies the condition.
Optional thisArg: anyThe thisArg parameter is an optional argument that specifies the value
to be used as the this value when executing the predicate function. If thisArg is provided,
it will be passed as the this value to the predicate function. If `thisArg
a boolean value. It returns true if the predicate function returns true for any element in the collection, and false otherwise.
Static fromTime Complexity: O(n) Space Complexity: O(n)
The function "fromArray" creates a new Queue object from an array of elements.Creates a queue from an existing array.
The "elements" parameter is an array of elements of type E.
The method is returning a new instance of the Queue class, initialized with the elements from the input array.
Generated using TypeDoc