__gnu_parallel:...t_find_selector(3cxx)

πŸ’« NAME πŸ’«

__gnu_parallel::__adjacent_find_selector β€” bestie, it tests a predicate on two adjacent elements πŸ’…

Quick vibe check before we dive in: this page lives in the __gnu_parallel corner of libstdc++, manual section 3cxx β€” that's the C++ library manual, iykyk. πŸ¦‹


✨ SYNOPSIS ✨

Include it like this, no cap:

#include <find_selectors.h>

It inherits from __gnu_parallel::__generic_find_selector β€” so it's giving "I'm a find selector, obviously" energy. πŸ‘‘

🌸 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) β€” tests on one position. One (1) position. That's the whole job. πŸŽ€

πŸ¦‹ Detailed Description πŸ¦‹

Test predicate on two adjacent elements. That's it, that's the icon. Two adjacent elements, one predicate, main character energy. ✨


πŸ’– 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 marked [inline], so it's lowkey built different (affectionate). πŸ’œ

Parameters β€” the whole squad:

  • __begin1 β€” Begin iterator of first sequence. 🫢
  • __end1 β€” End iterator of first sequence. 🫢
  • __begin2 β€” Begin iterator of second sequence. 🫢
  • __pred β€” Find predicate. The actual vibes-checker. πŸ”₯

πŸŽ€ 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. Also [inline]. We stay winning. πŸ‘‘

Parameters:

  • __i1 β€” _Iterator on first sequence.
  • __i2 β€” _Iterator on second sequence (unused). Yes bestie, literally unused β€” it's there, it's cute, it's not doing anything. πŸ’€
  • __pred β€” Find predicate.
Heads up: keep the underscores exactly as written (__i1, __i2, __pred, _M_sequential_algorithm) β€” those leading underscores are part of the real names, not a typo moment. πŸ™ˆ

πŸ‘‘ Author πŸ‘‘

Generated automatically by Doxygen for libstdc++ from the source code. Not a human, just a robot doing robot things. πŸ€–


okay that's the whole page, mwah 🫢

This little man page dropped under the title __gnu_parallel:...t_find_selector(3cxx) β€” libstdc++, section 3cxx β€” and the footer it shipped with was libst__gnu_parallel:...t_find_selector(3cxx). Slay, go read find_selectors.h and stan a predicate. 🌸