| /external/jacoco/org.jacoco.report.test/src/org/jacoco/report/check/ |
| LimitTest.java | 25 * Unit tests for {@link Limit}.
29 private Limit limit; field in class:LimitTest
33 limit = new Limit();
38 assertNull(limit.getMinimum());
39 assertNull(limit.getMaximum());
40 assertEquals(CounterEntity.INSTRUCTION, limit.getEntity());
41 assertEquals(CounterValue.COVEREDRATIO, limit.getValue());
46 limit.setValue(CounterValue.TOTALCOUNT.name())
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| BidiRun.java | 22 * <p>The "limit" of the run is the position just after the
34 int limit; /* last visual position of the run +1 */ field in class:BidiRun
42 * Note that members start and limit of a run instance have different
48 * - limit is one after the last visual position of the run.
51 * - limit is one after the last logical position of the run.
61 BidiRun(int start, int limit, byte embeddingLevel)
64 this.limit = limit;
74 this.limit = run.limit;
[all...] |
| DictionaryMatcher.java | 25 * @param limit The maximum amount of words to output. Must be less than or equal to lengths.length.
30 int[] count, int limit, int[] values);
33 int[] count, int limit) {
34 return matches(text, maxLength, lengths, count, limit, null);
|
| Replaceable.java | 26 * offset and a limit offset. The range of characters thus specified
27 * includes the characters at offset start..limit-1. That is, the
28 * start offset is inclusive, and the limit offset is exclusive.
96 * <= start <= limit</code>.
98 * <code>start <= limit <= length()</code>.
108 * limit is equal to the replacement text, that replace has no
115 * <= limit</code>.
116 * @param limit the ending index, exclusive; <code>start <= limit
119 * to <code>limit - 1</code
[all...] |
| ReplaceableString.java | 65 public String substring(int start, int limit) {
66 return buf.substring(start, limit);
112 * <= start <= limit</code>.
114 * <code>start <= limit <= length()</code>.
128 * <= limit</code>.
129 * @param limit the ending index, exclusive; <code>start <= limit
132 * <code>limit - 1</code>
134 public void replace(int start, int limit, String text) {
135 buf.replace(start, limit, text)
[all...] |
| FunctionReplacer.java | 50 int limit,
54 int len = replacer.replace(text, start, limit, cursor);
55 limit = start + len;
58 limit = translit.transliterate(text, start, limit);
60 return limit - start;
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| BidiRun.java | 21 * <p>The "limit" of the run is the position just after the
33 int limit; /* last visual position of the run +1 */ field in class:BidiRun
41 * Note that members start and limit of a run instance have different
47 * - limit is one after the last visual position of the run.
50 * - limit is one after the last logical position of the run.
60 BidiRun(int start, int limit, byte embeddingLevel)
63 this.limit = limit;
73 this.limit = run.limit;
[all...] |
| DictionaryMatcher.java | 24 * @param limit The maximum amount of words to output. Must be less than or equal to lengths.length.
29 int[] count, int limit, int[] values);
32 int[] count, int limit) {
33 return matches(text, maxLength, lengths, count, limit, null);
|
| Replaceable.java | 25 * offset and a limit offset. The range of characters thus specified
26 * includes the characters at offset start..limit-1. That is, the
27 * start offset is inclusive, and the limit offset is exclusive.
99 * <= start <= limit</code>.
101 * <code>start <= limit <= length()</code>.
112 * limit is equal to the replacement text, that replace has no
119 * <= limit</code>.
120 * @param limit the ending index, exclusive; <code>start <= limit
123 * to <code>limit - 1</code
[all...] |
| ReplaceableString.java | 69 public String substring(int start, int limit) {
70 return buf.substring(start, limit);
119 * <= start <= limit</code>.
121 * <code>start <= limit <= length()</code>.
136 * <= limit</code>.
137 * @param limit the ending index, exclusive; <code>start <= limit
140 * <code>limit - 1</code>
143 public void replace(int start, int limit, String text) {
144 buf.replace(start, limit, text)
[all...] |
| /external/icu/icu4c/source/tools/gentest/ |
| genres32.c | 27 incKey(char *key, char *limit) {
30 while(limit>key) {
31 c=*--limit;
33 *limit='1';
36 *limit='o';
51 char *limit; local
70 /* find the limit of the key string */
71 for(limit=key; *limit!=0; ++limit) {
[all...] |
| /dalvik/libdex/ |
| Leb128.cpp | 28 * any but the low-order four bits set. Additionally, if the limit is
29 * passed as non-NULL and bytes would need to be read past the limit,
32 int readAndVerifyUnsignedLeb128(const u1** pStream, const u1* limit,
37 if (((limit != NULL) && (*pStream > limit))
50 * any but the low-order four bits set. Additionally, if the limit is
51 * passed as non-NULL and bytes would need to be read past the limit,
54 int readAndVerifySignedLeb128(const u1** pStream, const u1* limit,
59 if (((limit != NULL) && (*pStream > limit))
[all...] |
| /libcore/ojluni/src/main/java/java/nio/ |
| 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 may be zero, or it may be some other valu
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...] |
| 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) {
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...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| UCharArrayIterator.java | 23 private final int limit; field in class:UCharArrayIterator
26 public UCharArrayIterator(char[] text, int start, int limit) {
27 if (start < 0 || limit > text.length || start > limit) {
28 throw new IllegalArgumentException("start: " + start + " or limit: "
29 + limit + " out of range [0, "
34 this.limit = limit;
40 return pos < limit ? text[pos] : DONE;
44 return limit - start
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| UCharArrayIterator.java | 21 private final int limit; field in class:UCharArrayIterator
24 public UCharArrayIterator(char[] text, int start, int limit) {
25 if (start < 0 || limit > text.length || start > limit) {
26 throw new IllegalArgumentException("start: " + start + " or limit: "
27 + limit + " out of range [0, "
32 this.limit = limit;
38 return pos < limit ? text[pos] : DONE;
42 return limit - start
[all...] |
| /external/skia/src/core/ |
| SkScaleToSides.h | 19 // Scale must be less than or equal to the ratio limit / (*a + *b).
21 static void AdjustRadii(double limit, double scale, SkScalar* a, SkScalar* b) {
27 if (*a + *b > limit) {
37 // The newMinRadius will always be smaller than limit. The largest that minRadius can be
39 // division, minRadius can be no larger than 1/2 limit + ULP. The newMinRadius can be
44 // than limit, but only by one ULP.
45 float newMaxRadius = (float)(limit - newMinRadius);
48 // sum is greater than the limit then newMaxRadius may have to be reduced twice.
51 if (newMaxRadius + newMinRadius > limit) {
53 if (newMaxRadius + newMinRadius > limit) {
[all...] |
| /external/tlsdate/src/common/ |
| strnlen.c | 10 strnlen(const char *s, size_t limit)
14 for (len = 0; len < limit; len++)
|
| /frameworks/av/include/media/ |
| MemoryLeakTrackUtil.h | 26 * limit is the number of unique allocations to return.
28 extern std::string dumpMemoryAddresses(size_t limit);
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/nio/ |
| AbstractBufferTest.java | 42 assertTrue(0 <= baseBuf.position() && baseBuf.position() <= baseBuf.limit()
43 && baseBuf.limit() <= baseBuf.capacity());
49 int oldLimit = baseBuf.limit();
54 assertEquals(baseBuf.limit(), baseBuf.capacity());
63 baseBuf.limit(oldLimit);
70 int oldLimit = baseBuf.limit();
75 assertEquals(baseBuf.limit(), oldPosition);
84 baseBuf.limit(oldLimit);
91 int oldLimit = baseBuf.limit();
93 assertEquals(baseBuf.hasRemaining(), baseBuf.position() < baseBuf.limit());
[all...] |
| /frameworks/av/media/libmedia/ |
| MediaUtils.cpp | 51 ALOGV("requested limit: %zu", maxMem);
60 ALOGV("actual limit: %zu", maxMem);
62 struct rlimit limit; local
63 getrlimit(RLIMIT_AS, &limit);
64 ALOGV("original limits: %lld/%lld", (long long)limit.rlim_cur, (long long)limit.rlim_max);
65 limit.rlim_cur = maxMem;
66 setrlimit(RLIMIT_AS, &limit);
67 limit.rlim_cur = -1;
68 limit.rlim_max = -1
[all...] |
| /art/runtime/arch/arm64/ |
| memcmp16_arm64.S | 30 #define limit x2 define
51 cbz limit, .Lret0
52 lsl limit, limit, #1 /* Half-words to bytes. */
58 add limit_wd, limit, #7
71 /* Not reached the limit, must have found a diff. */
74 /* Limit % 8 == 0 => all bytes significant. */
75 ands limit, limit, #7
78 lsl limit, limit, #3 /* Bits -> bytes. *
[all...] |
| /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/icu4j/main/classes/translit/src/com/ibm/icu/text/ |
| FunctionReplacer.java | 49 int limit,
53 int len = replacer.replace(text, start, limit, cursor);
54 limit = start + len;
57 limit = translit.transliterate(text, start, limit);
59 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,
|
