| /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 | 24 * <p>The "limit" of the run is the position just after the
36 int limit; /* last visual position of the run +1 */ field in class:BidiRun
44 * Note that members start and limit of a run instance have different
50 * - limit is one after the last visual position of the run.
53 * - limit is one after the last logical position of the run.
63 BidiRun(int start, int limit, byte embeddingLevel)
66 this.limit = limit;
76 this.limit = run.limit;
[all...] |
| DictionaryMatcher.java | 27 * @param limit The maximum amount of words to output. Must be less than or equal to lengths.length.
32 int[] count, int limit, int[] values);
35 int[] count, int limit) {
36 return matches(text, maxLength, lengths, count, limit, null);
|
| Replaceable.java | 28 * offset and a limit offset. The range of characters thus specified
29 * includes the characters at offset start..limit-1. That is, the
30 * 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 | 66 public String substring(int start, int limit) {
67 return buf.substring(start, limit);
116 * <= start <= limit</code>.
118 * <code>start <= limit <= length()</code>.
133 * <= limit</code>.
134 * @param limit the ending index, exclusive; <code>start <= limit
137 * <code>limit - 1</code>
140 public void replace(int start, int limit, String text) {
141 buf.replace(start, limit, text)
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| BidiRun.java | 23 * <p>The "limit" of the run is the position just after the
35 int limit; /* last visual position of the run +1 */ field in class:BidiRun
43 * Note that members start and limit of a run instance have different
49 * - limit is one after the last visual position of the run.
52 * - limit is one after the last logical position of the run.
62 BidiRun(int start, int limit, byte embeddingLevel)
65 this.limit = limit;
75 this.limit = run.limit;
[all...] |
| DictionaryMatcher.java | 26 * @param limit The maximum amount of words to output. Must be less than or equal to lengths.length.
31 int[] count, int limit, int[] values);
34 int[] count, int limit) {
35 return matches(text, maxLength, lengths, count, limit, null);
|
| Replaceable.java | 27 * offset and a limit offset. The range of characters thus specified
28 * includes the characters at offset start..limit-1. That is, the
29 * 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...] |
| /external/v8/src/inspector/ |
| test-interface.cc | 12 void SetMaxAsyncTaskStacksForTest(V8Inspector* inspector, int limit) {
15 ->setMaxAsyncTaskStacksForTest(limit);
|
| test-interface.h | 14 V8_EXPORT void SetMaxAsyncTaskStacksForTest(V8Inspector* inspector, int limit);
|
| /external/icu/icu4c/source/tools/gentest/ |
| genres32.c | 29 incKey(char *key, char *limit) {
32 while(limit>key) {
33 c=*--limit;
35 *limit='1';
38 *limit='o';
53 char *limit; local
72 /* find the limit of the key string */
73 for(limit=key; *limit!=0; ++limit) {
[all...] |
| /bionic/libc/arch-arm64/generic/bionic/ |
| memcmp.S | 39 #define limit x2 define
59 subs limit, limit, 8
62 /* Limit >= 8, so check first 8 bytes using unaligned loads. */
66 add limit, limit, tmp1
74 subs limit, limit, 8
78 Limit is pre-decremented by 8 and must be larger than zero.
84 subs limit, 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
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...] |
| 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...] |
| /packages/apps/Settings/src/com/android/settings/datausage/ |
| DataUsageInfoController.java | 40 * @returns the most appropriate limit for the data usage summary. Use the total usage when it
41 * is higher than the limit and warning level. Use the limit when it is set and less than usage.
45 long limit = info.limitLevel; local
46 if (limit <= 0) {
47 limit = info.warningLevel;
49 if (info.usageLevel > limit) {
50 limit = info.usageLevel;
52 return limit;
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| UCharArrayIterator.java | 25 private final int limit; field in class:UCharArrayIterator
28 public UCharArrayIterator(char[] text, int start, int limit) {
29 if (start < 0 || limit > text.length || start > limit) {
30 throw new IllegalArgumentException("start: " + start + " or limit: "
31 + limit + " out of range [0, "
36 this.limit = limit;
43 return pos < limit ? text[pos] : DONE;
48 return limit - start
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/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;
41 return pos < limit ? text[pos] : DONE;
46 return limit - start
[all...] |
| /external/freetype/src/gxvalid/ |
| gxvmorx4.c | 44 FT_Bytes limit,
50 gxv_mort_subtable_type4_validate( table, limit, gxvalid );
|
| gxvmorx.h | 41 FT_Bytes limit,
46 FT_Bytes limit,
51 FT_Bytes limit,
56 FT_Bytes limit,
61 FT_Bytes limit,
|
| /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/skqp/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...] |
| /frameworks/av/media/libmedia/include/media/ |
| MemoryLeakTrackUtil.h | 26 * limit is the number of unique allocations to return.
28 extern std::string dumpMemoryAddresses(size_t limit);
|
| /frameworks/base/cmds/statsd/src/guardrail/ |
| MemoryLeakTrackUtil.h | 27 * limit is the number of unique allocations to return.
29 extern std::string dumpMemInfo(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...] |
