[libcxx] r242679 - Implement the plugin-based version of std::search. There are no searchers yet; those are coming soon.
Marshall Clow
mclow.lists at gmail.com
Mon Jul 20 08:40:27 PDT 2015
Author: marshall
Date: Mon Jul 20 10:40:27 2015
New Revision: 242679
URL: http://llvm.org/viewvc/llvm-project?rev=242679&view=rev
Log:
Implement the plugin-based version of std::search. There are no searchers yet; those are coming soon.
Added:
libcxx/trunk/test/std/experimental/algorithms/alg.search/
libcxx/trunk/test/std/experimental/algorithms/alg.search/search.pass.cpp
Modified:
libcxx/trunk/include/experimental/algorithm
Modified: libcxx/trunk/include/experimental/algorithm
URL: http://llvm.org/viewvc/llvm-project/libcxx/trunk/include/experimental/algorithm?rev=242679&r1=242678&r2=242679&view=diff
==============================================================================
--- libcxx/trunk/include/experimental/algorithm (original)
+++ libcxx/trunk/include/experimental/algorithm Mon Jul 20 10:40:27 2015
@@ -50,6 +50,12 @@ SampleIterator sample(PopulationIterator
_LIBCPP_BEGIN_NAMESPACE_LFTS
+template <class _ForwardIterator, class _Searcher>
+_LIBCPP_INLINE_VISIBILITY
+_ForwardIterator search(_ForwardIterator __f, _ForwardIterator __l, const _Searcher &__s)
+{ return __s(__f, __l); }
+
+
template <class _PopulationIterator, class _SampleIterator, class _Distance,
class _UniformRandomNumberGenerator>
_LIBCPP_INLINE_VISIBILITY
Added: libcxx/trunk/test/std/experimental/algorithms/alg.search/search.pass.cpp
URL: http://llvm.org/viewvc/llvm-project/libcxx/trunk/test/std/experimental/algorithms/alg.search/search.pass.cpp?rev=242679&view=auto
==============================================================================
--- libcxx/trunk/test/std/experimental/algorithms/alg.search/search.pass.cpp (added)
+++ libcxx/trunk/test/std/experimental/algorithms/alg.search/search.pass.cpp Mon Jul 20 10:40:27 2015
@@ -0,0 +1,43 @@
+//===----------------------------------------------------------------------===//
+//
+// The LLVM Compiler Infrastructure
+//
+// This file is dual licensed under the MIT and the University of Illinois Open
+// Source Licenses. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
+
+// <algorithm>
+
+// template<class ForwardIterator, class Searcher>
+// ForwardIterator search(ForwardIterator first, ForwardIterator last,
+// const Searcher& searcher);
+//
+// returns searcher.operator(first, last)
+//
+
+#include <experimental/algorithm>
+#include <cassert>
+
+#include "test_iterators.h"
+
+int searcher_called = 0;
+
+struct MySearcher {
+ template <typename Iterator>
+ Iterator operator() ( Iterator b, Iterator /*e*/) const
+ {
+ ++searcher_called;
+ return b;
+ }
+};
+
+
+int main() {
+ typedef int * RI;
+ static_assert(std::is_same<RI, decltype(std::experimental::search(RI(), RI(), MySearcher()))>::value, "" );
+
+ RI it{nullptr};
+ assert(it == std::experimental::search(it, it, MySearcher()));
+ assert(searcher_called == 1);
+}
More information about the cfe-commits
mailing list