| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| D | CodePointMap.java | 217 protected int sIndex; field in CodePointMap.StringIterator
236 protected StringIterator(CharSequence s, int sIndex) { in StringIterator() argument
238 this.sIndex = sIndex; in StringIterator()
251 public void reset(CharSequence s, int sIndex) { in reset() argument
253 this.sIndex = sIndex; in reset()
269 if (sIndex >= s.length()) { in next()
272 c = Character.codePointAt(s, sIndex); in next()
273 sIndex += Character.charCount(c); in next()
289 if (sIndex <= 0) { in previous()
292 c = Character.codePointBefore(s, sIndex); in previous()
[all …]
|
| D | CodePointTrie.java | 837 public final StringIterator stringIterator(CharSequence s, int sIndex) { in stringIterator() argument
838 return new FastStringIterator(s, sIndex); in stringIterator()
842 private FastStringIterator(CharSequence s, int sIndex) { in FastStringIterator() argument
843 super(s, sIndex); in FastStringIterator()
848 if (sIndex >= s.length()) { in next()
851 char lead = s.charAt(sIndex++); in next()
858 if (UTF16Plus.isSurrogateLead(lead) && sIndex < s.length() && in next()
859 Character.isLowSurrogate(trail = s.charAt(sIndex))) { in next()
860 ++sIndex; in next()
873 if (sIndex <= 0) { in previous()
[all …]
|
| D | BytesTrie.java | 270 public Result next(byte[] s, int sIndex, int sLimit) { in next() argument
271 if(sIndex>=sLimit) { in next()
285 if(sIndex==sLimit) { in next()
292 inByte=s[sIndex++]; in next()
312 if(sIndex==sLimit) { in next()
320 inByte=s[sIndex++]; in next()
|
| D | CharsTrie.java | 232 public Result next(CharSequence s, int sIndex, int sLimit) { in next() argument
233 if(sIndex>=sLimit) { in next()
247 if(sIndex==sLimit) { in next()
254 inUnit=s.charAt(sIndex++); in next()
274 if(sIndex==sLimit) { in next()
282 inUnit=s.charAt(sIndex++); in next()
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| D | CodePointMap.java | 209 protected int sIndex; field in CodePointMap.StringIterator
228 protected StringIterator(CharSequence s, int sIndex) { in StringIterator() argument
230 this.sIndex = sIndex; in StringIterator()
242 public void reset(CharSequence s, int sIndex) { in reset() argument
244 this.sIndex = sIndex; in reset()
259 if (sIndex >= s.length()) { in next()
262 c = Character.codePointAt(s, sIndex); in next()
263 sIndex += Character.charCount(c); in next()
278 if (sIndex <= 0) { in previous()
281 c = Character.codePointBefore(s, sIndex); in previous()
[all …]
|
| D | CodePointTrie.java | 821 public final StringIterator stringIterator(CharSequence s, int sIndex) { in stringIterator() argument
822 return new FastStringIterator(s, sIndex); in stringIterator()
826 private FastStringIterator(CharSequence s, int sIndex) { in FastStringIterator() argument
827 super(s, sIndex); in FastStringIterator()
832 if (sIndex >= s.length()) { in next()
835 char lead = s.charAt(sIndex++); in next()
842 if (UTF16Plus.isSurrogateLead(lead) && sIndex < s.length() && in next()
843 Character.isLowSurrogate(trail = s.charAt(sIndex))) { in next()
844 ++sIndex; in next()
857 if (sIndex <= 0) { in previous()
[all …]
|
| D | BytesTrie.java | 254 public Result next(byte[] s, int sIndex, int sLimit) { in next() argument
255 if(sIndex>=sLimit) { in next()
269 if(sIndex==sLimit) { in next()
276 inByte=s[sIndex++]; in next()
296 if(sIndex==sLimit) { in next()
304 inByte=s[sIndex++]; in next()
|
| D | CharsTrie.java | 221 public Result next(CharSequence s, int sIndex, int sLimit) { in next() argument
222 if(sIndex>=sLimit) { in next()
236 if(sIndex==sLimit) { in next()
243 inUnit=s.charAt(sIndex++); in next()
263 if(sIndex==sLimit) { in next()
271 inUnit=s.charAt(sIndex++); in next()
|
| /external/swiftshader/src/OpenGL/compiler/preprocessor/ |
| D | Input.cpp | 46 assert(mReadLoc.cIndex < mLength[mReadLoc.sIndex]); in skipChar()
48 if (mReadLoc.cIndex == mLength[mReadLoc.sIndex]) in skipChar()
50 ++mReadLoc.sIndex; in skipChar()
53 if (mReadLoc.sIndex >= mCount) in skipChar()
57 return mString[mReadLoc.sIndex] + mReadLoc.cIndex; in skipChar()
65 if (mReadLoc.sIndex < mCount && maxSize > 0) in read()
67 const char *c = mString[mReadLoc.sIndex] + mReadLoc.cIndex; in read()
107 while ((nRead < maxRead) && (mReadLoc.sIndex < mCount)) in read()
109 size_t size = mLength[mReadLoc.sIndex] - mReadLoc.cIndex; in read()
116 if (*(mString[mReadLoc.sIndex] + mReadLoc.cIndex + i) == '\\') in read()
[all …]
|
| D | Tokenizer.l | 84 while ((scanLoc->sIndex < input->count()) && \
85 (scanLoc->cIndex >= input->length(scanLoc->sIndex))) \
87 scanLoc->cIndex -= input->length(scanLoc->sIndex++); \
284 if (scanLoc->sIndex != sIndexMax)
288 scanLoc->sIndex = sIndexMax; scanLoc->cIndex = 0;
|
| D | Input.h | 41 size_t sIndex; // String index; member
44 Location() : sIndex(0), cIndex(0) {} in Location()
|
| /external/skia/src/pathops/ |
| D | SkPathWriter.cpp | 336 int sIndex = sLink[rIndex]; in assemble() local
337 SkASSERT(sIndex != SK_MaxS32); in assemble()
340 if (sIndex < 0) { in assemble()
341 eIndex = sLink[~sIndex]; in assemble()
342 sLink[~sIndex] = SK_MaxS32; in assemble()
344 eIndex = eLink[sIndex]; in assemble()
345 eLink[sIndex] = SK_MaxS32; in assemble()
349 SkDebugf("%s sIndex=%c%d eIndex=%c%d\n", __FUNCTION__, sIndex < 0 ? 's' : 'e', in assemble()
350 sIndex < 0 ? ~sIndex : sIndex, eIndex < 0 ? 's' : 'e', in assemble()
386 sIndex == ((rIndex != eIndex) ^ forward ? eIndex : ~eIndex)); in assemble()
[all …]
|
| D | SkOpAngle.cpp | 543 int sIndex = -1; in endsIntersect() local
573 sIndex = index; in endsIntersect()
619 sIndex = index; in endsIntersect()
623 const SkDCurve& curve = sIndex ? rh->fPart.fCurve : this->fPart.fCurve; in endsIntersect()
624 const SkOpSegment& segment = sIndex ? *rh->segment() : *this->segment(); in endsIntersect()
625 double tStart = sIndex ? rh->fStart->t() : fStart->t(); in endsIntersect()
631 return sRayLonger ^ (sIndex == 0) ^ (septDir < 0); in endsIntersect()
|
| /external/skqp/src/pathops/ |
| D | SkPathWriter.cpp | 336 int sIndex = sLink[rIndex]; in assemble() local
337 SkASSERT(sIndex != SK_MaxS32); in assemble()
340 if (sIndex < 0) { in assemble()
341 eIndex = sLink[~sIndex]; in assemble()
342 sLink[~sIndex] = SK_MaxS32; in assemble()
344 eIndex = eLink[sIndex]; in assemble()
345 eLink[sIndex] = SK_MaxS32; in assemble()
349 SkDebugf("%s sIndex=%c%d eIndex=%c%d\n", __FUNCTION__, sIndex < 0 ? 's' : 'e', in assemble()
350 sIndex < 0 ? ~sIndex : sIndex, eIndex < 0 ? 's' : 'e', in assemble()
386 sIndex == ((rIndex != eIndex) ^ forward ? eIndex : ~eIndex)); in assemble()
[all …]
|
| D | SkOpAngle.cpp | 543 int sIndex = -1; in endsIntersect() local
573 sIndex = index; in endsIntersect()
619 sIndex = index; in endsIntersect()
623 const SkDCurve& curve = sIndex ? rh->fPart.fCurve : this->fPart.fCurve; in endsIntersect()
624 const SkOpSegment& segment = sIndex ? *rh->segment() : *this->segment(); in endsIntersect()
625 double tStart = sIndex ? rh->fStart->t() : fStart->t(); in endsIntersect()
631 return sRayLonger ^ (sIndex == 0) ^ (septDir < 0); in endsIntersect()
|
| /external/clang/test/Analysis/ |
| D | CFContainers.mm | 149 CFIndex sIndex;
150 for (sIndex = 0 ; sIndex <= 5 ; sIndex += 3 ) {
151 const void *s = CFArrayGetValueAtIndex(array, sIndex);
162 void TestGetCount(CFArrayRef A, CFIndex sIndex) {
164 if (sCount > sIndex)
165 const void *s1 = CFArrayGetValueAtIndex(A, sIndex);
188 void TestUndef(CFArrayRef A, CFIndex sIndex, void* x[]) {
197 void TestConst(CFArrayRef A, CFIndex sIndex, void* x[]) {
|
| /external/deqp-deps/glslang/Test/ |
| D | 310.vert | 146 uniform int sIndex;
157 sArray[sIndex + 1]; // ERRRO, not supported
158 auArray[sIndex + 1];
161 ubInst[sIndex + 1]; // ERROR, not supported
162 bbInst[sIndex]; // ERROR, not supported
164 iArray[sIndex * 2]; // ERROR, not supported
175 sArray[sIndex + 1];
176 ubInst[sIndex + 1];
177 bbInst[sIndex - 2]; // ERROR, still not supported
179 iArray[sIndex - 2];
|
| D | 320.vert | 55 uniform int sIndex;
66 sArray[sIndex + 1];
67 ubInst[sIndex + 1];
68 bbInst[sIndex - 2]; // ERROR, still not supported
70 iArray[sIndex - 2];
|
| /external/icu/icu4c/source/i18n/ |
| D | collationfastlatin.cpp | 814 const uint8_t *s8, int32_t &sIndex, int32_t sLength) { in lookupUTF8() argument
817 int32_t i2 = sIndex + 1; in lookupUTF8()
819 uint8_t t1 = s8[sIndex]; in lookupUTF8()
821 sIndex += 2; in lookupUTF8()
837 const uint8_t *s8, int32_t &sIndex) { in lookupUTF8Unsafe() argument
842 return table[((c - 0xc2) << 6) + s8[sIndex++]]; // 0080..017F in lookupUTF8Unsafe()
844 uint8_t t2 = s8[sIndex + 1]; in lookupUTF8Unsafe()
845 sIndex += 2; in lookupUTF8Unsafe()
857 … const UChar *s16, const uint8_t *s8, int32_t &sIndex, int32_t &sLength) { in nextPair() argument
865 sLength = sIndex - 1; in nextPair()
[all …]
|
| D | collationfastlatin.h | 224 const uint8_t *s8, int32_t &sIndex, int32_t sLength);
226 const uint8_t *s8, int32_t &sIndex);
229 … const UChar *s16, const uint8_t *s8, int32_t &sIndex, int32_t &sLength);
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/util/ |
| D | CodePointTrieTest.java | 350 int i, sIndex, countValues; in testTrieUTF16() local
378 sIndex = 0; in testTrieUTF16()
380 while (sIndex < s.length()) { in testTrieUTF16()
381 c2 = s.codePointAt(sIndex); in testTrieUTF16()
382 sIndex += Character.charCount(c2); in testTrieUTF16()
403 sIndex = s.length(); in testTrieUTF16()
405 while (sIndex > 0) { in testTrieUTF16()
407 c2 = s.codePointBefore(sIndex); in testTrieUTF16()
408 sIndex -= Character.charCount(c2); in testTrieUTF16()
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/util/ |
| D | CodePointTrieTest.java | 347 int i, sIndex, countValues; in testTrieUTF16() local
375 sIndex = 0; in testTrieUTF16()
377 while (sIndex < s.length()) { in testTrieUTF16()
378 c2 = s.codePointAt(sIndex); in testTrieUTF16()
379 sIndex += Character.charCount(c2); in testTrieUTF16()
400 sIndex = s.length(); in testTrieUTF16()
402 while (sIndex > 0) { in testTrieUTF16()
404 c2 = s.codePointBefore(sIndex); in testTrieUTF16()
405 sIndex -= Character.charCount(c2); in testTrieUTF16()
|
| /external/skqp/tests/ |
| D | PathOpsAngleIdeas.cpp | 529 int sIndex = (int) (smallestTs[1] < 1); in testQuadAngles() local
530 REPORTER_ASSERT(reporter, smallestTs[sIndex ^ 1] == 1); in testQuadAngles()
531 double t = smallestTs[sIndex]; in testQuadAngles()
532 const SkDQuad& q = *quads[sIndex]; in testQuadAngles()
534 SkDVector end = rays[sIndex][1] - origin; in testQuadAngles()
541 rayDist > endDist, sIndex == 0, vDir[sIndex] < 0, midXray < 0); in testQuadAngles()
544 == SkScalarSignAsInt(SkDoubleToScalar(vDir[sIndex]))); in testQuadAngles()
545 firstInside = (rayDist > endDist) ^ (sIndex == 0) ^ (vDir[sIndex] < 0); in testQuadAngles()
|
| /external/skia/tests/ |
| D | PathOpsAngleIdeas.cpp | 529 int sIndex = (int) (smallestTs[1] < 1); in testQuadAngles() local
530 REPORTER_ASSERT(reporter, smallestTs[sIndex ^ 1] == 1); in testQuadAngles()
531 double t = smallestTs[sIndex]; in testQuadAngles()
532 const SkDQuad& q = *quads[sIndex]; in testQuadAngles()
534 SkDVector end = rays[sIndex][1] - origin; in testQuadAngles()
541 rayDist > endDist, sIndex == 0, vDir[sIndex] < 0, midXray < 0); in testQuadAngles()
544 == SkScalarSignAsInt(SkDoubleToScalar(vDir[sIndex]))); in testQuadAngles()
545 firstInside = (rayDist > endDist) ^ (sIndex == 0) ^ (vDir[sIndex] < 0); in testQuadAngles()
|
| /external/skqp/samplecode/ |
| D | SamplePathFuzz.cpp | 366 for (uint32_t sIndex = 0; sIndex < segments; ++sIndex) { in makePath() local
|