diff -Nru abego-treelayout-1.0.2/CHANGES.txt abego-treelayout-1.0.3/CHANGES.txt --- abego-treelayout-1.0.2/CHANGES.txt 2015-01-19 00:01:09.000000000 +0000 +++ abego-treelayout-1.0.3/CHANGES.txt 2015-11-06 10:32:03.000000000 +0000 @@ -1,7 +1,8 @@ abego TreeLayout - Efficiently create compact tree layouts ============================================================================= -http://code.google.com/p/treelayout/ +Project web page: http://treelayout.sourceforge.net +GitHub: https://github.com/abego/treelayout Udo Borkowski, ub at abego org abego Software GmbH, Germany @@ -11,6 +12,13 @@ ============================================================================= ----------------------------------------------------------------------------- +Release 1.0.3 (2015-11-05) + +Documentation + +* Improve JavaDoc comments + +----------------------------------------------------------------------------- Release 1.0.2 (2015-01-19) New diff -Nru abego-treelayout-1.0.2/debian/changelog abego-treelayout-1.0.3/debian/changelog --- abego-treelayout-1.0.2/debian/changelog 2015-10-01 10:44:25.000000000 +0000 +++ abego-treelayout-1.0.3/debian/changelog 2016-03-29 14:39:51.000000000 +0000 @@ -1,3 +1,13 @@ +abego-treelayout (1.0.3-1) unstable; urgency=medium + + * New upstream release + * Build with the DH sequencer instead of CDBS + * Standards-Version updated to 3.9.7 (no changes) + * Use a secure Vcs-Git URL + * Remove the website files from the upstream tarball + + -- Emmanuel Bourg Tue, 29 Mar 2016 16:39:49 +0200 + abego-treelayout (1.0.2-1) unstable; urgency=medium * Initial release (Closes: #800579) diff -Nru abego-treelayout-1.0.2/debian/control abego-treelayout-1.0.3/debian/control --- abego-treelayout-1.0.2/debian/control 2015-10-01 10:44:25.000000000 +0000 +++ abego-treelayout-1.0.3/debian/control 2016-03-29 14:38:21.000000000 +0000 @@ -3,14 +3,13 @@ Priority: optional Maintainer: Debian Java Maintainers Uploaders: Emmanuel Bourg -Build-Depends: cdbs, - debhelper (>= 9), +Build-Depends: debhelper (>= 9), default-jdk, junit4, libmaven-bundle-plugin-java, maven-debian-helper (>= 1.5) -Standards-Version: 3.9.6 -Vcs-Git: git://anonscm.debian.org/pkg-java/abego-treelayout.git +Standards-Version: 3.9.7 +Vcs-Git: https://anonscm.debian.org/git/pkg-java/abego-treelayout.git Vcs-Browser: https://anonscm.debian.org/cgit/pkg-java/abego-treelayout.git Homepage: http://treelayout.sourceforge.net diff -Nru abego-treelayout-1.0.2/debian/orig-tar.sh abego-treelayout-1.0.3/debian/orig-tar.sh --- abego-treelayout-1.0.2/debian/orig-tar.sh 2015-10-01 10:44:25.000000000 +0000 +++ abego-treelayout-1.0.3/debian/orig-tar.sh 2016-03-29 14:38:21.000000000 +0000 @@ -16,5 +16,6 @@ --exclude '.project' \ --exclude 'nbproject' \ --exclude 'doc/*' \ + --exclude 'src/website' \ $DIR rm -Rf $DIR diff -Nru abego-treelayout-1.0.2/debian/rules abego-treelayout-1.0.3/debian/rules --- abego-treelayout-1.0.2/debian/rules 2015-10-01 10:44:25.000000000 +0000 +++ abego-treelayout-1.0.3/debian/rules 2016-03-29 14:38:21.000000000 +0000 @@ -1,9 +1,7 @@ #!/usr/bin/make -f -include /usr/share/cdbs/1/rules/debhelper.mk -include /usr/share/cdbs/1/class/maven.mk - -JAVA_HOME := /usr/lib/jvm/default-java +%: + dh $@ --buildsystem=maven get-orig-source: uscan --download-current-version --force-download --no-symlink diff -Nru abego-treelayout-1.0.2/pom.xml abego-treelayout-1.0.3/pom.xml --- abego-treelayout-1.0.2/pom.xml 2015-01-19 00:01:09.000000000 +0000 +++ abego-treelayout-1.0.3/pom.xml 2015-11-06 10:32:03.000000000 +0000 @@ -7,12 +7,12 @@ org.abego.treelayout org.abego.treelayout.core - 1.0.2 + 1.0.3 bundle abego TreeLayout Core Efficient and customizable TreeLayout Algorithm in Java. - http://code.google.com/p/treelayout/ + http://treelayout.sourceforge.net org.sonatype.oss @@ -23,14 +23,14 @@ BSD 3-Clause "New" or "Revised" License (BSD-3-Clause) - http://treelayout.googlecode.com/files/LICENSE.TXT + http://www.abego-software.de/legal/apl-v10.html repo - http://code.google.com/p/treelayout/source/browse/ - scm:svn:http://treelayout.googlecode.com/svn/ + https://github.com/abego/treelayout + scm:https://github.com/abego/treelayout.git diff -Nru abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/Configuration.java abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/Configuration.java --- abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/Configuration.java 2015-01-19 00:01:09.000000000 +0000 +++ abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/Configuration.java 2015-11-06 10:32:03.000000000 +0000 @@ -34,10 +34,10 @@ * Used to configure the tree layout algorithm. *

