Function _binarySearchRightmost

src/execution_plan/ops/op_value_hash_join.c:70–94

performs binary search, returns the rightmost index of a match assuming 'v' exists in 'array'

// performs binary search, returns the rightmost index of a match
// assuming 'v' exists in 'array'
static bool _binarySearchRightmost
(
	uint *idx,
	Record *array,
	uint array_len,
	int join_key_idx,
	SIValue v
) {
	ASSERT(idx != NULL);

	SIValue x;
	uint pos = 0;
	uint left = 0;
	uint right = array_len;

	while(left < right) {
		pos = (right + left) / 2;
		x = Record_Get(array[pos], join_key_idx);
		if(SIValue_Compare(v, x, NULL) < 0) right = pos;
		else left = pos + 1;
	}

	*idx = right - 1;
	return true;
}

// retrive the next intersecting record
// if such exists, otherwise returns NULL