Find

is a dyadic primitive function which indicates where the left argument appears as a contiguous subarray of the right argument.

Examples
Both arguments can be arrays of any shape. The entire left argument is tested against each position in the right argument. The result is a boolean array having the same shape as the right argument, where a 1 indicates the position of the first element of the matched subarray (which can be seen as the "leftmost" or "top left" position in case of a vector or matrix). If the left argument has lower rank, it is treated as if the shape is prepended with ones. If the left argument has higher rank, Find does not error, but it is never found in the right argument (resulting in an all-zero array).

For nested arrays, Find tests for exact match between the elements.

Model
Find can be modelled as follows (for non-empty left arguments), where all possible subarrays of the right argument are checked to see if they match the left argument:

Empty left argument
Implementations differ in their treatment of empty left arguments:
 * APL2, GNU APL, NARS2000, and Dyalog APL indicate positions where the left argument can fit, even if the prototypes don't match.
 * APLX never finds any empty arrays.
 * APL+ finds empty arrays everywhere, even where they would extend beyond the edges of the right argument.

The prototype is never used, in contrast to Match, which in many APLs compares prototypes of empty arrays. The behavior may come from the use of the inner product  in early flat APLs where Match is not a primitive; this function naturally checks elements and not the prototype. Adin Falkoff presented code for Find-like functions using  at APL79.

Correspondingly, the above model can be amended to match the behaviour of the primitive (in APL2, etc.) by replacing the  with   which ignores prototypes, only comparing shape and elements:

Documentation

 * Dyalog
 * APLX
 * J Dictionary, NuVoc
 * BQN