c_set_union overloads

Synopses

Declared in <absl/algorithm/container.h>

Container‐based version of the <algorithm> std::set_union() function to return an iterator containing the union of two containers; duplicate values are not copied into the output.

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

» more...

Overload of c_set_union() 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_union(
    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

c1

The first sorted container.

c2

The second sorted container.

output

The output iterator receiving the union.

comp

The comparison used to order the elements.

Created with MrDocs