LineageOS/android_external_libcxx
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Implement P0253R1: Fixing a design mistake in the searchers interface.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@262928 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Marshall Clow
2016-03-08 15:12:52 +00:00
parent 3e0808efb8
commit f6d6b51b63
16 changed files with 64 additions and 54 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
test/std/experimental/func/func.searchers/func.searchers.boyer_moore/default.pass.cpp
View File

@@ -21,7 +21,7 @@
// Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate());
//
// template<class RandomAccessIterator2>
// RandomAccessIterator2
// pair<RandomAccessIterator2, RandomAccessIterator2>
// operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const;
//
// private:

2
test/std/experimental/func/func.searchers/func.searchers.boyer_moore/hash.pass.cpp
View File

@@ -21,7 +21,7 @@
// Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate());
//
// template<class RandomAccessIterator2>
// RandomAccessIterator2
// pair<RandomAccessIterator2, RandomAccessIterator2>
// operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const;
//
// private:

2
test/std/experimental/func/func.searchers/func.searchers.boyer_moore/hash.pred.pass.cpp
View File

@@ -21,7 +21,7 @@
// Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate());
//
// template<class RandomAccessIterator2>
// RandomAccessIterator2
// pair<RandomAccessIterator2, RandomAccessIterator2>
// operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const;
//
// private:

2
test/std/experimental/func/func.searchers/func.searchers.boyer_moore/pred.pass.cpp
View File

@@ -21,7 +21,7 @@
// Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate());
//
// template<class RandomAccessIterator2>
// RandomAccessIterator2
// pair<RandomAccessIterator2, RandomAccessIterator2>
// operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const;
//
// private:

2
test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/default.pass.cpp
View File

@@ -21,7 +21,7 @@
// Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate());
//
// template<class RandomAccessIterator2>
// RandomAccessIterator2
// pair<RandomAccessIterator2, RandomAccessIterator2>
// operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const;
//
// private:

2
test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/hash.pass.cpp
View File

@@ -21,7 +21,7 @@
// Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate());
//
// template<class RandomAccessIterator2>
// RandomAccessIterator2
// pair<RandomAccessIterator2, RandomAccessIterator2>
// operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const;
//
// private:

2
test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/hash.pred.pass.cpp
View File

@@ -21,7 +21,7 @@
// Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate());
//
// template<class RandomAccessIterator2>
// RandomAccessIterator2
// pair<RandomAccessIterator2, RandomAccessIterator2>
// operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const;
//
// private:

2
test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/pred.pass.cpp
View File

@@ -21,7 +21,7 @@
// Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate());
//
// template<class RandomAccessIterator2>
// RandomAccessIterator2
// pair<RandomAccessIterator2, RandomAccessIterator2>
// operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const;
//
// private:

3
test/std/experimental/func/func.searchers/func.searchers.default/default.pass.cpp
View File

@@ -20,7 +20,8 @@
// : __first_(__f), __last_(__l), __pred_(__p) {}
//
// template <typename _ForwardIterator2>
// _ForwardIterator2 operator () (_ForwardIterator2 __f, _ForwardIterator2 __l) const {
// pair<_ForwardIterator2, _ForwardIterator2>
// operator () (_ForwardIterator2 __f, _ForwardIterator2 __l) const {
// return std::search(__f, __l, __first_, __last_, __pred_);
// }
//

3
test/std/experimental/func/func.searchers/func.searchers.default/default.pred.pass.cpp
View File

@@ -20,7 +20,8 @@
// : __first_(__f), __last_(__l), __pred_(__p) {}
//
// template <typename _ForwardIterator2>
// _ForwardIterator2 operator () (_ForwardIterator2 __f, _ForwardIterator2 __l) const {
// pair<_ForwardIterator2, _ForwardIterator2>
// operator () (_ForwardIterator2 __f, _ForwardIterator2 __l) const {
// return std::search(__f, __l, __first_, __last_, __pred_);
// }
//