__gnu_para...f_selector(3)
π __gnu_para...f_selector(3) π
okay bestie, welcome to the manual page for __gnu_para...f_selector(3) from the Library Functions Manual β manual name folded in right here like a lil name tag π«Ά. This one is all about __gnu_parallel::find_first_of_selector, and yes it has main character energy in the most C++ way possible.
πΈ NAME πΈ
Test predicate on several elements.
Thatβs the whole NAME, no cap β itβs literally giving βtest predicate on several elementsβ and nothing else π .
π SYNOPSIS π
Inherits __gnu_parallel::generic_find_selector.
π Public Member Functions π
find_first_of_selector (ForwardIterator begin, ForwardIterator end)β constructor vibes, bestie.operator()β the test-on-one-position girlie.
template<typename RandomAccessIterator1 , typename RandomAccessIterator2 , typename Pred > bool operator() (RandomAccessIterator1 i1, RandomAccessIterator2 i2, Pred pred)
sequential_algorithmβ the corresponding sequential algorithm on a sequence, periodt.
template<typename RandomAccessIterator1 , typename RandomAccessIterator2 , typename Pred > std::pair< RandomAccessIterator1, RandomAccessIterator2 > sequential_algorithm (RandomAccessIterator1 begin1, RandomAccessIterator1 end1, RandomAccessIterator2 begin2, Pred pred)
π¦ Public Attributes π¦
ForwardIterator beginForwardIterator end
No extra notes on these two in the original β they just exist and slay β¨.
β¨ Detailed Description β¨
okay so the struct itself is:
template<typename ForwardIterator> struct __gnu_parallel::find_first_of_selector< ForwardIterator >
and its whole personality is: Test predicate on several elements.
It also says: Definition at line 152 of file find_selectors.h. β iconic file placement, honestly ππ.
π§ Member Function Documentation π§
π
operator() π
Full signature, preserved exactly:
template<typename ForwardIterator > template<typename RandomAccessIterator1
, typename RandomAccessIterator2 , typename Pred > bool
__gnu_parallel::find_first_of_selector< ForwardIterator >::operator()
(RandomAccessIterator1 i1, RandomAccessIterator2 i2, Pred pred) [inline]
What does it do? Test on one position. Thatβs the line, bestie β short, sweet, and to the point.
Parameters, because we keep every detail:
i1β Iterator on first sequence.i2β Iterator on second sequence (unused). Yes, unused β sheβs just there for the vibes π.predβ Find predicate.
And the receipt: Definition at line 167 of file find_selectors.h.
π§ sequential_algorithm π§
Full signature, also preserved exactly:
template<typename ForwardIterator > template<typename RandomAccessIterator1
, typename RandomAccessIterator2 , typename Pred >
std::pair<RandomAccessIterator1, RandomAccessIterator2>
__gnu_parallel::find_first_of_selector< ForwardIterator
>::sequential_algorithm (RandomAccessIterator1 begin1,
RandomAccessIterator1 end1, RandomAccessIterator2 begin2, Pred pred)
[inline]
Its description is: Corresponding sequential algorithm on a sequence. Lowkey the responsible older sibling of the operation π₯.
Parameters, all of them:
begin1β Begin iterator of first sequence.end1β End iterator of first sequence.begin2β Begin iterator of second sequence.predβ Find predicate.
And the receipt again: Definition at line 184 of file find_selectors.h.
π Author π
No human author to hype up here β it literally says:
Generated automatically by Doxygen for libstdc++ from the source code.
Auto-generated and still serving looks, we love to see it π€π .
okay thatβs the whole page, bestie! Sending you libstdc++ source/version vibes dated 21 Apr 2009, with the title __gnu_para...f_selector(3) β periodt πβ¨π¦
π¦ where this page comes from
- nixpkgs unstable: std-man-pages 4.4.0
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms