JoaoJunior/formatted-java-preprocessed-code-APR

private static final int[] euclidInv(int a, int b, int prevDiv) { if (b == 0) throw new ArithmeticException("not invertible"); if (b == 1) // Success: values are indeed invertible! // Bottom of the recursion reached; start unwinding. return new int[] { -prevDiv, 1 }; int[] xy = euclidInv(b, a % b, a /...

private static int[] euclidInv(int a, int b, int prevDiv) { if (b == 0) throw new ArithmeticException("not invertible"); if (b == 1) // Success: values are indeed invertible! // Bottom of the recursion reached; start unwinding. return new int[] { -prevDiv, 1 }; int[] xy = euclidInv(b, a % b, a / b); /...

20,044

private static final int gcd(int a, int b) { // Euclid's algorithm, copied from libg++. int tmp; if (b > a) { tmp = a; a = b; b = tmp; } for(;;) { if (b == 0) return a; if (b == 1) return b; tmp = b; b = a % b; a = tmp; } }

private static int gcd(int a, int b) { // Euclid's algorithm, copied from libg++. int tmp; if (b > a) { tmp = a; a = b; b = tmp; } for(;;) { if (b == 0) return a; if (b == 1) return b; tmp = b; b = a % b; a = tmp; } }

20,045

private final boolean isNegative() { return (words == null ? ival : words[ival - 1]) < 0; }

private boolean isNegative() { return (words == null ? ival : words[ival - 1]) < 0; }

20,046

private final boolean isOne() { return words == null && ival == 1; }

private boolean isOne() { return words == null && ival == 1; }

20,047

private final boolean isZero() { return words == null && ival == 0; }

private boolean isZero() { return words == null && ival == 0; }

20,048

private final void set(long y) { int i = (int) y; if ((long) i == y) { ival = i; words = null; } else { realloc(2); words[0] = i; words[1] = (int) (y >> 32); ival = 2; } }

private void set(long y) { int i = (int) y; if ((long) i == y) { ival = i; words = null; } else { realloc(2); words[0] = i; words[1] = (int) (y >> 32); ival = 2; } }

20,049

private static final BigInteger times(BigInteger x, int y) { if (y == 0) return ZERO; if (y == 1) return x; int[] xwords = x.words; int xlen = x.ival; if (xwords == null) return valueOf((long) xlen * (long) y); boolean negative; BigInteger result = BigInteger.alloc(xlen + 1); i...

private static BigInteger times(BigInteger x, int y) { if (y == 0) return ZERO; if (y == 1) return x; int[] xwords = x.words; int xlen = x.ival; if (xwords == null) return valueOf((long) xlen * (long) y); boolean negative; BigInteger result = BigInteger.alloc(xlen + 1); if (xwo...

20,050

private NumericShaper (int ranges, int context) { this.ranges = ranges; this.context = context; }

private NumericShaper (int key, int mask) { this.ranges = ranges; this.context = context; }

20,051

private NumericShaper (int ranges, int context) { this.ranges = ranges; this.context = context; }

20,052

public boolean equals (Object obj) { if (! (obj instanceof NumericShaper)) return false; NumericShaper tmp = (NumericShaper) obj; return (ranges == tmp.ranges && context == tmp.context); }

20,053

public static NumericShaper getContextualShaper (int ranges) { throw new Error ("not implemented"); }

public static NumericShaper getContextualShaper (int ranges) { if ((ranges & ~ALL_RANGES) != 0) throw new IllegalArgumentException("argument out of range"); return new NumericShaper(EUROPEAN, ranges); }

20,054

public int getRanges () { return ranges; }

public int getRanges () { return mask & ALL_RANGES; }

20,055

public static NumericShaper getShaper (int singleRange) { throw new Error ("not implemented"); }

public static NumericShaper getShaper (int singleRange) { if (Integer.bitCount(singleRange) != 1) throw new IllegalArgumentException("more than one bit set in argument"); if ((singleRange & ~ALL_RANGES) != 0) throw new IllegalArgumentException("argument out of range"); return new NumericShaper(singleRange, Intege...

20,056

public int hashCode () { throw new Error ("not implemented"); }

public int hashCode () { return key ^ mask; }

20,057

public boolean isContextual () { throw new Error ("not implemented"); }

public boolean isContextual () { return mask > 0; }

20,058

public void shape (char[] text, int start, int count) { shape (text, start, count, context); }

public void shape (char[] text, int start, int count) { shape (text, start, count, 1 << key); }

20,059

public String toString () { throw new Error ("not implemented"); }

public String toString () { return "key=" + key + "; mask=" + mask; }

20,060

void setPage(URL page) throws IOException { // Sets the current URL being displayed. }

20,061

public X509CRL(InputStream encoded) throws CRLException, IOException { super(); revokedCerts = new HashMap(); extensions = new HashMap(); critOids = new HashSet(); nonCritOids = new HashSet(); try { parse(encoded); } catch (IOException ioe) { ioe.printStackTrace(); ...

20,062

public boolean equals(Object o) { return ((X509CRL) o).revokedCerts.equals(revokedCerts); }

public boolean equals(Object o) { if (!(o instanceof X509CRL)) return false; return ((X509CRL) o).getRevokedCertificates().equals(revokedCerts.values()); }

20,063

public Set getCriticalExtensionOIDs() { return Collections.unmodifiableSet(critOids); }

public Set getCriticalExtensionOIDs() { HashSet s = new HashSet(); for (Iterator it = extensions.values().iterator(); it.hasNext(); ) { Extension e = (Extension) it.next(); if (e.isCritical()) s.add(e.getOid().toString()); } return Collections.unmodifiableSet(s); }

20,064

public byte[] getExtensionValue(String oid) { byte[] ext = (byte[]) extensions.get(oid); if (ext != null) return (byte[]) ext.clone(); return null; }

20,065

public X500Principal getIssuerX500Principal() { return issuerDN; }

public X500Principal getIssuerX500Principal() { return new X500Principal(issuerDN.getDer()); }

20,066

public Set getNonCriticalExtensionOIDs() { return Collections.unmodifiableSet(nonCritOids); }

public Set getNonCriticalExtensionOIDs() { HashSet s = new HashSet(); for (Iterator it = extensions.values().iterator(); it.hasNext(); ) { Extension e = (Extension) it.next(); if (!e.isCritical()) s.add(e.getOid().toString()); } return Collections.unmodifiableSet(s); }

20,067

public X509CRLEntry getRevokedCertificate(BigInteger serialNo) { return (X509CRLEntry) revokedCerts.get(serialNo); }

public java.security.cert.X509CRLEntry getRevokedCertificate(BigInteger serialNo) { return (X509CRLEntry) revokedCerts.get(serialNo); }

20,068

public X509CRLEntry getRevokedCertificate(BigInteger serialNo) { return (X509CRLEntry) revokedCerts.get(serialNo); }

public X509CRLEntry getRevokedCertificate(BigInteger serialNo) { return (java.security.cert.X509CRLEntry) revokedCerts.get(serialNo); }

20,069

public boolean hasUnsupportedCriticalExtension() { return false; // XXX }

public boolean hasUnsupportedCriticalExtension() { for (Iterator it = extensions.values().iterator(); it.hasNext(); ) { Extension e = (Extension) it.next(); if (e.isCritical() && !e.isSupported()) return true; } return false; // XXX }

20,070