Searched defs:limit (Results 1 - 25 of 40) sorted by relevance

12

/libcore/ojluni/src/main/java/java/nio/
H A DCharBufferSpliterator.java42 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 DStringCharBuffer.java55 int limit,
58 super(mark, pos, limit, cap, null, offset);
64 position(), limit(), capacity(), offset);
52 StringCharBuffer(CharSequence s, int mark, int pos, int limit, int cap, int offset) argument
H A DBuffer.java36 * 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>&lt;=</tt>
107 * undefined. The initial limit ma
187 private int limit; field in class:Buffer
260 public final int limit() { method in class:Buffer
274 public final Buffer limit(int newLimit) { method in class:Buffer
[all...]
/libcore/ojluni/src/main/java/sun/net/www/protocol/mailto/
H A DHandler.java47 // int limit = s.length();
48 // char d[] = new char[limit];
50 // for (int sp = 0; sp < limit; sp++) {
52 // if (c == '%' && sp + 2 < limit) {
114 * @param limit the character position to stop parsing at.
116 public void parseURL(URL u, String spec, int start, int limit) { argument
123 if (start < limit) {
124 file = spec.substring(start, limit);
/libcore/ojluni/src/main/java/sun/net/www/protocol/file/
H A DHandler.java53 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 DDeflaterInputStream.java286 * @param limit maximum bytes that can be read before invalidating the position marker
288 public void mark(int limit) { argument
/libcore/ojluni/src/main/java/sun/net/www/protocol/jar/
H A DHandler.java127 int start, int limit) {
131 int refPos = spec.indexOf('#', limit);
147 spec = spec.substring(start, limit);
126 parseURL(URL url, String spec, int start, int limit) argument
/libcore/ojluni/src/test/java/util/stream/boottest/java/util/stream/
H A DSliceSpliteratorTest.java63 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 DIntSliceOpTest.java83 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 DSliceOpTest.java78 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 DURLStreamHandler.java118 * @param limit the character position to stop parsing at. This is the
123 protected void parseURL(URL u, String spec, int start, int limit) { argument
144 if (start < limit) {
147 if ((queryStart != -1) && (queryStart < limit)) {
148 query = spec.substring(queryStart+1, limit);
149 if (limit > queryStart)
150 limit = queryStart;
161 // boolean isUNCName = (start <= limit - 4) &&
168 if (!isUNCName && (start <= limit - 2) && (spec.charAt(start) == '/') &&
175 i = limit;
[all...]
/libcore/ojluni/src/main/java/java/util/logging/
H A DFileHandler.java41 * limit, it is closed, rotated out, and a new file opened.
67 * <li> java.util.logging.FileHandler.limit
69 * to any one file. If this is zero, then there is no limit.
70 * (Defaults to no limit).
124 private int limit; // zero => no limit. field in class:FileHandler
189 limit = manager.getIntProperty(cname + ".limit", 0);
190 if (limit < 0) {
191 limit
314 FileHandler(String pattern, int limit, int count) argument
353 FileHandler(String pattern, int limit, int count, boolean append) argument
[all...]
/libcore/ojluni/src/main/java/java/util/regex/
H A DPattern.java1062 * <p> The <tt>limit</tt> parameter controls the number of times the
1064 * array. If the limit <i>n</i> is greater than zero then the pattern
1077 * summary="Split examples showing regex, limit, and result">
1105 * @param limit
1111 public String[] split(CharSequence input, int limit) { argument
1112 String[] fast = fastSplit(pattern, input.toString(), limit);
1118 boolean matchLimited = limit > 0;
1124 if (!matchLimited || matchList.size() < limit - 1) {
1128 } else if (matchList.size() == limit - 1) { // last one
1141 if (!matchLimited || matchList.size() < limit)
1167 fastSplit(String re, String input, int limit) argument
[all...]
/libcore/ojluni/src/main/java/sun/net/www/http/
H A DKeepAliveStream.java122 public void mark(int limit) {} argument
/libcore/luni/src/test/java/libcore/java/net/
H A DOldURLStreamHandlerTest.java204 @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 DBidi.java52 * by indexing to get the start, limit, and level of a run. The level represents
196 * @param lineLimit the offset from the start of the paragraph to the limit of the line.
201 "limit=" + lineLimit + ", length=" + getLength() + ")");
323 * @return limit the limit of the run
342 * @param limit the limit of the range of characters to test
345 public static boolean requiresBidi(char[] text, int start, int limit) { argument
346 if (0 > start || start > limit || limit > tex
[all...]
/libcore/ojluni/src/main/java/java/util/stream/
H A DDoubleStream.java232 * 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 DSliceOps.java44 * 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 DStream.java430 * 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 DDoublePipeline.java337 public final DoubleStream limit(long maxSize) { method in class:DoublePipeline
350 long limit = -1;
351 return SliceOps.makeDouble(this, n, limit);
H A DIntPipeline.java373 public final IntStream limit(long maxSize) { method in class:IntPipeline
H A DIntStream.java227 * 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
/libcore/jsr166-tests/src/test/java/jsr166/
H A DConcurrentSkipListSetTest.java705 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 DTreeMapTest.java816 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 DTreeSetTest.java709 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);

Completed in 963 milliseconds

12