# Functions
The efficiency of this algorithm is O(N) Appends as2 to the end of as1.
No description provided by the author
The efficiency of this algorithm is O(N).
The efficiency of this algorithm is O(N) Collapses the given array of arrays without changing the order.
The efficiency of this algorithm is O(N).
The efficiency of this algorithm is O(N).
The efficiency of this algorithm is O(N).
Similar to Map in that it takes an array of T1 and applies a function to each element.
This is a stack-safe, tail recursive, pure function that uses the trampoline technique to ensure that the runtime does not face recursion that is too deep(i.e.
The efficiency of this algorithm is O(N) but it reverses the list.
A structure-preserving Functor on the given array of T.
The efficiency of this algorithm is O(N).
No description provided by the author