Uses of Class
org.apache.fop.layoutmgr.BreakingAlgorithm.KnuthNode
-
Packages that use BreakingAlgorithm.KnuthNode Package Description org.apache.fop.layoutmgr FOP's layout engine.org.apache.fop.layoutmgr.inline Layout managers for inline formatting objects and line building. -
-
Uses of BreakingAlgorithm.KnuthNode in org.apache.fop.layoutmgr
Subclasses of BreakingAlgorithm.KnuthNode in org.apache.fop.layoutmgr Modifier and Type Class Description protected class
PageBreakingAlgorithm.KnuthPageNode
This class represents a feasible breaking point with extra information about footnotes.Fields in org.apache.fop.layoutmgr declared as BreakingAlgorithm.KnuthNode Modifier and Type Field Description protected BreakingAlgorithm.KnuthNode[]
BreakingAlgorithm. activeLines
The set of active nodes in ascending line order.private BreakingAlgorithm.KnuthNode
PageBreakingAlgorithm. bestFloatEdgeNode
private BreakingAlgorithm.KnuthNode[]
BreakingAlgorithm.BestRecords. bestNode
private BreakingAlgorithm.KnuthNode
PageBreakingAlgorithm. bestNodeForIPDChange
BreakingAlgorithm.KnuthNode
PageBreakingAlgorithm. bestNodeForLastPage
private BreakingAlgorithm.KnuthNode
PageBreakingAlgorithm. lastBeforeKeepContextSwitch
private BreakingAlgorithm.KnuthNode
BreakingAlgorithm. lastDeactivated
The node to be reactivated if no set of feasible breakpoints can be found for this paragraph.private BreakingAlgorithm.KnuthNode
BreakingAlgorithm. lastRecovered
private BreakingAlgorithm.KnuthNode
BreakingAlgorithm. lastTooLong
When in forced mode, the best node leading to a too long line.private BreakingAlgorithm.KnuthNode
BreakingAlgorithm. lastTooShort
When in forced mode, the best node leading to a too short line.BreakingAlgorithm.KnuthNode
BreakingAlgorithm.KnuthNode. next
next possible node in the same lineBreakingAlgorithm.KnuthNode
BreakingAlgorithm.KnuthNode. previous
best node for the preceding breakpointMethods in org.apache.fop.layoutmgr that return BreakingAlgorithm.KnuthNode Modifier and Type Method Description 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
PageBreakingAlgorithm. compareNodes(BreakingAlgorithm.KnuthNode node1, BreakingAlgorithm.KnuthNode node2)
Compare two KnuthNodes and return the node with the least demerit.protected 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.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)
Creates a new active node for a feasible breakpoint at the given position.protected BreakingAlgorithm.KnuthNode
PageBreakingAlgorithm. 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.protected BreakingAlgorithm.KnuthNode
PageBreakingAlgorithm. 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.protected BreakingAlgorithm.KnuthNode
PageBreakingAlgorithm. getBestFloatEdgeNode()
(package private) BreakingAlgorithm.KnuthNode
PageBreakingAlgorithm. getBestNodeBeforeIPDChange()
(package private) BreakingAlgorithm.KnuthNode
PageBreakingAlgorithm. getBestNodeForLastPage()
protected BreakingAlgorithm.KnuthNode
BreakingAlgorithm. getLastTooLong()
protected BreakingAlgorithm.KnuthNode
BreakingAlgorithm. getLastTooShort()
Return the last node that yielded a too short line.BreakingAlgorithm.KnuthNode
BreakingAlgorithm.BestRecords. getNode(int fitness)
protected BreakingAlgorithm.KnuthNode
BreakingAlgorithm. getNode(int line)
Returns the first active node for the given line.protected BreakingAlgorithm.KnuthNode
BreakingAlgorithm. recoverFromOverflow()
Recover from an overflow condition.protected BreakingAlgorithm.KnuthNode
PageBreakingAlgorithm. recoverFromOverflow()
protected BreakingAlgorithm.KnuthNode
BreakingAlgorithm. recoverFromTooLong(BreakingAlgorithm.KnuthNode lastTooLong)
Recover from aBreakingAlgorithm.KnuthNode
leading to a line that is too long.protected BreakingAlgorithm.KnuthNode
PageBreakingAlgorithm. recoverFromTooLong(BreakingAlgorithm.KnuthNode lastTooLong)
Overridden to defer a part to the next page, if it must be kept within one page, but is too large to fit in the last column.Methods in org.apache.fop.layoutmgr with parameters of type BreakingAlgorithm.KnuthNode Modifier and Type Method Description protected void
BreakingAlgorithm. activateNode(BreakingAlgorithm.KnuthNode node, int difference, double r, double demerits, int fitnessClass, int availableShrink, int availableStretch)
Activate the given node.protected void
BreakingAlgorithm. addNode(int line, BreakingAlgorithm.KnuthNode node)
Add a node at the end of the given line's existing active nodes.protected void
PageBreakingAlgorithm. addNode(int line, BreakingAlgorithm.KnuthNode node)
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)
protected void
BreakingAlgorithm. calculateBreakPoints(BreakingAlgorithm.KnuthNode node, KnuthSequence par, int total)
Determines the set of optimal breakpoints corresponding to the given active node.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
PageBreakingAlgorithm. compareNodes(BreakingAlgorithm.KnuthNode node1, BreakingAlgorithm.KnuthNode node2)
Compare two KnuthNodes and return the node with the least demerit.protected double
BreakingAlgorithm. computeAdjustmentRatio(BreakingAlgorithm.KnuthNode activeNode, int difference)
Return the adjustment ratio needed to make up for the difference.protected double
PageBreakingAlgorithm. computeAdjustmentRatio(BreakingAlgorithm.KnuthNode activeNode, int difference)
Return the adjustment ratio needed to make up for the difference.protected double
BalancingColumnBreakingAlgorithm. 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.protected 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.protected double
PageBreakingAlgorithm. 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.protected 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.protected int
PageBreakingAlgorithm. 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.protected void
BreakingAlgorithm. createForcedNodes(BreakingAlgorithm.KnuthNode node, int line, int elementIdx, int difference, double r, double demerits, int fitnessClass, int availableShrink, int availableStretch, int newWidth, int newStretch, int newShrink)
protected void
PageBreakingAlgorithm. createForcedNodes(BreakingAlgorithm.KnuthNode node, int line, int elementIdx, int difference, double r, double demerits, int fitnessClass, int availableShrink, int availableStretch, int newWidth, int newStretch, int newShrink)
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)
Creates a new active node for a feasible breakpoint at the given position.protected BreakingAlgorithm.KnuthNode
PageBreakingAlgorithm. 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.protected void
BreakingAlgorithm. deactivateNode(BreakingAlgorithm.KnuthNode node, int line)
Deactivate the given nodeprotected void
PageBreakingAlgorithm. deactivateNode(BreakingAlgorithm.KnuthNode node, int line)
Deactivate the given nodeprivate int
RestartAtLM. findPositionIndex(AbstractBreaker breaker, BreakingAlgorithm.KnuthNode optimalBreak, PageBreakingAlgorithm alg, int start)
protected void
BreakingAlgorithm. forceNode(BreakingAlgorithm.KnuthNode node, int line, int elementIdx, int difference, double r, double demerits, int fitnessClass, int availableShrink, int availableStretch)
Force the givenBreakingAlgorithm.KnuthNode
, and register it.private java.util.LinkedList<java.lang.Integer>
BalancingColumnBreakingAlgorithm. getPossibilityTrail(BreakingAlgorithm.KnuthNode activeNode)
protected BreakingAlgorithm.KnuthNode
BreakingAlgorithm. recoverFromTooLong(BreakingAlgorithm.KnuthNode lastTooLong)
Recover from aBreakingAlgorithm.KnuthNode
leading to a line that is too long.protected BreakingAlgorithm.KnuthNode
PageBreakingAlgorithm. recoverFromTooLong(BreakingAlgorithm.KnuthNode lastTooLong)
Overridden to defer a part to the next page, if it must be kept within one page, but is too large to fit in the last column.protected void
BreakingAlgorithm. removeNode(int line, BreakingAlgorithm.KnuthNode node)
Remove the given active node registered for the given line.protected int
BreakingAlgorithm. restartFrom(BreakingAlgorithm.KnuthNode restartingNode, int currentIndex)
Restart from the given node at the given index.protected int
PageBreakingAlgorithm. restartFrom(BreakingAlgorithm.KnuthNode restartingNode, int currentIndex)
Restart from the given node at the given index.abstract void
BreakingAlgorithm. updateData2(BreakingAlgorithm.KnuthNode bestActiveNode, KnuthSequence sequence, int total)
Empty method, hook for subclasses.void
PageBreakingAlgorithm. updateData2(BreakingAlgorithm.KnuthNode bestActiveNode, KnuthSequence sequence, int total)
Empty method, hook for subclasses.Constructors in org.apache.fop.layoutmgr with parameters of type BreakingAlgorithm.KnuthNode Constructor Description 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)
Construct node.KnuthPageNode(int position, int line, int fitness, int totalWidth, int totalStretch, int totalShrink, int insertedFootnotes, int totalFootnotes, int footnoteListIndex, int footnoteElementIndex, double adjustRatio, int availableShrink, int availableStretch, int difference, double totalDemerits, BreakingAlgorithm.KnuthNode previous)
-
Uses of BreakingAlgorithm.KnuthNode in org.apache.fop.layoutmgr.inline
Methods in org.apache.fop.layoutmgr.inline with parameters of type BreakingAlgorithm.KnuthNode Modifier and Type Method Description void
LineLayoutManager.LineBreakingAlgorithm. updateData2(BreakingAlgorithm.KnuthNode bestActiveNode, KnuthSequence par, int total)
-