This is a much more efficient way of determining if items in one LST are found in a second, than by calling iFindItem_LST repeatedly in a loop. The returned INT VV contains the same number of items as the "search items" LST, and contains -1 for items where the value is not found, and the index of items that are found. Comparisons are case-tolerant.

public void FindItems(
	int i1,
	CLST oLST2,
	CVV oVV3
)

Public Sub FindItems ( 
	i1 As Integer,
	oLST2 As CLST,
	oVV3 As CVV
)

public:
void FindItems(
	int i1, 
	CLST^ oLST2, 
	CVV^ oVV3
)

member FindItems : 
        i1 : int * 
        oLST2 : CLST * 
        oVV3 : CVV -> unit