Returns a seq which contains the remaining elements of this seq after discarding the first n elements, truncated to be no longer than n in length.
This operation always respects encounter order.
This is a stateful intermediate operation, and also short-circuiting if the given length is not negative.
This operation is quite expensive on parallel execution. Using chop instead or switching to sequential execution may improve performance.
| offset |
the number of elements to skip |
| length |
maximum number of elements the seq may contain, or a negative value if unlimited |
|
the new seq |