* Also see this overview. - * + *

* @author Udo Borkowski (ub@abego.org) * - * @param + * @param Type of elements used as nodes in the tree */ public interface Configuration { @@ -59,8 +59,9 @@ *

* By default the root of the tree is located at the top of the diagram. * However one may also put it at the left, right or bottom of the diagram. - *

+ *

* + * * * * @@ -68,10 +69,10 @@ * * * - * - * - * - * + * + * + * + * * *
Possible Root Positions
Top (Default)LeftBottom
Tree with root at topTree with root at left sideTree with root at right sideTree with root at bottom
* @@ -94,25 +95,27 @@ * may also align them "towards the root" or "away from the root". When the * root is located at the top this means the nodes are aligned "to the top * of the level" or "to the bottom of the level". - *

+ *

* + * * * * * * * - * + * * + * src="doc-files/TreeGraphView-TowardsRoot.png" alt="Tree with root at top and nodes aligned to top"> * + * src="doc-files/TreeGraphView-AwayFromRoot.png" alt="Tree with root at top and nodes aligned to bottom"> * *
Alignment in level when root is at the top
Center (Default)TowardsRoot ("top of level")AwayFromRoot ("bottom of level")
Tree with root at top and nodes center aligned
*

* Alignment in level when root is at the left: *

* + * * * * @@ -121,11 +124,11 @@ * * * + * src="doc-files/TreeGraphView-Center-RootLeft.png" alt="Tree with root at left side and nodes center aligned"> * + * src="doc-files/TreeGraphView-TowardsRoot-RootLeft.png" alt="Tree with root at left side and nodes left aligned"> * + * src="doc-files/TreeGraphView-AwayFromRoot-RootLeft.png" alt="Tree with root at left side and nodes right aligned"> * *
Table: Possible Alignments of Nodes (when root at left side)
Center (Default)TowardsRoot ("left of level")
* @@ -144,13 +147,12 @@ /** * Returns the size of the gap between subsequent levels. *

- * + * gapBetweenLevels Visualization * - * @param nextLevel - * [nextLevel > 0] + * @param nextLevel [nextLevel > 0] * * @return the size of the gap between level (nextLevel-1) and nextLevel - * [result >= 0] + * [result >= 0] */ double getGapBetweenLevels(int nextLevel); @@ -160,13 +162,13 @@ * In the layout there will be a gap of at least the returned size between * both given nodes. *

- * + * gapBetweenNodes Visualization *

* node1 and node2 are at the same level and are placed next to each other. * - * @param node1 - * @param node2 - * @return the minimal size of the gap between node1 and node2 [result >= 0] + * @param node1   + * @param node2   + * @return the minimal size of the gap between node1 and node2 [result >= 0] */ double getGapBetweenNodes(TreeNode node1, TreeNode node2); } diff -Nru abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/internal/util/java/lang/IterableUtil.java abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/internal/util/java/lang/IterableUtil.java --- abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/internal/util/java/lang/IterableUtil.java 2015-01-19 00:01:09.000000000 +0000 +++ abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/internal/util/java/lang/IterableUtil.java 2015-11-06 10:32:03.000000000 +0000 @@ -61,8 +61,8 @@ *

