O(n). Creates a flatlist that contains the elements of one flatlist followed by the elements of another flatlist.

O(n). Applies the supplied function to each element of a flatlist, concatenates the results, and returns the combined flatlist.

O(n). Creates a flatlist that contains the elements of each of the supplied sequence of flatlists.

O(1). Returns flatlist of no elements.

O(n) worst case. Tests whether any element of a flatlist satisfies the supplied predicate.

O(n). Returns a flatlist that contains only the elements of the supplied flatlist for which the supplied condition returns true.

O(n). Applies a function to each element of a flatlist from left to right (first to last), threading an accumulator argument through the computation.

O(n). Applies a function to pairs of elements from two supplied flatlists, left-to-right, threading an accumulator argument through the computation. The two input flatlists must have the same lengths; otherwise, ArgumentException is raised.

O(n). Applies a function to each element of a flatlist from right to left (last to first), threading an accumulator argument through the computation.

O(n). Applies a function to pairs of elements from two supplied flatlists, right-to-left, threading an accumulator argument through the computation. The two input flatlists must have the same lengths; otherwise, ArgumentException is raised.

O(n). Tests whether all elements of a flatlist satisfy the supplied condition.

O(n). Tests whether all corresponding elements of two supplied flatlists satisfy a supplied condition.

O(n). Uses a supplied function to create a flatlist of the supplied dimension.

O(1). O(1). Returns true if the flatlist has no elements.

O(n). Applies the supplied function to each element of a flatlist.

O(n). Applies the supplied function to a pair of elements from matching indexes in two flatlists, also passing the index of the elements. The two flatlists must have the same lengths; otherwise, an ArgumentException is raised.

O(n). Applies the supplied function to each element of a flatlist. The integer passed to the function indicates the index of the element.

O(1). Returns the number of items in the flatlist.

O(n). Creates a flatlist whose elements are the results of applying the supplied function to each of the elements of a supplied flatlist.

O(n). Creates a flatlist whose elements are the results of applying the supplied function to the corresponding elements of two supplied flatlists. The two input flatlists must have the same lengths; otherwise, ArgumentException is raised.

O(n). Creates a flatlist whose elements are the results of applying the supplied function to each of the elements of a supplied flatlist. An integer index passed to the function indicates the index of the element being transformed.

O(n). Creates a flatlist from the supplied list.

O(n). Creates a flatlist from the supplied enumerable object.

O(n). Splits a flatlist into two flatlists, one containing the elements for which the supplied condition returns true, and the other containing those for which it returns false.

O(1). True if the flatlists are reference-equal, false otherwise

O(n). Reverses the order of the elements in a supplied array.

O(1). Returns a flatlist of one element.

O(n). Returns the sum of the elements in the flatlist.

O(n). Returns the sum of the results generated by applying a function to each element of a flatlist.

O(n). Converts the supplied flatlist to a list.

O(n). Converts the supplied flatlist of tuple pairs to a map.

O(n). Returns the first element in the supplied flatlist for which the supplied function returns true. Returns None if no such element exists.

O(n). Splits a flatlist of tuple pairs into a tuple of two flatlists.

O(n). Combines two flatlists into a flatlist of tuples that have two elements. The two flatlists must have equal lengths; otherwise, ArgumentException is raised.