Home
last modified time | relevance | path

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

12345678910>>...15

/libcore/ojluni/src/main/java/sun/util/calendar/
DCalendarUtils.java70 public static final long floorDivide(long n, long d) { in floorDivide() argument
71 return ((n >= 0) ? in floorDivide()
72 (n / d) : (((n + 1L) / d) - 1L)); in floorDivide()
84 public static final int floorDivide(int n, int d) { in floorDivide() argument
85 return ((n >= 0) ? in floorDivide()
86 (n / d) : (((n + 1) / d) - 1)); in floorDivide()
102 public static final int floorDivide(int n, int d, int[] r) { in floorDivide() argument
103 if (n >= 0) { in floorDivide()
104 r[0] = n % d; in floorDivide()
105 return n / d; in floorDivide()
[all …]
DCalendarDate.java134 public CalendarDate addYear(int n) { in addYear() argument
135 if (n != 0) { in addYear()
136 year += n; in addYear()
177 public CalendarDate addMonth(int n) { in addMonth() argument
178 if (n != 0) { in addMonth()
179 month += n; in addMonth()
197 public CalendarDate addDayOfMonth(int n) { in addDayOfMonth() argument
198 if (n != 0) { in addDayOfMonth()
199 dayOfMonth += n; in addDayOfMonth()
230 public CalendarDate addHours(int n) { in addHours() argument
[all …]
/libcore/ojluni/src/main/java/sun/nio/ch/
DIOStatus.java59 public static int normalize(int n) { in normalize() argument
60 if (n == UNAVAILABLE) in normalize()
62 return n; in normalize()
65 public static boolean check(int n) { in check() argument
66 return (n >= UNAVAILABLE); in check()
69 public static long normalize(long n) { in normalize() argument
70 if (n == UNAVAILABLE) in normalize()
72 return n; in normalize()
75 public static boolean check(long n) { in check() argument
76 return (n >= UNAVAILABLE); in check()
[all …]
DSimpleAsynchronousFileChannelImpl.java109 long n = 0L; in size() local
113 n = nd.size(fdObj); in size()
114 } while ((n == IOStatus.INTERRUPTED) && isOpen()); in size()
115 return n; in size()
117 end(n >= 0L); in size()
132 long n = 0L; in truncate() local
136 n = nd.size(fdObj); in truncate()
137 } while ((n == IOStatus.INTERRUPTED) && isOpen()); in truncate()
140 if (size < n && isOpen()) { in truncate()
142 n = nd.truncate(fdObj, size); in truncate()
[all …]
DSocketChannelImpl.java343 int n = 0; in read() local
421 n = IOUtil.read(fd, buf, -1, nd); in read()
422 if ((n == IOStatus.INTERRUPTED) && isOpen()) { in read()
427 return IOStatus.normalize(n); in read()
448 end(n > 0 || (n == IOStatus.UNAVAILABLE)); in read()
453 if ((n <= 0) && (!isInputOpen)) in read()
457 assert IOStatus.check(n); in read()
471 long n = 0; in read() local
481 n = IOUtil.read(fd, dsts, offset, length, nd); in read()
482 if ((n == IOStatus.INTERRUPTED) && isOpen()) in read()
[all …]
DDatagramChannelImpl.java373 int n = 0; in receive() local
383 n = receive(fd, dst); in receive()
384 } while ((n == IOStatus.INTERRUPTED) && isOpen()); in receive()
385 if (n == IOStatus.UNAVAILABLE) in receive()
391 n = receive(fd, bb); in receive()
392 } while ((n == IOStatus.INTERRUPTED) && isOpen()); in receive()
393 if (n == IOStatus.UNAVAILABLE) in receive()
403 n = 0; in receive()
416 end((n > 0) || (n == IOStatus.UNAVAILABLE)); in receive()
417 assert IOStatus.check(n); in receive()
[all …]
DSinkChannelImpl.java160 int n = 0; in write() local
167 n = IOUtil.write(fd, src, -1, nd); in write()
168 } while ((n == IOStatus.INTERRUPTED) && isOpen()); in write()
169 return IOStatus.normalize(n); in write()
172 end((n > 0) || (n == IOStatus.UNAVAILABLE)); in write()
173 assert IOStatus.check(n); in write()
183 long n = 0; in write() local
190 n = IOUtil.write(fd, srcs, nd); in write()
191 } while ((n == IOStatus.INTERRUPTED) && isOpen()); in write()
192 return IOStatus.normalize(n); in write()
[all …]
DSourceChannelImpl.java165 int n = 0; in read() local
172 n = IOUtil.read(fd, dst, -1, nd); in read()
173 } while ((n == IOStatus.INTERRUPTED) && isOpen()); in read()
174 return IOStatus.normalize(n); in read()
177 end((n > 0) || (n == IOStatus.UNAVAILABLE)); in read()
178 assert IOStatus.check(n); in read()
196 long n = 0; in read() local
203 n = IOUtil.read(fd, dsts, nd); in read()
204 } while ((n == IOStatus.INTERRUPTED) && isOpen()); in read()
205 return IOStatus.normalize(n); in read()
[all …]
/libcore/ojluni/src/main/java/java/util/zip/
DGZIPInputStream.java126 int n = super.read(buf, off, len); in read() local
127 if (n == -1) { in read()
133 crc.update(buf, off, n); in read()
135 return n; in read()
184 int n = 2 + 2 + 6; in readHeader() local
189 n += m + 2; in readHeader()
194 n++; in readHeader()
200 n++; in readHeader()
209 n += 2; in readHeader()
212 return n; in readHeader()
[all …]
DDeflaterInputStream.java185 int n; in read() local
189 n = in.read(buf, 0, buf.length); in read()
190 if (n < 0) { in read()
193 } else if (n > 0) { in read()
194 def.setInput(buf, 0, n); in read()
199 n = def.deflate(b, off, len); in read()
200 cnt += n; in read()
201 off += n; in read()
202 len -= n; in read()
237 public long skip(long n) throws IOException { in skip() argument
[all …]
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/
DStreamLinkTest.java49 private <S> Function<S, S> apply(int n, Function<S, S> f) { in apply() argument
51 for (int i = 0; i < n; i++) { in apply()
62 for (int n : sizes) {
63 setContext("n", n);
64 … List<Integer> expected = data.stream().map(e -> (Integer) (e + n)).collect(Collectors.toList());
67 stream(apply(n, (Stream<Integer> s) -> s.map(e -> (Integer) (e + 1)))).
75 for (int n : sizes) { in testIntManyStreams()
76 setContext("n", n); in testIntManyStreams()
77 int[] expected = data.stream().map(e -> e + n).toArray(); in testIntManyStreams()
80 stream(apply(n, (IntStream s) -> s.map(e -> e + 1))). in testIntManyStreams()
[all …]
/libcore/ojluni/src/main/java/java/io/
DBufferedInputStream.java248 int n = getInIfOpen().read(buffer, pos, buffer.length - pos); in fill() local
249 if (n > 0) in fill()
250 count = n + pos; in fill()
345 int n = 0; in read() local
347 int nread = read1(b, off + n, len - n); in read()
349 return (n == 0) ? nread : n; in read()
350 n += nread; in read()
351 if (n >= len) in read()
352 return n; in read()
356 return n; in read()
[all …]
DBufferedReader.java170 int n; in fill() local
172 n = in.read(cb, dst, cb.length - dst); in fill()
173 } while (n == 0); in fill()
174 if (n > 0) { in fill()
175 nChars = dst + n; in fill()
236 int n = Math.min(len, nChars - nextChar); in read1() local
237 System.arraycopy(cb, nextChar, cbuf, off, n); in read1()
238 nextChar += n; in read1()
239 return n; in read1()
297 int n = read1(cbuf, off, len); in read() local
[all …]
DReader.java100 int n = read(cbuf, 0, len); in read() local
101 if (n > 0) in read()
102 target.put(cbuf, 0, n); in read()
103 return n; in read()
176 public long skip(long n) throws IOException { in skip() argument
177 if (n < 0L) in skip()
179 int nn = (int) Math.min(n, maxSkipBufferSize); in skip()
183 long r = n; in skip()
190 return n - r; in skip()
DStringReader.java99 int n = Math.min(length - next, len); in read() local
100 str.getChars(next, next + n, cbuf, off); in read()
101 next += n; in read()
102 return n; in read()
128 long n = Math.min(length - next, ns); in skip() local
129 n = Math.max(-next, n); in skip()
130 next += n; in skip()
131 return n; in skip()
/libcore/ojluni/src/main/java/java/util/concurrent/
DConcurrentSkipListMap.java600 Node<K,V> n = node; in link() local
602 return n.value != null && casRight(succ, newSucc); in link()
669 Node<K,V> n = r.node; in findPredecessor() local
670 K k = n.key; in findPredecessor()
671 if (n.value == null) { in findPredecessor()
740 for (Node<K,V> b = findPredecessor(key, cmp), n = b.next;;) { in findNode()
742 if (n == null) in findNode()
744 Node<K,V> f = n.next; in findNode()
745 if (n != b.next) // inconsistent read in findNode()
747 if ((v = n.value) == null) { // n is deleted in findNode()
[all …]
DPriorityBlockingQueue.java264 int n = a.length; in PriorityBlockingQueue() local
267 a = Arrays.copyOf(a, n, Object[].class); in PriorityBlockingQueue()
268 if (screen && (n == 1 || this.comparator != null)) { in PriorityBlockingQueue()
269 for (int i = 0; i < n; ++i) in PriorityBlockingQueue()
274 this.size = n; in PriorityBlockingQueue()
322 int n = size - 1; in dequeue() local
323 if (n < 0) in dequeue()
328 E x = (E) array[n]; in dequeue()
329 array[n] = null; in dequeue()
332 siftDownComparable(0, x, array, n); in dequeue()
[all …]
/libcore/ojluni/src/main/java/java/net/
DSocketInputStream.java148 int n; in read() local
176 n = socketRead(fd, b, off, length, timeout); in read()
177 if (n > 0) { in read()
178 return n; in read()
194 n = socketRead(fd, b, off, length, timeout); in read()
195 if (n > 0) { in read()
196 return n; in read()
229 int n = read(temp, 0, 1); in read() local
230 if (n <= 0) { in read()
246 long n = numbytes; in skip() local
[all …]
DURI.java1700 int n = s.length(); in equal() local
1701 for (int i = 0; i < n;) { in equal()
1729 int n = s.length(); in equalIgnoringCase() local
1730 if (t.length() != n) in equalIgnoringCase()
1732 for (int i = 0; i < n; i++) { in equalIgnoringCase()
1769 int n = s.length(); in hashIgnoringCase() local
1770 for (int i = 0; i < n; i++) in hashIgnoringCase()
1794 int n = sn < tn ? sn : tn; in compareIgnoringCase() local
1795 for (int i = 0; i < n; i++) { in compareIgnoringCase()
2508 int n = chars.length(); in lowMask() local
[all …]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/javax/net/ssl/
DSSLEngineResultTest.java102 for (int n = 0; n < pos.length; n++) { in test_bytesConsumed()
105 enHS[j], pos[n], pos[l]); in test_bytesConsumed()
106 assertEquals("Incorrect bytesConsumed", pos[n], in test_bytesConsumed()
125 for (int n = 0; n < pos.length; n++) { in test_bytesProduced()
128 enHS[j], pos[n], pos[l]); in test_bytesProduced()
148 for (int n = 0; n < pos.length; n++) { in test_getHandshakeStatus()
151 enHS[j], pos[n], pos[l]); in test_getHandshakeStatus()
171 for (int n = 0; n < pos.length; n++) { in test_getStatus()
174 enHS[j], pos[n], pos[l]); in test_getStatus()
194 for (int n = 0; n < pos.length; n++) { in test_toString()
[all …]
/libcore/ojluni/src/main/java/sun/net/www/
DMeteredStream.java59 private final void justRead(long n) throws IOException { in justRead() argument
60 if (n == -1) { in justRead()
72 count += n; in justRead()
133 int n = in.read(b, off, len); in read() local
134 justRead(n); in read()
135 return n; in read()
138 public synchronized long skip(long n) throws IOException { in skip() argument
153 long min = (n > expected - count) ? expected - count: n; in skip()
154 n = in.skip(min); in skip()
156 justRead(n); in skip()
[all …]
/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/ojluni/src/main/native/
DUnixCopyFile.c60 ssize_t n, pos, len; in Java_sun_nio_fs_UnixCopyFile_transfer() local
61 RESTARTABLE(read((int)src, &buf, sizeof(buf)), n); in Java_sun_nio_fs_UnixCopyFile_transfer()
62 if (n <= 0) { in Java_sun_nio_fs_UnixCopyFile_transfer()
63 if (n < 0) in Java_sun_nio_fs_UnixCopyFile_transfer()
72 len = n; in Java_sun_nio_fs_UnixCopyFile_transfer()
76 RESTARTABLE(write((int)dst, bufp, len), n); in Java_sun_nio_fs_UnixCopyFile_transfer()
77 if (n == -1) { in Java_sun_nio_fs_UnixCopyFile_transfer()
81 pos += n; in Java_sun_nio_fs_UnixCopyFile_transfer()
82 len -= n; in Java_sun_nio_fs_UnixCopyFile_transfer()
/libcore/ojluni/src/main/java/sun/nio/cs/
DStreamDecoder.java130 int n = read(cb, 0, 2); in read0() local
131 switch (n) { in read0()
141 assert false : n; in read0()
159 int n = 0; in read() local
166 n = 1; in read()
169 return n; in read()
176 return (n == 0) ? -1 : n; in read()
178 return n + 1; in read()
181 return n + implRead(cbuf, off, off + len); in read()
281 int n = sun.nio.ch.ChannelInputStream.read(ch, bb, true); in readBytes() local
[all …]
/libcore/ojluni/src/test/java/util/concurrent/tck/
DCountedCompleter8Test.java115 int n = hi - lo; in forEach3() local
116 for (; n >= 2; n /= 2) { in forEach3()
118 new Task(this, lo + n/2, lo + n).fork(); in forEach3()
120 if (n > 0) in forEach3()
138 for (int n = hi - lo; n >= 2; n /= 2) in forEach4()
139 new Task(this, lo + n/2, lo + n).fork(); in forEach4()
150 int n = ThreadLocalRandom.current().nextInt(8); in testRecursiveDecomposition() local
151 Integer[] a = new Integer[n]; in testRecursiveDecomposition()
152 for (int i = 0; i < n; i++) a[i] = i + 1; in testRecursiveDecomposition()
155 assertEquals(n * (n + 1) / 2, ai.get()); in testRecursiveDecomposition()

12345678910>>...15