Function _set_intersection_idx

src/execution_plan/ops/op_value_hash_join.c:117–155

look up first intersecting cached record CR position returns false if no intersecting record is found

// look up first intersecting cached record CR position
// returns false if no intersecting record is found
static bool _set_intersection_idx
(
	OpValueHashJoin *op,
	SIValue v
) {
	op->intersect_idx = -1;
	op->number_of_intersections = 0;
	uint record_count = array_len(op->cached_records);

	uint leftmost_idx  = 0;
	uint rightmost_idx = 0;

	if(!_binarySearchLeftmost(&leftmost_idx, op->cached_records,
				array_len(op->cached_records), op->join_value_rec_idx, v)) {
		return false;
	}

	// value was found
	// idx points to the first intersecting record
	// update number_of_intersections to count how many
	// records share the same value
	op->intersect_idx = leftmost_idx;

	// count how many records share the same node
	// reduce search space by truncating left bound
	bool found = _binarySearchRightmost(&rightmost_idx,
			op->cached_records + leftmost_idx, record_count - leftmost_idx,
			op->join_value_rec_idx, v);
	UNUSED(found);
	ASSERT(found == true);

	// compensate index
	rightmost_idx += leftmost_idx;
	// +1 consider rightmost_idx == leftmost_idx
	op->number_of_intersections = rightmost_idx - leftmost_idx + 1;
	ASSERT(op->number_of_intersections > 0);

	return true;
}

// sorts cached records by joined value
void _sort_cached_records