aboutsummaryrefslogtreecommitdiffstats
path: root/src/java/org/apache/fop/layoutmgr/BreakingAlgorithm.java
diff options
context:
space:
mode:
authorAndreas L. Delmelle <adelmelle@apache.org>2007-07-18 17:37:14 +0000
committerAndreas L. Delmelle <adelmelle@apache.org>2007-07-18 17:37:14 +0000
commit4e921e05c7204e345525cf3e3312d8b8342d4b63 (patch)
tree05812a48470db3fa5acfb64156704485e86327ed /src/java/org/apache/fop/layoutmgr/BreakingAlgorithm.java
parent8fcc676984fbb4b8023f79a51dc2fb9fdff1bbb4 (diff)
downloadxmlgraphics-fop-4e921e05c7204e345525cf3e3312d8b8342d4b63.tar.gz
xmlgraphics-fop-4e921e05c7204e345525cf3e3312d8b8342d4b63.zip
* Javadoc update: use {@inheritDoc} instead of @see where applicable, removal of some @author tags
* Additional code cleanup: removal of unused imports (mainly in the fo.flow package) git-svn-id: https://svn.apache.org/repos/asf/xmlgraphics/fop/trunk@557337 13f79535-47bb-0310-9956-ffa450edef68
Diffstat (limited to 'src/java/org/apache/fop/layoutmgr/BreakingAlgorithm.java')
-rw-r--r--src/java/org/apache/fop/layoutmgr/BreakingAlgorithm.java12
1 files changed, 6 insertions, 6 deletions
diff --git a/src/java/org/apache/fop/layoutmgr/BreakingAlgorithm.java b/src/java/org/apache/fop/layoutmgr/BreakingAlgorithm.java
index 8da241395..df4bb1d47 100644
--- a/src/java/org/apache/fop/layoutmgr/BreakingAlgorithm.java
+++ b/src/java/org/apache/fop/layoutmgr/BreakingAlgorithm.java
@@ -151,7 +151,7 @@ public abstract class BreakingAlgorithm {
protected BestRecords best;
- /** @see #isPartOverflowRecoveryActivated() */
+ /** {@inheritDoc} */
private boolean partOverflowRecoveryActivated = true;
private KnuthNode lastRecovered;
@@ -397,9 +397,10 @@ public abstract class BreakingAlgorithm {
}
/** @see #findBreakingPoints(KnuthSequence, int, double, boolean, int) */
- public int findBreakingPoints(KnuthSequence par, /*int lineWidth,*/
- double threshold, boolean force,
- int allowedBreaks) {
+ public int findBreakingPoints(KnuthSequence par,
+ double threshold,
+ boolean force,
+ int allowedBreaks) {
return findBreakingPoints(par, 0, threshold, force, allowedBreaks);
}
@@ -412,7 +413,6 @@ public abstract class BreakingAlgorithm {
* @param allowedBreaks one of ONLY_FORCED_BREAKS, NO_FLAGGED_PENALTIES, ALL_BREAKS
*/
public int findBreakingPoints(KnuthSequence par, int startIndex,
- /*int lineWidth,*/
double threshold, boolean force,
int allowedBreaks) {
this.par = par;
@@ -634,7 +634,7 @@ public abstract class BreakingAlgorithm {
/** 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.
- * @see #createNode(int, int, int, int, int, int, double, int, int, int, double, KnuthNode)
+ * @see #createNode(int, int, int, int, int, int, double, int, int, int, double, org.apache.fop.layoutmgr.BreakingAlgorithm.KnuthNode)
* @see BreakingAlgorithm.BestRecords
*/
protected KnuthNode createNode(int position, int line, int fitness,