swing/text/GapContent.java

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
85         marks = new MarkVector();
234         if (unusedMarks > Math.max(5, (marks.size() / 10))) {
244         if (sortIndex < marks.size()
245             && (m = marks.elementAt(sortIndex)).index == index
252             marks.insertElementAt(m, sortIndex);
319     private transient MarkVector marks;
341      * the appropriate marks
348         // Adjust marks.
351         int n = marks.size();
353             MarkData mark = marks.elementAt(i);
374      * marks accordingly.
386         // update the marks
388             // Move gap up, move data and marks down.
390             int n = marks.size();
392                 MarkData mark = marks.elementAt(i);
399             // Move gap down, move data and marks up.
401             int n = marks.size();
403                 MarkData mark = marks.elementAt(i);
414      * Resets all the marks that have an offset of 0 to have an index of
418         if (marks != null && getGapStart() == 0) {
420             for (int counter = 0, maxCounter = marks.size();
422                 MarkData mark = marks.elementAt(counter);
435      * any data, but it does update any marks affected
436      * by the boundary change.  All marks from the old
442         // Push aside all marks from oldGapStart down to newGapStart.
444         int n = marks.size();
448             MarkData mark = marks.elementAt(i);
450                 // no more marks to adjust
464      * any data, but it does update any marks affected
465      * by the boundary change. All marks from the old
472         int n = marks.size();
474             MarkData mark = marks.elementAt(i);
488      * Compares two marks.
515             MarkData d = marks.elementAt(i);
532         int upper = marks.size() - 1;
540         MarkData last = marks.elementAt(upper);
547             MarkData entry = marks.elementAt(mid);
565      * Remove all unused marks out of the sorted collection
566      * of marks.
569         int n = marks.size();
572             MarkData mark = marks.elementAt(i);
577         marks = cleaned;
604             MarkData[] marks = (MarkData[]) getArray();
605             return marks.length;
609          * Returns the number of marks currently held
654         protected void replaceRange(int start, int end, Object[] marks) {
669                     array[index++] = marks[newIndex++];
676                     array[index++] = marks[newIndex++];
680                 array[index++] = marks[newIndex++];
693         marks = new MarkVector();
722         // Find the index of the marks.
748             placeIn.addElement(new UndoPosRef(marks.elementAt(counter)));
785         // We have to resort the marks in the range startIndex to endIndex.
798                     MarkData mark = marks.elementAt(counter);
804                     MarkData mark = marks.elementAt(counter);
812                     MarkData mark = marks.elementAt(counter);
818                     MarkData mark = marks.elementAt(counter);
825             marks.replaceRange(startIndex, endIndex, sorted);