Datasets:
JoaoJunior
/
formatted-java-preprocessed-code-APR

Dataset card Data Studio Files
xet
 Community
bugged
stringlengths
6
599k
fixed
stringlengths
10
599k
__index_level_0__
int64
0
1.13M
public boolean atomicChangeObjectColor(Object dst, int oldColor, int newColor) { final Address addr = ObjectReference.fromObject(dst).toAddress().add( flagsOffset); int oldValue; int newValue; do { oldValue = addr.prepareInt(); if ((oldValu...
public boolean atomicChangeObjectColor(Object dst, int oldColor, int newColor) { final Address addr = ObjectReference.fromObject(dst).toAddress().add( flagsOffset); int oldValue; int newValue; do { oldValue = addr.prepareInt(); if ((oldValu...
15,287
public final Monitor getInflatedMonitor(Object object, VmArchitecture arch) { return MonitorManager.getInflatedMonitor(object, arch); }
public final Monitor getInflatedMonitor(Object object, VmArchitecture arch) { return MonitorManager.getInflatedMonitor(object); }
15,288
public int hashCode () { // FIXME: Check what SUN calculates here. return super.hashCode (); }
public int hashCode () { // FIXME: Check what SUN calculates here. int hashCode = Float.floatToIntBits(get(position())) + 31; int multiplier = 1; for (int i = position() + 1; i < limit(); ++i) { multiplier *= 31; hashCode += (Float.floatToIntBits(get(i)) + 30)*multiplier; } return hashCode; }
15,289
final public static FloatBuffer wrap (float[] array, int offset, int length) { return new FloatBufferImpl (array, 0, array.length, offset + length, offset, -1, false); }
public static final FloatBuffer wrap (float[] array, int offset, int length) { return new FloatBufferImpl (array, 0, array.length, offset + length, offset, -1, false); }
15,290
public static float[] RGBtoHSB(int red, int green, int blue, float array[]) { if (array == null) array = new float[3]; // Calculate brightness. int min; int max; if (red < green) { min = red; max = green; } else { min = green; max = red; } if ...
public static float[] RGBtoHSB(int red, int green, int blue, float array[]) { if (array == null) array = new float[3]; // Calculate brightness. int min; int max; if (red < green) { min = red; max = green; } else { min = green; max = red; } if ...
15,291
public File resolveFile(String fileName) throws FileNotFoundException { if (directoryList == null){ File file = new File(fileName); if(file.exists()) { System.out.println("Resolved: " + file); return file; } else { throw new FileNo...
public File resolveFile(String fileName) throws FileNotFoundException { if (directoryList == null){ File file = new File(fileName); if(file.exists()) { return file; } else { throw new FileNotFoundException(fileName); } ...
15,292
public File resolveFile(String fileName) throws FileNotFoundException { if (directoryList == null){ File file = new File(fileName); if(file.exists()) { System.out.println("Resolved: " + file); return file; } else { throw new FileNo...
public File resolveFile(String fileName) throws FileNotFoundException { if (directoryList == null){ File file = new File(fileName); if(file.exists()) { System.out.println("Resolved: " + file); return file; } else { throw new FileNo...
15,293
public AccessibleJPanel() { // Nothing to do here. }
protected AccessibleJPanel() { // Nothing to do here. }
15,294
Stylesheet(TransformerFactoryImpl factory, Stylesheet parent, Document doc, String systemId, int precedence) throws TransformerConfigurationException { this.factory = factory; this.systemId = systemId; this.precedence = precedence; this.parent = parent; ...
Stylesheet(TransformerFactoryImpl factory, Stylesheet parent, Document doc, String systemId, int precedence) throws TransformerConfigurationException { this.factory = factory; this.systemId = systemId; this.precedence = precedence; this.parent = parent; ...
15,295
Stylesheet(TransformerFactoryImpl factory, Stylesheet parent, Document doc, String systemId, int precedence) throws TransformerConfigurationException { this.factory = factory; this.systemId = systemId; this.precedence = precedence; this.parent = parent; ...
Stylesheet(TransformerFactoryImpl factory, Stylesheet parent, Document doc, String systemId, int precedence) throws TransformerConfigurationException { this.factory = factory; this.systemId = systemId; this.precedence = precedence; this.parent = parent; ...
15,296
final void addNamespaceNodes(Node source, Node target, Document doc, Collection elementExcludeResultPrefixes) { NamedNodeMap attrs = source.getAttributes(); if (attrs != null) { int len = attrs.getLength(); for (int i = 0; i < len; i++) { Nod...
final void addNamespaceNodes(Node source, Node target, Document doc, Collection elementExcludeResultPrefixes) NamedNodeMap attrs = source.getAttributes(); if (attrs != null) int len = attrs.getLength(); for (int i = 0; i < len; i++) Node a...
15,297
final void addNamespaceNodes(Node source, Node target, Document doc, Collection elementExcludeResultPrefixes) { NamedNodeMap attrs = source.getAttributes(); if (attrs != null) { int len = attrs.getLength(); for (int i = 0; i < len; i++) { Nod...
final void addNamespaceNodes(Node source, Node target, Document doc, Collection elementExcludeResultPrefixes) { NamedNodeMap attrs = source.getAttributes(); if (attrs != null) { int len = attrs.getLength(); for (int i = 0; i < len; i++) { Nod...
15,298
void doParse(Node node, boolean root) throws TransformerConfigurationException { try { String namespaceUri = node.getNamespaceURI(); if (XSL_NS.equals(namespaceUri) && node.getNodeType() == Node.ELEMENT_NODE) { String name = node.getLocalName(); Name...
void doParse(Node node, boolean root) throws TransformerConfigurationException try String namespaceUri = node.getNamespaceURI(); if (XSL_NS.equals(namespaceUri) && node.getNodeType() == Node.ELEMENT_NODE) String name = node.getLocalName(); NamedNo...
15,299
void doParse(Node node, boolean root) throws TransformerConfigurationException { try { String namespaceUri = node.getNamespaceURI(); if (XSL_NS.equals(namespaceUri) && node.getNodeType() == Node.ELEMENT_NODE) { String name = node.getLocalName(); Name...
void doParse(Node node, boolean root) throws TransformerConfigurationException { try { String namespaceUri = node.getNamespaceURI(); if (XSL_NS.equals(namespaceUri) && node.getNodeType() == Node.ELEMENT_NODE) { String name = node.getLocalName(); Name...
15,300
void doParse(Node node, boolean root) throws TransformerConfigurationException { try { String namespaceUri = node.getNamespaceURI(); if (XSL_NS.equals(namespaceUri) && node.getNodeType() == Node.ELEMENT_NODE) { String name = node.getLocalName(); Name...
void doParse(Node node, boolean root) throws TransformerConfigurationException { try { String namespaceUri = node.getNamespaceURI(); if (XSL_NS.equals(namespaceUri) && node.getNodeType() == Node.ELEMENT_NODE) { String name = node.getLocalName(); Name...
15,301
void doParse(Node node, boolean root) throws TransformerConfigurationException { try { String namespaceUri = node.getNamespaceURI(); if (XSL_NS.equals(namespaceUri) && node.getNodeType() == Node.ELEMENT_NODE) { String name = node.getLocalName(); Name...
void doParse(Node node, boolean root) throws TransformerConfigurationException { try { String namespaceUri = node.getNamespaceURI(); if (XSL_NS.equals(namespaceUri) && node.getNodeType() == Node.ELEMENT_NODE) { String name = node.getLocalName(); Name...
15,302
static final String getAttribute(NamedNodeMap attrs, String name) { Node attr = attrs.getNamedItem(name); if (attr == null) { return null; } String ret = attr.getNodeValue(); if (ret.length() == 0) { return null; } return ret; }
static final String getAttribute(NamedNodeMap attrs, String name) Node attr = attrs.getNamedItem(name); if (attr == null) return null; } String ret = attr.getNodeValue(); if (ret.length() == 0) return null; } return ret; }
15,303
static final String getAttribute(NamedNodeMap attrs, String name) { Node attr = attrs.getNamedItem(name); if (attr == null) { return null; } String ret = attr.getNodeValue(); if (ret.length() == 0) { return null; } return ret; }
static final String getAttribute(NamedNodeMap attrs, String name) { Node attr = attrs.getNamedItem(name); if (attr == null) { return null; String ret = attr.getNodeValue(); if (ret.length() == 0) { return null; return ret;
15,304
Stylesheet getRootStylesheet() { Stylesheet stylesheet = this; while (stylesheet.parent != null) { stylesheet = stylesheet.parent; } return stylesheet; }
Stylesheet getRootStylesheet() Stylesheet stylesheet = this; while (stylesheet.parent != null) stylesheet = stylesheet.parent; } return stylesheet; }
15,305
Stylesheet getRootStylesheet() { Stylesheet stylesheet = this; while (stylesheet.parent != null) { stylesheet = stylesheet.parent; } return stylesheet; }
Stylesheet getRootStylesheet() { Stylesheet stylesheet = this; while (stylesheet.parent != null) { stylesheet = stylesheet.parent; return stylesheet;
15,306
TemplateNode getTemplate(QName mode, Node context, boolean applyImports) throws TransformerException { if (debug) { System.err.println("getTemplate: mode="+mode+" context="+context); } Set candidates = new TreeSet(); for (Iterator j = templates.iterator(); j.hasNext(); ) { Te...
TemplateNode getTemplate(QName mode, Node context, boolean applyImports) throws TransformerException if (debug) System.err.println("getTemplate: mode="+mode+" context="+context); } Set candidates = new TreeSet(); for (Iterator j = templates.iterator(); j.hasNext(); ) Templ...
15,307
TemplateNode getTemplate(QName mode, Node context, boolean applyImports) throws TransformerException { if (debug) { System.err.println("getTemplate: mode="+mode+" context="+context); } Set candidates = new TreeSet(); for (Iterator j = templates.iterator(); j.hasNext(); ) { Te...
TemplateNode getTemplate(QName mode, Node context, boolean applyImports) throws TransformerException { if (debug) { System.err.println("getTemplate: mode="+mode+" context="+context); } Set candidates = new TreeSet(); for (Iterator j = templates.iterator(); j.hasNext(); ) { Te...
15,308
TemplateNode getTemplate(QName mode, Node context, boolean applyImports) throws TransformerException { if (debug) { System.err.println("getTemplate: mode="+mode+" context="+context); } Set candidates = new TreeSet(); for (Iterator j = templates.iterator(); j.hasNext(); ) { Te...
TemplateNode getTemplate(QName mode, Node context, boolean applyImports) throws TransformerException { if (debug) { System.err.println("getTemplate: mode="+mode+" context="+context); Set candidates = new TreeSet(); for (Iterator j = templates.iterator(); j.hasNext(); ) { Tem...
15,309
TemplateNode getTemplate(QName mode, Node context, boolean applyImports) throws TransformerException { if (debug) { System.err.println("getTemplate: mode="+mode+" context="+context); } Set candidates = new TreeSet(); for (Iterator j = templates.iterator(); j.hasNext(); ) { Te...
TemplateNode getTemplate(QName mode, Node context, boolean applyImports) throws TransformerException { if (debug) { System.err.println("getTemplate: mode="+mode+" context="+context); } Set candidates = new TreeSet(); for (Iterator j = templates.iterator(); j.hasNext(); ) { Te...
15,310
TemplateNode getTemplate(QName mode, Node context, boolean applyImports) throws TransformerException { if (debug) { System.err.println("getTemplate: mode="+mode+" context="+context); } Set candidates = new TreeSet(); for (Iterator j = templates.iterator(); j.hasNext(); ) { Te...
TemplateNode getTemplate(QName mode, Node context, boolean applyImports) throws TransformerException { if (debug) { System.err.println("getTemplate: mode="+mode+" context="+context); } Set candidates = new TreeSet(); for (Iterator j = templates.iterator(); j.hasNext(); ) { Te...
15,311
TemplateNode getTemplate(QName mode, Node context, boolean applyImports) throws TransformerException { if (debug) { System.err.println("getTemplate: mode="+mode+" context="+context); } Set candidates = new TreeSet(); for (Iterator j = templates.iterator(); j.hasNext(); ) { Te...
TemplateNode getTemplate(QName mode, Node context, boolean applyImports) throws TransformerException { if (debug) { System.err.println("getTemplate: mode="+mode+" context="+context); } Set candidates = new TreeSet(); for (Iterator j = templates.iterator(); j.hasNext(); ) { Te...
15,312
TemplateNode getTemplate(QName mode, Node context, boolean applyImports) throws TransformerException { if (debug) { System.err.println("getTemplate: mode="+mode+" context="+context); } Set candidates = new TreeSet(); for (Iterator j = templates.iterator(); j.hasNext(); ) { Te...
TemplateNode getTemplate(QName mode, Node context, boolean applyImports) throws TransformerException { if (debug) { System.err.println("getTemplate: mode="+mode+" context="+context); } Set candidates = new TreeSet(); for (Iterator j = templates.iterator(); j.hasNext(); ) { Te...
15,313
TemplateNode getTemplate(QName mode, Node context, boolean applyImports) throws TransformerException { if (debug) { System.err.println("getTemplate: mode="+mode+" context="+context); } Set candidates = new TreeSet(); for (Iterator j = templates.iterator(); j.hasNext(); ) { Te...
TemplateNode getTemplate(QName mode, Node context, boolean applyImports) throws TransformerException { if (debug) { System.err.println("getTemplate: mode="+mode+" context="+context); } Set candidates = new TreeSet(); for (Iterator j = templates.iterator(); j.hasNext(); ) { Te...
15,314
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
boolean isPreserved(Text text, boolean source) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); i...
15,315
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
boolean isPreserved(Text text) throws TransformerConfigurationException // Check characters in text String value = text.getData(); if (value != null) int len = value.length(); for (int i = 0; i < len; i++) char c = value.charAt(i); if (c != 0x20 && c !...
15,316
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
15,317
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
15,318
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
15,319
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
15,320
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
15,321
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
15,322
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
15,323
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
15,324
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
15,325
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
15,326
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
boolean isPreserved(Text text) throws TransformerConfigurationException { // Check characters in text String value = text.getData(); if (value != null) { int len = value.length(); for (int i = 0; i < len; i++) { char c = value.charAt(i); if (c != 0x20 && ...
15,327
final TemplateNode parseApplyTemplates(Node node) throws TransformerConfigurationException, XPathExpressionException { NamedNodeMap attrs = node.getAttributes(); String m = getAttribute(attrs, "mode"); QName mode = (m == null) ? null : getQName(m); String s = getAttribute(attrs, "select"); if (s ==...
final TemplateNode parseApplyTemplates(Node node) throws TransformerConfigurationException, XPathExpressionException NamedNodeMap attrs = node.getAttributes(); String m = getAttribute(attrs, "mode"); QName mode = (m == null) ? null : getQName(m); String s = getAttribute(attrs, "select"); if (s == ...
15,328
final TemplateNode parseApplyTemplates(Node node) throws TransformerConfigurationException, XPathExpressionException { NamedNodeMap attrs = node.getAttributes(); String m = getAttribute(attrs, "mode"); QName mode = (m == null) ? null : getQName(m); String s = getAttribute(attrs, "select"); if (s ==...
final TemplateNode parseApplyTemplates(Node node) throws TransformerConfigurationException, XPathExpressionException { NamedNodeMap attrs = node.getAttributes(); String m = getAttribute(attrs, "mode"); QName mode = (m == null) ? null : getQName(m); String s = getAttribute(attrs, "select"); if (s ==...
15,329
final NameTest parseNameTest(String token) { if ("*".equals(token)) { return new NameTest(null, true, true); } else if (token.endsWith(":*")) { QName qName = getQName(token.substring(0, token.length() - 2)); return new NameTest(qName, true, false); } else { ...
final NameTest parseNameTest(String token) if ("*".equals(token)) return new NameTest(null, true, true); } else if (token.endsWith(":*")) QName qName = getQName(token.substring(0, token.length() - 2)); return new NameTest(qName, true, false); } else Q...
15,330
final NameTest parseNameTest(String token) { if ("*".equals(token)) { return new NameTest(null, true, true); } else if (token.endsWith(":*")) { QName qName = getQName(token.substring(0, token.length() - 2)); return new NameTest(qName, true, false); } else { ...
final NameTest parseNameTest(String token) { if ("*".equals(token)) { return new NameTest(null, true, true); else if (token.endsWith(":*")) { QName qName = getQName(token.substring(0, token.length() - 2)); return new NameTest(qName, true, false); else { ...
15,331
final NameTest parseNameTest(String token) { if ("*".equals(token)) { return new NameTest(null, true, true); } else if (token.endsWith(":*")) { QName qName = getQName(token.substring(0, token.length() - 2)); return new NameTest(qName, true, false); } else { ...
final NameTest parseNameTest(String token) { if ("*".equals(token)) { return new NameTest(null, true, true); } else if (token.endsWith(":*")) { QName qName = getQName(token); return new NameTest(qName, true, false); } else { QName qName = getQName(token);...
15,332
final void parseOutput(Node node, NamedNodeMap attrs) throws TransformerConfigurationException { output = node; String method = getAttribute(attrs, "method"); if ("xml".equals(method) || method == null) { outputMethod = OUTPUT_XML; } else if ("html".equals(method)) { outpu...
final void parseOutput(Node node, NamedNodeMap attrs) throws TransformerConfigurationException output = node; String method = getAttribute(attrs, "method"); if ("xml".equals(method) || method == null) outputMethod = OUTPUT_XML; } else if ("html".equals(method)) outputMe...
15,333
final void parseOutput(Node node, NamedNodeMap attrs) throws TransformerConfigurationException { output = node; String method = getAttribute(attrs, "method"); if ("xml".equals(method) || method == null) { outputMethod = OUTPUT_XML; } else if ("html".equals(method)) { outpu...
final void parseOutput(Node node, NamedNodeMap attrs) throws TransformerConfigurationException { output = node; String method = getAttribute(attrs, "method"); if ("xml".equals(method) || method == null) { outputMethod = OUTPUT_XML; else if ("html".equals(method)) { output...
15,334
final void parseOutput(Node node, NamedNodeMap attrs) throws TransformerConfigurationException { output = node; String method = getAttribute(attrs, "method"); if ("xml".equals(method) || method == null) { outputMethod = OUTPUT_XML; } else if ("html".equals(method)) { outpu...
final void parseOutput(Node node, NamedNodeMap attrs) throws TransformerConfigurationException { output = node; String method = getAttribute(attrs, "method"); if ("xml".equals(method) || method == null) { outputMethod = OUTPUT_XML; } else if ("html".equals(method)) { outpu...
15,335
final List parseSortKeys(Node node) throws TransformerConfigurationException, XPathExpressionException { List ret = new LinkedList(); while (node != null) { String namespaceUri = node.getNamespaceURI(); if (Stylesheet.XSL_NS.equals(namespaceUri) && Node.ELEMENT_NODE == node.get...
final List parseSortKeys(Node node) throws TransformerConfigurationException, XPathExpressionException List ret = new LinkedList(); while (node != null) String namespaceUri = node.getNamespaceURI(); if (Stylesheet.XSL_NS.equals(namespaceUri) && Node.ELEMENT_NODE == node.getNo...
15,336
final List parseSortKeys(Node node) throws TransformerConfigurationException, XPathExpressionException { List ret = new LinkedList(); while (node != null) { String namespaceUri = node.getNamespaceURI(); if (Stylesheet.XSL_NS.equals(namespaceUri) && Node.ELEMENT_NODE == node.get...
final List parseSortKeys(Node node) throws TransformerConfigurationException, XPathExpressionException { List ret = new LinkedList(); while (node != null) { String namespaceUri = node.getNamespaceURI(); if (Stylesheet.XSL_NS.equals(namespaceUri) && Node.ELEMENT_NODE == node.get...
15,337
final List parseWithParams(Node node) throws TransformerConfigurationException, XPathExpressionException { List ret = new LinkedList(); while (node != null) { String namespaceUri = node.getNamespaceURI(); if (Stylesheet.XSL_NS.equals(namespaceUri) && Node.ELEMENT_NODE == node.g...
final List parseWithParams(Node node) throws TransformerConfigurationException, XPathExpressionException List ret = new LinkedList(); while (node != null) String namespaceUri = node.getNamespaceURI(); if (Stylesheet.XSL_NS.equals(namespaceUri) && Node.ELEMENT_NODE == node.get...
15,338
final List parseWithParams(Node node) throws TransformerConfigurationException, XPathExpressionException { List ret = new LinkedList(); while (node != null) { String namespaceUri = node.getNamespaceURI(); if (Stylesheet.XSL_NS.equals(namespaceUri) && Node.ELEMENT_NODE == node.g...
final List parseWithParams(Node node) throws TransformerConfigurationException, XPathExpressionException { List ret = new LinkedList(); while (node != null) { String namespaceUri = node.getNamespaceURI(); if (Stylesheet.XSL_NS.equals(namespaceUri) && Node.ELEMENT_NODE == node.g...
15,339
public XPathFunction resolveFunction(QName name, int arity) { String uri = name.getNamespaceURI(); if (XSL_NS.equals(uri) || uri == null || uri.length() == 0) { String localName = name.getLocalPart(); if ("document".equals(localName) && (arity == 1 || arity == 2)) { if (c...
public XPathFunction resolveFunction(QName name, int arity) String uri = name.getNamespaceURI(); if (XSL_NS.equals(uri) || uri == null || uri.length() == 0) String localName = name.getLocalPart(); if ("document".equals(localName) && (arity == 1 || arity == 2)) if (curr...
15,340
public XPathFunction resolveFunction(QName name, int arity) { String uri = name.getNamespaceURI(); if (XSL_NS.equals(uri) || uri == null || uri.length() == 0) { String localName = name.getLocalPart(); if ("document".equals(localName) && (arity == 1 || arity == 2)) { if (c...
public XPathFunction resolveFunction(QName name, int arity) { String uri = name.getNamespaceURI(); if (XSL_NS.equals(uri) || uri == null || uri.length() == 0) { String localName = name.getLocalPart(); if ("document".equals(localName) && (arity == 1 || arity == 2)) { if (c...
15,341
public XPathFunction resolveFunction(QName name, int arity) { String uri = name.getNamespaceURI(); if (XSL_NS.equals(uri) || uri == null || uri.length() == 0) { String localName = name.getLocalPart(); if ("document".equals(localName) && (arity == 1 || arity == 2)) { if (c...
public XPathFunction resolveFunction(QName name, int arity) { String uri = name.getNamespaceURI(); if (XSL_NS.equals(uri) || uri == null || uri.length() == 0) { String localName = name.getLocalPart(); if ("document".equals(localName) && (arity == 1 || arity == 2)) { if (c...
15,342
public XPathFunction resolveFunction(QName name, int arity) { String uri = name.getNamespaceURI(); if (XSL_NS.equals(uri) || uri == null || uri.length() == 0) { String localName = name.getLocalPart(); if ("document".equals(localName) && (arity == 1 || arity == 2)) { if (c...
public XPathFunction resolveFunction(QName name, int arity) { String uri = name.getNamespaceURI(); if (XSL_NS.equals(uri) || uri == null || uri.length() == 0) { String localName = name.getLocalPart(); if ("document".equals(localName) && (arity == 1 || arity == 2)) { if (c...
15,343
private static final BigInteger add(int x, int y) { return BigInteger.make((long) x + (long) y); }
private static final BigInteger add(int x, int y) { return valueOf((long) x + (long) y); }
15,344
private static BigInteger alloc(int nwords) { if (nwords <= 1) return new BigInteger(); BigInteger result = new BigInteger(); result.words = new int[nwords]; return result; }
private static BigInteger alloc(int nwords) { if (nwords <= 1) return new BigInteger(); BigInteger result = new BigInteger(); result.words = new int[nwords]; return result; }
15,345
private static BigInteger and(BigInteger x, int y) { if (x.words == null) return BigInteger.make(x.ival & y); if (y >= 0) return BigInteger.make(x.words[0] & y); int len = x.ival; int[] words = new int[len]; words[0] = x.words[0] & y; while (--len > 0) words[len] = x.words[len]; r...
private static BigInteger and(BigInteger x, int y) { if (x.words == null) return valueOf(x.ival & y); if (y >= 0) return BigInteger.make(x.words[0] & y); int len = x.ival; int[] words = new int[len]; words[0] = x.words[0] & y; while (--len > 0) words[len] = x.words[len]; return Bi...
15,347
private static BigInteger and(BigInteger x, int y) { if (x.words == null) return BigInteger.make(x.ival & y); if (y >= 0) return BigInteger.make(x.words[0] & y); int len = x.ival; int[] words = new int[len]; words[0] = x.words[0] & y; while (--len > 0) words[len] = x.words[len]; r...
private static BigInteger and(BigInteger x, int y) { if (x.words == null) return BigInteger.make(x.ival & y); if (y >= 0) return valueOf(x.words[0] & y); int len = x.ival; int[] words = new int[len]; words[0] = x.words[0] & y; while (--len > 0) words[len] = x.words[len]; return Bi...
15,348
private static BigInteger and(BigInteger x, int y) { if (x.words == null) return BigInteger.make(x.ival & y); if (y >= 0) return BigInteger.make(x.words[0] & y); int len = x.ival; int[] words = new int[len]; words[0] = x.words[0] & y; while (--len > 0) words[len] = x.words[len]; r...
private static BigInteger and(BigInteger x, int y) { if (x.words == null) return BigInteger.make(x.ival & y); if (y >= 0) return BigInteger.make(x.words[0] & y); int len = x.ival; int[] words = new int[len]; words[0] = x.words[0] & y; while (--len > 0) words[len] = x.words[len]; r...
15,349
public int bitLength() { if (words == null) return MPN.intLength(ival); else return MPN.intLength(words, ival); }
public int bitLength() { if (words == null) return MPN.intLength(ival); return MPN.intLength(words, ival); }
15,350
private static BigInteger bitOp(int op, BigInteger x, BigInteger y) { switch (op) { case 0: return ZERO; case 1: return x.and(y); case 3: return x; case 5: return y; case 15: return make(-1); } BigInteger result = new BigInteger(); setBitOp(result, op, x, y);...
private static BigInteger bitOp(int op, BigInteger x, BigInteger y) { switch (op) { case 0: return ZERO; case 1: return x.and(y); case 3: return x; case 5: return y; case 15: return valueOf(-1); } BigInteger result = new BigInteger(); setBitOp(result, op, x, ...
15,351
private static int[] byteArrayToIntArray(byte[] bytes, int sign) { // Determine number of words needed. int[] words = new int[bytes.length/4 + 1]; int nwords = words.length; // Create a int out of modulo 4 high order bytes. int bptr = 0; int word = sign; for (int i = bytes.length % 4; i > 0; --i...
private static int[] byteArrayToIntArray(byte[] bytes, int sign) { // Determine number of words needed. int[] words = new int[bytes.length/4 + 1]; int nwords = words.length; // Create a int out of modulo 4 high order bytes. int bptr = 0; int word = sign; for (int i = bytes.length % 4; i > 0; --i...
15,352
private static int[] byteArrayToIntArray(byte[] bytes, int sign) { // Determine number of words needed. int[] words = new int[bytes.length/4 + 1]; int nwords = words.length; // Create a int out of modulo 4 high order bytes. int bptr = 0; int word = sign; for (int i = bytes.length % 4; i > 0; --i...
private static int[] byteArrayToIntArray(byte[] bytes, int sign) { // Determine number of words needed. int[] words = new int[bytes.length/4 + 1]; int nwords = words.length; // Create a int out of modulo 4 high order bytes. int bptr = 0; int word = sign; for (int i = bytes.length % 4; i > 0; --i...
15,353
private BigInteger canonicalize() { if (words != null && (ival = BigInteger.wordsNeeded(words, ival)) <= 1) { if (ival == 1) ival = words[0]; words = null; } if (words == null && ival >= minFixNum && ival <= maxFixNum) return smallFixNums[(int) ival - minFixNum]; return this; }
private BigInteger canonicalize() { if (words != null && (ival = BigInteger.wordsNeeded(words, ival)) <= 1) { if (ival == 1) ival = words[0]; words = null; } if (words == null && ival >= minFixNum && ival <= maxFixNum) return smallFixNums[ival - minFixNum]; return this; }
15,354
private static void divide(long x, long y, BigInteger quotient, BigInteger remainder, int rounding_mode) { boolean xNegative, yNegative; if (x < 0) { xNegative = true; if (x == Long.MIN_VALUE) { divide(BigInteger.make(x), BigInteger.make(y), quotient, remainder, rounding_mode); ...
private static void divide(long x, long y, BigInteger quotient, BigInteger remainder, int rounding_mode) { boolean xNegative, yNegative; if (x < 0) { xNegative = true; if (x == Long.MIN_VALUE) { divide(valueOf(x), valueOf(y), quotient, remainder, rounding_mode); return; } x =...
15,355
public double doubleValue() { if (words == null) return (double) ival; if (ival <= 2) return (double) longValue(); if (isNegative()) return BigInteger.neg(this).roundToDouble(0, true, false); else return roundToDouble(0, false, false); }
public double doubleValue() { if (words == null) return (double) ival; if (ival <= 2) return (double) longValue(); if (isNegative()) return BigInteger.neg(this).roundToDouble(0, true, false); else return roundToDouble(0, false, false); }
15,356
private static final int[] euclidInv(int a, int b, int prevDiv) { // Storage for return values, plus one slot for a temp int (see below). int[] xy; if (b == 0) throw new ArithmeticException("not invertible"); else if (b == 1) { // Success: values are indeed invertible! // Bottom of the recursi...
private static final int[] euclidInv(int a, int b, int prevDiv) { // Storage for return values, plus one slot for a temp int (see below). if (b == 0) throw new ArithmeticException("not invertible"); else if (b == 1) { // Success: values are indeed invertible! // Bottom of the recursion reache...
15,357
private static final int[] euclidInv(int a, int b, int prevDiv) { // Storage for return values, plus one slot for a temp int (see below). int[] xy; if (b == 0) throw new ArithmeticException("not invertible"); else if (b == 1) { // Success: values are indeed invertible! // Bottom of the recursi...
private static final int[] euclidInv(int a, int b, int prevDiv) { // Storage for return values, plus one slot for a temp int (see below). int[] xy; if (b == 0) throw new ArithmeticException("not invertible"); else if (b == 1) { // Success: values are indeed invertible! // Bottom of the recursi...
15,358
private static final int[] euclidInv(int a, int b, int prevDiv) { // Storage for return values, plus one slot for a temp int (see below). int[] xy; if (b == 0) throw new ArithmeticException("not invertible"); else if (b == 1) { // Success: values are indeed invertible! // Bottom of the recursi...
private static final int[] euclidInv(int a, int b, int prevDiv) { // Storage for return values, plus one slot for a temp int (see below). int[] xy; if (b == 0) throw new ArithmeticException("not invertible"); else if (b == 1) { // Success: values are indeed invertible! // Bottom of the recursi...
15,359
private static final int[] euclidInv(int a, int b, int prevDiv) { // Storage for return values, plus one slot for a temp int (see below). int[] xy; if (b == 0) throw new ArithmeticException("not invertible"); else if (b == 1) { // Success: values are indeed invertible! // Bottom of the recursi...
private static final int[] euclidInv(int a, int b, int prevDiv) { // Storage for return values, plus one slot for a temp int (see below). int[] xy; if (b == 0) throw new ArithmeticException("not invertible"); else if (b == 1) { // Success: values are indeed invertible! // Bottom of the recursi...
15,360
private void format(int radix, StringBuffer buffer) { if (words == null) buffer.append(Integer.toString(ival, radix)); else if (ival <= 2) buffer.append(Long.toString(longValue(), radix)); else { boolean neg = isNegative(); int[] work; if (neg || radix != 16) { work = new int[ival]; ...
private void format(int radix, StringBuffer buffer) { if (words == null) buffer.append(Integer.toString(ival, radix)); else if (ival <= 2) buffer.append(Long.toString(longValue(), radix)); else { boolean neg = isNegative(); int[] work; if (neg || radix != 16) { work = new int[ival]; ...
15,361
private static final int gcd(int a, int b) { // Euclid's algorithm, copied from libg++. if (b > a) { int tmp = a; a = b; b = tmp; } for(;;) { if (b == 0) return a; else if (b == 1) return b; else { int tmp = b; b = a % b; a = tmp; } } }
private static final int gcd(int a, int b) { // Euclid's algorithm, copied from libg++. if (b > a) { tmp = a; a = b; b = tmp; } for(;;) { if (b == 0) return a; else if (b == 1) return b; else { int tmp = b; b = a % b; a = tmp; } } }
15,362
private static final int gcd(int a, int b) { // Euclid's algorithm, copied from libg++. if (b > a) { int tmp = a; a = b; b = tmp; } for(;;) { if (b == 0) return a; else if (b == 1) return b; else { int tmp = b; b = a % b; a = tmp; } } }
private static final int gcd(int a, int b) { // Euclid's algorithm, copied from libg++. if (b > a) { int tmp = a; a = b; b = tmp; } for(;;) { if (b == 0) return a; if (b == 1) return b; else { int tmp = b; b = a % b; a = tmp; } } }
15,363
private static final int gcd(int a, int b) { // Euclid's algorithm, copied from libg++. if (b > a) { int tmp = a; a = b; b = tmp; } for(;;) { if (b == 0) return a; else if (b == 1) return b; else { int tmp = b; b = a % b; a = tmp; } } }
private static final int gcd(int a, int b) { // Euclid's algorithm, copied from libg++. if (b > a) { int tmp = a; a = b; b = tmp; } for(;;) { if (b == 0) return a; else if (b == 1) return b; else { int tmp = b; b = a % b; a = tmp; } } }
15,364
private static final int gcd(int a, int b) { // Euclid's algorithm, copied from libg++. if (b > a) { int tmp = a; a = b; b = tmp; } for(;;) { if (b == 0) return a; else if (b == 1) return b; else { int tmp = b; b = a % b; a = tmp; } } }
private static final int gcd(int a, int b) { // Euclid's algorithm, copied from libg++. if (b > a) { int tmp = a; a = b; b = tmp; for(;;) { if (b == 0) return a; else if (b == 1) return b; else { int tmp = b; b = a % b; a = tmp;
15,365
public boolean isProbablePrime(int certainty) { /** We'll use the Rabin-Miller algorithm for doing a probabilistic * primality test. It is fast, easy and has faster decreasing odds of a * composite passing than with other tests. This means that this * method will actually have a probability much gre...
public boolean isProbablePrime(int certainty) { /** We'll use the Rabin-Miller algorithm for doing a probabilistic * primality test. It is fast, easy and has faster decreasing odds of a * composite passing than with other tests. This means that this * method will actually have a probability much gre...
15,366
public boolean isProbablePrime(int certainty) { /** We'll use the Rabin-Miller algorithm for doing a probabilistic * primality test. It is fast, easy and has faster decreasing odds of a * composite passing than with other tests. This means that this * method will actually have a probability much gre...
public boolean isProbablePrime(int certainty) { /** We'll use the Rabin-Miller algorithm for doing a probabilistic * primality test. It is fast, easy and has faster decreasing odds of a * composite passing than with other tests. This means that this * method will actually have a probability much gre...
15,367
public boolean isProbablePrime(int certainty) { /** We'll use the Rabin-Miller algorithm for doing a probabilistic * primality test. It is fast, easy and has faster decreasing odds of a * composite passing than with other tests. This means that this * method will actually have a probability much gre...
public boolean isProbablePrime(int certainty) { /** We'll use the Rabin-Miller algorithm for doing a probabilistic * primality test. It is fast, easy and has faster decreasing odds of a * composite passing than with other tests. This means that this * method will actually have a probability much gre...
15,368
public boolean isProbablePrime(int certainty) { /** We'll use the Rabin-Miller algorithm for doing a probabilistic * primality test. It is fast, easy and has faster decreasing odds of a * composite passing than with other tests. This means that this * method will actually have a probability much gre...
public boolean isProbablePrime(int certainty) { /** We'll use the Rabin-Miller algorithm for doing a probabilistic * primality test. It is fast, easy and has faster decreasing odds of a * composite passing than with other tests. This means that this * method will actually have a probability much gre...
15,369
public boolean isProbablePrime(int certainty) { /** We'll use the Rabin-Miller algorithm for doing a probabilistic * primality test. It is fast, easy and has faster decreasing odds of a * composite passing than with other tests. This means that this * method will actually have a probability much gre...
public boolean isProbablePrime(int certainty) { /** We'll use the Rabin-Miller algorithm for doing a probabilistic * primality test. It is fast, easy and has faster decreasing odds of a * composite passing than with other tests. This means that this * method will actually have a probability much gre...
15,370
public boolean isProbablePrime(int certainty) { /** We'll use the Rabin-Miller algorithm for doing a probabilistic * primality test. It is fast, easy and has faster decreasing odds of a * composite passing than with other tests. This means that this * method will actually have a probability much gre...
public boolean isProbablePrime(int certainty) { /** We'll use the Rabin-Miller algorithm for doing a probabilistic * primality test. It is fast, easy and has faster decreasing odds of a * composite passing than with other tests. This means that this * method will actually have a probability much gre...
15,371
public boolean isProbablePrime(int certainty) { /** We'll use the Rabin-Miller algorithm for doing a probabilistic * primality test. It is fast, easy and has faster decreasing odds of a * composite passing than with other tests. This means that this * method will actually have a probability much gre...
public boolean isProbablePrime(int certainty) { /** We'll use the Rabin-Miller algorithm for doing a probabilistic * primality test. It is fast, easy and has faster decreasing odds of a * composite passing than with other tests. This means that this * method will actually have a probability much gre...
15,372
private static BigInteger make(long value) { if (value >= minFixNum && value <= maxFixNum) return smallFixNums[(int)value - minFixNum]; int i = (int) value; if ((long)i == value) return new BigInteger(i); BigInteger result = alloc(2); result.ival = 2; result.words[0] = i; result.words[...
private static BigInteger make(int[] words, int len) { if (value >= minFixNum && value <= maxFixNum) return smallFixNums[(int)value - minFixNum]; int i = (int) value; if ((long)i == value) return new BigInteger(i); BigInteger result = alloc(2); result.ival = 2; result.words[0] = i; res...
15,373
private static BigInteger make(long value) { if (value >= minFixNum && value <= maxFixNum) return smallFixNums[(int)value - minFixNum]; int i = (int) value; if ((long)i == value) return new BigInteger(i); BigInteger result = alloc(2); result.ival = 2; result.words[0] = i; result.words[...
private static BigInteger make(long value) { if (value >= minFixNum && value <= maxFixNum) return smallFixNums[(int)value - minFixNum]; int i = (int) value; if ((long)i == value) return new BigInteger(i); BigInteger result = alloc(2); result.ival = 2; result.words[0] = i; result.words[...
15,374
public BigInteger modInverse(BigInteger y) { if (y.isNegative() || y.isZero()) throw new ArithmeticException("non-positive modulo"); // Degenerate cases. if (y.isOne()) return ZERO; else if (isOne()) return ONE; // Use Euclid's algorithm as in gcd() but do this recursively // rather ...
public BigInteger modInverse(BigInteger y) { if (y.isNegative() || y.isZero()) throw new ArithmeticException("non-positive modulo"); // Degenerate cases. if (y.isOne()) return ZERO; if (isOne()) return ONE; // Use Euclid's algorithm as in gcd() but do this recursively // rather than ...
15,375
public BigInteger modInverse(BigInteger y) { if (y.isNegative() || y.isZero()) throw new ArithmeticException("non-positive modulo"); // Degenerate cases. if (y.isOne()) return ZERO; else if (isOne()) return ONE; // Use Euclid's algorithm as in gcd() but do this recursively // rather ...
public BigInteger modInverse(BigInteger y) { if (y.isNegative() || y.isZero()) throw new ArithmeticException("non-positive modulo"); // Degenerate cases. if (y.isOne()) return ZERO; else if (isOne()) return ONE; // Use Euclid's algorithm as in gcd() but do this recursively // rather ...
15,376
public BigInteger modInverse(BigInteger y) { if (y.isNegative() || y.isZero()) throw new ArithmeticException("non-positive modulo"); // Degenerate cases. if (y.isOne()) return ZERO; else if (isOne()) return ONE; // Use Euclid's algorithm as in gcd() but do this recursively // rather ...
public BigInteger modInverse(BigInteger y) { if (y.isNegative() || y.isZero()) throw new ArithmeticException("non-positive modulo"); // Degenerate cases. if (y.isOne()) return ZERO; else if (isOne()) return ONE; // Use Euclid's algorithm as in gcd() but do this recursively // rather ...
15,377
public BigInteger modInverse(BigInteger y) { if (y.isNegative() || y.isZero()) throw new ArithmeticException("non-positive modulo"); // Degenerate cases. if (y.isOne()) return ZERO; else if (isOne()) return ONE; // Use Euclid's algorithm as in gcd() but do this recursively // rather ...
public BigInteger modInverse(BigInteger y) { if (y.isNegative() || y.isZero()) throw new ArithmeticException("non-positive modulo"); // Degenerate cases. if (y.isOne()) return ZERO; else if (isOne()) return ONE; // Use Euclid's algorithm as in gcd() but do this recursively // rather ...
15,378
public BigInteger modInverse(BigInteger y) { if (y.isNegative() || y.isZero()) throw new ArithmeticException("non-positive modulo"); // Degenerate cases. if (y.isOne()) return ZERO; else if (isOne()) return ONE; // Use Euclid's algorithm as in gcd() but do this recursively // rather ...
public BigInteger modInverse(BigInteger y) { if (y.isNegative() || y.isZero()) throw new ArithmeticException("non-positive modulo"); // Degenerate cases. if (y.isOne()) return ZERO; else if (isOne()) return ONE; // Use Euclid's algorithm as in gcd() but do this recursively // rather ...
15,379
public BigInteger modInverse(BigInteger y) { if (y.isNegative() || y.isZero()) throw new ArithmeticException("non-positive modulo"); // Degenerate cases. if (y.isOne()) return ZERO; else if (isOne()) return ONE; // Use Euclid's algorithm as in gcd() but do this recursively // rather ...
public BigInteger modInverse(BigInteger y) { if (y.isNegative() || y.isZero()) throw new ArithmeticException("non-positive modulo"); // Degenerate cases. if (y.isOne()) return ZERO; else if (isOne()) return ONE; // Use Euclid's algorithm as in gcd() but do this recursively // rather ...
15,380
public BigInteger modInverse(BigInteger y) { if (y.isNegative() || y.isZero()) throw new ArithmeticException("non-positive modulo"); // Degenerate cases. if (y.isOne()) return ZERO; else if (isOne()) return ONE; // Use Euclid's algorithm as in gcd() but do this recursively // rather ...
public BigInteger modInverse(BigInteger y) { if (y.isNegative() || y.isZero()) throw new ArithmeticException("non-positive modulo"); // Degenerate cases. if (y.isOne()) return ZERO; else if (isOne()) return ONE; // Use Euclid's algorithm as in gcd() but do this recursively // rather ...
15,381
public BigInteger modPow(BigInteger exponent, BigInteger m) { if (m.isNegative() || m.isZero()) throw new ArithmeticException("non-positive modulo"); if (exponent.isNegative()) return modInverse(m); if (exponent.isOne()) return mod(m); // To do this naively by first raising this to the pow...
public BigInteger modPow(BigInteger exponent, BigInteger m) { if (m.isNegative() || m.isZero()) throw new ArithmeticException("non-positive modulo"); if (exponent.isNegative()) return modInverse(m); if (exponent.isOne()) return mod(m); // To do this naively by first raising this to the pow...
15,382
private static BigInteger neg(BigInteger x) { if (x.words == null && x.ival != Integer.MIN_VALUE) return make(- x.ival); BigInteger result = new BigInteger(0); result.setNegative(x); return result.canonicalize(); }
private static BigInteger neg(BigInteger x) { if (x.words == null && x.ival != Integer.MIN_VALUE) return valueOf(- x.ival); BigInteger result = new BigInteger(0); result.setNegative(x); return result.canonicalize(); }
15,383
public BigInteger pow(int exponent) { if (exponent <= 0) { if (exponent == 0) return ONE; else throw new ArithmeticException("negative exponent"); } if (isZero()) return this; int plen = words == null ? 1 : ival; // Length of pow2. int blen = ((bitLength() * exponent) >> 5) + 2 * plen...
public BigInteger pow(int exponent) { if (exponent <= 0) { if (exponent == 0) return ONE; throw new ArithmeticException("negative exponent"); } if (isZero()) return this; int plen = words == null ? 1 : ival; // Length of pow2. int blen = ((bitLength() * exponent) >> 5) + 2 * plen; ...
15,384
private void setNegative(BigInteger x) { int len = x.ival; if (x.words == null) { if (len == Integer.MIN_VALUE) set(- (long) len); else set(-len); return; } realloc(len + 1); if (BigInteger.negate(words, x.words, len)) words[len++] = 0; ival = len; }
private void setNegative(BigInteger x) { int len = x.ival; if (x.words == null) { if (len == Integer.MIN_VALUE) set(- (long) len); else set(-len); return; } realloc(len + 1); if (negate(words, x.words, len)) words[len++] = 0; ival = len; }
15,385
private static BigInteger shift(BigInteger x, int count) { if (x.words == null) { if (count <= 0) return make(count > -32 ? x.ival >> (-count) : x.ival < 0 ? -1 : 0); if (count < 32) return make((long) x.ival << count); } if (count == 0) return x; BigInteger result = new BigInteger(0); ...
private static BigInteger shift(BigInteger x, int count) { if (x.words == null) { if (count <= 0) return valueOf(count > -32 ? x.ival >> (-count) : x.ival < 0 ? -1 : 0); if (count < 32) return make((long) x.ival << count); } if (count == 0) return x; BigInteger result = new BigInteger(0);...
15,386
private static BigInteger shift(BigInteger x, int count) { if (x.words == null) { if (count <= 0) return make(count > -32 ? x.ival >> (-count) : x.ival < 0 ? -1 : 0); if (count < 32) return make((long) x.ival << count); } if (count == 0) return x; BigInteger result = new BigInteger(0); ...
private static BigInteger shift(BigInteger x, int count) { if (x.words == null) { if (count <= 0) return make(count > -32 ? x.ival >> (-count) : x.ival < 0 ? -1 : 0); if (count < 32) return valueOf((long) x.ival << count); } if (count == 0) return x; BigInteger result = new BigInteger(0);...
15,387