fop 0.94 | |
Frames | No Frames |
Classes derived from org.apache.fop.layoutmgr.BreakingAlgorithm.KnuthNode | |
class | This class represents a feasible breaking point
with extra information about footnotes. |
Constructors with parameter type org.apache.fop.layoutmgr.BreakingAlgorithm.KnuthNode | |
BreakingAlgorithm.KnuthNode.KnuthNode(int position, int line, int fitness, int totalWidth, int totalStretch, int totalShrink, double adjustRatio, int availableShrink, int availableStretch, int difference, double totalDemerits, BreakingAlgorithm.KnuthNode previous) | |
PageBreakingAlgorithm.KnuthPageNode.KnuthPageNode(int position, int line, int fitness, int totalWidth, int totalStretch, int totalShrink, int totalFootnotes, int footnoteListIndex, int footnoteElementIndex, double adjustRatio, int availableShrink, int availableStretch, int difference, double totalDemerits, BreakingAlgorithm.KnuthNode previous) |
Fields of type org.apache.fop.layoutmgr.BreakingAlgorithm.KnuthNode | |
BreakingAlgorithm.KnuthNode[] | The set of active nodes in ascending line order. |
BreakingAlgorithm.KnuthNode | next possible node in the same line |
BreakingAlgorithm.KnuthNode | best node for the preceding breakpoint |
Methods with parameter type org.apache.fop.layoutmgr.BreakingAlgorithm.KnuthNode | |
void | Add a node at the end of the given line's existing active nodes. |
void | BreakingAlgorithm.BestRecords.addRecord(double demerits, BreakingAlgorithm.KnuthNode node, double adjust, int availableShrink, int availableStretch, int difference, int fitness) Registers the new best active node for the given fitness class. |
void | PageBreakingAlgorithm.BestPageRecords.addRecord(double demerits, BreakingAlgorithm.KnuthNode node, double adjust, int availableShrink, int availableStretch, int difference, int fitness) |
BreakingAlgorithm.KnuthNode | BreakingAlgorithm.compareNodes(BreakingAlgorithm.KnuthNode node1, BreakingAlgorithm.KnuthNode node2) Compare two KnuthNodes and return the node with the least demerit. |
double | Return the adjust ration needed to make up for the difference. |
double | BalancingColumnBreakingAlgorithm.computeDemerits(BreakingAlgorithm.KnuthNode activeNode, KnuthElement element, int fitnessClass, double r) |
double | BreakingAlgorithm.computeDemerits(BreakingAlgorithm.KnuthNode activeNode, KnuthElement element, int fitnessClass, double r) Computes the demerits of the current breaking (that is, up to the given element),
if the next-to-last chosen breakpoint is the given active node. |
int | BreakingAlgorithm.computeDifference(BreakingAlgorithm.KnuthNode activeNode, KnuthElement element, int elementIndex) Return the difference between the natural width of a line that would be made
between the given active node and the given element, and the available width of the
real line. |
BreakingAlgorithm.KnuthNode | BreakingAlgorithm.createNode(int position, int line, int fitness, int totalWidth, int totalStretch, int totalShrink, double adjustRatio, int availableShrink, int availableStretch, int difference, double totalDemerits, BreakingAlgorithm.KnuthNode previous) Creates a new active node for a feasible breakpoint at the given position. |
void | Remove the given active node registered for the given line. |
int | |
void | BreakingAlgorithm.updateData2(BreakingAlgorithm.KnuthNode bestActiveNode, KnuthSequence sequence, int total) Empty method, hook for subclasses. |
Methods with return type org.apache.fop.layoutmgr.BreakingAlgorithm.KnuthNode | |
BreakingAlgorithm.KnuthNode | BreakingAlgorithm.compareNodes(BreakingAlgorithm.KnuthNode node1, BreakingAlgorithm.KnuthNode node2) Compare two KnuthNodes and return the node with the least demerit. |
BreakingAlgorithm.KnuthNode | BreakingAlgorithm.createNode(int position, int line, int fitness, int totalWidth, int totalStretch, int totalShrink) Creates a new active node for a break from the best active node of the given
fitness class to the element at the given position. |
BreakingAlgorithm.KnuthNode | BreakingAlgorithm.createNode(int position, int line, int fitness, int totalWidth, int totalStretch, int totalShrink, double adjustRatio, int availableShrink, int availableStretch, int difference, double totalDemerits, BreakingAlgorithm.KnuthNode previous) Creates a new active node for a feasible breakpoint at the given position. |
BreakingAlgorithm.KnuthNode | BreakingAlgorithm.getNode(int line) Returns the first active node for the given line. |
BreakingAlgorithm.KnuthNode | BreakingAlgorithm.BestRecords.getNode(int fitness) |
fop 0.94 |