| /device/google/marlin/ |
| thermal-engine-marlin.conf | 1 [SKIN-HIGH-FLOOR]
11 [SKIN-MID-FLOOR]
21 [SKIN-LOW-FLOOR]
|
| /libcore/luni/src/main/java/java/math/ |
| RoundingMode.java | 57 FLOOR(BigDecimal.ROUND_FLOOR),
107 return FLOOR;
|
| /libcore/luni/src/test/java/libcore/java/math/ |
| OldBigDecimalCompareTest.java | 41 mc = new MathContext(34, RoundingMode.FLOOR);
57 MathContext mc = new MathContext(37, RoundingMode.FLOOR);
|
| OldBigDecimalArithmeticTest.java | 32 mc = new MathContext(17, RoundingMode.FLOOR);
57 mc = new MathContext(17, RoundingMode.FLOOR);
80 mc = new MathContext(17, RoundingMode.FLOOR);
128 mc = new MathContext(7, RoundingMode.FLOOR);
135 mc = new MathContext(4, RoundingMode.FLOOR);
158 mc = new MathContext(0, RoundingMode.FLOOR);
167 mc = new MathContext(0, RoundingMode.FLOOR);
180 // mc = new MathContext(3, RoundingMode.FLOOR);
193 mc = new MathContext(17, RoundingMode.FLOOR);
220 mc = new MathContext(17, RoundingMode.FLOOR);
[all...] |
| BigDecimalTest.java | 64 BigDecimal rounded = bigDecimal.round(new MathContext(2, RoundingMode.FLOOR));
|
| OldBigDecimalConstructorsTest.java | 70 mc = new MathContext(34, RoundingMode.FLOOR);
157 mc = new MathContext(34, RoundingMode.FLOOR);
217 mc = new MathContext(34, RoundingMode.FLOOR);
257 mc = new MathContext(28, RoundingMode.FLOOR);
268 mc = new MathContext(17, RoundingMode.FLOOR);
326 mc = new MathContext(34, RoundingMode.FLOOR);
465 mc = new MathContext(8, RoundingMode.FLOOR);
603 mc = new MathContext(12, RoundingMode.FLOOR);
708 mc = new MathContext(7, RoundingMode.FLOOR);
[all...] |
| OldBigDecimalTest.java | 113 // testing rounding Mode RoundingMode.FLOOR
114 setScale2 = setScale1.setScale(1, RoundingMode.FLOOR);
116 "the number 1234.5908 after setting scale to 1/RoundingMode.FLOOR is wrong",
118 setScale2 = setNeg.setScale(1, RoundingMode.FLOOR);
120 "the number -1234.5908 after setting scale to 1/RoundingMode.FLOOR is wrong",
|
| /external/guava/guava/src/com/google/common/math/ |
| BigIntegerMath.java | 25 import static java.math.RoundingMode.FLOOR;
76 case FLOOR:
135 int approxLog10 = (int) (log2(x, FLOOR) * LN_2 / LN_10);
140 * We adjust approxLog10 and approxPow until they're equal to floor(log10(x)) and
141 * 10^floor(log10(x)).
175 case FLOOR:
216 case FLOOR:
251 * a) every iteration (except potentially the first) has guess >= floor(sqrt(x)). This is
255 * b) this iteration converges to floor(sqrt(x)). In fact, the number of correct digits doubles
260 * definitely >= floor(sqrt(x)), and then continue the iteration until we reach a fixed point
[all...] |
| IntMath.java | 94 case FLOOR:
107 // floor(2^(logFloor + 0.5))
136 case FLOOR:
156 * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))),
157 * we can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x))
158 * is 6, then 64 <= x < 128, so floor(log10(x)) is either 1 or 2.
162 * y is the higher of the two possible values of floor(log10(x)). If x < 10^y, then we want the
168 // maxLog10ForLeadingZeros[i] == floor(log10(2^(Long.SIZE - i)))
237 case FLOOR
[all...] |
| LongMath.java | 92 case FLOOR:
105 // floor(2^(logFloor + 0.5))
135 case FLOOR:
156 * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))),
157 * we can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x))
158 * is 6, then 64 <= x < 128, so floor(log10(x)) is either 1 or 2.
162 * y is the higher of the two possible values of floor(log10(x)). If x < 10^y, then we want the
168 // maxLog10ForLeadingZeros[i] == floor(log10(2^(Long.SIZE - i)))
281 * Let k be the true value of floor(sqrt(x)), so tha
[all...] |
| DoubleMath.java | 66 case FLOOR:
246 case FLOOR:
|
| /external/guava/guava-gwt/src-super/com/google/common/math/super/com/google/common/math/ |
| BigIntegerMath.java | 25 import static java.math.RoundingMode.FLOOR;
74 case FLOOR:
152 // Use floor(log2(num)) + 1 to prevent overflow of multiplication.
153 int productBits = LongMath.log2(product, FLOOR) + 1;
154 int bits = LongMath.log2(startingNumber, FLOOR) + 1;
160 // Check to see if the floor(log2(num)) + 1 has changed.
169 // Adjust floor(log2(num)) + 1.
178 productBits = LongMath.log2(product, FLOOR) + 1;
|
| IntMath.java | 91 case FLOOR:
104 // floor(2^(logFloor + 0.5))
120 * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))),
121 * we can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x))
122 * is 6, then 64 <= x < 128, so floor(log10(x)) is either 1 or 2.
126 * y is the higher of the two possible values of floor(log10(x)). If x < 10^y, then we want the
132 // maxLog10ForLeadingZeros[i] == floor(log10(2^(Long.SIZE - i)))
191 case FLOOR:
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/ |
| RoundingModeTest.java | 31 assertEquals("valueOf failed for ROUND_FLOOR", RoundingMode.valueOf(BigDecimal.ROUND_FLOOR), RoundingMode.FLOOR);
|
| /external/guava/guava-tests/test/com/google/common/math/ |
| BigIntegerMathTest.java | 29 import static java.math.RoundingMode.FLOOR;
57 BigInteger.ZERO.setBit(2 * BigIntegerMath.SQRT2_PRECOMPUTE_THRESHOLD + 1), FLOOR),
89 for (RoundingMode mode : asList(FLOOR, DOWN)) {
147 // Now figure out what rounding mode we should behave like (it depends if FLOOR was
149 boolean floorWasEven = (BigIntegerMath.log2(x, FLOOR) & 1) == 0;
177 for (RoundingMode mode : asList(FLOOR, DOWN)) {
196 // Relies on the correctness of log10(BigInteger, FLOOR).
200 int logFloor = BigIntegerMath.log10(x, FLOOR);
240 // Now figure out what rounding mode we should behave like (it depends if FLOOR was
242 boolean floorWasEven = (BigIntegerMath.log10(x, FLOOR) & 1) == 0
[all...] |
| LongMathTest.java | 30 import static java.math.RoundingMode.FLOOR;
52 assertEquals(BigIntegerMath.sqrt(BigInteger.ZERO.setBit(2 * Long.SIZE - 1), FLOOR).longValue(),
60 BigIntegerMath.log10(BigInteger.ONE.shiftLeft(Long.SIZE - i), FLOOR),
79 assertEquals(BigIntegerMath.sqrt(BigInteger.TEN.pow(2 * i + 1), FLOOR),
83 BigIntegerMath.sqrt(BigInteger.TEN.pow(2 * LongMath.halfPowersOf10.length + 1), FLOOR);
89 assertEquals(LongMath.sqrt(Long.MAX_VALUE, FLOOR), LongMath.FLOOR_SQRT_MAX_LONG);
250 // Relies on the correctness of log10(long, FLOOR) and of pow(long, int).
254 int floor = LongMath.log10(x, FLOOR); local
255 boolean expectSuccess = LongMath.pow(10, floor) == x
[all...] |
| IntMathTest.java | 28 import static java.math.RoundingMode.FLOOR;
51 BigIntegerMath.sqrt(BigInteger.ZERO.setBit(2 * Integer.SIZE - 1), FLOOR).intValue(),
66 BigIntegerMath.log10(BigInteger.ONE.shiftLeft(Integer.SIZE - i), FLOOR),
76 BigIntegerMath.sqrt(BigInteger.TEN.pow(2 * i + 1), FLOOR).longValue());
96 assertEquals(IntMath.sqrt(Integer.MAX_VALUE, FLOOR), IntMath.FLOOR_SQRT_MAX_INT);
197 // Relies on the correctness of log10(int, FLOOR) and of pow(int, int).
201 int floor = IntMath.log10(x, FLOOR); local
202 boolean expectSuccess = IntMath.pow(10, floor) == x;
204 assertEquals(floor, IntMath.log10(x, UNNECESSARY))
257 int floor = IntMath.sqrt(x, FLOOR); local
[all...] |
| /external/guava/guava-gwt/test-super/com/google/common/math/super/com/google/common/math/ |
| BigIntegerMathTest.java | 26 import static java.math.RoundingMode.FLOOR;
77 for (RoundingMode mode : asList(FLOOR, DOWN)) {
135 // Now figure out what rounding mode we should behave like (it depends if FLOOR was
137 boolean floorWasEven = (BigIntegerMath.log2(x, FLOOR) & 1) == 0;
142 // Relies on the correctness of log10(BigInteger, FLOOR).
146 // Relies on the correctness of sqrt(BigInteger, FLOOR).
|
| /external/libvpx/libvpx/vp8/decoder/ |
| error_concealment.c | 21 #define FLOOR(x,q) ((x) & -(1 << (q)))
203 overlap_b_row = FLOOR(new_row / 4, 3) >> 3;
204 overlap_b_col = FLOOR(new_col / 4, 3) >> 3;
209 overlap_mb_row = FLOOR((overlap_b_row << 3) / 4, 3) >> 3;
210 overlap_mb_col = FLOOR((overlap_b_col << 3) / 4, 3) >> 3;
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/decoder/ |
| error_concealment.c | 22 #define FLOOR(x,q) ((x) & -(1 << (q)))
204 overlap_b_row = FLOOR(new_row / 4, 3) >> 3;
205 overlap_b_col = FLOOR(new_col / 4, 3) >> 3;
210 overlap_mb_row = FLOOR((overlap_b_row << 3) / 4, 3) >> 3;
211 overlap_mb_col = FLOOR((overlap_b_col << 3) / 4, 3) >> 3;
|
| /external/icu/icu4j/main/classes/localespi/src/com/ibm/icu/impl/icuadapter/ |
| NumberFormatJDK.java | 155 } else if (jdkMode.equals(RoundingMode.FLOOR)) {
260 mode = RoundingMode.FLOOR;
|
| /external/icu/icu4j/main/classes/localespi/src/com/ibm/icu/impl/jdkadapter/ |
| NumberFormatICU.java | 118 mode = RoundingMode.FLOOR;
211 } else if (roundingMode.equals(RoundingMode.FLOOR)) {
|
| /frameworks/opt/net/wifi/service/java/com/android/server/wifi/anqp/ |
| CivicLocationElement.java | 112 public static final int FLOOR = 27;
147 Floor,
183 s_caTypes.put(FLOOR, CAType.Floor);
|
| /external/libvncserver/libvncserver/ |
| scale.c | 67 #define FLOOR(x) ( (double) ((int) (x)) )
112 /*cast from double to int is same as "*x = floor(x1);" */
113 x2 = FLOOR(x1);
114 y2 = FLOOR(y1);
|
| /external/jacoco/org.jacoco.report/src/org/jacoco/report/check/ |
| Limit.java | 158 return message("minimum", bd, minimum, RoundingMode.FLOOR);
|
