Searched defs:mod (Results 26 - 32 of 32) sorted by relevance
12
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/dv/xs/ |
H A D | AbstractDateTimeDV.java | 629 date.minute = mod(temp, 60, carry); 637 date.hour = mod(temp, 24, carry); 726 protected int mod(int a, int b, int quotient) { method in class:AbstractDateTimeDV 747 return (mod(a, b, fQuotient(a, b)) + low);
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/tools/internal/jxc/model/nav/ |
H A D | APTNavigator.java | 188 private boolean hasModifier(Declaration d, Modifier mod) { argument 189 return d.getModifiers().contains(mod);
|
/openjdk7/jdk/src/share/classes/sun/tools/java/ |
H A D | MemberDefinition.java | 196 public final void subModifiers(int mod) { argument 197 modifiers &= ~mod; 199 public final void addModifiers(int mod) { argument 200 modifiers |= mod;
|
H A D | ClassDefinition.java | 177 public final void subModifiers(int mod) { argument 178 modifiers &= ~mod; 180 public final void addModifiers(int mod) { argument 181 modifiers |= mod;
|
/openjdk7/jdk/src/share/classes/java/math/ |
H A D | BigInteger.java | 778 return u.mod(this).equals(ZERO); 798 j = -j; // 3 (011) or 7 (111) mod 8 807 j = -j; // 3 (011) or 5 (101) mod 8 812 if ((p & u & 2) != 0) // p = u = 3 (mod 4)? 814 // And reduce u mod p 815 u = n.mod(BigInteger.valueOf(p)).intValue(); 824 j = -j; // 3 (011) or 5 (101) mod 8 831 if ((u & p & 2) != 0) // u = p = 3 (mod 4)? 845 u2 = u.multiply(v).mod(n); 847 v2 = v.square().add(d.multiply(u.square())).mod( 1553 public BigInteger mod(BigInteger m) { method in class:BigInteger 1873 montReduce(int[] n, int[] mod, int mlen, int inv) argument [all...] |
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | node.cpp | 62 const int mod = 100000; local 63 int bump = (int)(_idx - new_debug_idx) % mod; 64 if (bump < 0) bump += mod; 65 assert(bump >= 0 && bump < mod, ""); 1237 igvn->hash_delete(use); // Yank from hash table prior to mod
|
/openjdk7/jdk/src/share/native/com/sun/java/util/jar/pack/ |
H A D | unpack.cpp | 505 growBy += -growBy & 7; // round up mod 8 2695 int mod; local 2699 mod = 12; 2703 mod = 8; 2708 mod = 7; 2710 max_stack = sc % mod; 2711 max_na_locals = sc / mod; // caller must add static, siglen 3011 uint hash2 = 0; // lazily computed (requires mod op.)
|
Completed in 75 milliseconds
12