b = torch.where(gt, i_u, i_b)
        
        # Can we stop early?
        diff = (fu - x).abs().max() # max to continue until we get the furthest point
        n_steps += 1

        if max_steps and n_steps &gt;= max_steps:
            break

    return u</code></pre>
</details>
</dd>
<dt id="flow.utils.monotonic_increasing_bounded_bijective_search"><code class="name flex">
<span>def <span class="ident">monotonic_increasing_bounded_bijective_search</span></span>(<span>f, x, *args, a=0.0, b=1.0, eps=0.001,