Package com.vladsch.flexmark.util.sequence
package com.vladsch.flexmark.util.sequence
-
ClassDescriptionImplemented by BasedOptionsSequence, use instance of it to pass to
BasedSequence.of(CharSequence)
and options enabled in it will be accessible to all based sequences or uses of these for testing for options or getting options.A BasedSequence with offset tracking that follows editing operations and subSequence() chopping as best as it canA CharSequence that references original char sequence with offsets into original preserved.Implementation of BaseSequenceA CharSequence that references original char[] a subSequence() returns a sub-sequence from the original base sequenceIRichSequence<T extends IRichSequence<T>>A CharSequence that provides a rich set of manipulation methods.IRichSequenceBase<T extends IRichSequence<T>>An abstract base for RichSequence which implements most of the methods allowing subclasses to implement RichSequence with minimal support methodsUsed to collect line text for further processingLine information in LineAppendableA BasedSequence which maps characters according to CharMapperA CharSequence that maps characters according to CharMapperMappedSequence<T extends CharSequence>A CharSequence that maps characters according to CharMapperUsed to replace placeholder text in the form of open/close char such as <text> in a markdown document.A BasedSequence with an out of scope of original char sequence prefixCharSequence that repeats in a wraparound the given sequence.Interface implemented by sequences which do not contain contiguous base characters from startOffset to endOffsetClass which tracks text replacements to provide original offset from modified offset.A RichSequence implementationA BasedSequence which consists of segments of other BasedSequencesA 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.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.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.