__gnu_para...f_selector(3)

πŸ“¦ version 4.4.0, in nixpkgs unstable

πŸŽ€ __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 begin
  • ForwardIterator 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