| /external/freetype/src/psaux/ |
| psconv.h | 31 FT_Byte* limit,
37 FT_Byte* limit );
41 FT_Byte* limit,
47 FT_Byte* limit,
54 FT_Byte* limit,
60 FT_Byte* limit,
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| FunctionReplacer.java | 53 int limit,
57 int len = replacer.replace(text, start, limit, cursor);
58 limit = start + len;
61 limit = translit.transliterate(text, start, limit);
63 return limit - start;
|
| UnicodeFilter.java | 34 int limit,
37 if (offset[0] < limit &&
42 if (offset[0] > limit && contains(text.char32At(offset[0]))) {
52 if (incremental && offset[0] == limit) {
|
| /external/icu/icu4j/main/classes/translit/src/com/ibm/icu/text/ |
| FunctionReplacer.java | 52 int limit,
56 int len = replacer.replace(text, start, limit, cursor);
57 limit = start + len;
60 limit = translit.transliterate(text, start, limit);
62 return limit - start;
|
| /external/pdfium/third_party/freetype/src/psaux/ |
| psconv.h | 31 FT_Byte* limit,
37 FT_Byte* limit );
41 FT_Byte* limit,
47 FT_Byte* limit,
54 FT_Byte* limit,
60 FT_Byte* limit,
|
| /external/libchrome/sandbox/linux/services/ |
| resource_limits.cc | 15 bool ResourceLimits::Lower(int resource, rlim_t limit) {
19 // Make sure we don't raise the existing limit.
20 const struct rlimit new_rlimit = {std::min(old_rlimit.rlim_cur, limit),
21 std::min(old_rlimit.rlim_max, limit)};
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| RangeValueIterator.java | 19 * <start, limit, value> where
22 * <li> limit is 1 after the maximum integer that follows start, such that
23 * all integers between start and (limit - 1), inclusive, have the same
25 * <li> value is the integer value that all integers from start to (limit - 1)
30 * value(limit - 1). However value(start -1) != value(start) and
31 * value(limit) != value(start).
44 * Integer.toHexString(result.limit - 1) +
56 * Stores the start and limit of the continous result range and the
57 * common value all integers between [start, limit - 1] has.
72 public int limit; field in class:RangeValueIterator.Element
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| UnicodeFilter.java | 40 int limit,
43 if (offset[0] < limit &&
48 if (offset[0] > limit && contains(text.char32At(offset[0]))) {
58 if (incremental && offset[0] == limit) {
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| RangeValueIterator.java | 18 * <start, limit, value> where
21 * <li> limit is 1 after the maximum integer that follows start, such that
22 * all integers between start and (limit - 1), inclusive, have the same
24 * <li> value is the integer value that all integers from start to (limit - 1)
29 * value(limit - 1). However value(start -1) != value(start) and
30 * value(limit) != value(start).
43 * Integer.toHexString(result.limit - 1) +
56 * Stores the start and limit of the continous result range and the
57 * common value all integers between [start, limit - 1] has.
75 public int limit; field in class:RangeValueIterator.Element
[all...] |
| /external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/http/ |
| RetryableSink.java | 34 private final int limit; field in class:RetryableSink
37 public RetryableSink(int limit) {
38 this.limit = limit;
48 if (content.size() < limit) {
50 "content-length promised " + limit + " bytes, but received " + content.size());
57 if (limit != -1 && content.size() > limit - byteCount) {
58 throw new ProtocolException("exceeded content-length limit of " + limit + " bytes")
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| BMPSet.java | 135 * @return the limit (exclusive end) of the span
145 int limit = s.length(); local
149 while (i < limit) {
160 c >= 0xdc00 || (i + 1) == limit || (c2 = s.charAt(i + 1)) < 0xdc00 || c2 >= 0xe000) {
188 while (i < limit) {
199 c >= 0xdc00 || (i + 1) == limit || (c2 = s.charAt(i + 1)) < 0xdc00 || c2 >= 0xe000) {
236 * limit and spanCondition==0 or 1.
240 public final int spanBack(CharSequence s, int limit, SpanCondition spanCondition) {
246 c = s.charAt(--limit);
256 c < 0xdc00 || 0 == limit || (c2 = s.charAt(limit - 1)) < 0xd800 || c2 >= 0xdc00)
381 int start, limit; local
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| BMPSet.java | 133 * @return the limit (exclusive end) of the span
143 int limit = s.length(); local
147 while (i < limit) {
158 c >= 0xdc00 || (i + 1) == limit || (c2 = s.charAt(i + 1)) < 0xdc00 || c2 >= 0xe000) {
186 while (i < limit) {
197 c >= 0xdc00 || (i + 1) == limit || (c2 = s.charAt(i + 1)) < 0xdc00 || c2 >= 0xe000) {
234 * limit and spanCondition==0 or 1.
238 public final int spanBack(CharSequence s, int limit, SpanCondition spanCondition) {
244 c = s.charAt(--limit);
254 c < 0xdc00 || 0 == limit || (c2 = s.charAt(limit - 1)) < 0xd800 || c2 >= 0xdc00)
379 int start, limit; local
[all...] |
| /libcore/ojluni/src/test/java/util/stream/test/org/openjdk/tests/java/util/stream/ |
| 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(10), EMPTY_INT_ARRAY)
161 assertEquals(sr.size(), sliceSize(sliceSize(data.size(), s), 0, limit)); local
164 assertEquals(sr.size(), sliceSize(data.size(), s, limit)); local
176 assertEquals(sr.size(), sliceSize(data.size(), 0, limit)); local
179 assertEquals(sr.size(), sliceSize(sliceSize(data.size(), 0, limit), 0, limit \/ 2)); local
[all...] |
| 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(10), Collections.emptyList())
[all...] |
| /external/okhttp/okio/okio/src/main/java/okio/ |
| Segment.java | 30 * {@code limit} and beyond. There is a single owning segment for each byte array. Positions,
43 int limit; field in class:Segment
48 /** True if this segment owns the byte array and can append to it, extending {@code limit}. */
64 this(shareFrom.data, shareFrom.pos, shareFrom.limit);
68 Segment(byte[] data, int pos, int limit) {
71 this.limit = limit;
104 * segment contains the data in {@code [pos+byteCount..limit)}. This can be
110 if (byteCount <= 0 || byteCount > limit - pos) throw new IllegalArgumentException();
112 prefix.limit = prefix.pos + byteCount
[all...] |
| /cts/tests/openglperf2/jni/graphics/ |
| Vector2D.h | 26 void limit(float max);
27 void limit(float maxX, float maxY);
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
| LimitedInputStream.java | 13 int limit)
16 this._limit = limit;
|
| /external/libvpx/libvpx/test/ |
| i420_video_source.h | 26 unsigned int start, int limit)
28 rate_numerator, rate_denominator, start, limit) {}
|
| /external/libnl/lib/cli/qdisc/ |
| bfifo.c | 23 " --limit=LIMIT Maximum queue length in number of bytes.\n"
26 " # Attach bfifo with a 4KB bytes limit to eth1\n"
27 " nl-qdisc-add --dev=eth1 --parent=root bfifo --limit=4096\n");
33 int limit; local
42 { "limit", 1, 0, ARG_LIMIT },
56 limit = nl_size2int(optarg);
57 if (limit < 0) {
58 nl_cli_fatal(limit, "Unable to parse bfifo limit "
[all...] |
| /external/icu/icu4c/source/i18n/ |
| uni2name.cpp | 80 offsets.start = offsets.limit;
87 offsets.start = offsets.limit;
92 int32_t limit = offsets.limit; local
98 while (cursor < limit) {
108 limit += len-clen; // change in length
114 offsets.contextLimit += limit - offsets.limit;
115 offsets.limit = limit;
[all...] |
| /external/brotli/enc/ |
| find_match_length.h | 24 size_t limit) {
26 size_t limit2 = (limit >> 3) + 1; /* + 1 is for pre-decrement in while */
40 limit = (limit & 7) + 1; /* + 1 is for pre-decrement in while */
41 while (--limit) {
54 size_t limit) {
56 const uint8_t* s2_limit = s2 + limit;
|
| /external/ltp/testcases/kernel/syscalls/ulimit/ |
| ulimit01.c | 125 long limit; /* saved limit */ variable
181 limit = Scenarios[i].newlimit;
186 TEST(ulimit(cmd, limit));
193 cmd, limit);
197 cmd, limit);
203 cmd, limit, TEST_RETURN);
207 cmd, limit, TEST_RETURN);
|
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/ |
| ByteBufferHelper.java | 32 nuSamples.get(lastIndex).arrayOffset() + nuSamples.get(lastIndex).limit() == buffer.arrayOffset()) {
34 ByteBuffer nu = ByteBuffer.wrap(buffer.array(), oldBuffer.arrayOffset(), oldBuffer.limit() + buffer.limit()).slice();
39 nuSamples.get(lastIndex).limit() == nuSamples.get(lastIndex).capacity() - buffer.capacity()) {
42 oldBuffer.limit(buffer.limit() + oldBuffer.limit());
|
| /external/r8/src/main/java/com/android/tools/r8/ir/regalloc/ |
| RegisterPositions.java | 12 * The backing for the mapping grows as needed up to a given limit. If no mapping exists for
18 private int limit; field in class:RegisterPositions
22 public RegisterPositions(int limit) {
23 this.limit = limit;
28 registerHoldsConstant = new BitSet(limit);
47 assert index < limit;
56 size = Math.min(size, limit);
|
| /external/wpa_supplicant_8/wpa_supplicant/ |
| autoscan_exponential.c | 18 int limit; member in struct:autoscan_exponential_data
39 data->limit = atoi(pos);
60 "and limit is %d", data->base, data->limit);
84 if (data->interval >= data->limit)
85 return data->limit;
91 if (data->interval > data->limit)
92 return data->limit;
|
