reverse xs returns the elements of xs in reverse order. xs must be finite.
O(n) reverse xs efficiently returns the elements of xs in reverse order.
O(n) reverse xs returns the elements of xs in reverse order.
O(n). The reverse of a sequence.
Provides a standard version of the reverse apply operator. Its definition is simply (&) = flip ($).
Making functors whose elements are notionally in the reverse order from the original functor.
The same functor, but with Foldable and Traversable instances that process the elements in the reverse order.
Provides a simple means of reverse-proxying HTTP requests. The raw approach uses the same technique as leveraged by keter, whereas the WAI approach performs full request/response parsing via WAI and http-conduit.