/external/deqp/modules/gles2/functional/ |
H A D | es2fImplementationLimitTests.cpp | 51 inline bool compare (const T& min, const T& reported) { return min <= reported; } argument 65 float min; member in struct:deqp::gles2::Functional::LimitQuery::FloatRange 67 FloatRange (float min_, float max_) : min(min_), max(max_) {} 70 std::ostream& operator<< (std::ostream& str, const FloatRange& range) { return str << range.min << ", " << range.max; } 122 bool compare<Boolean> (const Boolean& min, const Boolean& reported) argument 124 return !min.value || (min.value && reported.value); 128 bool compare<NegInt> (const NegInt& min, const NegInt& reported) argument 131 return reported.value <= min 135 compare(const FloatRange& min, const FloatRange& reported) argument [all...] |
/external/skia/src/effects/ |
H A D | SkTableMaskFilter.cpp | 99 void SkTableMaskFilter::MakeClipTable(uint8_t table[256], uint8_t min, argument 104 if (min >= max) { 105 min = max - 1; 107 SkASSERT(min < max); 109 SkFixed scale = (1 << 16) * 255 / (max - min); 110 memset(table, 0, min + 1); 111 for (int i = min + 1; i < max; i++) { 112 int value = SkFixedRoundToInt(scale * (i - min)); 125 SkDebugf("%d %d start [%d]", min, max, j);
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/univariate/ |
H A D | AbstractUnivariateRealOptimizer.java | 219 double min, double max, double startValue) 222 this.searchMin = min; 251 double min, double max) 253 return optimize(f, goal, min, max, min + 0.5 * (max - min)); 218 optimize(UnivariateRealFunction f, GoalType goal, double min, double max, double startValue) argument 250 optimize(UnivariateRealFunction f, GoalType goal, double min, double max) argument
|
/external/openssh/ |
H A D | kexgexs.c | 77 u_int min = 0, max = 0, nbits = 0; local 82 if ((r = sshpkt_get_u32(ssh, &min)) != 0 || 88 kex->min = min; 90 min = MAX(DH_GRP_MIN, min); 102 kex->min = min = DH_GRP_MIN; 110 if (kex->max < kex->min || kex->nbits < kex->min || [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/transform/ |
H A D | FastCosineTransformer.java | 75 * @param min the lower bound for the interval 84 double min, double max, int n) 86 double data[] = FastFourierTransformer.sample(f, min, max, n); 116 * @param min the lower bound for the interval 125 double min, double max, int n) 128 double data[] = FastFourierTransformer.sample(f, min, max, n); 158 * @param min the lower bound for the interval 166 double min, double max, int n) 169 double data[] = FastFourierTransformer.sample(f, min, max, n); 197 * @param min th 83 transform(UnivariateRealFunction f, double min, double max, int n) argument 124 transform2(UnivariateRealFunction f, double min, double max, int n) argument 165 inversetransform(UnivariateRealFunction f, double min, double max, int n) argument 204 inversetransform2(UnivariateRealFunction f, double min, double max, int n) argument [all...] |
H A D | FastSineTransformer.java | 74 * @param min the lower bound for the interval 83 double min, double max, int n) 86 double data[] = FastFourierTransformer.sample(f, min, max, n); 114 * @param min the lower bound for the interval 123 UnivariateRealFunction f, double min, double max, int n) 126 double data[] = FastFourierTransformer.sample(f, min, max, n); 155 * @param min the lower bound for the interval 162 public double[] inversetransform(UnivariateRealFunction f, double min, double max, int n) argument 165 double data[] = FastFourierTransformer.sample(f, min, max, n); 193 * @param min th 82 transform(UnivariateRealFunction f, double min, double max, int n) argument 122 transform2( UnivariateRealFunction f, double min, double max, int n) argument 200 inversetransform2(UnivariateRealFunction f, double min, double max, int n) argument [all...] |
/external/chromium-trace/trace-viewer/tracing/tracing/ui/base/ |
H A D | list_and_associated_view.css | 12 min-width: 100px;
|
/external/chromium-trace/trace-viewer/tracing/tracing/ui/extras/about_tracing/ |
H A D | common.css | 19 min-height: 0;
|
/external/clang/test/SemaCXX/ |
H A D | cxx1y-user-defined-literals.cpp | 15 duration operator""min(unsigned long long); 33 duration a = 1ns, b = 1us, c = 1ms, d = 1s, e = 1min, f = 1h;
|
/external/deqp/modules/glshared/ |
H A D | glsVertexArrayTests.cpp | 220 inline T getRandom (deRandom& rnd, T min, T max); 223 inline GLValue::Float getRandom (deRandom& rnd, GLValue::Float min, GLValue::Float max) argument 225 if (max < min) 226 return min; 228 return GLValue::Float::create(min + deRandom_getFloat(&rnd) * (max.to<float>() - min.to<float>())); 232 inline GLValue::Short getRandom (deRandom& rnd, GLValue::Short min, GLValue::Short max) argument 234 if (max < min) 235 return min; 237 return GLValue::Short::create((min 241 getRandom(deRandom& rnd, GLValue::Ushort min, GLValue::Ushort max) argument 250 getRandom(deRandom& rnd, GLValue::Byte min, GLValue::Byte max) argument 259 getRandom(deRandom& rnd, GLValue::Ubyte min, GLValue::Ubyte max) argument 268 getRandom(deRandom& rnd, GLValue::Fixed min, GLValue::Fixed max) argument 277 getRandom(deRandom& rnd, GLValue::Half min, GLValue::Half max) argument 289 getRandom(deRandom& rnd, GLValue::Int min, GLValue::Int max) argument 298 getRandom(deRandom& rnd, GLValue::Uint min, GLValue::Uint max) argument 307 getRandom(deRandom& rnd, GLValue::Double min, GLValue::Double max) argument 1323 setData(char* data, Array::InputType type, deRandom& rnd, GLValue min, GLValue max) argument 1393 generateArray(int seed, GLValue min, GLValue max, int count, int componentCount, int stride, Array::InputType type) argument 1416 generateQuads(int seed, int count, int componentCount, int offset, int stride, Array::Primitive primitive, Array::InputType type, GLValue min, GLValue max) argument 1499 const deUint32 min = 10; local 1548 createQuads(int seed, int count, int componentCount, int offset, int stride, Array::Primitive primitive, T min, T max) argument 1652 generatePerQuad(int seed, int count, int componentCount, int stride, Array::Primitive primitive, Array::InputType type, GLValue min, GLValue max) argument 1707 createPerQuads(int seed, int count, int componentCount, int stride, Array::Primitive primitive, T min, T max) argument [all...] |
/external/icu/icu4c/source/test/cintltst/ |
H A D | ccaltst.h | 79 int32_t hr, int32_t min, int32_t sec, int32_t ms, 88 int32_t hour, int32_t min, int32_t sec, int32_t am_pm);
|
/external/icu/icu4c/source/test/intltest/ |
H A D | caltztst.h | 40 UDate date(int32_t y, int32_t m, int32_t d, int32_t hr=0, int32_t min=0, int32_t sec=0); 44 // Date utcDate(int y, int m, int d, int hr=0, int min=0, int sec=0); 47 void dateToFields(UDate date, int32_t& y, int32_t& m, int32_t& d, int32_t& hr, int32_t& min, int32_t& sec);
|
H A D | tzregts.h | 53 UDate findTransitionBinary(const SimpleTimeZone& tz, UDate min, UDate max); 54 UDate findTransitionStepwise(const SimpleTimeZone& tz, UDate min, UDate max);
|
/external/jmonkeyengine/engine/src/bullet/com/jme3/bullet/collision/shapes/ |
H A D | HeightfieldCollisionShape.java | 61 float min = heightfieldData[0];
63 // calculate min and max height
65 if (heightfieldData[i] < min) {
66 min = heightfieldData[i];
73 // min and max height to be equal on either side of the y axis, otherwise it gets shifted and collision is incorrect.
75 max = -min;
77 if (Math.abs(max) > Math.abs(min)) {
78 min = -max;
80 max = -min;
83 this.minHeight = min;
[all...] |
/external/jmonkeyengine/engine/src/jbullet/com/jme3/bullet/collision/shapes/ |
H A D | HeightfieldCollisionShape.java | 60 float min = heightfieldData[0]; 62 // calculate min and max height 64 if (heightfieldData[i] < min) 65 min = heightfieldData[i]; 70 // min and max height to be equal on either side of the y axis, otherwise it gets shifted and collision is incorrect. 72 max = -min; 74 if (Math.abs(max) > Math.abs(min)) 75 min = -max; 77 max = -min; 79 this.minHeight = min; [all...] |
/external/libcxx/test/std/numerics/rand/rand.eng/rand.eng.sub/ |
H A D | values.pass.cpp | 23 // static constexpr result_type min() { return 0; } 41 /*static_*/assert((E::min() == 0)/*, ""*/); 57 /*static_*/assert((E::min() == 0)/*, ""*/);
|
/external/libvorbis/vq/ |
H A D | latticebuild.c | 133 double min=quantlist[0]; local 136 for(j=1;j<quantvals;j++)if(quantlist[j]<min)min=quantlist[j]; 145 double test=fac*(quantlist[j]-min)/mindel; 153 fprintf(stderr,"min=%g mindel=%g\n",min,mindel); 155 c.q_min=_float32_pack(min); 159 min=_float32_unpack(c.q_min); 162 c.quantlist[j]=rint((quantlist[j]-min)/mindel);
|
/external/linux-tools-perf/src/tools/perf/util/ |
H A D | stat.c | 17 if (val < stats->min) 18 stats->min = val;
|
/external/ppp/pppd/include/ |
H A D | pcap-int.h | 102 #ifndef min 103 #define min(a, b) ((a) > (b) ? (b) : (a)) macro
|
/external/v8/test/webkit/ |
H A D | dfg-dead-min-two-args.js | 25 "Tests that a dead use of Math.min(a,b) at least speculates that its arguments are indeed numbers." 29 Math.min(a.f, b.f); 34 Math.min(a.f, b.f);
|
/external/eigen/doc/examples/ |
H A D | Tutorial_ArrayClass_cwise_other.cpp | 17 cout << "a.min(a.abs().sqrt()) =" << endl 18 << a.min(a.abs().sqrt()) << endl;
|
/external/iptables/include/linux/netfilter/ |
H A D | nf_nat.h | 16 union nf_conntrack_man_proto min; member in struct:nf_nat_ipv4_range
|
H A D | xt_u32.h | 19 __u32 min; member in struct:xt_u32_value_element
|
/external/kernel-headers/original/uapi/linux/ |
H A D | atm_nicstar.h | 33 unsigned min; member in struct:buf_nr
|
/external/kernel-headers/original/uapi/linux/netfilter/ |
H A D | xt_u32.h | 19 __u32 min; member in struct:xt_u32_value_element
|