/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
H A D | ShadowProgressBar.java | 41 if (!isIndeterminate()) this.progress = Math.min(max, progress); 51 if (!isIndeterminate()) this.secondaryProgress = Math.min(max, secondaryProgress);
|
/external/selinux/libsepol/src/ |
H A D | private.h | 40 #undef min macro 41 #define min(a,b) (((a) < (b)) ? (a) : (b)) macro
|
/external/skia/bin/ |
H A D | compare | 24 am, bm = min(a[key]), min(b[key])
|
/external/skia/experimental/iOSSampleApp/Shared/ |
H A D | SkOptionsTableViewController.h | 36 - (UITableViewCell*)createSlider:(NSString*)title min:(float)min max:(float)max default:(float)value;
|
/external/skia/src/views/mac/ |
H A D | SkOptionsTableView.h | 35 - (NSCell*)createSlider:(float)value min:(float)min max:(float)max;
|
/external/zlib/src/contrib/infback9/ |
H A D | inftree9.c | 42 unsigned min, max; /* minimum and maximum code lengths */ local 120 for (min = 1; min <= MAXBITS; min++) 121 if (count[min] != 0) break; 122 if (root < min) root = min; 196 len = min; /* starting code length */
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/ |
H A D | AggregateSummaryStatistics.java | 311 double min = current.getMin(); 318 if (current.getMin() < min || Double.isNaN(min)) { 319 min = current.getMin(); 340 return new StatisticalSummaryValues(mean, variance, n, max, min, sum);
|
/external/ceres-solver/internal/ceres/ |
H A D | loss_function.cc | 52 rho[1] = std::max(std::numeric_limits<double>::min(), a_ / r); 67 rho[1] = std::max(std::numeric_limits<double>::min(), 1.0 / tmp); 76 rho[1] = std::max(std::numeric_limits<double>::min(), inv); 85 rho[1] = std::max(std::numeric_limits<double>::min(), inv); 111 rho[1] = std::max(std::numeric_limits<double>::min(), e_x / (1.0 + e_x));
|
/external/dexmaker/src/dx/java/com/android/dx/util/ |
H A D | IntList.java | 413 int min = -1; 416 while (max > (min + 1)) { 418 * The guessIdx calculation is equivalent to ((min + max) 419 * / 2) but won't go wonky when min and max are close to 422 int guessIdx = min + ((max - min) >> 1); 428 min = guessIdx;
|
/external/icu/icu4c/source/i18n/ |
H A D | wintzimpl.cpp | 62 int32_t hour, min, sec, mil; local 74 min = mil/60000; 80 standardDate.wMinute = min; 95 min = mil/60000; 101 daylightDate.wMinute = min;
|
/external/iptables/extensions/ |
H A D | libip6t_frag.c | 93 print_ids(const char *name, uint32_t min, uint32_t max, argument 98 if (min != 0 || max != 0xFFFFFFFF || invert) { 100 if (min == max) 101 printf(":%s%u", inv, min); 103 printf("s:%s%u:%u", inv, min, max);
|
H A D | libip6t_mh.c | 122 "Invalid MH type range (min > max)"); 157 static void print_types(uint8_t min, uint8_t max, int invert, int numeric) argument 161 if (min != 0 || max != 0xFF || invert) { 163 if (min == max) { 165 print_type(min, numeric); 168 print_type(min, numeric);
|
H A D | libxt_udp.c | 86 print_ports(const char *name, uint16_t min, uint16_t max, argument 91 if (min != 0 || max != 0xFFFF || invert) { 93 if (min == max) { 95 print_port(min, numeric); 98 print_port(min, numeric);
|
H A D | libipt_ULOG.c | 37 .min = 1, .max = 32}, 40 .min = 1}, 43 .min = 1, .max = ULOG_MAX_QLEN},
|
H A D | libxt_cluster.c | 37 .type = XTTYPE_UINT32, .min = 1, .max = XT_CLUSTER_NODES_MAX, 41 .type = XTTYPE_UINT32, .min = 1, .max = XT_CLUSTER_NODES_MAX}, 44 .min = 1, .max = XT_CLUSTER_NODES_MAX,
|
/external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.discrete/ |
H A D | eval.pass.cpp | 35 assert(d.min() <= v && v <= d.max()); 53 assert(d.min() <= v && v <= d.max()); 71 assert(d.min() <= v && v <= d.max()); 89 assert(d.min() <= v && v <= d.max()); 107 assert(d.min() <= v && v <= d.max()); 125 assert(d.min() <= v && v <= d.max()); 143 assert(d.min() <= v && v <= d.max()); 164 assert(d.min() <= v && v <= d.max()); 185 assert(d.min() <= v && v <= d.max()); 206 assert(d.min() < [all...] |
/external/compiler-rt/lib/sanitizer_common/tests/ |
H A D | sanitizer_format_interceptor_test.cc | 159 // In the cases with std::min below the format spec can be interpreted as 165 testScanf("%a[]]", 1, std::min(F, P)); 166 testScanf("%a[abc]", 1, std::min(F, P)); 167 testScanf("%a[^abc]", 1, std::min(F, P)); 170 testScanf("%as", 1, std::min(F, P)); 171 testScanf("%aS", 1, std::min(F, P)); 172 testScanf("%a13S", 1, std::min(F, P)); 173 testScanf("%alS", 1, std::min(F, P));
|
/external/openssh/ |
H A D | kexgexc.c | 65 kex->min = DH_GRP_MIN; 79 (r = sshpkt_put_u32(ssh, kex->min)) != 0 || 85 kex->min, kex->nbits, kex->max); 89 kex->min, kex->nbits, kex->max); 118 (u_int)bits < kex->min || (u_int)bits > kex->max) { 226 kex->min = kex->max = -1; 237 kex->min, kex->nbits, kex->max,
|
/external/skia/src/core/ |
H A D | SkRect.cpp | 63 Sk4s min, max, accum; local 66 min = Sk4s(pts[0].fX, pts[0].fY, pts[0].fX, pts[0].fY); 70 min = Sk4s::Load(&pts[0].fX); 74 accum = max = min; 81 min = Sk4s::Min(min, xy); 88 * in which case we could eliminate accum entirely, and just check min and max for 93 min.store(minArray);
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
H A D | QRDecompositionImpl.java | 77 rDiag = new double[FastMath.min(m, n)]; 88 for (int minor = 0; minor < FastMath.min(m, n); minor++) { 159 for (int row = FastMath.min(m, n) - 1; row >= 0; row--) { 196 for (int minor = m - 1; minor >= FastMath.min(m, n); minor--) { 200 for (int minor = FastMath.min(m, n)-1; minor >= 0; minor--){ 234 for (int j = 0; j < FastMath.min(i + 1, n); ++j) { 306 for (int minor = 0; minor < FastMath.min(m, n); minor++) { 382 final int kEnd = FastMath.min(kStart + blockSize, columns); 389 for (int minor = 0; minor < FastMath.min(m, n); minor++) {
|
/external/eigen/unsupported/test/ |
H A D | polynomialutils.cpp | 79 _Scalar min = roots.array().abs().minCoeff(); local 80 bool eval = (M >= Max) && (m <= min); 85 cerr << "Min,Max: (" << min << ", " << Max << ")" << endl;
|
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/heightmap/ |
H A D | HillHeightMap.java | 205 private float randomRange(Random random, float min, float max) {
argument 206 return (random.nextInt() * (max - min) / Integer.MAX_VALUE) + min;
|
/external/pdfium/core/src/fxcodec/fx_libopenjpeg/libopenjpeg20/ |
H A D | opj_intmath.h | 97 <li>Returns a if (min < a < max) 99 <li>Returns min if (a < min) 102 static INLINE OPJ_INT32 opj_int_clamp(OPJ_INT32 a, OPJ_INT32 min, OPJ_INT32 max) { argument 103 if (a < min) 104 return min;
|
/external/sfntly/cpp/src/sfntly/port/ |
H A D | memory_input_stream.cc | 89 size_t read_count = std::min<size_t>(length_ - position_, length); 114 skip_count = std::min<size_t>(length_ - position_, (size_t)n); 133 size_t unread_count = std::min<size_t>(position_, length);
|
/external/skia/tools/lua/ |
H A D | glyph-usage.lua | 118 local min, max = 0, 0 129 min = math.min(min, count) 138 io.write("\n", "unique glyphs: min = ", min, ", max = ", max, ", ave = ", ave, "\n");
|