# Difference between revisions of "Suffix"

A suffix is a kind of subarray which is like a prefix except that values are taken from the end of the array rather than the beginning: a vector is a suffix of another vector if it is no longer than that vector, and shares all of its trailing elements. In leading axis theory, an array may be considered a suffix of another array of the same rank if the same relation holds with major cells in place of elements. The function Drop produces suffixes of its right argument when the left argument is non-negative.

In analogy to prefix testing, whether an array is a suffix may be tested using Take with a negated left argument and Match. The only difference is the negation.

isSuffix  {(()())  (-≢)}
'fix' isSuffix 'suffix'
1
'suff' isSuffix 'suffix'
0

We can also use an isPrefix function directly by reversing both its arguments. In the second definition below, this relation is written more succinctly in a tacit style using the Over operator.

isSuffix  {()isPrefix()}
isSuffix  isPrefix

In leading axis theory, the cell shape of each k-cell in an array is a suffix of that array's shape, while the frame is a prefix of the shape.

Iverson notation included the notion of a suffix vector ${\displaystyle \omega ^{j}(n)}$ consisting of ${\displaystyle n-j}$ zeros followed by ${\displaystyle j}$ ones; such a vector could be used to produce a length-${\displaystyle j}$ suffix of a length-${\displaystyle n}$ vector using Compress. The earliest versions of APL\360 adapted this notation by defining a suffix function n j before removing it in favor of Take with a negative left argument.