absl::c_set_intersection

Synopses

Declared in <absl/algorithm/container.h>

Container-based version of the <algorithm> std::set_intersection() function to return an iterator containing the intersection of two sorted containers.

template<
    typename C1,
    typename C2,
    typename OutputIterator>
requires !container_algorithm_internal::IsUnorderedContainer<C1>::value && !container_algorithm_internal::IsUnorderedContainer<C2>::value
constexpr
OutputIterator
c_set_intersection(
    C1 const& c1,
    C2 const& c2,
    OutputIterator output);

» more...

Overload of c_set_intersection() for performing a merge using a comp other than operator<.

template<
    typename C1,
    typename C2,
    typename OutputIterator,
    typename LessThan>
requires !container_algorithm_internal::IsUnorderedContainer<C1>::value && !container_algorithm_internal::IsUnorderedContainer<C2>::value
constexpr
OutputIterator
c_set_intersection(
    C1 const& c1,
    C2 const& c2,
    OutputIterator output,
    LessThan&& comp);

» more...