O(n). Returns a new random access list with the elements of the second random access list added at the end.

O(1). Returns a new random access list with the element added at the start.

O(1). Returns random access list of no elements.

O(n). Returns a state from the supplied state and a function operating from left to right.

O(n). Returns a state from the supplied state and a function operating from right to left.

O(1). Returns the first element in the random access list. If the random access list is empty it throws an exception.

O(n). Returns a random access list of the supplied length using the supplied function operating on the index.

O(1). Returns true if the random access list has no elements.

O(1). Returns the number of items in the random access list.

O(n). Returns a random access list whose elements are the results of applying the supplied function to each of the elements of a supplied random access list.

O(n). Builds a new collection whose elements are the results of applying the given function to the corresponding elements of the two collections pairwise. The two input arrays must have the same lengths, otherwise ArgumentException is raised.

O(1) for all practical purposes; really O(log32n). Returns the value at the index.

O(log32(m,n)). Returns the value at the outer index, inner index. If either index is out of bounds it throws an exception.

O(n). Returns a random access list of the seq.

O(n). Applies a function to each element of the collection, threading an accumulator argument through the computation. This function first applies the function to the first two elements of the list. Then, it passes this result into the function along with the third element and so on. Finally, it returns the final result. If the input function is f and the elements are i0...iN, then it computes f (... (f i0 i1) i2 ...) iN.

O(n). Returns new random access list reversed.

O(1). Returns a new random access list of one element.

O(1) for all practical purposes; really O(log32n). Returns a new random access list without the first item. If the collection is empty it throws an exception.

O(n). Views the given random access list as a sequence.

O(1). Returns option first element in the random access list.

O(1) for all practical purposes; really O(log32n). Returns option value at the index.

O(log32(m,n)). Returns option value at the indices.

O(1) for all practical purposes; really O(log32n). Returns option random access list without the first item.

O(1) for all practical purposes; really O(log32n). Returns option tuple first element and random access list without first item

O(1) for all practical purposes; really O(log32n). Returns option random access list that contains the given value at the index.

O(log32(m,n)). Returns option random access list that contains the given value at the indices.

O(1) for all practical purposes; really O(log32n). Returns tuple first element and random access list without first item

O(1) for all practical purposes; really O(log32n). Returns a new random access list that contains the given value at the index.

O(log32(m,n)). Returns a new random access list of random access lists that contains the given value at the indices.

O(n). Returns a random access list of random access lists of given length from the seq. Result may be a jagged random access list.

O(n). Combines the two RandomAccessLists into a RandomAccessList of pairs. The two RandomAccessLists must have equal lengths, otherwise an ArgumentException is raised.