/external/protobuf/src/google/protobuf/ |
H A D | repeated_field.cc | 49 total_size_ = max(kMinRepeatedFieldAllocationSize, 50 max(total_size_ * 2, new_size));
|
/external/selinux/libsepol/src/ |
H A D | private.h | 43 #undef max macro 44 #define max(a,b) ((a) >= (b) ? (a) : (b)) macro
|
/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/core/ |
H A D | SkAlphaRuns.cpp | 29 int max = (y + 1) * maxStep - (y == maxStep - 1); local 35 SkASSERT(*alpha <= max);
|
H A D | SkBitmapProcState_matrix.h | 36 static inline uint32_t PACK_FILTER_Y_NAME(SkFixed f, unsigned max, argument 38 unsigned i = TILEY_PROCF(f, max); 39 i = (i << 4) | TILEY_LOW_BITS(f, max); 40 return (i << 14) | (TILEY_PROCF((f + one), max)); 43 static inline uint32_t PACK_FILTER_X_NAME(SkFixed f, unsigned max, argument 45 unsigned i = TILEX_PROCF(f, max); 46 i = (i << 4) | TILEX_LOW_BITS(f, max); 47 return (i << 14) | (TILEX_PROCF((f + one), max));
|
H A D | SkBitmapProcState_procs.h | 320 #define TILEX_PROCF(fx, max) SkClampMax((fx) >> 16, max) 321 #define TILEY_PROCF(fy, max) SkClampMax((fy) >> 16, max) 322 #define TILEX_LOW_BITS(fx, max) (((fx) >> 12) & 0xF) 323 #define TILEY_LOW_BITS(fy, max) (((fy) >> 12) & 0xF) 333 #define TILEX_PROCF(fx, max) (((fx) & 0xFFFF) * ((max) + 1) >> 16) 334 #define TILEY_PROCF(fy, max) (((fy) & 0xFFFF) * ((max) [all...] |
/external/skia/src/views/mac/ |
H A D | SkOptionsTableView.h | 35 - (NSCell*)createSlider:(float)value min:(float)min max:(float)max;
|
/external/v8/src/base/ |
H A D | safe_conversions.h | 52 return std::numeric_limits<Dst>::max(); 57 return std::numeric_limits<Dst>::max();
|
/external/aac/libPCMutils/src/ |
H A D | limiter.cpp | 101 FIXP_DBL cor, max; member in struct:TDLimiter 135 /* alloc max and delay buffers */ 180 limiter->max = (FIXP_DBL)0; 241 FIXP_DBL max = limiter->max; local 295 if (tmp >= max) { 297 max = tmp; 299 else if (old < max) { 305 buffer for the new max */ 306 max [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/ |
H A D | AggregateSummaryStatistics.java | 313 double max = current.getMax(); 321 if (current.getMax() > max || Double.isNaN(max)) { 322 max = current.getMax(); 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/guava/guava/src/com/google/common/primitives/ |
H A D | UnsignedBytes.java | 154 public static byte max(byte... array) { method in class:UnsignedBytes 156 int max = toInt(array[0]); 159 if (next > max) { 160 max = next; 163 return (byte) max;
|
H A D | UnsignedInts.java | 106 public static int max(int... array) { method in class:UnsignedInts 108 int max = flip(array[0]); 111 if (next > max) { 112 max = next; 115 return flip(max);
|
/external/jarjar/src/main/com/tonicsystems/jarjar/ |
H A D | Wildcard.java | 55 int max = 0; 73 if (n > max) 74 max = n; 93 if (count < max) 94 throw new IllegalArgumentException("Result includes impossible placeholder \"@" + max + "\": " + result);
|
/external/lldb/include/lldb/Interpreter/ |
H A D | Args.h | 372 const uint64_t max = ((uint64_t)1 << (uint64_t)(total_byte_size * 8)) - 1; local 373 return uval64 <= max; 385 const int64_t max = ((int64_t)1 << (uint64_t)(total_byte_size * 8 - 1)) - 1; local 386 const int64_t min = ~(max); 387 return min <= sval64 && sval64 <= max;
|
/external/skia/tests/ |
H A D | DequeTest.cpp | 33 int max, int min) { 38 int value = max; 53 REPORTER_ASSERT(reporter, value-1 == max); 58 value = max; 69 REPORTER_ASSERT(reporter, value-1 == max); 32 assert_iter(skiatest::Reporter* reporter, const SkDeque& deq, int max, int min) argument
|
/external/freetype/src/psnames/ |
H A D | psmodule.c | 401 PS_UniMap *min, *max, *mid, *result = NULL; local 407 max = min + table->num_maps - 1; 409 while ( min <= max ) 414 mid = min + ( ( max - min ) >> 1 ); 427 if ( min == max ) 433 max = mid - 1; 453 FT_UInt max = table->num_maps; local 459 while ( min < max ) 461 mid = min + ( ( max - min ) >> 1 ); 478 max [all...] |
/external/pdfium/third_party/freetype/src/psnames/ |
H A D | psmodule.c | 401 PS_UniMap *min, *max, *mid, *result = NULL; local 407 max = min + table->num_maps - 1; 409 while ( min <= max ) 414 mid = min + ( ( max - min ) >> 1 ); 427 if ( min == max ) 433 max = mid - 1; 453 FT_UInt max = table->num_maps; local 459 while ( min < max ) 461 mid = min + ( ( max - min ) >> 1 ); 478 max [all...] |
/external/ppp/pppd/plugins/radius/ |
H A D | config.c | 97 for (i = 0; i < serv->max; i++) { 100 serv->max = 0; 107 serv->port[serv->max] = atoi(q); 111 serv->port[serv->max] = PW_AUTH_UDP_PORT; 113 serv->port[serv->max] = ntohs ((unsigned int) svp->s_port); 116 serv->port[serv->max] = PW_ACCT_UDP_PORT; 118 serv->port[serv->max] = ntohs ((unsigned int) svp->s_port); 125 serv->name[serv->max++] = strdup(p); 315 if (!(rc_conf_srv("authserver")->max)) 320 if (!(rc_conf_srv("acctserver")->max)) [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/bounding/ |
H A D | BoundingBox.java | 91 public BoundingBox(Vector3f min, Vector3f max) {
argument 92 setMinMax(min, max);
126 Vector3f max = vars.vect2.set(new Vector3f(Float.NEGATIVE_INFINITY, Float.NEGATIVE_INFINITY, Float.NEGATIVE_INFINITY));
131 checkMinMax(min, max, point);
133 checkMinMax(min, max, point);
135 checkMinMax(min, max, point);
138 center.set(min.addLocal(max));
141 xExtent = max.x - center.x;
142 yExtent = max.y - center.y;
143 zExtent = max 183 checkMinMax(Vector3f min, Vector3f max, Vector3f point) argument 948 setMinMax(Vector3f min, Vector3f max) argument [all...] |
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/timezone/ |
H A D | TimeZoneBoundaryTest.java | 70 long max = min + SIX_MONTHS; 72 while ((max - min) > INTERVAL) 74 long mid = (min + max) >> 1; 83 max = mid; 88 logln("Date After: " + showDate(max)); 90 // not used long maxdelta = max - expectedBoundary; 115 // long max = min + (long)(365.25 / 2 * 24*60*60*1000); 117 // while ((max - min) > INTERVAL) 119 // long mid = (min + max) >> 1; 127 // max [all...] |
/external/boringssl/src/crypto/asn1/ |
H A D | asn1_lib.c | 107 static int asn1_get_length(const unsigned char **pp,int *inf,long *rl,int max); 142 long max=omax; local 144 if (!max) goto err; 151 if (--max == 0) goto err; 157 if (--max == 0) goto err; 163 if (--max == 0) goto err; 169 if (--max == 0) goto err; 173 if (!asn1_get_length(&p,&inf,plength,(int)max)) goto err; 198 static int asn1_get_length(const unsigned char **pp, int *inf, long *rl, int max) argument 204 if (max [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/ |
H A D | MultiStartUnivariateRealOptimizer.java | 228 final double min, final double max) 242 final double bound1 = (i == 0) ? min : min + generator.nextDouble() * (max - min); 243 final double bound2 = (i == 0) ? max : min + generator.nextDouble() * (max - min); 246 FastMath.max(bound1, bound2)); 314 final double min, final double max, final double startValue) 316 return optimize(f, goalType, min, max); 227 optimize(final UnivariateRealFunction f, final GoalType goalType, final double min, final double max) argument 313 optimize(final UnivariateRealFunction f, final GoalType goalType, final double min, final double max, final double startValue) argument
|
/external/bison/etc/ |
H A D | bench.pl.in | 30 my ($base, $max, $directives) = @_; 53 for my $size (1 .. $max) 70 for my $size (1 .. $max) 87 if (outer > $max) 117 my ($base, $max) = @_; 120 foreach (1 .. $max) 131 my ($base, $max, $directives) = @_;
|
/external/e2fsprogs/e2fsck/ |
H A D | profile_helpers.c | 45 int max; member in struct:profile_string_list 54 list->max = 10; 55 list->list = malloc(list->max * sizeof(char *)); 81 list->num = list->max = 0; 93 if (list->num+1 >= list->max) { 94 newmax = list->max + 10; 98 list->max = newmax;
|