Currently we only have lower_bound and upper_bound like binary search functions, which is not enough to express exact binary search semantics.
This PR adds an exact_match argument in BinarySearch function, if it's set to True, we generate another found_match buffer that stores whether search is an exact match or not.
The generated found_match buffer could then be used in other scenarios such as #95 .
Currently we only have
lower_bound
andupper_bound
like binary search functions, which is not enough to express exact binary search semantics.This PR adds an
exact_match
argument inBinarySearch
function, if it's set to True, we generate anotherfound_match
buffer that stores whether search is an exact match or not.The generated
found_match
buffer could then be used in other scenarios such as #95 .