Datasets:
JoaoJunior
/
formatted-java-code-APR

Dataset card Data Studio Files
xet
 Community
1
bugged
stringlengths
6
599k
fixed
stringlengths
6
40.8M
__index_level_0__
int64
0
3.24M
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 && ...
24,246
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 != 0...
24,247
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 && ...
24,248
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 != 0...
24,249
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 && ...
24,250
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 && ...
24,251
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 == n...
24,252
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 ==...
24,253
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 QName...
24,254
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...
24,255
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);...
24,256
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)) outputMetho...
24,257
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)) { outputM...
24,258
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)) outputMetho...
24,259
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)) { outputM...
24,260
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)) outputMetho...
24,261
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)) { outputM...
24,262
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...
24,263
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)) outputMetho...
24,264
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)) { outputM...
24,265
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)) outputMetho...
24,266
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)) { outputM...
24,267
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)) outputMetho...
24,268
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)) { outputM...
24,269
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)) outputMetho...
24,270
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)) { outputM...
24,271
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.getNode...
24,272
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...
24,273
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.getNo...
24,274
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...
24,275
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 (current...
24,276
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...
24,277
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 (current...
24,278
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...
24,279
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 (current...
24,280
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...
24,281
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 (current...
24,282
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...
24,283
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 (current...
24,284
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...
24,285
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 (current...
24,286
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...
24,287
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 (current...
24,288
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...
24,289
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...
24,290
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...
24,291
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); }
24,292
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; }
24,293
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...
24,295
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...
24,296
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...
24,297
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); }
24,298
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, ...
24,299
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...
24,300
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...
24,301
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; }
24,302
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(BigInteger.make(x), BigInteger.make(y), quotient, remainder, rounding_mode); ...
24,303
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(BigInteger.make(x), BigInteger.make(y), quotient, remainder, rounding_mode); ...
24,304
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); }
24,305
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 reached; ...
24,306
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...
24,307
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...
24,308
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...
24,309
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]; ...
24,310
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; } } }
24,311
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; } } }
24,312
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; } } }
24,313
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; }
24,314
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...
24,315
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...
24,316
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 greater than th...
24,317
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...
24,318
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...
24,319
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...
24,320
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...
24,321
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...
24,322
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...
24,323
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[...
24,324
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 ...
24,325
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 ...
24,326
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 ...
24,327
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 ...
24,328
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 ...
24,329
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 ...
24,330
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 ...
24,331
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...
24,332
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...
24,333
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(); }
24,334
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; 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...
24,335
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; }
24,336
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 make((long) x.ival << count); } if (count == 0) return x; BigInteger result = new BigInteger(0); ...
24,337
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);...
24,338
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 BigInteger.make((long) xlen * (long) y); boolean negative; BigInteger result = BigInteger.alloc(xlen + ...
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...
24,339
public static BigInteger valueOf(long val) { return make(val); }
public static BigInteger valueOf(long val) { if (val >= minFixNum && val <= maxFixNum) return smallFixNums[(int) val - minFixNum]; int i = (int) val; if ((long) i == val) return new BigInteger(i); BigInteger result = alloc(2); result.ival = 2; result.words[0] = i; result.words[1] = (int)(val >> 32); return result...
24,340
public FBScreen(Surface g) { this.g = g; w = 6; h = 18; sh = h * FBPcTextScreen.SCREEN_HEIGHT + 2 * margin; sw = w * FBPcTextScreen.SCREEN_WIDTH + 2 * margin; bi = new JNodeBufferedImage(sw, sh, BufferedImage.TYPE_INT_ARGB); ...
public FBScreen(Surface g) { this.g = g; w = 6; h = 18; sh = h * FBPcTextScreen.SCREEN_HEIGHT + 2 * margin; sw = w * FBPcTextScreen.SCREEN_WIDTH + 2 * margin; bi = new JNodeBufferedImage(sw, sh, BufferedImage.TYPE_INT_ARGB); ...
24,341
public FBScreen(Surface g) { this.g = g; w = 6; h = 18; sh = h * FBPcTextScreen.SCREEN_HEIGHT + 2 * margin; sw = w * FBPcTextScreen.SCREEN_WIDTH + 2 * margin; bi = new JNodeBufferedImage(sw, sh, BufferedImage.TYPE_INT_ARGB); ...
new Thread(new Runnable() { public void run() { while(true){ try{ paintComponent(); synchronized(FBScreen.this){ if(!update) { update = false; FBScreen.this.wait(); } } }catch(InterruptedException x ){ break; } } } }, "FBScreenUpdater").start(); new Thread(new Runnable() { public void run() { while(true){ try{ paintCom...
24,342
public void repaint() { paintComponent(); }
public void repaint() { paintComponent(); }
24,343
public static void main(String[] args) throws Exception { final String devId = (args.length > 0) ? args[0] : "" /*"fb0"*/; Surface g = null; try { Device dev = null; if("".equals(devId)){ final Collection<Device> devs = DeviceUtils.getDevicesByAPI(FrameBuffe...
public static void main(String[] args) throws Exception { final String devId = (args.length > 0) ? args[0] : "" /*"fb0"*/; Surface g = null; try { Device dev = null; if("".equals(devId)){ final Collection<Device> devs = DeviceUtils.getDevicesByAPI(FrameBuffe...
24,344
public static void main(String[] args) throws Exception { final String devId = (args.length > 0) ? args[0] : "" /*"fb0"*/; Surface g = null; try { Device dev = null; if("".equals(devId)){ final Collection<Device> devs = DeviceUtils.getDevicesByAPI(FrameBuffe...
public static void main(String[] args) throws Exception { final String devId = (args.length > 0) ? args[0] : "" /*"fb0"*/; Surface g = null; try { Device dev = null; if("".equals(devId)){ final Collection<Device> devs = DeviceUtils.getDevicesByAPI(FrameBuffe...
24,345
public void update(Graphics g, JComponent c) { AbstractButton b = (AbstractButton) c; if (b.isContentAreaFilled() && (UIManager.get(getPropertyPrefix() + "gradient") != null) && b.isEnabled() && (b.getBackground() instanceof UIResource)) updateWidthGradient(g, b, b.getParent()); el...
public void update(Graphics g, JComponent c) { AbstractButton b = (AbstractButton) c; if (b.isContentAreaFilled() && (UIManager.get(getPropertyPrefix() + "gradient") != null) && b.isEnabled() && (b.getBackground() instanceof UIResource)) updateWidthGradient(g, b, b.getParent()); el...
24,346