HomeSort by relevance Sort by last modified time
    Searched full:endindex (Results 1 - 25 of 305) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
nav_braille.js 23 * endIndex: (undefined|number)}} kwargs The arguments for braille.
27 * endIndex The end of a selection within text.
48 this.endIndex = goog.isDef(kwargs.endIndex) ?
49 kwargs.endIndex : this.startIndex;
70 typeof json.endIndex !== 'number') {
76 endIndex: json.endIndex
95 ' endIndex="' + this.endIndex + '")'
    [all...]
braille_util_test.js 61 endIndex: actual.endIndex
79 endIndex: 1
88 endIndex: 1
97 endIndex: 9
106 endIndex: 17
125 endIndex: 1
135 endIndex: 1
141 endIndex: 8
162 endIndex:
    [all...]
editable_text_area_shadow.js 26 * @type {Object.<number, {startIndex: number, endIndex: number}>}
75 * @type {Object.<number, {startIndex: number, endIndex: number}>}
77 var lines = {0: {startIndex: 0, endIndex: 0}};
122 lines[lineIndex].endIndex = offset - 1;
124 lines[lineIndex] = {startIndex: offset, endIndex: offset};
137 lines[lineIndex].endIndex = lastGoodOffset;
139 lines[lineIndex] = {startIndex: lastGoodOffset, endIndex: lastGoodOffset};
149 lines[lineIndex].endIndex = text.length;
154 for (var j = lines[i].startIndex; j <= lines[i].endIndex; j++) {
189 return this.lines_[index].endIndex;
    [all...]
content_editable_extractor.js 43 * @type {Object.<number, {startIndex: number, endIndex: number}>}
64 * @type {Object.<number, {startIndex: number, endIndex: number}>}
66 var lines = {0: {startIndex: 0, endIndex: 0}};
149 lines[lineIndex].endIndex = textSize;
151 lines[lineIndex] = {startIndex: textSize, endIndex: textSize};
169 lines[lineIndex].endIndex = textSize;
174 for (var j = lines[i].startIndex; j <= lines[i].endIndex; j++) {
234 return this.lines_[index].endIndex;
  /external/chromium_org/third_party/skia/src/pathops/
SkPathOpsSimplify.cpp 20 int index, endIndex;
25 &index, &endIndex, &topLeft, &topUnsortable, &topDone, &onlyVertical, firstPass);
39 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...]
SkOpSegment.h 109 bool isConnected(int startIndex, int endIndex) const {
110 return fTs[startIndex].fWindSum != SK_MinS32 || fTs[endIndex].fWindSum != SK_MinS32;
134 int oppSign(int startIndex, int endIndex) const {
135 int result = startIndex < endIndex ? -fTs[startIndex].fOppValue : fTs[endIndex].fOppValue;
184 void setUpWinding(int index, int endIndex, int* maxWinding, int* sumWinding) {
185 int deltaSum = spanSign(index, endIndex);
211 int spanSign(int startIndex, int endIndex) const {
212 int result = startIndex < endIndex ? -fTs[startIndex].fWindValue : fTs[endIndex].fWindValue
    [all...]
SkPathOpsCommon.h 18 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>* chase, int* tIndex, int* endIndex);
20 bool* firstContour, int* index, int* endIndex, SkPoint* topLeft,
SkPathOpsOp.cpp 12 static SkOpSegment* findChaseOp(SkTDArray<SkOpSpan*>& chase, int* tIndex, int* endIndex) {
21 *endIndex = -1;
22 if (const SkOpAngle* last = segment->activeAngle(*tIndex, tIndex, endIndex, &done,
28 *endIndex = last->end();
43 const SkOpAngle* angle = segment->spanToAngle(*tIndex, *endIndex);
74 *endIndex = end;
130 int index, endIndex;
135 &index, &endIndex, &topLeft, &topUnsortable, &topDone, &onlyVertical, firstPass);
156 if (current->activeOp(index, endIndex, xorMask, xorOpMask, op)) {
163 int nextEnd = endIndex;
    [all...]
SkLineParameters.h 28 int endIndex = 1;
29 cubicEndPoints(pts, 0, endIndex);
34 cubicEndPoints(pts, 0, ++endIndex);
35 SkASSERT(endIndex == 2);
40 cubicEndPoints(pts, 0, ++endIndex); // line
41 SkASSERT(endIndex == 3);
51 if (NotAlmostEqualUlps(pts[0].fY, pts[++endIndex].fY)) {
52 if (pts[0].fY > pts[endIndex].fY) {
57 if (endIndex == 3) {
60 SkASSERT(endIndex == 2)
    [all...]
  /external/skia/src/pathops/
SkPathOpsSimplify.cpp 20 int index, endIndex;
25 &index, &endIndex, &topLeft, &topUnsortable, &topDone, &onlyVertical, firstPass);
39 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...]
SkOpSegment.h 109 bool isConnected(int startIndex, int endIndex) const {
110 return fTs[startIndex].fWindSum != SK_MinS32 || fTs[endIndex].fWindSum != SK_MinS32;
134 int oppSign(int startIndex, int endIndex) const {
135 int result = startIndex < endIndex ? -fTs[startIndex].fOppValue : fTs[endIndex].fOppValue;
184 void setUpWinding(int index, int endIndex, int* maxWinding, int* sumWinding) {
185 int deltaSum = spanSign(index, endIndex);
211 int spanSign(int startIndex, int endIndex) const {
212 int result = startIndex < endIndex ? -fTs[startIndex].fWindValue : fTs[endIndex].fWindValue
    [all...]
SkPathOpsCommon.h 18 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>* chase, int* tIndex, int* endIndex);
20 bool* firstContour, int* index, int* endIndex, SkPoint* topLeft,
SkPathOpsOp.cpp 12 static SkOpSegment* findChaseOp(SkTDArray<SkOpSpan*>& chase, int* tIndex, int* endIndex) {
21 *endIndex = -1;
22 if (const SkOpAngle* last = segment->activeAngle(*tIndex, tIndex, endIndex, &done,
28 *endIndex = last->end();
43 const SkOpAngle* angle = segment->spanToAngle(*tIndex, *endIndex);
74 *endIndex = end;
130 int index, endIndex;
135 &index, &endIndex, &topLeft, &topUnsortable, &topDone, &onlyVertical, firstPass);
156 if (current->activeOp(index, endIndex, xorMask, xorOpMask, op)) {
163 int nextEnd = endIndex;
    [all...]
SkLineParameters.h 32 int endIndex = 1;
33 cubicEndPoints(pts, 0, endIndex);
38 cubicEndPoints(pts, 0, ++endIndex);
39 SkASSERT(endIndex == 2);
44 cubicEndPoints(pts, 0, ++endIndex); // line
45 SkASSERT(endIndex == 3);
55 if (NotAlmostEqualUlps(pts[0].fY, pts[++endIndex].fY)) {
56 if (pts[0].fY > pts[endIndex].fY) {
61 if (endIndex == 3) {
64 SkASSERT(endIndex == 2)
    [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/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...]
  /libcore/luni/src/main/java/java/text/
FieldPosition.java 36 private int endIndex;
73 beginIndex == pos.beginIndex && endIndex == pos.endIndex;
87 return endIndex;
106 return attributeHash + field * 10 + beginIndex * 100 + endIndex;
120 endIndex = index;
131 ",endIndex=" + 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...]
  /external/chromium_org/third_party/skia/experimental/Intersection/
ShapeOps.cpp 139 int index, endIndex;
141 Segment* current = findSortableTop(contourList, firstContour, index, endIndex, topLeft,
154 if (current->activeOp(index, endIndex, xorMask, xorOpMask, op)) {
163 int nextEnd = endIndex;
170 current->addCurveTo(index, endIndex, simple, true);
178 current->xyAtT(endIndex).fX, current->xyAtT(endIndex).fY);
180 current->addCurveTo(index, endIndex, simple, true);
183 endIndex = nextEnd;
185 || !current->done(SkMin32(index, endIndex))));
    [all...]
  /external/skia/experimental/Intersection/
ShapeOps.cpp 139 int index, endIndex;
141 Segment* current = findSortableTop(contourList, firstContour, index, endIndex, topLeft,
154 if (current->activeOp(index, endIndex, xorMask, xorOpMask, op)) {
163 int nextEnd = endIndex;
170 current->addCurveTo(index, endIndex, simple, true);
178 current->xyAtT(endIndex).fX, current->xyAtT(endIndex).fY);
180 current->addCurveTo(index, endIndex, simple, true);
183 endIndex = nextEnd;
185 || !current->done(SkMin32(index, endIndex))));
    [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/WebKit/Source/core/rendering/
AbstractInlineTextBox.h 62 WordBoundaries(int startIndex, int endIndex) : startIndex(startIndex), endIndex(endIndex) { }
64 int endIndex;
  /frameworks/av/media/libeffects/loudness/dsp/core/
basic.h 33 // EndIndex: the maximum searched index
35 // StartIndex <= i <= (EndIndex-1)
  /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);

Completed in 734 milliseconds

1 2 3 4 5 6 7 8 91011>>