Find
⍷

Find (⍷
) is a dyadic primitive function which tests if 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 allzero array).
'ANA'⍷'BANANA' ⍝ Matches may overlap
0 1 0 1 0 0
WEEK
SUNDAY
MONDAY
TUESDAY
WEDNESDAY
THURSDAY
FRIDAY
SATURDAY
'DAY'⍷WEEK ⍝ Find the pattern 'DAY' in WEEK; right arg may have higher rank
0 0 0 1 0 0 0 0 0
0 0 0 1 0 0 0 0 0
0 0 0 0 1 0 0 0 0
0 0 0 0 0 0 1 0 0
0 0 0 0 0 1 0 0 0
0 0 0 1 0 0 0 0 0
0 0 0 0 0 1 0 0 0
WEEK⍷'DAY' ⍝ WEEK not found in 'DAY'; left arg may have higher rank but it is never found
0 0 0
For nested arrays, Find tests for exact match between the elements.
'BIRDS' 'NEST'⍷'BIRDS' 'NEST' 'SOUP'
1 0 0
External links
Documentation