Uses of Interface
com.vladsch.flexmark.util.sequence.BasedOptionsHolder

Packages that use BasedOptionsHolder

Package	Description
com.vladsch.flexmark.util.sequence

Uses of BasedOptionsHolder in com.vladsch.flexmark.util.sequence

Subinterfaces of BasedOptionsHolder in com.vladsch.flexmark.util.sequence

Modifier and Type	Interface	Description
interface	BasedSequence	A CharSequence that references original char sequence with offsets into original preserved.
interface	ReplacedBasedSequence	Interface implemented by sequences which do not contain contiguous base characters from startOffset to endOffset

Classes in com.vladsch.flexmark.util.sequence that implement BasedOptionsHolder

Modifier and Type	Class	Description
final class	BasedOptionsSequence	A BasedSequence with offset tracking that follows editing operations and subSequence() chopping as best as it can
static class	BasedSequence.EmptyBasedSequence
class	BasedSequenceImpl	Implementation of BaseSequence
final class	CharSubSequence	A CharSequence that references original char[] a subSequence() returns a sub-sequence from the original base sequence
final class	MappedBasedSequence	A BasedSequence which maps characters according to CharMapper
final class	PrefixedSubSequence	A BasedSequence with an out of scope of original char sequence prefix
class	SegmentedSequence	A BasedSequence which consists of segments of other BasedSequences
final class	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.
final class	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.
final class	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.