fop 0.95

Uses of Class
org.apache.fop.layoutmgr.BreakingAlgorithm.KnuthNode

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.activeLines
          The set of active nodes in ascending line order.
 BreakingAlgorithm.KnuthNode BreakingAlgorithm.KnuthNode.next
          next possible node in the same line
 BreakingAlgorithm.KnuthNode BreakingAlgorithm.KnuthNode.previous
          best node for the preceding breakpoint
 

Methods in org.apache.fop.layoutmgr that return BreakingAlgorithm.KnuthNode
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.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 BreakingAlgorithm.getNode(int line)
          Returns the first active node for the given line.
 BreakingAlgorithm.KnuthNode BreakingAlgorithm.BestRecords.getNode(int fitness)
           
 

Methods in org.apache.fop.layoutmgr with parameters of type BreakingAlgorithm.KnuthNode
protected  void BreakingAlgorithm.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.
protected  BreakingAlgorithm.KnuthNode BreakingAlgorithm.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 adjust ration 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  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  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  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)
           
abstract  void BreakingAlgorithm.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
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.95

Copyright 1999-2008 The Apache Software Foundation. All Rights Reserved.