Uses of Interface
com.vladsch.flexmark.util.sequence.SequenceUtils
Packages that use SequenceUtils
-
Uses of SequenceUtils in com.vladsch.flexmark.util.sequence
Subinterfaces of SequenceUtils in com.vladsch.flexmark.util.sequenceModifier and TypeInterfaceDescriptioninterface
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
Interface implemented by sequences which do not contain contiguous base characters from startOffset to endOffsetinterface
Classes in com.vladsch.flexmark.util.sequence that implement SequenceUtilsModifier and TypeClassDescriptionstatic class
class
Implementation of BaseSequencefinal class
A CharSequence that references original char[] a subSequence() returns a sub-sequence from the original base sequenceclass
IRichSequenceBase<T extends IRichSequence<T>>
An abstract base for RichSequence which implements most of the methods allowing subclasses to implement RichSequence with minimal support methodsfinal class
A BasedSequence which maps characters according to CharMapperclass
A CharSequence that maps characters according to CharMapperfinal class
A BasedSequence with an out of scope of original char sequence prefixclass
A RichSequence implementationclass
A BasedSequence which consists of segments of other BasedSequencesfinal class
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
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
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.