__gnu_para...d_selector(3)

okay so bestie, welcome to the __gnu_parallel::adjacent_find_selector(3) page — it's chilling in the Library Functions Manual, and it is exactly what it sounds like: a selector that tests a predicate on two adjacent elements. adjacent. like two besties linking pinkies. the vibe is immaculate 💅

🌸 NAME 🌸

__gnu_parallel::adjacent_find_selector — Test predicate on two adjacent elements. 💖

✨ SYNOPSIS ✨

Inherits __gnu_parallel::generic_find_selector.

💅 Public Member Functions 💅

These are the public member functions, kept exactly character-for-character because we do not mess with signatures, no cap:

template<typename RandomAccessIterator1 , typename RandomAccessIterator2
    , typename Pred > bool operator() (RandomAccessIterator1 i1,
    RandomAccessIterator2 i2, Pred pred)

template<typename RandomAccessIterator1 , typename RandomAccessIterator2
    , typename Pred > std::pair< RandomAccessIterator1,
    RandomAccessIterator2 > sequential_algorithm (RandomAccessIterator1
    begin1, RandomAccessIterator1 end1, RandomAccessIterator2 begin2,
    Pred pred)

🦋 Detailed Description 🦋

Okay so the whole point: Test predicate on two adjacent elements.

Definition at line 80 of file find_selectors.h.

🔥 Member Function Documentation 🔥

🎀 __gnu_parallel::adjacent_find_selector::operator() 🎀

Full signature, verbatim:

template<typename RandomAccessIterator1 , typename RandomAccessIterator2 ,
    typename Pred > bool __gnu_parallel::adjacent_find_selector::operator()
    (RandomAccessIterator1 i1, RandomAccessIterator2 i2, Pred pred) [inline]

What it does: Test on one position. very demure. very mindful. ✨

Parameters:

• i1 — Iterator on first sequence.
• i2 — Iterator on second sequence (unused). she's just there for moral support 🙈
• pred — Find predicate.

Definition at line 90 of file find_selectors.h.

🌈 __gnu_parallel::adjacent_find_selector::sequential_algorithm 🌈

Full signature, verbatim:

template<typename RandomAccessIterator1 , typename RandomAccessIterator2 ,
    typename Pred > std::pair<RandomAccessIterator1, RandomAccessIterator2>
    __gnu_parallel::adjacent_find_selector::sequential_algorithm
    (RandomAccessIterator1 begin1, RandomAccessIterator1 end1,
    RandomAccessIterator2 begin2, Pred pred) [inline]

What it does: Corresponding sequential algorithm on a sequence. iconic behavior honestly 🦋

Parameters:

• begin1 — Begin iterator of first sequence.
• end1 — End iterator of first sequence.
• begin2 — Begin iterator of second sequence.
• pred — Find predicate.

Definition at line 105 of file find_selectors.h.

👑 Author 👑

Generated automatically by Doxygen for libstdc++ from the source code. no human author, just automation serving looks 🤖💅

---

And that's the whole page, bestie — brought to you by libstdc++, dated 21 Apr 2009, with footer energy that goes __gnu_para...d_selector(3). periodt 💖✨