public class GapContent extends Object implements AbstractDocument.Content, Serializable
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.
Constructor and Description |
---|
GapContent()
Creates a new GapContent object.
|
GapContent(int initialLength)
Creates a new GapContent object, with the initial
size specified.
|
Modifier and Type | Method and Description |
---|---|
protected Object |
allocateArray(int len)
Allocate an array to store items of the type
appropriate (which is determined by the subclass).
|
Position |
createPosition(int offset)
Creates a position within the content that will
track change as the content is mutated.
|
protected Object |
getArray()
Access to the array.
|
protected int |
getArrayLength()
Get the length of the allocated array.
|
void |
getChars(int where,
int len,
Segment chars)
Retrieves a portion of the content.
|
protected int |
getGapEnd()
Access to the end of the gap.
|
protected int |
getGapStart()
Access to the start of the gap.
|
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 . |
String |
getString(int where,
int len)
Retrieves a portion of the content.
|
UndoableEdit |
insertString(int where,
String str)
Inserts a string into the content.
|
int |
length()
Returns the length of the content.
|
UndoableEdit |
remove(int where,
int nitems)
Removes part of the content.
|
protected void |
replace(int position,
int rmSize,
Object addItems,
int addSize)
Replace the given logical position in the storage with
the given new items.
|
protected void |
resetMarksAtZero()
Resets all the marks that have an offset of 0 to have an index of
zero as well.
|
protected 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.
|
protected void |
shiftGapEndUp(int newGapEnd)
Adjust the gap end upward.
|
protected void |
shiftGapStartDown(int newGapStart)
Adjust the gap end downward.
|
protected void |
updateUndoPositions(Vector positions,
int offset,
int length)
Resets the location for all the UndoPosRef instances
in
positions . |
public GapContent()
public GapContent(int initialLength)
initialLength
- the initial sizeprotected Object allocateArray(int len)
protected int getArrayLength()
public int length()
length
in interface AbstractDocument.Content
AbstractDocument.Content.length()
public UndoableEdit insertString(int where, String str) throws BadLocationException
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
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
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
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
createPosition
in interface AbstractDocument.Content
offset
- the offset to track >= 0BadLocationException
- if the specified position is invalidprotected void shiftEnd(int newSize)
protected void shiftGap(int newGapStart)
protected void resetMarksAtZero()
protected void shiftGapStartDown(int newGapStart)
protected void shiftGapEndUp(int newGapEnd)
protected Vector getPositionsInRange(Vector v, int offset, int length)
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)
positions
.
This is meant for internal usage, and is generally not of interest to subclasses.
positions
- the UndoPosRef instances to resetprotected final Object getArray()
protected final int getGapStart()
protected final int getGapEnd()
protected void replace(int position, int rmSize, Object addItems, int addSize)
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. Submit a bug or feature
For further API reference and developer documentation, see Java SE Documentation. That documentation contains more detailed, developer-targeted descriptions, with conceptual overviews, definitions of terms, workarounds, and working code examples.
Copyright © 1993, 2018, Oracle and/or its affiliates. All rights reserved. Use is subject to license terms. Also see the documentation redistribution policy.