[#absl-c_set_intersection-0f]
= xref:absl.adoc[absl]::c_set_intersection
:relfileprefix: ../
:mrdocs:

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


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    typename C1,
    typename C2,
    typename OutputIterator>
requires !container_algorithm_internal::IsUnorderedContainer<C1>::value && !container_algorithm_internal::IsUnorderedContainer<C2>::value
constexpr
OutputIterator
xref:absl/c_set_intersection-095.adoc[c_set_intersection](
    C1 const& c1,
    C2 const& c2,
    OutputIterator output);
----

[.small]#xref:absl/c_set_intersection-095.adoc[_» more..._]#

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


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    typename C1,
    typename C2,
    typename OutputIterator,
    typename LessThan>
requires !container_algorithm_internal::IsUnorderedContainer<C1>::value && !container_algorithm_internal::IsUnorderedContainer<C2>::value
constexpr
OutputIterator
xref:absl/c_set_intersection-090.adoc[c_set_intersection](
    C1 const& c1,
    C2 const& c2,
    OutputIterator output,
    LessThan&& comp);
----

[.small]#xref:absl/c_set_intersection-090.adoc[_» more..._]#

== Return Value

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

== Parameters

[cols="1,4"]
|===
| Name| Description
| *c1*
| The first sorted container.
| *c2*
| The second sorted container.
| *output*
| The output iterator receiving the intersection.
| *comp*
| The comparison used to order the elements.
|===


[.small]#Created with https://www.mrdocs.com[MrDocs]#