BasedOptionsSequence |
A BasedSequence with offset tracking that follows editing operations and subSequence() chopping as best as it can
|
BasedSequence.EmptyBasedSequence |
|
BasedSequenceImpl |
Implementation of BaseSequence
|
CharSubSequence |
A CharSequence that references original char[]
a subSequence() returns a sub-sequence from the original base sequence
|
Escaping |
|
Html5Entities |
|
IRichSequenceBase<T extends IRichSequence<T>> |
An abstract base for RichSequence which implements most of the methods allowing subclasses to
implement RichSequence with minimal support methods
|
LineAppendableImpl |
|
LineInfo |
Line information in LineAppendable
|
MappedBasedSequence |
A BasedSequence which maps characters according to CharMapper
|
MappedRichSequence |
A CharSequence that maps characters according to CharMapper
|
PlaceholderReplacer |
Used to replace placeholder text in the form of open/close char such as <text> in a markdown document.
|
PrefixedSubSequence |
A BasedSequence with an out of scope of original char sequence prefix
|
Range |
|
RepeatedSequence |
CharSequence that repeats in a wraparound the given sequence.
|
ReplacedTextMapper |
Class which tracks text replacements to provide original offset from modified offset.
|
ReplacedTextRegion |
|
RichSequenceImpl |
A RichSequence implementation
|
SegmentedSequence |
A BasedSequence which consists of segments of other BasedSequences
|
SegmentedSequenceFull |
A BasedSequence which consists of segments of other BasedSequences
NOTE: very efficient for random access but extremely wasteful with space by allocating 4 bytes per character in the sequence with corresponding construction penalty
use SegmentedSequenceTree which is binary tree based segmented sequence with minimal overhead and optimized to give penalty free random access for most applications.
|
SegmentedSequenceTree |
A BasedSequence which consists of segments of other BasedSequences
NOTE: very efficient for random access but extremely wasteful with space by allocating 4 bytes per character in the sequence with corresponding construction penalty
use SegmentedSequenceTree which is binary tree based segmented sequence with minimal overhead and optimized to give penalty free random access for most applications.
|
SubSequence |
A BasedSequence implementation which wraps original CharSequence to provide a BasedSequence for
all its subsequences, a subSequence() returns a SubSequence from the original base sequence.
|
TagRange |
|