StarMirror/CppCoreGuidelines
1
0
Fork 0
mirror of https://github.com/isocpp/CppCoreGuidelines.git synced 2024-03-22 13:30:58 +08:00
Code Issues Projects Releases Wiki Activity

Merge pull request #724 from fmorgner/master

Browse Source 
Move whitespace to right place
This commit is contained in:
Gabriel Dos Reis 2016-09-06 14:58:21 -07:00 committed by GitHub
commit 031379332d
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
CppCoreGuidelines.md
View File

@ -11280,7 +11280,7 @@ Consider:
template <class ForwardIterator, class T> template <class ForwardIterator, class T>
bool binary_search(ForwardIterator first, ForwardIterator last, const T& val); bool binary_search(ForwardIterator first, ForwardIterator last, const T& val);
`binary_search(begin(c) ,end(c) ,7)` will tell you whether `7` is in `c` or not. `binary_search(begin(c), end(c), 7)` will tell you whether `7` is in `c` or not.
However, it will not tell you where that `7` is or whether there are more than one `7`. However, it will not tell you where that `7` is or whether there are more than one `7`.
Sometimes, just passing the minimal amount of information back (here, `true` or `false`) is sufficient, but a good interface passes Sometimes, just passing the minimal amount of information back (here, `true` or `false`) is sufficient, but a good interface passes
@ -11299,7 +11299,7 @@ However, `lower_bound` still doesn't return enough information for all uses, so
`equal_range` returns a `pair` of iterators specifying the first and one beyond last match. `equal_range` returns a `pair` of iterators specifying the first and one beyond last match.
auto r = equal_range(begin(c), end(c) ,7); auto r = equal_range(begin(c), end(c), 7);
for (auto p = r.first(); p != r.second(), ++p) for (auto p = r.first(); p != r.second(), ++p)
cout << *p << '\n'; cout << *p << '\n';