/libcore/ojluni/src/main/java/java/nio/ |
H A D | CharBufferSpliterator.java | 42 private final int limit; field in class:CharBufferSpliterator 45 this(buffer, buffer.position(), buffer.limit()); 48 CharBufferSpliterator(CharBuffer buffer, int origin, int limit) { argument 49 assert origin <= limit; 51 this.index = (origin <= limit) ? origin : limit; 52 this.limit = limit; 57 int lo = index, mid = (lo + limit) >>> 1; 69 int hi = limit; [all...] |
H A D | StringCharBuffer.java | 56 int limit, 59 super(mark, pos, limit, cap, null, offset); 65 position(), limit(), capacity(), offset); 53 StringCharBuffer(CharSequence s, int mark, int pos, int limit, int cap, int offset) argument
|
H A D | Buffer.java | 36 * buffer are its capacity, limit, and position: </p> 43 * <p> A buffer's <i>limit</i> is the index of the first element that should 44 * not be read or written. A buffer's limit is never negative and is never 49 * greater than its limit. </p> 65 * elements transferred. If the requested transfer exceeds the limit then a 73 * limit. </p> 88 * position or the limit is adjusted to a value smaller than the mark. If the 95 * <p> The following invariant holds for the mark, position, limit, and 102 * <i>limit</i> <tt><=</tt> 107 * undefined. The initial limit ma 189 private int limit; field in class:Buffer 270 public final int limit() { method in class:Buffer 288 public final Buffer limit(int newLimit) { method in class:Buffer [all...] |
/libcore/ojluni/src/main/java/sun/net/www/protocol/file/ |
H A D | Handler.java | 53 protected void parseURL(URL u, String spec, int start, int limit) { argument 67 super.parseURL(u, spec.replace(File.separatorChar, '/'), start, limit);
|
/libcore/ojluni/src/main/java/java/util/zip/ |
H A D | DeflaterInputStream.java | 284 * @param limit maximum bytes that can be read before invalidating the position marker 286 public void mark(int limit) { argument
|
/libcore/ojluni/src/main/java/sun/net/www/protocol/jar/ |
H A D | Handler.java | 128 int start, int limit) { 132 int refPos = spec.indexOf('#', limit); 148 spec = spec.substring(start, limit); 127 parseURL(URL url, String spec, int start, int limit) argument
|
/libcore/ojluni/src/test/java/util/stream/boottest/java/util/stream/ |
H A D | SliceSpliteratorTest.java | 63 void test(int size, int skip, int limit); argument 73 SliceTester r = (size, skip, limit) -> { 79 return new StreamSpliterators.SliceSpliterator.OfRef<>(s, skip, limit); 86 SliceTester r = (size, skip, limit) -> { 92 return new StreamSpliterators.SliceSpliterator.OfInt(s, skip, limit); 99 SliceTester r = (size, skip, limit) -> { 105 return new StreamSpliterators.SliceSpliterator.OfLong(s, skip, limit); 112 SliceTester r = (size, skip, limit) -> { 118 return new StreamSpliterators.SliceSpliterator.OfDouble(s, skip, limit); 128 SliceTester r = (size, skip, limit) [all...] |
/libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/ |
H A D | IntSliceOpTest.java | 83 assertCountSum(IntStream.range(0, 0).limit(4).boxed(), 0, 0); 84 assertCountSum(IntStream.range(1, 3).limit(4).boxed(), 2, 3); 85 assertCountSum(IntStream.range(1, 5).limit(4).boxed(), 4, 10); 86 assertCountSum(IntStream.range(1, 9).limit(4).boxed(), 4, 10); 88 assertCountSum(IntStream.range(0, 0).parallel().limit(4).boxed(), 0, 0); 89 assertCountSum(IntStream.range(1, 3).parallel().limit(4).boxed(), 2, 3); 90 assertCountSum(IntStream.range(1, 5).parallel().limit(4).boxed(), 4, 10); 91 assertCountSum(IntStream.range(1, 9).parallel().limit(4).boxed(), 4, 10); 93 exerciseOps(EMPTY_INT_ARRAY, s -> s.limit(0), EMPTY_INT_ARRAY); 94 exerciseOps(EMPTY_INT_ARRAY, s -> s.limit(1 126 sliceSize(int dataSize, int skip, int limit) argument [all...] |
H A D | SliceOpTest.java | 78 assertCountSum(countTo(0).stream().limit(4), 0, 0); 79 assertCountSum(countTo(2).stream().limit(4), 2, 3); 80 assertCountSum(countTo(4).stream().limit(4), 4, 10); 81 assertCountSum(countTo(8).stream().limit(4), 4, 10); 83 assertCountSum(countTo(0).parallelStream().limit(4), 0, 0); 84 assertCountSum(countTo(2).parallelStream().limit(4), 2, 3); 85 assertCountSum(countTo(4).parallelStream().limit(4), 4, 10); 86 assertCountSum(countTo(8).parallelStream().limit(4), 4, 10); 88 exerciseOps(Collections.emptyList(), s -> s.limit(0), Collections.emptyList()); 89 exerciseOps(Collections.emptyList(), s -> s.limit(1 140 sliceSize(int dataSize, int skip, int limit) argument [all...] |
/libcore/ojluni/src/main/java/java/net/ |
H A D | URLStreamHandler.java | 117 * @param limit the character position to stop parsing at. This is the 122 protected void parseURL(URL u, String spec, int start, int limit) { argument 143 if (start < limit) { 146 if ((queryStart != -1) && (queryStart < limit)) { 147 query = spec.substring(queryStart+1, limit); 148 if (limit > queryStart) 149 limit = queryStart; 160 // boolean isUNCName = (start <= limit - 4) && 167 if (!isUNCName && (start <= limit - 2) && (spec.charAt(start) == '/') && 171 if (i < 0 || i > limit) { [all...] |
/libcore/ojluni/src/main/java/java/util/regex/ |
H A D | Pattern.java | 1066 * <p> The <tt>limit</tt> parameter controls the number of times the 1068 * array. If the limit <i>n</i> is greater than zero then the pattern 1081 * summary="Split examples showing regex, limit, and result"> 1109 * @param limit 1115 public String[] split(CharSequence input, int limit) { argument 1116 String[] fast = fastSplit(pattern, input.toString(), limit); 1122 boolean matchLimited = limit > 0; 1128 if (!matchLimited || matchList.size() < limit - 1) { 1132 } else if (matchList.size() == limit - 1) { // last one 1145 if (!matchLimited || matchList.size() < limit) 1171 fastSplit(String re, String input, int limit) argument [all...] |
/libcore/luni/src/test/java/libcore/java/net/ |
H A D | OldURLStreamHandlerTest.java | 204 @Override public void parseURL(URL url, String spec, int start, int limit) { argument 205 super.parseURL(url, spec, start, limit);
|
/libcore/ojluni/src/main/java/java/text/ |
H A D | Bidi.java | 52 * by indexing to get the start, limit, and level of a run. The level represents 214 * @param lineLimit the offset from the start of the paragraph to the limit of the line. 221 "limit=" + lineLimit + ", length=" + getLength() + ")"); 351 * @return limit the limit of the run 370 * @param limit the limit of the range of characters to test 373 public static boolean requiresBidi(char[] text, int start, int limit) { argument 375 if (0 > start || start > limit || limit > tex [all...] |
/libcore/ojluni/src/main/java/java/util/logging/ |
H A D | FileHandler.java | 58 * limit, it is closed, rotated out, and a new file opened. 86 * <li> <handler-name>.limit 88 * to any one file. If this is zero, then there is no limit. 89 * (Defaults to no limit). </li> 154 private int limit; // zero => no limit. field in class:FileHandler 227 limit = manager.getIntProperty(cname + ".limit", 0); 228 if (limit < 0) { 229 limit 353 FileHandler(String pattern, int limit, int count) argument 392 FileHandler(String pattern, int limit, int count, boolean append) argument [all...] |
/libcore/ojluni/src/main/java/java/util/stream/ |
H A D | DoubleStream.java | 232 * While {@code limit()} is generally a cheap operation on sequential 234 * especially for large values of {@code maxSize}, since {@code limit(n)} 239 * speedups of {@code limit()} in parallel pipelines, if the semantics of 242 * {@code limit()} in parallel pipelines, switching to sequential execution 249 DoubleStream limit(long maxSize); method in interface:DoubleStream
|
H A D | SliceOps.java | 44 * skip, and the number of elements to limit. 48 * @param limit the number of elements to limit, assumed to be >= 0, with 49 * a value of {@code Long.MAX_VALUE} if there is no limit 52 private static long calcSize(long size, long skip, long limit) { argument 53 return size >= 0 ? Math.max(-1, Math.min(size - skip, limit)) : -1; 60 * @param limit the number of elements to limit, assumed to be >= 0, with 61 * a value of {@code Long.MAX_VALUE} if there is no limit 64 private static long calcSliceFence(long skip, long limit) { argument 76 sliceSpliterator(StreamShape shape, Spliterator<P_IN> s, long skip, long limit) argument 114 makeRef(AbstractPipeline<?, T, ?> upstream, long skip, long limit) argument 230 makeInt(AbstractPipeline<?, Integer, ?> upstream, long skip, long limit) argument 339 makeLong(AbstractPipeline<?, Long, ?> upstream, long skip, long limit) argument 448 makeDouble(AbstractPipeline<?, Double, ?> upstream, long skip, long limit) argument 548 flags(long limit) argument [all...] |
H A D | Stream.java | 430 * While {@code limit()} is generally a cheap operation on sequential 432 * especially for large values of {@code maxSize}, since {@code limit(n)} 437 * speedups of {@code limit()} in parallel pipelines, if the semantics of 440 * {@code limit()} in parallel pipelines, switching to sequential execution 447 Stream<T> limit(long maxSize); method in interface:Stream
|
H A D | DoublePipeline.java | 337 public final DoubleStream limit(long maxSize) { method in class:DoublePipeline 350 long limit = -1; 351 return SliceOps.makeDouble(this, n, limit);
|
H A D | IntPipeline.java | 373 public final IntStream limit(long maxSize) { method in class:IntPipeline
|
H A D | IntStream.java | 227 * While {@code limit()} is generally a cheap operation on sequential 229 * especially for large values of {@code maxSize}, since {@code limit(n)} 234 * speedups of {@code limit()} in parallel pipelines, if the semantics of 237 * {@code limit()} in parallel pipelines, switching to sequential execution 244 IntStream limit(long maxSize); method in interface:IntStream
|
H A D | LongPipeline.java | 354 public final LongStream limit(long maxSize) { method in class:LongPipeline
|
H A D | LongStream.java | 231 * While {@code limit()} is generally a cheap operation on sequential 233 * especially for large values of {@code maxSize}, since {@code limit(n)} 238 * speedups of {@code limit()} in parallel pipelines, if the semantics of 241 * {@code limit()} in parallel pipelines, switching to sequential execution 248 LongStream limit(long maxSize); method in interface:LongStream
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
H A D | ConcurrentSkipListSetTest.java | 705 void populate(NavigableSet<Integer> set, int limit, BitSet bs) { argument 706 for (int i = 0, n = 2 * limit / 3; i < n; i++) { 707 int element = rnd.nextInt(limit);
|
H A D | TreeMapTest.java | 816 void populate(NavigableMap<Integer, Integer> map, int limit) { argument 817 for (int i = 0, n = 2 * limit / 3; i < n; i++) { 818 int key = rnd.nextInt(limit);
|
H A D | TreeSetTest.java | 709 void populate(NavigableSet<Integer> set, int limit) { argument 710 for (int i = 0, n = 2 * limit / 3; i < n; i++) { 711 int element = rnd.nextInt(limit);
|