absl::c_set_intersection

c_set_intersection overloads

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...

Return Value

An iterator to the end of the written range in the output.

Parameters

Name

Description

The first sorted container.

The second sorted container.

output

The output iterator receiving the intersection.

comp

The comparison used to order the elements.

Created with MrDocs