This is a much more efficient way of determining if items in one VV are found in a second, than by searching repeatedly in a loop. The returned GS_LONG VV contains the same number of items as the "search items" VV, and contains -1 for items where the value is not found, and the index of items that are found. Comparisons are case-tolerant. Non-string VVs are converted to string type VVs (element size 24) internally. The method requires that the VV items be sorted, and will do so internally. Since the input VVs may already be sorted, the method will run faster if this stage can be skipped.

public static void FindStringItems(
	CVV oVV1,
	CVV oVV2,
	int i3,
	int i4,
	int i5,
	CVV oVV6
)

Public Shared Sub FindStringItems ( 
	oVV1 As CVV,
	oVV2 As CVV,
	i3 As Integer,
	i4 As Integer,
	i5 As Integer,
	oVV6 As CVV
)

public:
static void FindStringItems(
	CVV^ oVV1, 
	CVV^ oVV2, 
	int i3, 
	int i4, 
	int i5, 
	CVV^ oVV6
)

static member FindStringItems : 
        oVV1 : CVV * 
        oVV2 : CVV * 
        i3 : int * 
        i4 : int * 
        i5 : int * 
        oVV6 : CVV -> unit