flat_map_upper_bound_idx()

FL_NO_INLINE fl::size fl::detail::flat_map_upper_bound_idx	(	const void *	data,
		fl::size	n,
		const void *	key,
		const flat_map_ops &	ops )

Definition at line 35 of file flat_map_basic.cpp.hpp.

                                                                        {
    const char* base = static_cast<const char*>(data);
    fl::size first_idx = 0;
    fl::size count = n;
    while (count > 0) {
        fl::size step = count / 2;
        fl::size mid_idx = first_idx + step;
        const void* mid_key = base + mid_idx * ops.element_size;
        // upper_bound: advance past elements where !(key < elem.first).
        if (!ops.less_fn(ops.less_ctx, key, mid_key)) {
            first_idx = mid_idx + 1;
            count -= step + 1;
        } else {
            count = step;
        }
    }
    return first_idx;
}

References fl::FL_NO_EXCEPT, and fl::step().

Referenced by fl::flat_map< int, FxPtr >::upper_bound(), and fl::flat_map< int, FxPtr >::upper_bound().

Here is the call graph for this function:

Here is the caller graph for this function: