| /external/llvm/test/CodeGen/AArch64/ |
| aarch64-minmaxv.ll | 11 %rdx.minmax.cmp22 = icmp sgt <16 x i8> %arr.load, %rdx.shuf
12 %rdx.minmax.select23 = select <16 x i1> %rdx.minmax.cmp22, <16 x i8> %arr.load, <16 x i8> %rdx.shuf
13 %rdx.shuf24 = shufflevector <16 x i8> %rdx.minmax.select23, <16 x i8> undef, <16 x i32> <i32 4, i32 5, i32 6, i32 7, i32 undef, i32 undef, i32 undef, i32 undef, i32 undef, i32 undef, i32 undef, i32 undef, i32 undef, i32 undef, i32 undef, i32 undef>
14 %rdx.minmax.cmp25 = icmp sgt <16 x i8> %rdx.minmax.select23, %rdx.shuf24
15 %rdx.minmax.select26 = select <16 x i1> %rdx.minmax.cmp25, <16 x i8> %rdx.minmax.select23, <16 x i8> %rdx.shuf24
16 %rdx.shuf27 = shufflevector <16 x i8> %rdx.minmax.select26, <16 x i8> undef, <16 x i32> <i32 2, i32 3, i32 undef, i32 undef, i32 undef, i32 undef, i (…)
[all...] |
| /external/libcxx/test/std/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);
30 std::pair<int, int> p = std::minmax(il, std::ref(pred));
41 assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)));
42 assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)));
43 assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)));
44 assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1)));
45 assert((std::minmax({3, 1, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)));
46 assert((std::minmax({3, 2, 1}, std::greater<int>()) == std::pair<int, int>(3, 1)));
47 assert((std::minmax({1, 2, 3}, all_equal ) == std::pair<int, int>(1, 3)));
50 assert((std::minmax({1, 2, 2, 3, 3, 3, 5, 5, 5, 5, 5, 3}, std::ref(pred)) == std::pair<int, int>(5, 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<>());
|
| /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/libxml2/test/schemas/ |
| element-minmax-err_0.xml | 3 xsi:noNamespaceSchemaLocation="element-minmax-err_0.xsd">
|
| /external/libxml2/result/schemas/ |
| element-minmax-err_0_0.err | 1 ./test/schemas/element-minmax-err_0.xsd:6: element element: Schemas parser error : Element '{http://www.w3.org/2001/XMLSchema}element', attribute 'maxOccurs': The value must be greater than or equal to 1.
|
| /external/chromium-trace/catapult/third_party/flot/ |
| jquery.flot.errorbars.min.js | 7 (function($){var options={series:{points:{errorbars:null,xerr:{err:"x",show:null,asymmetric:null,upperCap:null,lowerCap:null,color:null,radius:null},yerr:{err:"y",show:null,asymmetric:null,upperCap:null,lowerCap:null,color:null,radius:null}}}};function processRawData(plot,series,data,datapoints){if(!series.points.errorbars)return;var format=[{x:true,number:true,required:true},{y:true,number:true,required:true}];var errors=series.points.errorbars;if(errors=="x"||errors=="xy"){if(series.points.xerr.asymmetric){format.push({x:true,number:true,required:true});format.push({x:true,number:true,required:true})}else format.push({x:true,number:true,required:true})}if(errors=="y"||errors=="xy"){if(series.points.yerr.asymmetric){format.push({y:true,number:true,required:true});format.push({y:true,number:true,required:true})}else format.push({y:true,number:true,required:true})}datapoints.format=format}function parseErrors(series,i){var points=series.datapoints.points;var exl=null,exu=null,eyl=null,eyu=null;var xerr=series.points.xerr,yerr=series.points.yerr;var eb=series.points.errorbars;if(eb=="x"||eb=="xy"){if(xerr.asymmetric){exl=points[i+2];exu=points[i+3];if(eb=="xy")if(yerr.asymmetric){eyl=points[i+4];eyu=points[i+5]}else eyl=points[i+4]}else{exl=points[i+2];if(eb=="xy")if(yerr.asymmetric){eyl=points[i+3];eyu=points[i+4]}else eyl=points[i+3]}}else if(eb=="y")if(yerr.asymmetric){eyl=points[i+2];eyu=points[i+3]}else eyl=points[i+2];if(exu==null)exu=exl;if(eyu==null)eyu=eyl;var errRanges=[exl,exu,eyl,eyu];if(!xerr.show){errRanges[0]=null;errRanges[1]=null}if(!yerr.show){errRanges[2]=null;errRanges[3]=null}return errRanges}function drawSeriesErrors(plot,ctx,s){var points=s.datapoints.points,ps=s.datapoints.pointsize,ax=[s.xaxis,s.yaxis],radius=s.points.radius,err=[s.points.xerr,s.points.yerr];var invertX=false;if(ax[0].p2c(ax[0].max)<ax[0].p2c(ax[0].min)){invertX=true;var tmp=err[0].lowerCap;err[0].lowerCap=err[0].upperCap;err[0].upperCap=tmp}var invertY=false;if(ax[1].p2c(ax[1].min)<ax[1].p2c(ax[1].max)){invertY=true;var tmp=err[1].lowerCap;err[1].lowerCap=err[1].upperCap;err[1].upperCap=tmp}for(var i=0;i<s.datapoints.points.length;i+=ps){var errRanges=parseErrors(s,i);for(var e=0;e<err.length;e++){var minmax=[ax[e].min,ax[e].max];if(errRanges[e*err.length]){var x=points[i],y=points[i+1];var upper=[x,y][e]+errRanges[e*err.length+1],lower=[x,y][e]-errRanges[e*err.length];if(err[e].err=="x")if(y>ax[1].max||y<ax[1].min||upper<ax[0].min||lower>ax[0].max)continue;if(err[e].err=="y")if(x>ax[0].max||x<ax[0].min||upper<ax[1].min||lower>ax[1].max)continue;var drawUpper=true,drawLower=true;if(upper>minmax[1]){drawUpper=false;upper=minmax[1]}if(lower<minmax[0]){drawLower=false;lower=minmax[0]}if(err[e].err=="x"&&invertX||err[e].err=="y"&&invertY){var tmp=lower;lower=upper;upper=tmp;tmp=drawLower;drawLower=drawUpper;drawUpper=tmp;tmp=minmax[0];minmax[0]=minmax[1];minmax[1]=tmp}x=ax[0].p2c(x),y=ax[1].p2c(y),upper=ax[e].p2c(upper);lower=ax[e].p2c(lower);minmax[0]=ax[e].p2c(minmax[0]);minmax[1]=ax[e].p2c(minmax[1]);var lw=err[e].lineWidth?err[e].lineWidth:s. (…)
[all...] |
| jquery.flot.errorbars.js | 195 var minmax = [ax[e].min, ax[e].max];
220 if (upper > minmax[1]) {
222 upper = minmax[1];
224 if (lower < minmax[0]) {
226 lower = minmax[0];
238 tmp = minmax[0];
239 minmax[0] = minmax[1];
240 minmax[1] = tmp;
248 minmax[0] = ax[e].p2c(minmax[0])
[all...] |
| /external/blktrace/ |
| 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;
|
| 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)
|
| /external/clang/test/SemaCXX/ |
| invalid-member-expr.cpp | 29 template <typename _Tp> pair<_Tp, _Tp> minmax(initializer_list<_Tp> __l) {}; function in namespace:test3
32 pair<int, int> z = minmax({});
36 // expected-error@-4 {{no matching function for call to 'minmax'}}
|
| /external/fio/t/ |
| log.c | 3 #include "../minmax.h"
|
| /cts/tests/camera/src/android/hardware/camera2/cts/rs/ |
| raw_converter.rs | 119 float2 minmax;
120 minmax.x = sorted.x;
121 minmax.y = sorted.z;
124 minmax = native_powr(minmax, 3.f) * toneMapCoeffs.x +
125 native_powr(minmax, 2.f) * toneMapCoeffs.y +
126 minmax * toneMapCoeffs.z + toneMapCoeffs.w;
131 newMid = minmax.y;
133 newMid = minmax.x + ((minmax.y - minmax.x) * (sorted.y - sorted.x)
[all...] |
| /external/fio/ |
| fifo.h | 23 #include "minmax.h"
|
| /external/opencv3/modules/cudalegacy/src/ |
| needle_map.cpp | 90 cuda::minMax(u_avg, 0, &uMax);
91 cuda::minMax(v_avg, 0, &vMax);
|
| /cts/tests/tests/media/src/android/media/cts/ |
| VideoEncoderTest.java | 1668 private void minmax(Encoder[] encoders, boolean flexYUV) { method in class:VideoEncoderTest
[all...] |
| /external/opencv3/modules/cudaarithm/test/ |
| test_reductions.cpp | 369 // MinMax
371 PARAM_TEST_CASE(MinMax, cv::cuda::DeviceInfo, cv::Size, MatDepth, UseRoi)
389 CUDA_TEST_P(MinMax, WithoutMask)
398 cv::cuda::minMax(loadMat(src), &minVal, &maxVal);
408 cv::cuda::minMax(loadMat(src, useRoi), &minVal, &maxVal);
418 CUDA_TEST_P(MinMax, Async)
440 CUDA_TEST_P(MinMax, WithMask)
450 cv::cuda::minMax(loadMat(src), &minVal, &maxVal, loadMat(mask));
460 cv::cuda::minMax(loadMat(src, useRoi), &minVal, &maxVal, loadMat(mask, useRoi));
470 CUDA_TEST_P(MinMax, NullPtr
[all...] |
| /external/chromium-trace/catapult/dashboard/dashboard/elements/ |
| triage-dialog.html | 336 var minMax = percentMin + '%-' + percentMax + '%';
341 minMax = 'A ' + this.FREAKIN_HUGE;
345 minMax = 'A ' + this.FREAKIN_HUGE + ' to ' + percentMin + '%';
349 minMax = percentMin + '%';
356 'range': minMax,
|
| /external/deqp/modules/gles31/functional/ |
| es31fIntegerStateQueryTests.cpp | 613 int minMax;
619 minMax = 72;
628 minMax = 72;
635 minMax = 48;
639 minMax = 36;
644 verifyStateIntegerMin(result, gl, GL_MAX_UNIFORM_BUFFER_BINDINGS, minMax, m_verifierType);
670 int minMax;
676 minMax = 60;
685 minMax = 60;
692 minMax = 36
[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
|
