|
fop 0.90alpha1 | ||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use BreakingAlgorithm.KnuthNode | |
org.apache.fop.layoutmgr | FOP's layout engine. |
Uses of BreakingAlgorithm.KnuthNode in org.apache.fop.layoutmgr |
Fields in org.apache.fop.layoutmgr declared as BreakingAlgorithm.KnuthNode | |
protected BreakingAlgorithm.KnuthNode |
BreakingAlgorithm.lastDeactivatedNode
|
protected BreakingAlgorithm.KnuthNode[] |
BreakingAlgorithm.activeLines
The set of active nodes. |
BreakingAlgorithm.KnuthNode |
BreakingAlgorithm.KnuthNode.previous
best node for the preceding breakpoint |
BreakingAlgorithm.KnuthNode |
BreakingAlgorithm.KnuthNode.next
next possible node in the same line |
Methods in org.apache.fop.layoutmgr that return BreakingAlgorithm.KnuthNode | |
protected 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)
|
protected BreakingAlgorithm.KnuthNode |
BreakingAlgorithm.createNode(int position,
int line,
int fitness,
int totalWidth,
int totalStretch,
int totalShrink)
|
protected BreakingAlgorithm.KnuthNode |
BreakingAlgorithm.compareNodes(BreakingAlgorithm.KnuthNode node1,
BreakingAlgorithm.KnuthNode node2)
Compare two KnuthNodes and return the node with the least demerit. |
protected BreakingAlgorithm.KnuthNode |
BreakingAlgorithm.getNode(int line)
|
BreakingAlgorithm.KnuthNode |
BreakingAlgorithm.BestRecords.getNode(int fitness)
|
Methods in org.apache.fop.layoutmgr with parameters of type BreakingAlgorithm.KnuthNode | |
abstract void |
BreakingAlgorithm.updateData2(BreakingAlgorithm.KnuthNode bestActiveNode,
KnuthSequence sequence,
int total)
|
protected 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)
|
protected int |
BreakingAlgorithm.restartFrom(BreakingAlgorithm.KnuthNode restartingNode,
int currentIndex)
|
protected int |
BreakingAlgorithm.computeDifference(BreakingAlgorithm.KnuthNode activeNode,
KnuthElement element,
int elementIndex)
Return the difference between the line width and the width of the break that ends in 'element'. |
protected double |
BreakingAlgorithm.computeAdjustmentRatio(BreakingAlgorithm.KnuthNode activeNode,
int difference)
Return the adjust ration needed to make up for the difference. |
protected double |
BreakingAlgorithm.computeDemerits(BreakingAlgorithm.KnuthNode activeNode,
KnuthElement element,
int fitnessClass,
double r)
|
protected BreakingAlgorithm.KnuthNode |
BreakingAlgorithm.compareNodes(BreakingAlgorithm.KnuthNode node1,
BreakingAlgorithm.KnuthNode node2)
Compare two KnuthNodes and return the node with the least demerit. |
protected void |
BreakingAlgorithm.addNode(int line,
BreakingAlgorithm.KnuthNode node)
Add a KnuthNode at the end of line 'line'. |
protected void |
BreakingAlgorithm.removeNode(int line,
BreakingAlgorithm.KnuthNode node)
Remove the first node in line 'line'. |
void |
BreakingAlgorithm.BestRecords.addRecord(double demerits,
BreakingAlgorithm.KnuthNode node,
double adjust,
int availableShrink,
int availableStretch,
int difference,
int fitness)
|
protected double |
BalancingColumnBreakingAlgorithm.computeDemerits(BreakingAlgorithm.KnuthNode activeNode,
KnuthElement element,
int fitnessClass,
double r)
|
Constructors in org.apache.fop.layoutmgr with parameters of type BreakingAlgorithm.KnuthNode | |
BreakingAlgorithm.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)
|
|
fop 0.90alpha1 | ||||||||||
PREV NEXT | FRAMES NO FRAMES |