Tries to find an element intersection between two arrays in a way that intersecting elements must be
at the tail of the first array and at the beginning of the second array.
For example, consider the following two arrays:
a1: {a, b, c, d, e}
a2: {d, e, f, g}
In this example, the intersection of tail of
a1 with head of
a2 is {d, e}
and consists of 2 overlapping elements.
The method takes the first array represented as a sub-array in buffer demarcated by an offset and length.
The second array is a fixed pattern to be matched. The method then compares the tail of the
array in the buffer with the head of the pattern and returns the number of intersecting elements,
or zero in case the two arrays do not intersect tail to head.