| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/ |
| BigIntegerTest.java | 935 assertTrue("negative remainder == mod - divisor", r.signum() >= 0
938 assertTrue("mod fails on negative divisor only", i2.signum() <= 0);
|
| /development/ndk/platforms/android-24/include/GLES2/ |
| gl2ext.h | [all...] |
| /external/deqp/framework/platform/null/ |
| tcuNullRenderContextFuncs.inl | [all...] |
| /frameworks/native/opengl/include/GLES2/ |
| gl2ext.h | [all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
| vp9_firstpass.c | 1683 int divisor = boost >> 10; local
2139 int divisor = kf_boost >> 10; local
[all...] |
| /external/skia/tools/ |
| pathops_visualizer.htm | [all...] |
| /art/compiler/optimizing/ |
| code_generator_mips64.cc | 2076 GpuRegister divisor = second.AsRegister<GpuRegister>(); local
2164 int64_t divisor = codegen_->GetInt64ValueOf(value.GetConstant()->AsConstant()); local
[all...] |
| /external/icu/icu4j/demos/src/com/ibm/icu/dev/demo/rbnf/ |
| RbnfSampleRuleSets.java | 98 // of the rule. A rule's divisor is (usually) the highest
101 // divisor, and the integral quotient is used to get the text
104 // being formatted is an even multiple of the rule's divisor
109 // rule's divisor, which for all these rules is also the rule's
136 // of the rule's radix by one, causing the rule's divisor
150 // the rule's divisor, and the rule's base value ISN'T an even multiple
151 // if the rule's divisor, then the rule that precedes this one in the
[all...] |
| /external/libpng/ |
| png.c | [all...] |
| /external/pdfium/third_party/lpng_v163/ |
| png.c | [all...] |
| /external/valgrind/coregrind/ |
| m_main.c | [all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/share/info/ |
| gmp.info-2 | 25 File: gmp.info, Node: Subquadratic GCD, Next: Extended GCD, Prev: Lehmer's Algorithm, Up: Greatest Common Divisor Algorithms
77 File: gmp.info, Node: Extended GCD, Next: Jacobi Symbol, Prev: Subquadratic GCD, Up: Greatest Common Divisor Algorithms
102 File: gmp.info, Node: Jacobi Symbol, Prev: Extended GCD, Up: Greatest Common Divisor Algorithms
123 File: gmp.info, Node: Powering Algorithms, Next: Root Extraction Algorithms, Prev: Greatest Common Divisor Algorithms, Up: Algorithms
306 If a prime divisor p with multiplicity e can be found, then only
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/util/ |
| MathUtils.java | 231 // is relative prime to (i/d) and is a divisor of
870 * Gets the greatest common divisor of the absolute value of two numbers,
892 * @return the greatest common divisor, never negative
[all...] |
| FastMath.java | [all...] |
| /external/valgrind/VEX/priv/ |
| guest_ppc_toIR.c | 3681 IRExpr* divisor = mk64lo32Sto64( mkexpr(rB) ); local
3712 IRExpr* divisor = mk64lo32Uto64( mkexpr(rB) ); local
3995 IRExpr * dividend, * divisor; local
4030 IRExpr * dividend, * divisor; local
[all...] |
| /external/deqp/framework/opengl/wrapper/ |
| glwApi.inl | [all...] |
| glwFunctionTypes.inl | [all...] |
| glwImpl.inl | [all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineMulDivRem.cpp | [all...] |
| /external/mesa3d/src/gallium/state_trackers/glx/xlib/ |
| glx_api.c | [all...] |
| /external/mesa3d/src/mesa/drivers/x11/ |
| fakeglx.c | [all...] |
| /external/okhttp/okhttp-tests/src/test/java/com/squareup/okhttp/internal/framed/ |
| Spdy3ConnectionTest.java | [all...] |
| /external/opencv/cxcore/src/ |
| cxarithm.cpp | [all...] |
| /packages/apps/ContactsCommon/src/com/android/contacts/common/ |
| ContactPhotoManager.java | 760 private static final int safeDiv(int dividend, int divisor) {
761 return (divisor == 0) ? 0 : (dividend / divisor);
[all...] |
| /external/clang/lib/CodeGen/ |
| CGExprScalar.cpp | 2665 llvm::Value *divisor = nullptr; local
[all...] |
