HomeSort by relevance Sort by last modified time
    Searched refs:limit (Results 1 - 25 of 2042) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /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 &quot;limit&quot; 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 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 * &lt;= start &lt;= limit</code>.
98 * <code>start &lt;= limit &lt;= length()</code>.
108 * limit is equal to the replacement text, that replace has no
115 * &lt;= limit</code>.
116 * @param limit the ending index, exclusive; <code>start &lt;= 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 * &lt;= start &lt;= limit</code>.
118 * <code>start &lt;= limit &lt;= length()</code>.
133 * &lt;= limit</code>.
134 * @param limit the ending index, exclusive; <code>start &lt;= 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 &quot;limit&quot; 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 * &lt;= start &lt;= limit</code>.
101 * <code>start &lt;= limit &lt;= length()</code>.
112 * limit is equal to the replacement text, that replace has no
119 * &lt;= limit</code>.
120 * @param limit the ending index, exclusive; <code>start &lt;= limit
123 * to <code>limit - 1</code
    [all...]
ReplaceableString.java 70 public String substring(int start, int limit) {
71 return buf.substring(start, limit);
123 * &lt;= start &lt;= limit</code>.
125 * <code>start &lt;= limit &lt;= length()</code>.
141 * &lt;= limit</code>.
142 * @param limit the ending index, exclusive; <code>start &lt;= limit
145 * <code>limit - 1</code>
149 public void replace(int start, int limit, String text) {
150 buf.replace(start, limit, text)
    [all...]
  /external/arm-optimized-routines/test/rtest/
random.h 11 uint32 random_upto(uint32 limit);
12 uint32 random_upto_biased(uint32 limit, int bias);
random.c 44 * 0,...,limit-1. (Precondition: limit > 0.)
60 static uint32 random_upto_makemask(uint32 limit) {
64 if ((limit & (mask >> i)) == limit)
69 static uint32 random_upto_internal(uint32 limit, uint32 mask) {
73 } while (ret > limit);
77 uint32 random_upto(uint32 limit) {
78 uint32 mask = random_upto_makemask(limit);
79 return random_upto_internal(limit, mask)
    [all...]
  /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...]
  /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...]
  /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 21 // Scale must be less than or equal to the ratio limit / (*a + *b).
23 static void AdjustRadii(double limit, double scale, SkScalar* a, SkScalar* b) {
29 if (*a + *b > limit) {
40 // The newMinRadius will always be smaller than limit. The largest that minRadius can be
42 // division, minRadius can be no larger than 1/2 limit + ULP. The newMinRadius can be
47 // than limit, but only by one ULP.
48 float newMaxRadius = (float)(limit - newMinRadius);
51 // sum is greater than the limit then newMaxRadius may have to be reduced twice.
54 if (newMaxRadius + newMinRadius > limit) {
56 if (newMaxRadius + newMinRadius > limit) {
    [all...]
  /external/skqp/src/core/
SkScaleToSides.h 21 // Scale must be less than or equal to the ratio limit / (*a + *b).
23 static void AdjustRadii(double limit, double scale, SkScalar* a, SkScalar* b) {
29 if (*a + *b > limit) {
40 // The newMinRadius will always be smaller than limit. The largest that minRadius can be
42 // division, minRadius can be no larger than 1/2 limit + ULP. The newMinRadius can be
47 // than limit, but only by one ULP.
48 float newMaxRadius = (float)(limit - newMinRadius);
51 // sum is greater than the limit then newMaxRadius may have to be reduced twice.
54 if (newMaxRadius + newMinRadius > limit) {
56 if (newMaxRadius + newMinRadius > limit) {
    [all...]
  /external/v8/src/inspector/
test-interface.cc 12 void SetMaxAsyncTaskStacksForTest(V8Inspector* inspector, int limit) {
15 ->setMaxAsyncTaskStacksForTest(limit);
  /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);
  /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/ltp/testcases/kernel/syscalls/sched_setscheduler/
sched_setscheduler03.c 72 static void l_rlimit_show(const int type, struct rlimit *limit)
74 SAFE_GETRLIMIT(type, limit);
76 "rlimit rlim_cur=%lu", (unsigned long)(limit->rlim_cur));
78 "rlimit rlim_max=%lu", (unsigned long)(limit->rlim_max));
81 static void l_rlimit_setup(const int type, struct rlimit *limit)
86 "Setting rlim_cur to %lu", (unsigned long)(limit->rlim_cur));
88 "Setting rlim_max to %lu", (unsigned long)(limit->rlim_max));
90 SAFE_SETRLIMIT(type, limit);
94 if (tmp_rlimit.rlim_cur != limit->rlim_cur)
96 (unsigned long)(limit->rlim_cur)
123 struct rlimit limit; local
    [all...]
  /bionic/libc/arch-arm64/generic/bionic/
memcmp.S 41 #define limit x2 define
64 subs limit, limit, 8
67 /* Limit >= 8, so check first 8 bytes using unaligned loads. */
73 subs limit, limit, 8
76 ldr data1, [src1, limit]
77 ldr data2, [src2, limit]
88 subs limit, limit, 1
    [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,

Completed in 834 milliseconds

1 2 3 4 5 6 7 8 91011>>