boolean |
BlockKnuthSequence.appendSequence(KnuthSequence sequence) |
Append sequence to this sequence if it can be appended.
|
boolean |
BlockKnuthSequence.appendSequence(KnuthSequence sequence,
boolean keepTogether,
BreakElement breakElement) |
Append sequence to this sequence if it can be appended.
|
boolean |
InlineKnuthSequence.appendSequence(KnuthSequence sequence) |
Append sequence to this sequence if it can be appended.
|
boolean |
InlineKnuthSequence.appendSequence(KnuthSequence sequence,
boolean keepTogether,
BreakElement breakElement) |
Append sequence to this sequence if it can be appended.
|
abstract boolean |
KnuthSequence.appendSequence(KnuthSequence sequence) |
Append sequence to this sequence if it can be appended.
|
abstract boolean |
KnuthSequence.appendSequence(KnuthSequence sequence,
boolean keepTogether,
BreakElement breakElement) |
Append sequence to this sequence if it can be appended.
|
boolean |
KnuthSequence.appendSequenceOrClose(KnuthSequence sequence) |
Append sequence to this sequence if it can be appended.
|
boolean |
KnuthSequence.appendSequenceOrClose(KnuthSequence sequence,
boolean keepTogether,
BreakElement breakElement) |
Append sequence to this sequence if it can be appended.
|
protected void |
BreakingAlgorithm.calculateBreakPoints(BreakingAlgorithm.KnuthNode node,
KnuthSequence par,
int total) |
Determines the set of optimal breakpoints corresponding to the given active node.
|
boolean |
BlockKnuthSequence.canAppendSequence(KnuthSequence sequence) |
Can sequence be appended to this sequence?
|
boolean |
InlineKnuthSequence.canAppendSequence(KnuthSequence sequence) |
Can sequence be appended to this sequence?
|
abstract boolean |
KnuthSequence.canAppendSequence(KnuthSequence sequence) |
Can sequence be appended to this sequence?
|
int |
BreakingAlgorithm.findBreakingPoints(KnuthSequence par,
double threshold,
boolean force,
int allowedBreaks) |
|
int |
BreakingAlgorithm.findBreakingPoints(KnuthSequence par,
int startIndex,
double threshold,
boolean force,
int allowedBreaks) |
Finds an optimal set of breakpoints for the given paragraph.
|
abstract void |
BreakingAlgorithm.updateData2(BreakingAlgorithm.KnuthNode bestActiveNode,
KnuthSequence sequence,
int total) |
Empty method, hook for subclasses.
|