public class GapContent extends Object implements AbstractDocument.Content, Serializable
An implementation of the AbstractDocument.Content interface implemented using a gapped buffer similar to that used by emacs. The underlying storage is a array of unicode characters with a gap somewhere. The gap is moved to the location of changes to take advantage of common behavior where most changes are in the same location. Changes that occur at a gap boundary are generally cheap and moving the gap is generally cheaper than moving the array contents directly to accommodate the change.
The positions tracking change are also generally cheap to maintain. The Position implementations (marks) store the array index and can easily calculate the sequential position from the current gap location. Changes only require update to the the marks between the old and new gap boundaries when the gap is moved, so generally updating the marks is pretty cheap. The marks are stored sorted so they can be located quickly with a binary search. This increases the cost of adding a mark, and decreases the cost of keeping the mark updated.
public GapContent()
Creates a new GapContent object. Initial size defaults to 10.
public GapContent(int initialLength)
Creates a new GapContent object, with the initial size specified. The initial size will not be allowed to go below 2, to give room for the implied break and the gap.
initialLength
- the initial sizeprotected Object allocateArray(int len)
Allocate an array to store items of the type appropriate (which is determined by the subclass).
protected int getArrayLength()
Get the length of the allocated array.
public int length()
Returns the length of the content.
length
in interface AbstractDocument.Content
AbstractDocument.Content.length()
public UndoableEdit insertString(int where, String str) throws BadLocationException
Inserts a string into the content.
insertString
in interface AbstractDocument.Content
where
- the starting position >= 0, < length()str
- the non-null string to insertBadLocationException
- if the specified position is invalidAbstractDocument.Content.insertString(int, java.lang.String)
public UndoableEdit remove(int where, int nitems) throws BadLocationException
Removes part of the content.
remove
in interface AbstractDocument.Content
where
- the starting position >= 0, where + nitems < length()nitems
- the number of characters to remove >= 0BadLocationException
- if the specified position is invalidAbstractDocument.Content.remove(int, int)
public String getString(int where, int len) throws BadLocationException
Retrieves a portion of the content.
getString
in interface AbstractDocument.Content
where
- the starting position >= 0len
- the length to retrieve >= 0BadLocationException
- if the specified position is invalidAbstractDocument.Content.getString(int, int)
public void getChars(int where, int len, Segment chars) throws BadLocationException
Retrieves a portion of the content. If the desired content spans the gap, we copy the content. If the desired content does not span the gap, the actual store is returned to avoid the copy since it is contiguous.
getChars
in interface AbstractDocument.Content
where
- the starting position >= 0, where + len <= length()len
- the number of characters to retrieve >= 0chars
- the Segment object to return the characters inBadLocationException
- if the specified position is invalidAbstractDocument.Content.getChars(int, int, javax.swing.text.Segment)
public Position createPosition(int offset) throws BadLocationException
Creates a position within the content that will track change as the content is mutated.
createPosition
in interface AbstractDocument.Content
offset
- the offset to track >= 0BadLocationException
- if the specified position is invalidprotected void shiftEnd(int newSize)
Make the gap bigger, moving any necessary data and updating the appropriate marks
protected void shiftGap(int newGapStart)
Move the start of the gap to a new location, without changing the size of the gap. This moves the data in the array and updates the marks accordingly.
protected void resetMarksAtZero()
Resets all the marks that have an offset of 0 to have an index of zero as well.
protected void shiftGapStartDown(int newGapStart)
Adjust the gap end downward. This doesn't move any data, but it does update any marks affected by the boundary change. All marks from the old gap start down to the new gap start are squeezed to the end of the gap (their location has been removed).
protected void shiftGapEndUp(int newGapEnd)
Adjust the gap end upward. This doesn't move any data, but it does update any marks affected by the boundary change. All marks from the old gap end up to the new gap end are squeezed to the end of the gap (their location has been removed).
protected Vector getPositionsInRange(Vector v, int offset, int length)
Returns a Vector containing instances of UndoPosRef for the Positions in the range offset
to offset
+ length
. If v
is not null the matching Positions are placed in there. The vector with the resulting Positions are returned.
v
- the Vector to use, with a new one created on nulloffset
- the starting offset >= 0length
- the length >= 0protected void updateUndoPositions(Vector positions, int offset, int length)
Resets the location for all the UndoPosRef instances in positions
.
This is meant for internal usage, and is generally not of interest to subclasses.
positions
- the UndoPosRef instances to resetprotected final Object getArray()
Access to the array. The actual type of the array is known only by the subclass.
protected final int getGapStart()
Access to the start of the gap.
protected final int getGapEnd()
Access to the end of the gap.
protected void replace(int position, int rmSize, Object addItems, int addSize)
Replace the given logical position in the storage with the given new items. This will move the gap to the area being changed if the gap is not currently located at the change location.
position
- the location to make the replacement. This is not the location in the underlying storage array, but the location in the contiguous space being modeled.rmSize
- the number of items to removeaddItems
- the new items to place in storage.
© 1993–2017, Oracle and/or its affiliates. All rights reserved.
Documentation extracted from Debian's OpenJDK Development Kit package.
Licensed under the GNU General Public License, version 2, with the Classpath Exception.
Various third party code in OpenJDK is licensed under different licenses (see Debian package).
Java and OpenJDK are trademarks or registered trademarks of Oracle and/or its affiliates.