HomeSort by relevance Sort by last modified time
    Searched full:count (Results 126 - 150 of 8059) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/icu4c/io/
ufmt_cmn.c 137 int32_t count; local
143 count = 0;
153 /* increment our count */
154 ++count;
157 *len = count;
166 int32_t count, resultIdx, incVal, offset; local
174 count = 0;
179 while(buffer[count] == DIGIT_0 || u_isspace(buffer[count])) {
180 count++
    [all...]
  /external/icu4c/layout/
ArabicLayoutEngine.cpp 65 // Returns: output character count
66 le_int32 ArabicOpenTypeLayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft,
73 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
78 outChars = LE_NEW_ARRAY(LEUnicode, count);
85 glyphStorage.allocateGlyphArray(count, rightToLeft, success);
93 CanonShaping::reorderMarks(&chars[offset], count, rightToLeft, outChars, glyphStorage);
98 ArabicShaping::shape(chars, offset, count, max, rightToLeft, glyphStorage);
100 return count;
103 void ArabicOpenTypeLayoutEngine::adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse
    [all...]
ThaiLayoutEngine.cpp 57 // Returns: the glyph count
59 le_int32 ThaiLayoutEngine::computeGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool /*rightToLeft*/, LEGlyphStorage &glyphStorage, LEErrorCode &success)
65 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
75 outChars = LE_NEW_ARRAY(LEUnicode, count * 2);
82 glyphStorage.allocateGlyphArray(count * 2, FALSE, success);
90 glyphCount = ThaiShaping::compose(chars, offset, count, fGlyphSet, fErrorChar, outChars, glyphStorage);
100 void ThaiLayoutEngine::adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool /*reverse*/,
107 if (chars == NULL || offset < 0 || count < 0) {
  /external/skia/include/core/
SkTDArray.h 31 SkTDArray(const T src[], size_t count) {
32 SkASSERT(src || count == 0);
39 if (count) {
40 fArray = (T*)sk_malloc_throw(count * sizeof(T));
44 memcpy(fArray, src, sizeof(T) * count);
45 fReserve = fCount = count;
101 int count() const { return fCount; } function in class:SkTDArray
127 void setCount(size_t count) {
128 if (count > fReserve) {
129 this->growBy(count - fCount)
138 size_t count = fCount; local
    [all...]
SkTSearch.h 23 int SkTSearch(const T* base, int count, const T& target, size_t elemSize)
25 SkASSERT(count >= 0);
26 if (count <= 0)
29 SkASSERT(base != NULL); // base may be NULL if count is zero
32 int hi = count - 1;
56 int SkTSearch(const T* base, int count, const T& target, size_t elemSize,
59 SkASSERT(count >= 0);
60 if (count <= 0) {
64 SkASSERT(base != NULL); // base may be NULL if count is zero
67 int hi = count - 1
    [all...]
SkTemplates.h 92 /** Allocate count number of T elements
94 SkAutoTArray(size_t count) {
96 if (count) {
97 fArray = new T[count];
99 SkDEBUGCODE(fCount = count;)
106 /** Return the array of T elements. Will be NULL if count == 0
126 /** Allocate count number of T elements
128 SkAutoSTArray(size_t count) {
129 if (count > N) {
130 fArray = new T[count];
153 size_t count() const { return fCount; } function in class:SkAutoSTArray
    [all...]
  /external/webkit/JavaScriptCore/tests/mozilla/js1_2/regexp/
asterisk.js 38 var count = 0; variable
42 testcases[count++] = new TestCase ( SECTION, "'abcddddefg'.match(new RegExp('d*'))",
46 testcases[count++] = new TestCase ( SECTION, "'abcddddefg'.match(new RegExp('cd*'))",
50 testcases[count++] = new TestCase ( SECTION, "'abcdefg'.match(new RegExp('cx*d'))",
54 testcases[count++] = new TestCase ( SECTION, "'xxxxxxx'.match(new RegExp('(x*)(x+)'))",
58 testcases[count++] = new TestCase ( SECTION, "'1234567890'.match(new RegExp('(\\d*)(\\d+)'))",
63 testcases[count++] = new TestCase ( SECTION, "'1234567890'.match(new RegExp('(\\d*)\\d(\\d+)'))",
68 testcases[count++] = new TestCase ( SECTION, "'xxxxxxx'.match(new RegExp('(x+)(x*)'))",
72 testcases[count++] = new TestCase ( SECTION, "'xxxxxxyyyyyy'.match(new RegExp('x*y+$'))",
76 testcases[count++] = new TestCase ( SECTION, "'abcdef'.match(/[\\d]*[\\s]*bc./)"
    [all...]
source.js 38 var count = 0; variable
42 testcases[count++] = new TestCase ( SECTION, "/xyz/g.source",
46 testcases[count++] = new TestCase ( SECTION, "/xyz/.source",
50 testcases[count++] = new TestCase ( SECTION, "/abc\\\\def/.source",
54 testcases[count++] = new TestCase ( SECTION, "/abc[\\b]def/.source",
58 testcases[count++] = new TestCase ( SECTION, "(new RegExp('xyz')).source",
62 testcases[count++] = new TestCase ( SECTION, "(new RegExp('xyz','g')).source",
66 testcases[count++] = new TestCase ( SECTION, "(new RegExp('abc\\\\\\\\def')).source",
70 testcases[count++] = new TestCase ( SECTION, "(new RegExp('abc[\\\\b]def')).source",
string_search.js 38 var count = 0; variable
42 testcases[count++] = new TestCase ( SECTION, "'abcdefg'.search(/d/)",
46 testcases[count++] = new TestCase ( SECTION, "'abcdefg'.search(/x/)",
50 testcases[count++] = new TestCase ( SECTION, "'abcdefg123456hijklmn'.search(/\d+/)",
54 testcases[count++] = new TestCase ( SECTION, "'abcdefg123456hijklmn'.search(new RegExp())",
58 testcases[count++] = new TestCase ( SECTION, "'abc'.search(new RegExp('$'))",
62 testcases[count++] = new TestCase ( SECTION, "'abc'.search(new RegExp('^'))",
66 testcases[count++] = new TestCase ( SECTION, "'abc1'.search(/.\d/)",
70 testcases[count++] = new TestCase ( SECTION, "'abc1'.search(/\d{2}/)",
  /external/skia/tests/
skia_test.cpp 31 static int Count() {
33 int count = 0; local
35 count += 1;
38 return count;
112 const int count = Iter::Count(); local
116 reporter.setIndexOfTotal(index, count);
123 SkDebugf("Finished %d tests, %d failures.\n", count,
124 count - successCount);
  /external/chromium/third_party/icu/source/test/cintltst/
usrchtst.c 138 int count = 0; local
141 for (; count < length; count ++) {
142 UChar ch = unichars[count];
339 int count = 0; local
342 int32_t matchindex = search.offset[count];
352 uint32_t matchlength = search.size[count];
365 count ++;
375 matchindex = search.offset[count];
390 count = count == 0 ? 0 : count - 1
544 int count = 0; local
562 int count = 0; local
600 int count = 0; local
621 int count = 0; local
723 int count = 0; local
749 int count = 0; local
1090 int count = 0; local
1137 int count = 0; local
1297 int count = 0; local
1397 int count = 0; local
1528 int count = 0; local
1551 int count = 0; local
1595 uint32_t count = 0; local
1638 uint32_t count = 0; local
1686 int count = 0; local
1704 int count = 0; local
1725 int count = 0; local
1743 int count = 0; local
1824 int count = 0; local
1850 int count = 0; local
2139 int count = 0; local
2192 int count = 0; local
2256 int count = 0; local
2279 int count = 0; local
2414 int count = 0; local
    [all...]
  /external/icu4c/test/cintltst/
usrchtst.c 138 int count = 0; local
141 for (; count < length; count ++) {
142 UChar ch = unichars[count];
339 int count = 0; local
342 int32_t matchindex = search.offset[count];
358 uint32_t matchlength = search.size[count];
371 count ++;
381 matchindex = search.offset[count];
396 count = count == 0 ? 0 : count - 1
551 int count = 0; local
569 int count = 0; local
607 int count = 0; local
628 int count = 0; local
730 int count = 0; local
756 int count = 0; local
1097 int count = 0; local
1144 int count = 0; local
1304 int count = 0; local
1404 int count = 0; local
1535 int count = 0; local
1558 int count = 0; local
1602 uint32_t count = 0; local
1645 uint32_t count = 0; local
1693 int count = 0; local
1711 int count = 0; local
1732 int count = 0; local
1750 int count = 0; local
1831 int count = 0; local
1857 int count = 0; local
2146 int count = 0; local
2199 int count = 0; local
2263 int count = 0; local
2286 int count = 0; local
2421 int count = 0; local
    [all...]
  /dalvik/tests/023-many-interfaces/
iface-gen.c 11 static int createFiles(int count)
16 for (i = 0; i < count; i++) {
35 for (i = 0; i < count; i++) {
36 fprintf(fp, " Interface%03d%s\n", i, (i == count-1) ? "" : ",");
39 for (i = 1; i < count; i += 2) {
  /external/bouncycastle/src/main/java/org/bouncycastle/crypto/paddings/
ZeroBytePadding.java 59 int count = in.length; local
61 while (count > 0)
63 if (in[count - 1] != 0)
68 count--;
71 return in.length - count;
  /external/chromium/base/
string_util_posix.h 27 inline int strncasecmp(const char* string1, const char* string2, size_t count) {
28 return ::strncasecmp(string1, string2, count);
36 inline int strncmp16(const char16* s1, const char16* s2, size_t count) {
38 return ::wcsncmp(s1, s2, count);
40 return c16memcmp(s1, s2, count);
  /frameworks/base/tests/CoreTests/android/core/
LowLevelNetRunner.java 24 private int count = 0; field in class:LowLevelNetRunner
30 count++;
34 * Decrement the run count. If this returns to zero notify any
38 count--;
39 if (count <= 0) {
  /libcore/luni/src/main/java/org/apache/harmony/luni/internal/net/www/protocol/http/
AbstractHttpOutputStream.java 35 protected final void checkBounds(byte[] buffer, int offset, int count) {
36 if (offset < 0|| offset > buffer.length || count < 0 || buffer.length - offset < count) {
38 "offset=" + offset + ", buffer.length=" + buffer.length + ", count=" + count);
  /libcore/support/src/test/java/tests/support/
Support_ASimpleWriter.java 55 public void write(char[] src, int offset, int count) throws IOException {
59 if (offset < 0 || count < 0 || (offset + count) > buf.length) {
63 System.arraycopy(src, offset, buf, pos, count);
64 pos += count;
  /external/chromium/third_party/icu/source/test/intltest/
srchtest.cpp 216 int count = 0; local
219 for (; count < length; count ++) {
220 UChar ch = text[count];
253 int count = 0; local
255 int32_t matchindex = search->offset[count];
264 int32_t matchlength = search->size[count];
276 count ++;
288 matchindex = search->offset[count];
302 count = count == 0 ? 0 : count - 1
628 int count; local
698 int count = 0; local
710 int count = 0; local
742 int count = 0; local
789 int count = 0; local
849 int count = 0; local
869 int count = 0; local
1161 int count = 0; local
1203 int count = 0; local
1332 int count = 0; local
1373 int count = 0; local
1479 int count = 0; local
1509 int count = 0; local
1533 int count = 0; local
1571 int count = 0; local
1606 int count = 0; local
1619 int count = 0; local
1631 int count = 0; local
1645 int count = 0; local
1716 int count = 0; local
1736 int count = 0; local
1985 int count = 0; local
2036 int count = 0; local
2083 int count = 0; local
2115 int count = 0; local
    [all...]
  /external/icu4c/test/intltest/
srchtest.cpp 218 int count = 0; local
221 for (; count < length; count ++) {
222 UChar ch = text[count];
255 int count = 0; local
257 int32_t matchindex = search->offset[count];
272 int32_t matchlength = search->size[count];
285 count ++;
297 matchindex = search->offset[count];
311 count = count == 0 ? 0 : count - 1
638 int count; local
708 int count = 0; local
720 int count = 0; local
752 int count = 0; local
799 int count = 0; local
859 int count = 0; local
879 int count = 0; local
1171 int count = 0; local
1213 int count = 0; local
1342 int count = 0; local
1383 int count = 0; local
1489 int count = 0; local
1519 int count = 0; local
1543 int count = 0; local
1581 int count = 0; local
1616 int count = 0; local
1629 int count = 0; local
1641 int count = 0; local
1655 int count = 0; local
1726 int count = 0; local
1746 int count = 0; local
1995 int count = 0; local
2046 int count = 0; local
2093 int count = 0; local
2125 int count = 0; local
    [all...]
  /external/skia/include/effects/
SkGradientShader.h 34 CreateLinear returns a shader with a reference count of 1.
35 The caller should decrement the shader's reference count when done with the shader.
36 It is an error for count to be < 2.
38 @param colors The array[count] of colors, to be distributed between the two points
39 @param pos May be NULL. array[count] of SkScalars, or NULL, of the relative position of
44 @param count Must be >=2. The number of colors (and pos if not NULL) entries.
49 const SkColor colors[], const SkScalar pos[], int count,
55 CreateRadial returns a shader with a reference count of 1.
56 The caller should decrement the shader's reference count when done with the shader.
60 @param colors The array[count] of colors, to be distributed between the center and edge of the circl
    [all...]
  /packages/apps/Email/src/org/apache/commons/io/input/
CountingInputStream.java 34 /** The count of bytes that have passed. */
35 private long count; field in class:CountingInputStream
48 * Reads a number of bytes into the byte array, keeping count of the
58 this.count += (found >= 0) ? found : 0;
64 * keeping count of the number read.
75 this.count += (found >= 0) ? found : 0;
80 * Reads the next byte of data adding to the count of bytes received
89 this.count += (found >= 0) ? 1 : 0;
95 * amount to the count.
104 this.count += skip;
    [all...]
  /external/protobuf/src/google/protobuf/io/
zero_copy_stream_impl_lite.cc 78 void ArrayInputStream::BackUp(int count) {
81 GOOGLE_CHECK_LE(count, last_returned_size_);
82 GOOGLE_CHECK_GE(count, 0);
83 position_ -= count;
87 bool ArrayInputStream::Skip(int count) {
88 GOOGLE_CHECK_GE(count, 0);
90 if (count > size_ - position_) {
94 position_ += count;
131 void ArrayOutputStream::BackUp(int count) {
134 GOOGLE_CHECK_LE(count, last_returned_size_)
    [all...]
  /external/srec/portable/src/
PFile.c 58 ESR_ReturnCode PFileRead(PFile* self, void* buffer, size_t size, size_t* count)
65 return self->read(self, buffer, size, count);
68 ESR_ReturnCode PFileWrite(PFile* self, void* buffer, size_t size, size_t* count)
75 return self->write(self, buffer, size, count);
198 size_t i, bufferSize, count, totalRead = 0; local
204 count = pfread(number, sizeof(LCHAR), MAX_INT_DIGITS, self);
205 totalRead += count;
206 if (count < MAX_INT_DIGITS)
222 for (i = 0; i < count && LISSPACE(number[i]); ++i);
224 while (i == count);
272 size_t i, bufferSize, count, totalRead = 0; local
    [all...]
  /external/skia/src/core/
SkShader.cpp 111 void SkShader::shadeSpan16(int x, int y, uint16_t span16[], int count) {
113 SkASSERT(count > 0);
129 void SkShader::shadeSpanAlpha(int x, int y, uint8_t alpha[], int count) {
130 SkASSERT(count > 0);
134 while ((count -= kTempColorCount) >= 0) {
152 SkASSERT(count < 0);
153 SkASSERT(count + kTempColorCount >= 0);
154 if (count += kTempColorCount) {
155 this->shadeSpan(x, y, colors, count);
161 } while (--count != 0)
    [all...]

Completed in 1533 milliseconds

1 2 3 4 56 7 8 91011>>