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

Packages that use SequenceUtils

Package	Description
com.vladsch.flexmark.util.sequence

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

Subinterfaces of SequenceUtils 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	IRichSequence<T extends IRichSequence<T>>	A CharSequence that provides a rich set of manipulation methods.
interface	ReplacedBasedSequence	Interface implemented by sequences which do not contain contiguous base characters from startOffset to endOffset
interface	RichSequence

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

Modifier and Type	Class	Description
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
class	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
final class	MappedBasedSequence	A BasedSequence which maps characters according to CharMapper
class	MappedRichSequence	A CharSequence that maps characters according to CharMapper
final class	PrefixedSubSequence	A BasedSequence with an out of scope of original char sequence prefix
class	RichSequenceImpl	A RichSequence implementation
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.