private int getMatchCountFromStart() {

		// scan past the beginning of all equal items
		int n = 0;
		int xl = lengthOf(xSource);
		int yl = lengthOf(ySource);
		while (n < xl && n < yl) {
			T xt = valueOf(xSource, n);
			T yt = valueOf(ySource, n);
			if (!matches(xt, yt)) {
				return n;
			}
			n++;
		}

		return 0;
	}
Return the value at the given 0-based offset
 
@param i the input sequence (x or y)
@param offset the offset
@return the value
Ghidra/Framework/Generic/src/main/java/generic/algorithms/ReducingLcs.java