////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2025-2026. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/container for documentation. // ////////////////////////////////////////////////////////////////////////////// #ifndef BOOST_CONTAINER_EXPERIMENTAL_SEGMENTED_FIND_HPP #define BOOST_CONTAINER_EXPERIMENTAL_SEGMENTED_FIND_HPP #ifndef BOOST_CONFIG_HPP # include #endif #if defined(BOOST_HAS_PRAGMA_ONCE) # pragma once #endif #include #include #include #include namespace boost { namespace container { template InpIter segmented_find(InpIter first, Sent last, const T& BOOST_RESTRICT value); namespace detail_algo { template BOOST_CONTAINER_FORCEINLINE typename algo_enable_if_c< !Tag::value || is_sentinel::value, InpIter>::type segmented_find_dispatch(InpIter first, Sent last, const T& BOOST_RESTRICT value, Tag, Cat) { BOOST_CONTAINER_SEGMENTED_UNROLL(4) for(; first != last; ++first) if(*first == value) break; return first; } template SegIter segmented_find_dispatch (SegIter first, SegIter last, const T& BOOST_RESTRICT value, segmented_iterator_tag, Cat) { typedef segmented_iterator_traits traits; typedef typename traits::local_iterator local_iterator; typedef typename traits::segment_iterator segment_iterator; typedef typename segmented_iterator_traits::is_segmented_iterator is_local_seg_t; typedef typename iterator_traits::iterator_category local_cat_t; segment_iterator sfirst = traits::segment(first); const segment_iterator slast = traits::segment(last); if(sfirst == slast) { const local_iterator ll = traits::local(last); const local_iterator r = (segmented_find_dispatch)(traits::local(first), ll, value, is_local_seg_t(), local_cat_t()); if (r != ll) return traits::compose(sfirst, r); } else { //First segment { const local_iterator le = traits::end(sfirst); const local_iterator r = (segmented_find_dispatch)(traits::local(first), le, value, is_local_seg_t(), local_cat_t()); if (r != le) return traits::compose(sfirst, r); } //Middle segments for (++sfirst; sfirst != slast; ++sfirst) { const local_iterator le = traits::end(sfirst); const local_iterator r = (segmented_find_dispatch)(traits::begin(sfirst), le, value, is_local_seg_t(), local_cat_t()); if (r != le) return traits::compose(sfirst, r); } //Last segment { const local_iterator ll = traits::local(last); const local_iterator r = (segmented_find_dispatch)(traits::begin(slast), traits::local(last), value, is_local_seg_t(), local_cat_t()); if (r != ll) return traits::compose(sfirst, r); } } return last; } } // namespace detail_algo //! Returns an iterator to the first element equal to \c value //! in [first, last), or \c last if not found. template BOOST_CONTAINER_FORCEINLINE InpIter segmented_find(InpIter first, Sent last, const T& BOOST_RESTRICT value) { typedef segmented_iterator_traits traits; return detail_algo::segmented_find_dispatch (first, last, value, typename traits::is_segmented_iterator(), typename iterator_traits::iterator_category()); } } // namespace container } // namespace boost #include #endif // BOOST_CONTAINER_EXPERIMENTAL_SEGMENTED_FIND_HPP