Lines Matching defs:marks
50 * maintain. The Position implementations (marks) store the array
53 * the marks between the old and new gap boundaries when the gap
54 * is moved, so generally updating the marks is pretty cheap.
55 * The marks are stored sorted so they can be located quickly
84 marks = new MarkVector();
233 if (unusedMarks > Math.max(5, (marks.size() / 10))) {
243 if (sortIndex < marks.size()
244 && (m = marks.elementAt(sortIndex)).index == index
251 marks.insertElementAt(m, sortIndex);
318 private transient MarkVector marks;
340 * the appropriate marks
347 // Adjust marks.
350 int n = marks.size();
352 MarkData mark = marks.elementAt(i);
373 * marks accordingly.
385 // update the marks
387 // Move gap up, move data and marks down.
389 int n = marks.size();
391 MarkData mark = marks.elementAt(i);
398 // Move gap down, move data and marks up.
400 int n = marks.size();
402 MarkData mark = marks.elementAt(i);
413 * Resets all the marks that have an offset of 0 to have an index of
417 if (marks != null && getGapStart() == 0) {
419 for (int counter = 0, maxCounter = marks.size();
421 MarkData mark = marks.elementAt(counter);
434 * any data, but it does update any marks affected
435 * by the boundary change. All marks from the old
441 // Push aside all marks from oldGapStart down to newGapStart.
443 int n = marks.size();
447 MarkData mark = marks.elementAt(i);
449 // no more marks to adjust
463 * any data, but it does update any marks affected
464 * by the boundary change. All marks from the old
471 int n = marks.size();
473 MarkData mark = marks.elementAt(i);
487 * Compares two marks.
514 MarkData d = marks.elementAt(i);
531 int upper = marks.size() - 1;
539 MarkData last = marks.elementAt(upper);
546 MarkData entry = marks.elementAt(mid);
564 * Remove all unused marks out of the sorted collection
565 * of marks.
568 int n = marks.size();
571 MarkData mark = marks.elementAt(i);
576 marks = cleaned;
603 MarkData[] marks = (MarkData[]) getArray();
604 return marks.length;
608 * Returns the number of marks currently held
653 protected void replaceRange(int start, int end, Object[] marks) {
668 array[index++] = marks[newIndex++];
675 array[index++] = marks[newIndex++];
679 array[index++] = marks[newIndex++];
692 marks = new MarkVector();
719 // Find the index of the marks.
744 placeIn.addElement(new UndoPosRef(marks.elementAt(counter)));
778 // We have to resort the marks in the range startIndex to endIndex.
791 MarkData mark = marks.elementAt(counter);
797 MarkData mark = marks.elementAt(counter);
805 MarkData mark = marks.elementAt(counter);
811 MarkData mark = marks.elementAt(counter);
818 marks.replaceRange(startIndex, endIndex, sorted);