| /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();
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| bcompos_test.cpp | 38 binary_compose<logical_and<bool>, odd, positive>
39 b = binary_compose<logical_and<bool>, odd, positive>(logical_and<bool>(), odd(), positive());
52 compose2(logical_and<bool>(), odd(), positive()));
|
| unary.h | 15 struct positive : public unary_function<int, bool> { struct in inherits:unary_function
|
| /ndk/tests/device/test-stlport/unit/ |
| bcompos_test.cpp | 38 binary_compose<logical_and<bool>, odd, positive>
39 b = binary_compose<logical_and<bool>, odd, positive>(logical_and<bool>(), odd(), positive());
52 compose2(logical_and<bool>(), odd(), positive()));
|
| unary.h | 15 struct positive : public unary_function<int, bool> { struct in inherits:unary_function
|
| /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/eigen/test/eigen2/ |
| eigen2_svd.cpp | 58 MatrixType unitary, positive; local
59 svd.computeUnitaryPositive(&unitary, &positive);
61 VERIFY_IS_APPROX(positive, positive.adjoint());
62 for(int i = 0; i < rows; i++) VERIFY(positive.diagonal()[i] >= 0); // cheap necessary (not sufficient) condition for positivity
63 VERIFY_IS_APPROX(unitary*positive, a);
65 svd.computePositiveUnitary(&positive, &unitary);
67 VERIFY_IS_APPROX(positive, positive.adjoint());
68 for(int i = 0; i < rows; i++) VERIFY(positive.diagonal()[i] >= 0); // cheap necessary (not sufficient) condition for positivit
[all...] |
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| stochastic_linear_ranker.cpp | 26 const SparseWeightVector<Key, Hash> &positive,
34 gradient.AdditiveWeightUpdate(1.0, positive, 0.0);
63 const SparseWeightVector<Key, Hash> &positive,
70 const double positive_score = ScoreSample(positive);
83 UpdateSubGradient(positive, negative, learning_rate,
90 UpdateSubGradient(positive, negative, learning_rate,
96 UpdateSubGradient(positive, current_negative_, learning_rate,
|
| /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...] |
| /external/libvpx/libvpx/vpx_dsp/arm/ |
| variance_media.asm | 47 sel r7, r6, lr ; select bytes with positive difference
53 usad8 r4, r7, lr ; calculate sum of positive differences
57 adds r8, r8, r4 ; add positive differences to sum
71 sel r7, r6, lr ; select bytes with positive difference
76 usad8 r4, r7, lr ; calculate sum of positive differences
81 add r8, r8, r4 ; add positive differences to sum
95 sel r7, r6, lr ; select bytes with positive difference
100 usad8 r4, r7, lr ; calculate sum of positive differences
105 add r8, r8, r4 ; add positive differences to sum
120 sel r7, r6, lr ; select bytes with positive differenc
[all...] |
| variance_halfpixvar16x16_h_media.asm | 50 sel r7, r6, lr ; select bytes with positive difference
56 usad8 r4, r7, lr ; calculate sum of positive differences
60 adds r8, r8, r4 ; add positive differences to sum
81 sel r7, r6, lr ; select bytes with positive difference
86 usad8 r4, r7, lr ; calculate sum of positive differences
91 add r8, r8, r4 ; add positive differences to sum
112 sel r7, r6, lr ; select bytes with positive difference
117 usad8 r4, r7, lr ; calculate sum of positive differences
122 add r8, r8, r4 ; add positive differences to sum
144 sel r7, r6, lr ; select bytes with positive differenc
[all...] |
| variance_halfpixvar16x16_v_media.asm | 51 sel r7, r6, lr ; select bytes with positive difference
57 usad8 r4, r7, lr ; calculate sum of positive differences
61 adds r8, r8, r4 ; add positive differences to sum
82 sel r7, r6, lr ; select bytes with positive difference
87 usad8 r4, r7, lr ; calculate sum of positive differences
92 add r8, r8, r4 ; add positive differences to sum
113 sel r7, r6, lr ; select bytes with positive difference
118 usad8 r4, r7, lr ; calculate sum of positive differences
123 add r8, r8, r4 ; add positive differences to sum
145 sel r7, r6, lr ; select bytes with positive differenc
[all...] |
| /external/v8/test/mjsunit/compiler/ |
| shift-shr.js | 8 // therefore positive).
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/arm/armv6/ |
| vp8_variance16x16_armv6.asm | 45 sel r7, r6, lr ; select bytes with positive difference
51 usad8 r4, r7, lr ; calculate sum of positive differences
55 adds r8, r8, r4 ; add positive differences to sum
69 sel r7, r6, lr ; select bytes with positive difference
74 usad8 r4, r7, lr ; calculate sum of positive differences
79 add r8, r8, r4 ; add positive differences to sum
93 sel r7, r6, lr ; select bytes with positive difference
98 usad8 r4, r7, lr ; calculate sum of positive differences
103 add r8, r8, r4 ; add positive differences to sum
118 sel r7, r6, lr ; select bytes with positive differenc
[all...] |
