__gnu_para...d_selector(3)

💖 NAME 💖

__gnu_parallel::__adjacent_find_selector — bestie, it tests a predicate on two adjacent elements. That's the whole vibe. No cap.

This lil cutie lives in the Library Functions Manual for libstdc++, and honestly? It's giving ✨niche but iconic✨.

---

🌸 SYNOPSIS 🌸

#include <find_selectors.h>

Inherits __gnu_parallel::__generic_find_selector. So it's a glow-up of the generic find selector, as it should be 💅.

🎀 Public Member Functions 🎀

• template<typename _RAIter1, typename _RAIter2, typename _Pred> std::pair< _RAIter1, _RAIter2 > _M_sequential_algorithm (_RAIter1 __begin1, _RAIter1 __end1, _RAIter2 __begin2, _Pred __pred) — the corresponding sequential algorithm on a sequence, fr fr.
• template<typename _RAIter1, typename _RAIter2, typename _Pred> bool operator() (_RAIter1 __i1, _RAIter2 __i2, _Pred __pred) — the test on one position. One. Single. Position. 💀

---

🦋 Detailed Description 🦋

Test predicate on two adjacent elements.

Yeah bestie, that's it. That's the whole personality. Two elements. Right next to each other. Predicate goes brrr. ✨

---

👑 Member Function Documentation 👑

💜 _M_sequential_algorithm

template<typename _RAIter1, typename _RAIter2, typename _Pred> std::pair<
    _RAIter1, _RAIter2 >
    __gnu_parallel::__adjacent_find_selector::_M_sequential_algorithm
    (_RAIter1 __begin1, _RAIter1 __end1, _RAIter2 __begin2, _Pred __pred) [inline]

Corresponding sequential algorithm on a sequence. It's the non-parallel twin, the "do it the normal way" bestie, and it's marked [inline] so the compiler's like "yeah okay I got u" 🫶

🌈 Parameters 🌈

• __begin1 — begin iterator of first sequence. The starting point, the main character's entrance 🎬
• __end1 — end iterator of first sequence. The exit. Periodt.
• __begin2 — begin iterator of second sequence. Second sequence said "hello I'm here too" 💖
• __pred — find predicate. The little logic gremlin doing the actual deciding 🧚

References std::make_pair(). It literally hands u a std::pair, and std::make_pair() is the plug. 💅

---

🍓 operator()

template<typename _RAIter1, typename _RAIter2, typename _Pred> bool
    __gnu_parallel::__adjacent_find_selector::operator() (_RAIter1 __i1,
    _RAIter2 __i2, _Pred __pred) [inline]

Test on one position. One position only, bestie. Don't overreach. It's [inline] too, so no function-call drama ✨

🌸 Parameters 🌸

• __i1 — _Iterator on first sequence. (Yes, that leading underscore is in the docs, I don't make the rules 🙈)
• __i2 — _Iterator on second sequence (unused). Not me showing up to the function and not being used 😭 iconic behavior honestly.
• __pred — find predicate. Again. Doing the work. Slay.

Heads up bestie: __i2 is genuinely documented as unused. That's not a typo, that's canon. 💀

---

✨ Author ✨

Generated automatically by Doxygen for libstdc++ from the source code. So like... not a human, not a bestie, just a documentation robot doing its lil thing 🤖💖

---

And that's the whole page! This manual came from the libstdc++ library docs — big love to libstdc++, the version that keeps all our C++ dreams alive 🌟 — and yeah, this page is fully Doxygen-generated, so if u spot anything cursed, blame the generator, not me 💅✨