merge_machine/preprocess_fields_v3.py
def check_non_consecutive_subsequence(superStr, subStr):
	'''Checks if b is a non-consecutive subsequence of a, and returns the start and end indexes in a. '''
	a, b = convert_codes(superStr), convert_codes(subStr)
	pos = 0
	res = -1
	for i, ch in enumerate(a):
		if pos < len(b) and ch == b[pos]:
			if res < 0: res = i
			pos += 1
	return (res, i) if pos == len(b) else None
Checks if b is a non-consecutive subsequence of a, and returns the start and end indexes in a. 
Checks if b is a non-consecutive subsequence of a, and returns the start and end indexes in a.
Checks if b is a non - consecutive subsequence of a and returns the start and end indexes in a .
def check_non_consecutive_subsequence(superStr, subStr):
	a, b = convert_codes(superStr), convert_codes(subStr)
	pos = 0
	res = -1
	for i, ch in enumerate(a):
		if pos < len(b) and ch == b[pos]:
			if res < 0: res = i
			pos += 1
	return (res, i) if pos == len(b) else None
def check_non_consecutive_subsequence ( superStr , subStr ) : a , b = convert_codes ( superStr ) , convert_codes ( subStr ) pos = 0 res = - 1 for i , ch in enumerate ( a ) : if pos < len ( b ) and ch == b [ pos ] : if res < 0 : res = i pos += 1 return ( res , i ) if pos == len ( b ) else None
Checks if b is a non-consecutive subsequence of a, and returns the start and end indexes in a.
Checks if b is a non - consecutive subsequence of a and returns the start and end indexes in a .
'''Checks if b is a non-consecutive subsequence of a, and returns the start and end indexes in a. '''
superStr
subStr