| /libcore/ojluni/src/main/java/java/time/format/ |
| SignStyle.java | 65 * Enumeration of ways to handle the positive/negative sign.
67 * The formatting engine allows the positive and negative signs of numbers
81 * In strict parsing, the negative sign will be accepted and the positive sign rejected.
90 * of a sign treated as a positive number.
113 * of a sign treated as a positive number.
120 * @param positive true if positive sign parsed, false for negative sign
125 boolean parse(boolean positive, boolean strict, boolean fixedWidth) {
128 // valid if negative or (positive and lenient)
129 return !positive || !strict
[all...] |
| /external/valgrind/memcheck/tests/ |
| clientperm.stdout.exp | 2 sum is non-positive
4 sum is non-positive
|
| /external/proguard/src/proguard/gui/ |
| FilterBuilder.java | 53 StringBuffer positive = new StringBuffer(); local
56 buildFilter("", positive, negative);
58 return positive.length() <= negative.length() ?
59 positive.toString() :
67 * @param positive the filter to be extended, assuming the matching
73 StringBuffer positive,
101 // Extend the positive filter with exceptions and return.
102 if (positive.length() > 0)
104 positive.append(',');
106 positive.append('!').append(prefix)
[all...] |
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/tic6x/ |
| scomm-directive-7.d | 4 #warning: alignment is not a positive number
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| AbstractECMultiplier.java | 15 ECPoint positive = multiplyPositive(p, k.abs()); local
16 ECPoint result = sign > 0 ? positive : positive.negate();
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/ia64/ |
| rotX.l | 2 .*.s:[[:digit:]]+: Error: [Nn]umber of elements must be positive
3 .*.s:[[:digit:]]+: Error: [Nn]umber of elements must be positive
|
| unwind-bad.l | 2 .*:8: Error: First operand to \.save\.g must be a positive 4-bit constant
3 .*:10: Error: First operand to \.save\.g must be a positive 4-bit constant
4 .*:12: Error: First operand to \.save\.g must be a positive 4-bit constant
7 .*:20: Error: Operand to \.save\.f must be a positive 20-bit constant
8 .*:22: Error: Operand to \.save\.f must be a positive 20-bit constant
9 .*:24: Error: Operand to \.save\.f must be a positive 20-bit constant
12 .*:32: Error: First operand to \.save\.b must be a positive 5-bit constant
13 .*:34: Error: First operand to \.save\.b must be a positive 5-bit constant
14 .*:36: Error: First operand to \.save\.b must be a positive 5-bit constant
40 .*:108: Error: First operand to \.save\.g must be a positive 4-bit constan
[all...] |
| /external/skia/src/core/ |
| SkHalf.h | 19 static constexpr uint16_t SK_HalfMin = 0x0400; // 2^-14 (minimum positive normal value)
52 positive = bits ^ sign, // ...but strip it off for now.
53 is_norm = 0x03ff < positive; // Exponent > 0?
57 Sk4i norm = (positive << 13) + ((127 - 15) << 23);
73 positive = bits ^ sign, // ...but strip it off for now.
74 will_be_norm = 0x387fdfff < positive; // greater than largest denorm half?
78 Sk4i norm = (positive - ((127 - 15) << 23)) >> 13;
|
| /external/guava/guava-tests/benchmark/com/google/common/math/ |
| BigIntegerMathRoundingBenchmark.java | 40 private static final BigInteger[] positive = new BigInteger[ARRAY_SIZE]; field in class:BigIntegerMathRoundingBenchmark
48 positive[i] = randomPositiveBigInteger(1024);
58 tmp += BigIntegerMath.log2(positive[j], mode);
67 tmp += BigIntegerMath.log10(positive[j], mode);
76 tmp += BigIntegerMath.sqrt(positive[j], mode).intValue();
|
| IntMathRoundingBenchmark.java | 38 private static final int[] positive = new int[ARRAY_SIZE]; field in class:IntMathRoundingBenchmark
45 positive[i] = randomPositiveBigInteger(Integer.SIZE - 2).intValue();
58 tmp += IntMath.log2(positive[j], mode);
67 tmp += IntMath.log10(positive[j], mode);
76 tmp += IntMath.sqrt(positive[j], mode);
|
| LongMathRoundingBenchmark.java | 41 private static final long[] positive = new long[ARRAY_SIZE]; field in class:LongMathRoundingBenchmark
48 positive[i] = randomPositiveBigInteger(Long.SIZE - 2).longValue();
58 tmp += LongMath.log2(positive[j], mode);
67 tmp += LongMath.log10(positive[j], mode);
76 tmp += LongMath.sqrt(positive[j], mode);
|
| IntMathBenchmark.java | 39 private static final int[] positive = new int[ARRAY_SIZE]; field in class:IntMathBenchmark
49 positive[i] = randomPositiveBigInteger(Integer.SIZE - 1).intValue();
59 tmp += IntMath.pow(positive[j], exponent[j]);
68 tmp += IntMath.mod(ints[j], positive[j]);
77 tmp += IntMath.gcd(nonnegative[j], positive[j]);
|
| LongMathBenchmark.java | 39 private static final long[] positive = new long[ARRAY_SIZE]; field in class:LongMathBenchmark
47 positive[i] = randomPositiveBigInteger(Long.SIZE - 1).longValue();
62 tmp += LongMath.pow(positive[j], exponents[j]);
71 tmp += LongMath.mod(longs[j], positive[j]);
80 tmp += LongMath.mod(nonnegative[j], positive[j]);
|
| /libcore/luni/src/main/java/java/math/ |
| Logical.java | 112 // PRE: both arguments are positive
128 /** @return sign = positive.magnitude & magnitude = -negative.magnitude */
129 static BigInteger andDiffSigns(BigInteger positive, BigInteger negative) {
130 // PRE: positive is positive and negative is negative
131 int iPos = positive.getFirstNonzeroDigit();
135 // the positive digits
136 if (iNeg >= positive.numberLength) {
139 int resLength = positive.numberLength;
145 resDigits[i] = -negative.digits[i] & positive.digits[i]
[all...] |
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/epiphany/ |
| addr-syntax.s | 3 ; Check postmodified immediate with positive and negative displacements
|
| /external/pdfium/third_party/bigint/ |
| BigInteger.cc | 26 case positive:
45 case positive:
62 BigInteger::BigInteger(unsigned long x) : mag(x) { sign = mag.isZero() ? zero : positive; }
63 BigInteger::BigInteger(unsigned int x) : mag(x) { sign = mag.isZero() ? zero : positive; }
64 BigInteger::BigInteger(unsigned short x) : mag(x) { sign = mag.isZero() ? zero : positive; }
78 : (x > 0) ? BigInteger::positive
115 if (sign == positive) {
149 case positive:
256 // is positive, otherwise it is negative.
257 sign = (a.sign == b.sign) ? positive : negative
[all...] |
| BigInteger.hh | 30 enum Sign { negative = -1, zero = 0, positive = 1 }; enumerator in enum:BigInteger::Sign
51 sign = mag.isZero() ? zero : positive;
59 sign = mag.isZero() ? zero : positive;
|
| /build/make/core/ |
| math.mk | 18 # Basic math functions for positive integers <= 100
28 # Returns true if $(1) is a positive integer <= 100, otherwise returns nothing.
42 $(if $(call math_is_number,$(1)),,$(error Only positive integers <= 100 are supported (not $(1))))
53 # If $1 or $2 is not a positive integer <= 100, then an error is generated.
|
| /prebuilts/go/darwin-x86/misc/cgo/testsanitizers/ |
| tsan4.go | 8 // positive reports.
|
| /prebuilts/go/linux-x86/misc/cgo/testsanitizers/ |
| tsan4.go | 8 // positive reports.
|
| /prebuilts/go/darwin-x86/src/math/ |
| bits.go | 16 // Inf returns positive infinity if sign >= 0, negative infinity if sign < 0.
40 // If sign > 0, IsInf reports whether f is positive infinity.
|
| /prebuilts/go/linux-x86/src/math/ |
| bits.go | 16 // Inf returns positive infinity if sign >= 0, negative infinity if sign < 0.
40 // If sign > 0, IsInf reports whether f is positive infinity.
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/cris/ |
| quick.s | 44 ; bits cases above covers positive numbers.
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/goto_16/d/ |
| T_goto_16_1.d | 29 ; test positive offset
|
| /cts/tools/vm-tests-tf/src/dot/junit/opcodes/goto_32/d/ |
| T_goto_32_1.d | 29 ; test positive offset
|
