# HG changeset patch
# User wenzelm
# Date 1626432337 -7200
# Node ID 3b8b1da2ff29a5996bf81753535c47f3ce6707e6
# Parent  f114e11fe21d57ef7792a7cb41355b5dcf7fbc26
tuned --- fewer warnings;

diff -r f114e11fe21d -r 3b8b1da2ff29 src/Tools/GraphBrowser/GraphBrowser/Graph.java
--- a/src/Tools/GraphBrowser/GraphBrowser/Graph.java	Fri Jul 16 12:40:39 2021 +0200
+++ b/src/Tools/GraphBrowser/GraphBrowser/Graph.java	Fri Jul 16 12:45:37 2021 +0200
@@ -323,7 +323,7 @@
 				}
 			}
 			v=next;
-			numEdges.addElement(new Integer(n_edges));
+			numEdges.addElement(Integer.valueOf(n_edges));
 		} while (!v.isEmpty());
 		return layers2;
 	}
@@ -749,21 +749,21 @@
 							xh=x2+box_height*(x3-x2)/(y3-y2);
 							if (!(x2<=x3 && xh>=rightx || x2>x3 && xh<=leftx)) {
 								/* top control point */
-								pos.addElement(new Integer(1));
+								pos.addElement(Integer.valueOf(1));
 								y1=y2;
 							} else {
 								xh=x1+(y2-y1)*(x2-x1)/(y2+box_height-y1);
 								if (!(x2<=x1 && xh>=rightx || x2>x1 && xh<=leftx))
 									/* bottom control point */
-									pos.addElement(new Integer(2));
+									pos.addElement(Integer.valueOf(2));
 								else
 									/* two control points needed */
-									pos.addElement(new Integer(3));
+									pos.addElement(Integer.valueOf(3));
 								y1=y2+box_height;
 							}
 							x1=x2;
 						} while (vx2.isDummy());
-						pos.addElement(new Integer(1));
+						pos.addElement(Integer.valueOf(1));
 
 						/**** calculate triangles ****/
 						vx2=vx3;
@@ -903,7 +903,7 @@
 		while (e1.hasMoreElements()) {
 			Vertex vx=(Vertex)(e1.nextElement());
 			if (vx.getNumber()>=0)
-				code.addElement(new Integer(vx.getNumber()));
+				code.addElement(Integer.valueOf(vx.getNumber()));
 		}
 		return code;
 	}
diff -r f114e11fe21d -r 3b8b1da2ff29 src/Tools/GraphBrowser/GraphBrowser/TreeNode.java
--- a/src/Tools/GraphBrowser/GraphBrowser/TreeNode.java	Fri Jul 16 12:40:39 2021 +0200
+++ b/src/Tools/GraphBrowser/GraphBrowser/TreeNode.java	Fri Jul 16 12:45:37 2021 +0200
@@ -91,14 +91,14 @@
 	public void collapse()
 	{
 		unfold=false;
-		/*
+		/*Integer.valueOf
 		for(int i=0;i<leaves.size();i++)
 			((Tree)leaves.elementAt(i)).collapse();
 		*/
 	}
 
 	void collapsedNodes(Vector v) {
-		if (number>=0) v.addElement(new Integer(number));
+		if (number>=0) v.addElement(Integer.valueOf(number));
 		Enumeration e1=leaves.elements();
 		while (e1.hasMoreElements())
 			((TreeNode)(e1.nextElement())).collapsedNodes(v);