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

1 2 3 4 5 6 7 8 9

  /external/chromium_org/third_party/icu/source/common/unicode/
umisc.h 47 int32_t endIndex;
  /external/icu4c/common/unicode/
umisc.h 47 int32_t endIndex;
  /external/jsilver/src/com/google/streamhtmlparser/util/
JavascriptTokenBuffer.java 61 private int endIndex;
70 endIndex = 0;
83 endIndex = aJavascriptTokenBuffer.endIndex;
115 buffer[endIndex] = input;
116 endIndex = (endIndex + 1) % buffer.length;
117 if (endIndex == startIndex) {
118 startIndex = (endIndex + 1) % buffer.length;
129 if (startIndex == endIndex) {
    [all...]
  /libcore/luni/src/main/java/java/text/
FieldPosition.java 34 private int myField, beginIndex, endIndex;
75 beginIndex = endIndex = 0;
96 && beginIndex == pos.beginIndex && endIndex == pos.endIndex;
114 return endIndex;
138 return attributeHash + myField * 10 + beginIndex * 100 + endIndex;
158 endIndex = index;
169 + myField + ", beginIndex=" + beginIndex + ", endIndex="
170 + endIndex + "]";
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
Utils.java 64 int endIndex = src.indexOf(replacee);
65 while(endIndex != -1) {
66 result.append(src.substring(startIndex,endIndex));
70 startIndex = endIndex + replacee.length();
71 endIndex = src.indexOf(replacee,startIndex);
  /external/apache-http/src/org/apache/http/util/
CharArrayBuffer.java 206 public int indexOf(int ch, int beginIndex, int endIndex) {
210 if (endIndex > this.len) {
211 endIndex = this.len;
213 if (beginIndex > endIndex) {
216 for (int i = beginIndex; i < endIndex; i++) {
228 public String substring(int beginIndex, int endIndex) {
232 if (endIndex > this.len) {
235 if (beginIndex > endIndex) {
238 return new String(this.buffer, beginIndex, endIndex - beginIndex);
241 public String substringTrimmed(int beginIndex, int endIndex) {
    [all...]
  /frameworks/opt/telephony/src/java/com/android/internal/telephony/cat/
ComprehensionTlv.java 91 int endIndex = data.length;
92 while (startIndex < endIndex) {
117 int endIndex = data.length;
130 " endIndex=" + endIndex);
162 " endIndex=" + endIndex);
173 " endIndex=" + endIndex);
185 " endIndex=" + endIndex)
    [all...]
BerTlv.java 80 int endIndex = data.length;
98 " curIndex=" + curIndex + " endIndex=" + endIndex);
107 " endIndex=" + endIndex);
118 " curIndex=" + curIndex + " endIndex=" + endIndex);
124 if (endIndex - curIndex < length) {
126 "Command had extra data endIndex=" + endIndex + " curIndex=" + curIndex
    [all...]
  /external/chromium_org/third_party/WebKit/Source/wtf/
NonCopyingSort.h 69 ptrdiff_t endIndex = count - 1;
70 while (endIndex > 0) {
71 swap(start[endIndex], start[0]);
72 siftDown(start, 0, endIndex - 1, compareLess);
73 endIndex--;
  /external/chromium_org/third_party/skia/src/pathops/
SkPathOpsSimplify.cpp 18 int index, endIndex;
20 SkOpSegment* current = FindSortableTop(contourList, &firstContour, &index, &endIndex,
33 if (current->activeWinding(index, endIndex)) {
46 int nextEnd = endIndex;
53 current->addCurveTo(index, endIndex, simple, true);
61 current->xyAtT(endIndex).fX, current->xyAtT(endIndex).fY);
63 current->addCurveTo(index, endIndex, simple, true);
66 endIndex = nextEnd;
68 || !current->done(SkMin32(index, endIndex))));
    [all...]
SkPathOpsCommon.h 18 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>& chase, int& tIndex, int& endIndex);
20 int* index, int* endIndex, SkPoint* topLeft, bool* unsortable,
SkPathOpsOp.cpp 136 int index, endIndex;
138 SkOpSegment* current = FindSortableTop(contourList, &firstContour, &index, &endIndex,
151 if (current->activeOp(index, endIndex, xorMask, xorOpMask, op)) {
164 int nextEnd = endIndex;
171 current->addCurveTo(index, endIndex, simple, true);
179 current->xyAtT(endIndex).fX, current->xyAtT(endIndex).fY);
181 current->addCurveTo(index, endIndex, simple, true);
184 endIndex = nextEnd;
186 || !current->done(SkMin32(index, endIndex))));
    [all...]
SkPathOpsCommon.cpp 16 const int endIndex = *endIndexPtr;
19 double tAtMid = current->tAtMid(index, endIndex, mid);
51 if (testSeg == current && current->betweenTs(index, testHit, endIndex)) {
53 double endT = current->t(endIndex);
56 double midT = current->tAtMid(index, endIndex, mid);
58 double newMidT = current->tAtMid(index, endIndex, newMid);
66 endT, current->xAtT(endIndex), current->yAtT(endIndex));
95 double endT = current->t(endIndex);
113 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>& chase, int& tIndex, int& endIndex) {
    [all...]
SkOpSegment.h 78 bool isConnected(int startIndex, int endIndex) const {
79 return fTs[startIndex].fWindSum != SK_MinS32 || fTs[endIndex].fWindSum != SK_MinS32;
103 int oppSign(int startIndex, int endIndex) const {
104 int result = startIndex < endIndex ? -fTs[startIndex].fOppValue : fTs[endIndex].fOppValue;
152 void setUpWinding(int index, int endIndex, int* maxWinding, int* sumWinding) {
153 int deltaSum = spanSign(index, endIndex);
173 int spanSign(int startIndex, int endIndex) const {
174 int result = startIndex < endIndex ? -fTs[startIndex].fWindValue : fTs[endIndex].fWindValue
    [all...]
  /external/skia/src/pathops/
SkPathOpsSimplify.cpp 18 int index, endIndex;
20 SkOpSegment* current = FindSortableTop(contourList, &firstContour, &index, &endIndex,
33 if (current->activeWinding(index, endIndex)) {
46 int nextEnd = endIndex;
53 current->addCurveTo(index, endIndex, simple, true);
61 current->xyAtT(endIndex).fX, current->xyAtT(endIndex).fY);
63 current->addCurveTo(index, endIndex, simple, true);
66 endIndex = nextEnd;
68 || !current->done(SkMin32(index, endIndex))));
    [all...]
SkPathOpsCommon.h 18 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>& chase, int& tIndex, int& endIndex);
20 int* index, int* endIndex, SkPoint* topLeft, bool* unsortable,
SkPathOpsOp.cpp 136 int index, endIndex;
138 SkOpSegment* current = FindSortableTop(contourList, &firstContour, &index, &endIndex,
151 if (current->activeOp(index, endIndex, xorMask, xorOpMask, op)) {
164 int nextEnd = endIndex;
171 current->addCurveTo(index, endIndex, simple, true);
179 current->xyAtT(endIndex).fX, current->xyAtT(endIndex).fY);
181 current->addCurveTo(index, endIndex, simple, true);
184 endIndex = nextEnd;
186 || !current->done(SkMin32(index, endIndex))));
    [all...]
SkPathOpsCommon.cpp 16 const int endIndex = *endIndexPtr;
19 double tAtMid = current->tAtMid(index, endIndex, mid);
51 if (testSeg == current && current->betweenTs(index, testHit, endIndex)) {
53 double endT = current->t(endIndex);
56 double midT = current->tAtMid(index, endIndex, mid);
58 double newMidT = current->tAtMid(index, endIndex, newMid);
66 endT, current->xAtT(endIndex), current->yAtT(endIndex));
95 double endT = current->t(endIndex);
113 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>& chase, int& tIndex, int& endIndex) {
    [all...]
SkOpSegment.h 78 bool isConnected(int startIndex, int endIndex) const {
79 return fTs[startIndex].fWindSum != SK_MinS32 || fTs[endIndex].fWindSum != SK_MinS32;
103 int oppSign(int startIndex, int endIndex) const {
104 int result = startIndex < endIndex ? -fTs[startIndex].fOppValue : fTs[endIndex].fOppValue;
152 void setUpWinding(int index, int endIndex, int* maxWinding, int* sumWinding) {
153 int deltaSum = spanSign(index, endIndex);
173 int spanSign(int startIndex, int endIndex) const {
174 int result = startIndex < endIndex ? -fTs[startIndex].fWindValue : fTs[endIndex].fWindValue
    [all...]
  /external/chromium_org/third_party/isimpledom/
ISimpleDOMText.idl 59 cpp_quote("// /* [in] */ unsigned int endIndex,")
72 cpp_quote("// /* [in] */ unsigned int endIndex);")
95 [in] unsigned int endIndex,
102 [in] unsigned int endIndex,
109 [in] unsigned int endIndex);
  /external/chromium_org/third_party/WebKit/Source/core/fileapi/
BlobURL.cpp 60 unsigned endIndex = url.pathAfterLastSlash();
61 return url.string().substring(startIndex, endIndex - startIndex - 1);
  /external/proguard/src/proguard/
WordReader.java 177 int endIndex;
184 endIndex = ++currentIndex;
206 endIndex = currentIndex++;
225 endIndex = currentIndex;
229 currentWord = currentLine.substring(startIndex, endIndex);
  /external/chromium_org/third_party/WebKit/Tools/Scripts/
bisect-builds 136 my $endIndex = $revisions[1] ? findNearestNightlyIndex(@nightlies, $revisions[1], 'floor') : $#nightlies;
158 $nightlies[$endIndex]->{rev};
159 downloadNightly($nightlies[$endIndex]->{file}, $nightlyFilesURLBase, $nightlyDownloadDirectory);
160 mountAndRunNightly($nightlies[$endIndex]->{file}, $nightlyDownloadDirectory, $safariPath, $tempFile);
161 $didReproduceBug = promptForTest($nightlies[$endIndex]->{rev});
162 $endIndex++ if $didReproduceBug < 0;
170 printStatus($nightlies[$startIndex]->{rev}, $nightlies[$endIndex]->{rev}, $isProgression);
173 while (abs($endIndex - $startIndex) > 1) {
174 my $index = $startIndex + int(($endIndex - $startIndex) / 2);
179 my $buildsLeft = max(max(0, $endIndex - $index - 1), max(0, $index - $startIndex - 1))
    [all...]
  /frameworks/base/core/java/android/net/http/
CharArrayBuffers.java 67 int endIndex = buffer.length();
70 for (int i = beginIndex; i < endIndex; i++) {
  /external/chromium_org/third_party/protobuf/java/src/main/java/com/google/protobuf/
LiteralByteString.java 83 public ByteString substring(int beginIndex, int endIndex) {
88 if (endIndex > size()) {
89 throw new IndexOutOfBoundsException("End index: " + endIndex + " > " +
92 int substringLength = endIndex - beginIndex;
96 + endIndex);

Completed in 722 milliseconds

1 2 3 4 5 6 7 8 9