3,038
edits
(Created page with "{{Built-in|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 mu...") |
No edit summary |
||
Line 1: | Line 1: | ||
{{Built-in|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 [[Index|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]]. | {{Built-in|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 [[Index|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 <source lang=k inline>_</source> 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. | |||
Cut is related to [[Partition]] and [[Partitioned Enclose]]: see [[Partition representations]]. | Cut is related to [[Partition]] and [[Partitioned Enclose]]: see [[Partition representations]]. |