init

Telegram/ThirdParty/range-v3/test/algorithm/max_element.cpp

@@ -0,0 +1,172 @@
+// Range v3 library
+//
+//  Copyright Eric Niebler 2014-present
+//
+//  Use, modification and distribution is subject to the
+//  Boost Software License, Version 1.0. (See accompanying
+//  file LICENSE_1_0.txt or copy at
+//  http://www.boost.org/LICENSE_1_0.txt)
+//
+// Project home: https://github.com/ericniebler/range-v3
+
+//===----------------------------------------------------------------------===//
+//
+//                     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.
+//
+//===----------------------------------------------------------------------===//
+
+#include <memory>
+#include <numeric>
+#include <random>
+#include <algorithm>
+#include <range/v3/core.hpp>
+#include <range/v3/algorithm/max_element.hpp>
+
+#include "../array.hpp"
+#include "../simple_test.hpp"
+#include "../test_utils.hpp"
+#include "../test_iterators.hpp"
+
+RANGES_DIAGNOSTIC_IGNORE_GLOBAL_CONSTRUCTORS
+
+namespace
+{
+    std::mt19937 gen;
+
+    template<class Iter, class Sent = Iter>
+    void
+    test_iter(Iter first, Sent last)
+    {
+        Iter i = ranges::max_element(first, last);
+        if (first != last)
+        {
+            for (Iter j = first; j != last; ++j)
+                CHECK(!(*i < *j));
+        }
+        else
+            CHECK(i == last);
+
+        auto rng = ::MakeTestRange(first, last);
+        i = ranges::max_element(rng);
+        if (first != last)
+        {
+            for (Iter j = first; j != last; ++j)
+                CHECK(!(*i < *j));
+        }
+        else
+            CHECK(i == last);
+
+        auto j = ranges::max_element(std::move(rng));
+        CHECK(::is_dangling(j));
+    }
+
+    template<class Iter, class Sent = Iter>
+    void
+    test_iter(unsigned N)
+    {
+        std::unique_ptr<int[]> a{new int[N]};
+        std::iota(a.get(), a.get()+N, 0);
+        std::shuffle(a.get(), a.get()+N, gen);
+        test_iter(Iter(a.get()), Sent(a.get()+N));
+    }
+
+    template<class Iter, class Sent = Iter>
+    void
+    test_iter()
+    {
+        test_iter<Iter, Sent>(0);
+        test_iter<Iter, Sent>(1);
+        test_iter<Iter, Sent>(2);
+        test_iter<Iter, Sent>(3);
+        test_iter<Iter, Sent>(10);
+        test_iter<Iter, Sent>(1000);
+    }
+
+    template<class Iter, class Sent = Iter>
+    void
+    test_iter_comp(Iter first, Sent last)
+    {
+        Iter i = ranges::max_element(first, last, std::greater<int>());
+        if (first != last)
+        {
+            for (Iter j = first; j != last; ++j)
+                CHECK(!std::greater<int>()(*i, *j));
+        }
+        else
+            CHECK(i == last);
+
+        auto rng = ::MakeTestRange(first, last);
+        i = ranges::max_element(rng, std::greater<int>());
+        if (first != last)
+        {
+            for (Iter j = first; j != last; ++j)
+                CHECK(!std::greater<int>()(*i, *j));
+        }
+        else
+            CHECK(i == last);
+
+        auto res = ranges::max_element(std::move(rng), std::greater<int>());
+        CHECK(::is_dangling(res));
+    }
+
+    template<class Iter, class Sent = Iter>
+    void
+    test_iter_comp(unsigned N)
+    {
+        std::unique_ptr<int[]> a{new int[N]};
+        std::iota(a.get(), a.get()+N, 0);
+        std::shuffle(a.get(), a.get()+N, gen);
+        test_iter_comp(Iter(a.get()), Sent(a.get()+N));
+    }
+
+    template<class Iter, class Sent = Iter>
+    void
+    test_iter_comp()
+    {
+        test_iter_comp<Iter, Sent>(0);
+        test_iter_comp<Iter, Sent>(1);
+        test_iter_comp<Iter, Sent>(2);
+        test_iter_comp<Iter, Sent>(3);
+        test_iter_comp<Iter, Sent>(10);
+        test_iter_comp<Iter, Sent>(1000);
+    }
+
+    struct S
+    {
+        int i;
+    };
+}
+
+int main()
+{
+    test_iter<ForwardIterator<const int*> >();
+    test_iter<BidirectionalIterator<const int*> >();
+    test_iter<RandomAccessIterator<const int*> >();
+    test_iter<const int*>();
+    test_iter<ForwardIterator<const int*>, Sentinel<const int*>>();
+    test_iter<BidirectionalIterator<const int*>, Sentinel<const int*>>();
+    test_iter<RandomAccessIterator<const int*>, Sentinel<const int*>>();
+
+    test_iter_comp<ForwardIterator<const int*> >();
+    test_iter_comp<BidirectionalIterator<const int*> >();
+    test_iter_comp<RandomAccessIterator<const int*> >();
+    test_iter_comp<const int*>();
+    test_iter_comp<ForwardIterator<const int*>, Sentinel<const int*>>();
+    test_iter_comp<BidirectionalIterator<const int*>, Sentinel<const int*>>();
+    test_iter_comp<RandomAccessIterator<const int*>, Sentinel<const int*>>();
+
+    // Works with projections?
+    S s[] = {S{1},S{2},S{3},S{4},S{40},S{5},S{6},S{7},S{8},S{9}};
+    S const *ps = ranges::max_element(s, std::less<int>{}, &S::i);
+    CHECK(ps->i == 40);
+
+    {
+        constexpr auto a = test::array<int, 10>{{1, 2, 3, 4, 40, 5, 6, 7, 8, 9}};
+        STATIC_CHECK(ranges::max_element(a) == ranges::begin(a) + 4);
+    }
+
+    return test_result();
+}