Cut (K): Difference between revisions
m (Primitive function category) |
|||
| Line 4: | Line 4: | ||
When the left argument to <code>_</code> is a single value rather than a list, it indicates [[Drop]] rather than Cut. Cut has some resemblance to Drop in that it omits every element whose index is less than the first element of the left argument. | When the left argument to <code>_</code> is a single value rather than a list, it indicates [[Drop]] rather than Cut. Cut has some resemblance to Drop in that it omits every element whose index is less than the first element of the left argument. | ||
== See also == | |||
* [[Partition]] | |||
* [[Partitioned Enclose]] | |||
* [[Partition representations]] | |||
== External Links == | == External Links == | ||
Revision as of 09:09, 9 July 2020
- For the operator used in A Dictionary of APL and J, see Cut.
_
|
Cut (_) is a dyadic primitive function in K which partitions its right argument by its left in the same sense as Partition. The left argument must be a non-decreasing vector of integers between 0 and the count of the right argument, inclusive (unlike indices with K's index origin of 0, the count itself is allowed). Each entry of the left argument indicates that a new partition should start just before that index in the right argument. When more than one partition is started in the same place, all but the last is left empty. Values before the first break are not included in the result.
When the left argument to _ is a single value rather than a list, it indicates Drop rather than Cut. Cut has some resemblance to Drop in that it omits every element whose index is less than the first element of the left argument.