Home
last modified time | relevance | path

Searched refs:n (Results 1 – 25 of 191) sorted by relevance

12345678

/libcore/luni/src/main/java/org/apache/xml/dtm/ref/
DDTMNamedNodeMap.java80 for (int n = dtm.getFirstAttribute(element); n != -1; in getLength()
81 n = dtm.getNextAttribute(n)) in getLength()
102 for (int n = dtm.getFirstAttribute(element); n != DTM.NULL; in getNamedItem()
103 n = dtm.getNextAttribute(n)) in getNamedItem()
105 if (dtm.getNodeName(n).equals(name)) in getNamedItem()
106 return dtm.getNode(n); in getNamedItem()
125 for (int n = dtm.getFirstAttribute(element); n != -1; in item()
126 n = dtm.getNextAttribute(n)) in item()
129 return dtm.getNode(n); in item()
200 for (int n = dtm.getFirstAttribute(element); n != DTM.NULL; in getNamedItemNS()
[all …]
/libcore/luni/src/main/java/java/util/concurrent/
DConcurrentSkipListMap.java566 Node<K,V> n = node; in link() local
568 return n.value != null && casRight(succ, newSucc); in link()
692 Node<K,V> n = r.node; in findPredecessor() local
693 K k = n.key; in findPredecessor()
694 if (n.value == null) { in findPredecessor()
763 Node<K,V> n = b.next; in findNode() local
765 if (n == null) in findNode()
767 Node<K,V> f = n.next; in findNode()
768 if (n != b.next) // inconsistent read in findNode()
770 Object v = n.value; in findNode()
[all …]
/libcore/luni/src/main/java/org/apache/xml/serializer/utils/
DDOM2Helper.java69 public String getLocalNameOfNode(Node n) in getLocalNameOfNode() argument
72 String name = n.getLocalName(); in getLocalNameOfNode()
74 return (null == name) ? getLocalNameOfNodeFallback(n) : name; in getLocalNameOfNode()
88 private String getLocalNameOfNodeFallback(Node n) in getLocalNameOfNodeFallback() argument
91 String qname = n.getNodeName(); in getLocalNameOfNodeFallback()
112 public String getNamespaceOfNode(Node n) in getNamespaceOfNode() argument
114 return n.getNamespaceURI(); in getNamespaceOfNode()
/libcore/luni/src/main/java/org/apache/harmony/xml/dom/
DTextImpl.java78 for (TextImpl n = firstTextNodeInCurrentRun(); n != null; n = n.nextTextNode()) { in getWholeText()
79 n.appendDataTo(result); in getWholeText()
93 for (TextImpl n = firstTextNodeInCurrentRun(); n != null; ) { in replaceWholeText()
96 if (n == this && content != null && content.length() > 0) { in replaceWholeText()
99 n = n.nextTextNode(); in replaceWholeText()
102 Node toRemove = n; // because removeChild() detaches siblings in replaceWholeText()
103 n = n.nextTextNode(); in replaceWholeText()
/libcore/sqlite-jdbc/src/main/java/SQLite/
DBlob.java76 public long skip(long n) throws IOException { in skip() argument
77 long ret = pos + n; in skip()
97 int n = blob.read(b, 0, pos, b.length); in read() local
98 if (n > 0) { in read()
99 pos += n; in read()
112 int n = blob.read(b, 0, pos, b.length); in read() local
113 if (n > 0) { in read()
114 pos += n; in read()
115 return n; in read()
138 int n = blob.read(b, off, pos, len); in read() local
[all …]
/libcore/luni/src/main/java/org/apache/harmony/xnet/provider/jsse/
DHandshakeIODataStream.java280 public void writeUint8(long n) { in writeUint8() argument
282 buffer[write_pos++] = (byte) (n & 0x00ff); in writeUint8()
289 public void writeUint16(long n) { in writeUint16() argument
291 buffer[write_pos++] = (byte) ((n & 0x00ff00) >> 8); in writeUint16()
292 buffer[write_pos++] = (byte) (n & 0x00ff); in writeUint16()
299 public void writeUint24(long n) { in writeUint24() argument
301 buffer[write_pos++] = (byte) ((n & 0x00ff0000) >> 16); in writeUint24()
302 buffer[write_pos++] = (byte) ((n & 0x00ff00) >> 8); in writeUint24()
303 buffer[write_pos++] = (byte) (n & 0x00ff); in writeUint24()
310 public void writeUint32(long n) { in writeUint32() argument
[all …]
/libcore/luni/src/main/java/java/lang/
DIntegralToString.java307 private static String convertLong(AbstractStringBuilder sb, long n) {
308 int i = (int) n;
309 if (i == n) {
313 boolean negative = (n < 0);
315 n = -n;
316 if (n < 0) {
330 int low = (int) (n % 1000000000); // Extract low-order 9 digits
343 n = ((n - low) >>> 9) * 0x8E47CE423A2E9C6DL;
351 if ((n & (-1L << 32)) == 0) {
352 cursor = intIntoCharArray(buf, cursor, (int) n);
[all …]
/libcore/luni/src/main/java/java/util/
DRandom.java174 public int nextInt(int n) { in nextInt() argument
175 if (n > 0) { in nextInt()
176 if ((n & -n) == n) { in nextInt()
177 return (int) ((n * (long) next(31)) >> 31); in nextInt()
182 val = bits % n; in nextInt()
183 } while (bits - val + (n - 1) < 0); in nextInt()
DComparableTimSort.java242 int n = start - left; // The number of elements to move in binarySort() local
244 switch(n) { in binarySort()
248 default: System.arraycopy(a, left, a, left + 1, n); in binarySort()
331 private static int minRunLength(int n) {
332 if (DEBUG) assert n >= 0;
334 while (n >= MIN_MERGE) {
335 r |= (n & 1);
336 n >>= 1;
338 return n + r;
366 int n = stackSize - 2; local
[all …]
DTimSort.java275 int n = start - left; // The number of elements to move in binarySort() local
277 switch(n) { in binarySort()
281 default: System.arraycopy(a, left, a, left + 1, n); in binarySort()
365 private static int minRunLength(int n) {
366 if (DEBUG) assert n >= 0;
368 while (n >= MIN_MERGE) {
369 r |= (n & 1);
370 n >>= 1;
372 return n + r;
400 int n = stackSize - 2; local
[all …]
/libcore/luni/src/test/java/tests/api/javax/net/ssl/
DSSLEngineResultTest.java120 for (int n = 0; n < pos.length; n++) { in test_bytesConsumed()
123 enHS[j], pos[n], pos[l]); in test_bytesConsumed()
124 assertEquals("Incorrect bytesConsumed", pos[n], in test_bytesConsumed()
149 for (int n = 0; n < pos.length; n++) { in test_bytesProduced()
152 enHS[j], pos[n], pos[l]); in test_bytesProduced()
178 for (int n = 0; n < pos.length; n++) { in test_getHandshakeStatus()
181 enHS[j], pos[n], pos[l]); in test_getHandshakeStatus()
207 for (int n = 0; n < pos.length; n++) { in test_getStatus()
210 enHS[j], pos[n], pos[l]); in test_getStatus()
236 for (int n = 0; n < pos.length; n++) { in test_toString()
[all …]
/libcore/luni/src/main/java/org/apache/xpath/patterns/
DFunctionPattern.java111 int n; in execute() local
113 while (DTM.NULL != (n = nl.nextNode())) in execute()
115 score = (n == context) ? SCORE_OTHER : SCORE_NONE; in execute()
119 context = n; in execute()
155 int n; in execute() local
157 while (DTM.NULL != (n = nl.nextNode())) in execute()
159 score = (n == context) ? SCORE_OTHER : SCORE_NONE; in execute()
163 context = n; in execute()
198 int n; in execute() local
200 while (DTM.NULL != (n = nl.nextNode())) in execute()
[all …]
DUnionPattern.java64 int n = m_patterns.length; in canTraverseOutsideSubtree() local
65 for (int i = 0; i < n; i++) in canTraverseOutsideSubtree()
121 int n = m_patterns.length; in execute() local
123 for (int i = 0; i < n; i++) in execute()
180 int n = m_patterns.length; in callVisitors() local
181 for(int i = 0; i < n; i++) in callVisitors()
200 int n = m_patterns.length; in deepEquals() local
201 if((null == up.m_patterns) || (up.m_patterns.length != n)) in deepEquals()
204 for(int i = 0; i < n; i++) in deepEquals()
/libcore/luni/src/main/java/org/apache/xpath/
DSourceTreeManager.java92 int n = m_sourceTree.size(); in findURIFromDoc() local
94 for (int i = 0; i < n; i++) in findURIFromDoc()
145 public void removeDocumentFromCache(int n) in removeDocumentFromCache() argument
147 if(DTM.NULL ==n) in removeDocumentFromCache()
152 if(st!=null && st.m_root==n) in removeDocumentFromCache()
169 public void putDocumentInCache(int n, Source source) in putDocumentInCache() argument
176 if (!(cachedNode == n)) in putDocumentInCache()
185 m_sourceTree.addElement(new SourceTree(n, source.getSystemId())); in putDocumentInCache()
208 int n = m_sourceTree.size(); in getNode() local
211 for (int i = 0; i < n; i++) in getNode()
[all …]
/libcore/luni/src/test/java/tests/security/interfaces/
DRSAKeyTest.java47 final BigInteger n = BigInteger.valueOf(3233); in test_getModulus() local
53 key = (RSAKey) gen.generatePrivate(new RSAPrivateKeySpec(n, d)); in test_getModulus()
54 assertEquals("invalid modulus", n, key.getModulus()); in test_getModulus()
57 key = (RSAKey) gen.generatePublic(new RSAPublicKeySpec(n, e)); in test_getModulus()
58 assertEquals("invalid modulus", n, key.getModulus()); in test_getModulus()
/libcore/include/
DLocalArray.h62 char& operator[](size_t n) { return mPtr[n]; }
63 const char& operator[](size_t n) const { return mPtr[n]; }
/libcore/luni/src/main/java/org/apache/xpath/objects/
DXStringForFSB.java257 int n = srcEnd - srcBegin; in getChars() local
259 if (n > m_length) in getChars()
260 n = m_length; in getChars()
262 if (n > (dst.length - dstBegin)) in getChars()
263 n = (dst.length - dstBegin); in getChars()
265 int end = srcBegin + m_start + n; in getChars()
297 int n = m_length; in equals() local
299 if (n == obj2.length()) in equals()
305 while (n-- != 0) in equals()
342 int n = m_length; in equals() local
[all …]
/libcore/luni/src/main/java/org/apache/xml/utils/
DXMLCharacterRecognizer.java75 int n = buf.length(); in isWhiteSpace() local
77 for (int i = 0; i < n; i++) in isWhiteSpace()
97 int n = s.length(); in isWhiteSpace() local
99 for (int i = 0; i < n; i++) in isWhiteSpace()
/libcore/luni/src/main/java/org/apache/xpath/axes/
DUnionPathIterator.java75 int n = m_exprs.length; in setRoot() local
76 DTMIterator newIters[] = new DTMIterator[n]; in setRoot()
78 for (int i = 0; i < n; i++) in setRoot()
134 int n = m_iterators.length; in detach() local
135 for(int i = 0; i < n; i++) in detach()
237 int n = m_exprs.length; in getAnalysisBits() local
239 for (int i = 0; i < n; i++) in getAnalysisBits()
285 int n = m_iterators.length; in clone() local
287 clone.m_iterators = new DTMIterator[n]; in clone()
289 for (int i = 0; i < n; i++) in clone()
[all …]
DPredicatedNodeTest.java437 protected String nodeToString(int n) in nodeToString() argument
439 if(DTM.NULL != n) in nodeToString()
441 DTM dtm = m_lpi.getXPathContext().getDTM(n); in nodeToString()
442 return dtm.getNodeName(n) + "{" + (n+1) + "}"; in nodeToString()
461 public short acceptNode(int n) in acceptNode() argument
468 xctxt.pushCurrentNode(n); in acceptNode()
470 XObject score = execute(xctxt, n); in acceptNode()
479 if (!executePredicates(n, xctxt)) in acceptNode()
532 int n = getPredicateCount(); in canTraverseOutsideSubtree() local
533 for (int i = 0; i < n; i++) in canTraverseOutsideSubtree()
[all …]
/libcore/luni/src/main/java/java/io/
DStringBufferInputStream.java151 public synchronized long skip(long n) {
152 if (n <= 0) {
157 if (this.count - pos < n) {
161 numskipped = (int) n;
162 pos += n;
/libcore/luni/src/main/java/org/apache/xpath/functions/
DFunctionMultiArgs.java150 int n = m_args.length; in canTraverseOutsideSubtree() local
152 for (int i = 0; i < n; i++) in canTraverseOutsideSubtree()
199 int n = m_args.length; in callArgVisitors() local
200 for (int i = 0; i < n; i++) in callArgVisitors()
218 int n = m_args.length; in deepEquals() local
219 if ((null == fma) || (fma.m_args.length != n)) in deepEquals()
222 for (int i = 0; i < n; i++) in deepEquals()
/libcore/luni/src/main/java/org/apache/xpath/compiler/
DOpMap.java152 int n = m_opMap.elementAt(MAPINDEX_LENGTH); in shrink() local
153 m_opMap.setToSize(n + 4); in shrink()
155 m_opMap.setElementAt(0,n); in shrink()
156 m_opMap.setElementAt(0,n+1); in shrink()
157 m_opMap.setElementAt(0,n+2); in shrink()
160 n = m_tokenQueue.size(); in shrink()
161 m_tokenQueue.setToSize(n + 4); in shrink()
163 m_tokenQueue.setElementAt(null,n); in shrink()
164 m_tokenQueue.setElementAt(null,n + 1); in shrink()
165 m_tokenQueue.setElementAt(null,n + 2); in shrink()
/libcore/luni/src/test/java/org/apache/harmony/luni/platform/
DOSMemoryTest.java87 private static int swapInt(int n) { in swapInt() argument
88 return (((n >> 0) & 0xff) << 24) | in swapInt()
89 (((n >> 8) & 0xff) << 16) | in swapInt()
90 (((n >> 16) & 0xff) << 8) | in swapInt()
91 (((n >> 24) & 0xff) << 0); in swapInt()
128 private static short swapShort(short n) { in swapShort() argument
129 return (short) ((((n >> 0) & 0xff) << 8) | (((n >> 8) & 0xff) << 0)); in swapShort()
/libcore/luni/src/main/java/java/math/
DBigInteger.java437 public BigInteger shiftRight(int n) { in shiftRight() argument
438 return shiftLeft(-n); in shiftRight()
454 public BigInteger shiftLeft(int n) { in shiftLeft() argument
455 if (n == 0) { in shiftLeft()
462 if ((sign > 0) || (n >= 0)) { in shiftLeft()
463 return new BigInteger(BigInt.shift(getBigInt(), n)); in shiftLeft()
468 return BitLevel.shiftRight(this, -n); in shiftLeft()
508 public boolean testBit(int n) { in testBit() argument
509 if (n < 0) { in testBit()
510 throw new ArithmeticException("n < 0: " + n); in testBit()
[all …]

12345678