HomeSort by relevance Sort by last modified time
    Searched refs:minmax (Results 1 - 25 of 53) sorted by null

1 2 3

  /external/libcxx/test/algorithms/alg.sorting/alg.min.max/
minmax_init_list.pass.cpp 14 // minmax(initializer_list<T> t);
22 assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)));
23 assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)));
24 assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3)));
25 assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3)));
26 assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3)));
27 assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3)));
30 static_assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)), "");
31 static_assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)), "");
32 static_assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3)), "")
    [all...]
minmax_init_list_comp.pass.cpp 14 // minmax(initializer_list<T> t, Compare comp);
23 assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)));
24 assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)));
25 assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)));
26 assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1)));
27 assert((std::minmax({3, 1, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)));
28 assert((std::minmax({3, 2, 1}, std::greater<int>()) == std::pair<int, int>(3, 1)));
31 static_assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), "");
32 static_assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)), "");
33 static_assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), "")
    [all...]
minmax.pass.cpp 14 // minmax(const T& a, const T& b);
23 std::pair<const T&, const T&> p = std::minmax(a, b);
54 constexpr auto p1 = std::minmax (x, y);
57 constexpr auto p2 = std::minmax (y, x);
minmax_comp.pass.cpp 15 // minmax(const T& a, const T& b, Compare comp);
25 std::pair<const T&, const T&> p = std::minmax(a, b, c);
57 constexpr auto p1 = std::minmax(x, y, std::greater<>());
60 constexpr auto p2 = std::minmax(y, x, std::greater<>());
Android.mk 47 test_name := algorithms/alg.sorting/alg.min.max/minmax
48 test_src := minmax.pass.cpp
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.min.max/
minmax_init_list.pass.cpp 14 // minmax(initializer_list<T> t);
22 assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)));
23 assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)));
24 assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3)));
25 assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3)));
26 assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3)));
27 assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3)));
30 static_assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)), "");
31 static_assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)), "");
32 static_assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3)), "")
    [all...]
minmax_init_list_comp.pass.cpp 14 // minmax(initializer_list<T> t, Compare comp);
23 assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)));
24 assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)));
25 assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)));
26 assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1)));
27 assert((std::minmax({3, 1, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)));
28 assert((std::minmax({3, 2, 1}, std::greater<int>()) == std::pair<int, int>(3, 1)));
31 static_assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), "");
32 static_assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)), "");
33 static_assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), "")
    [all...]
minmax.pass.cpp 14 // minmax(const T& a, const T& b);
23 std::pair<const T&, const T&> p = std::minmax(a, b);
54 constexpr auto p1 = std::minmax (x, y);
57 constexpr auto p2 = std::minmax (y, x);
minmax_comp.pass.cpp 15 // minmax(const T& a, const T& b, Compare comp);
25 std::pair<const T&, const T&> p = std::minmax(a, b, c);
57 constexpr auto p1 = std::minmax(x, y, std::greater<>());
60 constexpr auto p2 = std::minmax(y, x, std::greater<>());
  /external/blktrace/
