equal
deleted
inserted
replaced
42 * The underlying storage is a array of unicode characters with |
42 * The underlying storage is a array of unicode characters with |
43 * a gap somewhere. The gap is moved to the location of changes |
43 * a gap somewhere. The gap is moved to the location of changes |
44 * to take advantage of common behavior where most changes are |
44 * to take advantage of common behavior where most changes are |
45 * in the same location. Changes that occur at a gap boundary are |
45 * in the same location. Changes that occur at a gap boundary are |
46 * generally cheap and moving the gap is generally cheaper than |
46 * generally cheap and moving the gap is generally cheaper than |
47 * moving the array contents directly to accomodate the change. |
47 * moving the array contents directly to accommodate the change. |
48 * <p> |
48 * <p> |
49 * The positions tracking change are also generally cheap to |
49 * The positions tracking change are also generally cheap to |
50 * maintain. The Position implementations (marks) store the array |
50 * maintain. The Position implementations (marks) store the array |
51 * index and can easily calculate the sequential position from |
51 * index and can easily calculate the sequential position from |
52 * the current gap location. Changes only require update to the |
52 * the current gap location. Changes only require update to the |