Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Remaining find algorithms implemented, N4071 #1223

Merged
merged 18 commits into from Aug 23, 2014
Merged

Remaining find algorithms implemented, N4071 #1223

merged 18 commits into from Aug 23, 2014

Conversation

Syntaf
Copy link
Member

@Syntaf Syntaf commented Aug 13, 2014

The remaining find algorithms have been finished and are ready to merge into the master branch. They are

  • first_first_of
  • adjacent_find

@@ -4,6 +4,8 @@
# file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

set(tests
adjacentfind
adjacentfind_binary
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Tabs --> spaces?

@hkaiser hkaiser mentioned this pull request Aug 13, 2014
47 tasks
@hkaiser
Copy link
Member

hkaiser commented Aug 13, 2014

This is related to #1141: Implement N4071 on top of HPX

}
}
return result;
return std::find_end(first1,last1,first2,last2,op);
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

May I ask to more strictly conform to code formatting guidelines, i.e. keep formatting consistent inside each file (here: add spaces after ',')?

@hkaiser
Copy link
Member

hkaiser commented Aug 13, 2014

In order for the new algorithms to show up in the generated documentation index those will need to be added to the file hpx.idx.

@hkaiser
Copy link
Member

hkaiser commented Aug 13, 2014

Test this please

@hkaiser hkaiser added this to the 0.9.9 milestone Aug 13, 2014
@@ -82,6 +82,8 @@ parallel::find "find" "hpx\.parallel\.v1\.find$"
parallel::find_if "find_if" "hpx\.parallel\.v1\.find_if$"
parallel::find_if_not "find_if_not" "hpx\.parallel\.v1\.find_if_not.*"
parallel::find_end "find_end" "hpx\.parallel\.v1\.find_end_id.*"
parallel::find_first_of "find_first_of" "hpx\.parallel\.v1\.find_end_id.*"
parallel::adjacent_find "adjacent_find" "hpx\.parallel\.v1\adjacent_find.*"
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

tabs -> spaces

@@ -468,6 +470,7 @@ namespace hpx { namespace parallel { HPX_INLINE_NAMESPACE(v1)
}
}
return result;
*/
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

No need to keep the inefficient manual code around

hkaiser added a commit that referenced this pull request Aug 23, 2014
Remaining find algorithms implemented, N4071
@hkaiser hkaiser merged commit fa863cf into master Aug 23, 2014
@hkaiser hkaiser deleted the N4071 branch August 23, 2014 02:12
@hkaiser hkaiser added this to Merged to master in Standard Algorithms Jun 10, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
Standard Algorithms
  
Merged to master
Development

Successfully merging this pull request may close these issues.

None yet

3 participants