* I.e. the iterator does the reverse of the {@link List#iterator()}. * - * @param - * @param list + * @param Type of elements in the list + * @param list   * @return a reverse {@link Iterable} of the list */ public static Iterable createReverseIterable(List list) { diff -Nru abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/internal/util/java/lang/string/StringUtil.java abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/internal/util/java/lang/string/StringUtil.java --- abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/internal/util/java/lang/string/StringUtil.java 2015-01-19 00:01:09.000000000 +0000 +++ abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/internal/util/java/lang/string/StringUtil.java 2015-11-06 10:32:03.000000000 +0000 @@ -99,7 +99,7 @@ /** * see {@link #quote(String, String)} * - * @param s + * @param s the string to quote * @return nullable */ public static String quote(String s) { diff -Nru abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/internal/util/java/util/IteratorUtil.java abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/internal/util/java/util/IteratorUtil.java --- abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/internal/util/java/util/IteratorUtil.java 2015-01-19 00:01:09.000000000 +0000 +++ abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/internal/util/java/util/IteratorUtil.java 2015-11-06 10:32:03.000000000 +0000 @@ -71,8 +71,8 @@ *

* I.e. the iterator does the reverse of the {@link List#iterator()}. * - * @param - * @param list + * @param Type of elements in the list + * @param list   * @return a reverse {@link Iterator} of the list */ public static Iterator createReverseIterator(List list) { diff -Nru abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/internal/util/java/util/ListUtil.java abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/internal/util/java/util/ListUtil.java --- abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/internal/util/java/util/ListUtil.java 2015-01-19 00:01:09.000000000 +0000 +++ abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/internal/util/java/util/ListUtil.java 2015-11-06 10:32:03.000000000 +0000 @@ -42,7 +42,7 @@ /** * - * @param + * @param Type of elements in the list * @param list [!list.isEmpty()] * @return the last element of the list */ diff -Nru abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/NodeExtentProvider.java abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/NodeExtentProvider.java --- abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/NodeExtentProvider.java 2015-01-19 00:01:09.000000000 +0000 +++ abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/NodeExtentProvider.java 2015-11-06 10:32:03.000000000 +0000 @@ -36,22 +36,22 @@ * * @author Udo Borkowski (ub@abego.org) * - * @param + * @param Type of elements used as nodes in the tree */ public interface NodeExtentProvider { /** * Returns the width of the given treeNode. * - * @param treeNode - * @return [result >= 0] + * @param treeNode   + * @return [result >= 0] */ double getWidth(TreeNode treeNode); /** * Returns the height of the given treeNode. * - * @param treeNode - * @return [result >= 0] + * @param treeNode   + * @return [result >= 0] */ double getHeight(TreeNode treeNode); } \ No newline at end of file diff -Nru abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/package-info.java abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/package-info.java --- abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/package-info.java 2015-01-19 00:01:09.000000000 +0000 +++ abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/package-info.java 2015-11-06 10:32:03.000000000 +0000 @@ -63,7 +63,7 @@ x-coordinate of a node is given by its level

Here an example tree layout:

- + Simple Tree with 6 nodes @@ -94,12 +94,12 @@

Example: Extending AbstractTreeForTreeLayout

Assume you have a tree consisting of nodes of type StringTreeNode:

-

+ UML diagram for StringTreeNode

As StringTreeNode provides the children in a list and you can get the parent for each node you can extend {@link org.abego.treelayout.util.AbstractTreeForTreeLayout AbstractTreeForTreeLayout} to create your TreeForTreeLayout implementation. You only need to implement two methods and - the constructor:

+ the constructor: 

  public class StringTreeAsTreeForTreeLayout extends
      AbstractTreeForTreeLayout<StringTreeNode> {
@@ -124,10 +124,10 @@
  
Example: Using the DefaultTreeForTreeLayout

 
  Assume you want to create a tree with TextInBox items as nodes:

- 

+ UML diagram for TextInBox

 
  As you have no own tree implementation yet you may as well use 
- {@link org.abego.treelayout.util.DefaultTreeForTreeLayout DefaultTreeForTreeLayout} to create the tree:

+ {@link org.abego.treelayout.util.DefaultTreeForTreeLayout DefaultTreeForTreeLayout} to create the tree:
  
  TextInBox root = new TextInBox("root", 40, 20);
  TextInBox n1 = new TextInBox("n1", 30, 20);
@@ -145,9 +145,9 @@
  tree.addChild(n1, n1_3);
  tree.addChild(root, n2);
  tree.addChild(n2, n2_1);
- 

+
This will create a tree like this:

- + Tree created with SVG

NodeExtentProvider

@@ -162,10 +162,10 @@

Example

Assume you want to create a tree with TextInBox items as nodes:

-

+ UML diagram for TextInBox

Here each node contains its width and height. So your NodeExtentProvider may - look like this:

+ look like this:
  public class TextInBoxNodeExtentProvider implements
          NodeExtentProvider<TextInBox> {
 
@@ -196,10 +196,10 @@
 
  
Root Position

 
- By default the root of the tree is located at the top of the diagram. However 
- one may also put it at the left, right or bottom of the diagram. 
- 

+ By default the root of the tree is located at the top of the diagram.
+ However one may also put it at the left, right or bottom of the diagram.
  
+ 
@@ -207,15 +207,15 @@
  
- 
- 
- 
- 
+ 
+ 
+ 
+ 
Possible Root Positions
  

  Top (Default)
  LeftBottom
  

  
Tree with root at topTree with root at left sideTree with root at right sideTree with root at bottom
  

  

  

  See {@link org.abego.treelayout.Configuration#getRootLocation() getRootLocation}.
-
+ 

 
 
 
@@ -227,28 +227,29 @@
  level" or "to the bottom of the level".
  

  
+ 
- 
- 
- 
+ 
+ 
+ 
Alignment in level when root is at the top
  

  Center (Default)
  TowardsRoot ("top of level")
  AwayFromRoot ("bottom of level")
  

  
Tree with root at top and nodes center alignedTree with root at top and nodes aligned to topTree with root at top and nodes aligned to bottom
  

  

- 
Alignment in level when root is at the left:

  
+ 
- 
- 
- 
+ 
+ 
+ 
Alignment in level when root is at the left
  

  Center (Default)
  TowardsRoot ("left of level")
  AwayFromRoot
("right of level")		
  

  
Tree with root at left side and nodes center alignedTree with root at left side and nodes left alignedTree with root at left side and nodes right aligned
  

  

 
@@ -261,7 +262,7 @@
 
  The gap between subsequent levels and the minimal gap between nodes can be configured.
  

- 
+ levels, gapBetweenLevels and gapBetweenNodes Visualization
  

  See {@link org.abego.treelayout.Configuration#getGapBetweenLevels(int) getGapBetweenLevels} and 
  {@link org.abego.treelayout.Configuration#getGapBetweenNodes(Object, Object) getGapBetweenNodes}.
@@ -287,7 +288,7 @@
  MacBook Pro 2.4 GHz Intel Core 2 Duo (2 GB Memory (-Xmx2000m)). The variously 
  sized trees were created randomly. 
  

- 
+ Chart: Performance of TreeLayout on random trees
  

  The picture illustrates the linear time behavior of the algorithm and shows 
  the applicability also for large number of nodes. In this setting it takes 
diff -Nru abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/TreeForTreeLayout.java abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/TreeForTreeLayout.java
--- abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/TreeForTreeLayout.java	2015-01-19 00:01:09.000000000 +0000
+++ abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/TreeForTreeLayout.java	2015-11-06 10:32:03.000000000 +0000
@@ -39,12 +39,12 @@
  * {@link org.abego.treelayout.util.AbstractTreeForTreeLayout} to implement this
  * interface or even use the
  * {@link org.abego.treelayout.util.DefaultTreeForTreeLayout} class directly.
- * 

+ * 

  * Also see this overview.
  * 
  * @author Udo Borkowski (ub@abego.org)
  * 
- * @param 
+ * @param  Type of elements used as nodes in the tree
  */
 public interface TreeForTreeLayout {
 
@@ -62,7 +62,7 @@
 	 * 

 	 * Time Complexity: O(1)
 	 * 
-	 * @param node
+	 * @param node  
 	 * @return true iff node is a leaf in the tree, i.e. has no children.
 	 */
 	boolean isLeaf(TreeNode node);
@@ -72,8 +72,8 @@
 	 * 

 	 * Time Complexity: O(1)
 	 * 
-	 * @param node
-	 * @param parentNode
+	 * @param node  
+	 * @param parentNode  
 	 * @return true iff the node is a child of the given parentNode
 	 */
 	boolean isChildOfParent(TreeNode node, TreeNode parentNode);
diff -Nru abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/TreeLayout.java abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/TreeLayout.java
--- abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/TreeLayout.java	2015-01-19 00:01:09.000000000 +0000
+++ abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/TreeLayout.java	2015-11-06 10:32:03.000000000 +0000
@@ -51,14 +51,14 @@
  * 

  * The nodes with their final layout can be retrieved through
  * {@link #getNodeBounds()}.
- * 

+ * 

  * See this summary to get an overview how to
  * use TreeLayout.
  * 
  * 
  * @author Udo Borkowski (ub@abego.org)
  * 
- * @param 
+ * @param  Type of elements used as nodes in the tree
  */
 public class TreeLayout {
 	/*
@@ -90,6 +90,8 @@
 
 	/**
 	 * Returns the Tree the layout is created for.
+	 * 
+	 * @return the Tree the layout is created for
 	 */
 	public TreeForTreeLayout getTree() {
 		return tree;
@@ -102,6 +104,8 @@
 
 	/**
 	 * Returns the {@link NodeExtentProvider} used by this {@link TreeLayout}.
+	 * 
+	 * @return the {@link NodeExtentProvider} used by this {@link TreeLayout}
 	 */
 	public NodeExtentProvider getNodeExtentProvider() {
 		return nodeExtentProvider;
@@ -155,6 +159,8 @@
 
 	/**
 	 * Returns the Configuration used by this {@link TreeLayout}.
+	 * 
+	 * @return the Configuration used by this {@link TreeLayout}
 	 */
 	public Configuration getConfiguration() {
 		return configuration;
@@ -243,7 +249,7 @@
 	/**
 	 * Returns the number of levels of the tree.
 	 * 
-	 * @return [level > 0]
+	 * @return [level > 0]
 	 */
 	public int getLevelCount() {
 		return sizeOfLevel.size();
@@ -257,8 +263,8 @@
 	 * the left or right the size of a level is the maximal width of the nodes
 	 * of that level.
 	 * 
-	 * @param level
-	 * @return the size of the level [level >= 0 && level < levelCount]
+	 * @param level  
+	 * @return the size of the level [level >= 0 && level < levelCount]
 	 */
 	public double getSizeOfLevel(int level) {
 		checkArg(level >= 0, "level must be >= 0");
@@ -687,7 +693,7 @@
 	 * Returns the layout of the tree nodes by mapping each node of the tree to
 	 * its bounds (position and size).
 	 * 

-	 * For each rectangle x and y will be >= 0. At least one rectangle will have
+	 * For each rectangle x and y will be >= 0. At least one rectangle will have
 	 * an x == 0 and at least one rectangle will have an y == 0.
 	 * 
 	 * @return maps each node of the tree to its bounds (position and size).
@@ -718,10 +724,13 @@
 	 * In addition to the tree the {@link NodeExtentProvider} and the
 	 * {@link Configuration} must be given.
 	 * 
-	 * @param useIdentity
+     * @param tree  
+     * @param nodeExtentProvider  
+     * @param configuration  
+     * @param useIdentity
 	 *            [default: false] when true, identity ("==") is used instead of
 	 *            equality ("equals(...)") when checking nodes. Within a tree
-	 *            each node must only be once (using this check).
+	 *            each node must only exist once (using this check).
 	 */
 	public TreeLayout(TreeForTreeLayout tree,
 			NodeExtentProvider nodeExtentProvider,
@@ -879,7 +888,7 @@
 	 * Prints a dump of the tree to the given printStream, using the node's
 	 * "toString" method.
 	 * 
-	 * @param printStream
+	 * @param printStream  
 	 * @param dumpConfiguration
 	 *            [default: new DumpConfiguration()]
 	 */
diff -Nru abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/util/AbstractTreeForTreeLayout.java abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/util/AbstractTreeForTreeLayout.java
--- abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/util/AbstractTreeForTreeLayout.java	2015-01-19 00:01:09.000000000 +0000
+++ abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/util/AbstractTreeForTreeLayout.java	2015-11-06 10:32:03.000000000 +0000
@@ -36,7 +36,7 @@
 import org.abego.treelayout.internal.util.java.util.ListUtil;
 
 /**
- * Provides an easy way to implement the {@link TreeForTreeLayout} interface by
+ * Provides an easy way to implement the {@link org.abego.treelayout.TreeForTreeLayout} interface by
  * defining just two simple methods and a constructor.
  * 

  * To use this class the underlying tree must provide the children as a list
@@ -48,7 +48,7 @@
  * 
  * @author Udo Borkowski (ub@abego.org)
  * 
- * @param 
+ * @param  Type of elements used as nodes in the tree
  */
 abstract public class AbstractTreeForTreeLayout implements
 		TreeForTreeLayout {
@@ -58,7 +58,7 @@
 	 * 

 	 * Time Complexity: O(1)
 	 * 
-	 * @param node
+	 * @param node  
 	 * @return [nullable] the parent of the node, or null when the node is a
 	 *         root.
 	 */
@@ -73,7 +73,7 @@
 	 * 

 	 * A client must not modify the returned list.
 	 * 
-	 * @param node
+	 * @param node  
 	 * @return the children of the given node. When node is a leaf the list is
 	 *         empty.
 	 */
diff -Nru abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/util/DefaultConfiguration.java abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/util/DefaultConfiguration.java
--- abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/util/DefaultConfiguration.java	2015-01-19 00:01:09.000000000 +0000
+++ abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/util/DefaultConfiguration.java	2015-11-06 10:32:03.000000000 +0000
@@ -40,7 +40,7 @@
  * @author Udo Borkowski (ub@abego.org)
  * 
  * 
- * @param 
+ * @param  Type of elements used as nodes in the tree
  */
 public class DefaultConfiguration implements
 		Configuration {
@@ -48,8 +48,8 @@
 	/**
 	 * Specifies the constants to be used for this Configuration.
 	 * 
-	 * @param gapBetweenLevels
-	 * @param gapBetweenNodes
+	 * @param gapBetweenLevels  
+	 * @param gapBetweenNodes  
 	 * @param location
 	 *            [default: {@link org.abego.treelayout.Configuration.Location#Top Top}]
 	 * @param alignmentInLevel
@@ -72,6 +72,10 @@
 	 * 

 	 * see
 	 * {@link #DefaultConfiguration(double, double, org.abego.treelayout.Configuration.Location, org.abego.treelayout.Configuration.AlignmentInLevel)}
+	 * 

+     * @param gapBetweenLevels  
+     * @param gapBetweenNodes  
+     * @param location  
 	 */
 	public DefaultConfiguration(double gapBetweenLevels,
 			double gapBetweenNodes, Location location) {
@@ -85,6 +89,9 @@
 	 * 

 	 * see
 	 * {@link #DefaultConfiguration(double, double,  org.abego.treelayout.Configuration.Location, org.abego.treelayout.Configuration.AlignmentInLevel)}
+	 * 

+     * @param gapBetweenLevels  
+     * @param gapBetweenNodes  
 	 */
 	public DefaultConfiguration(double gapBetweenLevels,
 			double gapBetweenNodes) {
diff -Nru abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/util/DefaultTreeForTreeLayout.java abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/util/DefaultTreeForTreeLayout.java
--- abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/util/DefaultTreeForTreeLayout.java	2015-01-19 00:01:09.000000000 +0000
+++ abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/util/DefaultTreeForTreeLayout.java	2015-11-06 10:32:03.000000000 +0000
@@ -38,7 +38,7 @@
 
 
 /**
- * Provides a generic implementation for the {@link TreeForTreeLayout}
+ * Provides a generic implementation for the {@link org.abego.treelayout.TreeForTreeLayout}
  * interface, applicable to any type of tree node.
  * 

  * It allows you to create a tree "from scratch", without creating any new
@@ -52,7 +52,7 @@
  * 
  * @author Udo Borkowski (ub@abego.org)
  * 
- * @param 
+ * @param  Type of elements used as nodes in the tree
  */
 public class DefaultTreeForTreeLayout extends
 		AbstractTreeForTreeLayout {
@@ -92,7 +92,7 @@
 
 	/**
 	 * 
-	 * @param node
+	 * @param node  
 	 * @return true iff the node is in the tree
 	 */
 	public boolean hasNode(TreeNode node) {
diff -Nru abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/util/FixedNodeExtentProvider.java abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/util/FixedNodeExtentProvider.java
--- abego-treelayout-1.0.2/src/main/java/org/abego/treelayout/util/FixedNodeExtentProvider.java	2015-01-19 00:01:09.000000000 +0000
+++ abego-treelayout-1.0.3/src/main/java/org/abego/treelayout/util/FixedNodeExtentProvider.java	2015-11-06 10:32:03.000000000 +0000
@@ -29,7 +29,7 @@
  */
 package org.abego.treelayout.util;
 
-import static org.abego.treelayout.internal.util.Contract.*;
+import static org.abego.treelayout.internal.util.Contract.checkArg;
 
 import org.abego.treelayout.NodeExtentProvider;
 
@@ -39,7 +39,7 @@
  * 
  * @author Udo Borkowski (ub@abego.org)
  * 
- * @param 
+ * @param  Type of elements used as nodes in the tree
  */
 public class FixedNodeExtentProvider implements NodeExtentProvider {