Motivation

The time complexity of IntersectionSearchSpace is O(n_trials) for each trial. We can improve it to the constant time.

We filter trials here, but we can do it in the following for-loop.

Suggestion

We can move the filtering to the inside of the for-loop. The loop will finish immediately using cached_trial_number.

Additional context (optional)

No response