stats.h 28 struct minmax { struct
36 static inline void minmax_init(struct minmax *mm)
45 static inline void minmax_account(struct minmax *mm, __u64 value)
56 static inline void minmax_merge(struct minmax *dst, struct minmax *src)
67 static inline void minmax_to_be(struct minmax *mm)
76 static inline double minmax_avg(struct minmax *mm)
81 static inline double minmax_var(struct minmax *mm)
88 static inline int minmax_print(FILE *fp, const char *s, struct minmax *mm)
blkiomon.h 38 struct minmax size_r;
39 struct minmax size_w;
40 struct minmax d2c_r;
41 struct minmax d2c_w;
42 struct minmax thrput_r;
43 struct minmax thrput_w;
  /external/clang/test/SemaCXX/
invalid-member-expr.cpp 28 pair<int, int> z = minmax({}); // expected-error {{expected expression}}
  /external/qemu/android/skin/
region.c 269 runs_coalesce_band( Run* *psrc_spans, Run* *pdst_spans, SkinBox* minmax )
281 if (pleft < minmax->x1) minmax->x1 = pleft;
308 if (pright > minmax->x2) minmax->x2 = pright;
316 runs_coalesce( Run* dst, Run* src, SkinBox* minmax )
333 if (ytop < minmax->y1) minmax->y1 = ytop;
334 if (ybot > minmax->y2) minmax->y2 = ybot
992 SkinBox minmax; local
    [all...]
  /device/generic/goldfish/opengl/shared/OpenglCodecCommon/
glUtils.h 66 template <class T> void minmax(T *indices, int count, int *min, int *max) { function in namespace:GLUtils
  /sdk/emulator/opengl/shared/OpenglCodecCommon/
glUtils.h 66 template <class T> void minmax(T *indices, int count, int *min, int *max) { function in namespace:GLUtils
  /external/chromium_org/chrome/browser/thumbnails/
content_analysis.cc 105 std::pair<float, float>* minmax) {
107 DCHECK(minmax);
119 *minmax = std::make_pair(value_min, value_max);
467 std::pair<float, float> minmax; local
468 if (!ComputeScaledHistogram(input, &histogram, &minmax))
469 return minmax.first;
474 return (minmax.second - minmax.first) * (max_index + 0.5f) / 255.0f +
475 minmax.first;
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_audioop.py 53 self.assertEqual(audioop.minmax(b'', w),
56 self.assertEqual(audioop.minmax(p(5), w), (5, 5))
57 self.assertEqual(audioop.minmax(p(5, -8, -1), w), (-8, 5))
58 self.assertEqual(audioop.minmax(p(maxvalues[w]), w),
60 self.assertEqual(audioop.minmax(p(minvalues[w]), w),
62 self.assertEqual(audioop.minmax(datas[w], w),
363 self.assertRaises(audioop.error, audioop.minmax, data, size)
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_audioop.py 53 self.assertEqual(audioop.minmax(b'', w),
56 self.assertEqual(audioop.minmax(p(5), w), (5, 5))
57 self.assertEqual(audioop.minmax(p(5, -8, -1), w), (-8, 5))
58 self.assertEqual(audioop.minmax(p(maxvalues[w]), w),
60 self.assertEqual(audioop.minmax(p(minvalues[w]), w),
62 self.assertEqual(audioop.minmax(datas[w], w),
363 self.assertRaises(audioop.error, audioop.minmax, data, size)
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/bits/
algorithmfwd.h 83 minmax (C++0x)
376 minmax(const _Tp&, const _Tp&);
380 minmax(const _Tp&, const _Tp&, _Compare);
408 minmax(initializer_list<_Tp>);
412 minmax(initializer_list<_Tp>, _Compare);
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/
algorithmfwd.h 81 minmax (C++0x)
371 minmax(const _Tp&, const _Tp&);
375 minmax(const _Tp&, const _Tp&, _Compare);
403 minmax(initializer_list<_Tp>);
407 minmax(initializer_list<_Tp>, _Compare);
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/
algorithmfwd.h 81 minmax (C++0x)
371 minmax(const _Tp&, const _Tp&);
375 minmax(const _Tp&, const _Tp&, _Compare);
403 minmax(initializer_list<_Tp>);
407 minmax(initializer_list<_Tp>, _Compare);
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/
algorithmfwd.h 81 minmax (C++0x)
371 minmax(const _Tp&, const _Tp&);
375 minmax(const _Tp&, const _Tp&, _Compare);
403 minmax(initializer_list<_Tp>);
407 minmax(initializer_list<_Tp>, _Compare);
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/
algorithmfwd.h 81 minmax (C++0x)
371 minmax(const _Tp&, const _Tp&);
375 minmax(const _Tp&, const _Tp&, _Compare);
403 minmax(initializer_list<_Tp>);
407 minmax(initializer_list<_Tp>, _Compare);
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
algorithmfwd.h 83 minmax (C++0x)
376 minmax(const _Tp&, const _Tp&);
380 minmax(const _Tp&, const _Tp&, _Compare);
408 minmax(initializer_list<_Tp>);
412 minmax(initializer_list<_Tp>, _Compare);
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
algorithmfwd.h 83 minmax (C++0x)
376 minmax(const _Tp&, const _Tp&);
380 minmax(const _Tp&, const _Tp&, _Compare);
408 minmax(initializer_list<_Tp>);
412 minmax(initializer_list<_Tp>, _Compare);

Completed in 325 milliseconds

1 2 3