[Archive-access-cvs] SF.net SVN: archive-access:[3083] trunk/archive-access/projects/wayback/ wayback-core/src/main/java/org/archive/wayback/partition/PartitionsToGraph. java

[<bra...@us...>]

Revision: 3083
          http://archive-access.svn.sourceforge.net/archive-access/?rev=3083&view=rev
Author:   bradtofel
Date:     2010-04-30 02:16:27 +0000 (Fri, 30 Apr 2010)

Log Message:
-----------
TWEAK: removed System.out.format() debug line...

Modified Paths:
--------------
    trunk/archive-access/projects/wayback/wayback-core/src/main/java/org/archive/wayback/partition/PartitionsToGraph.java

Modified: trunk/archive-access/projects/wayback/wayback-core/src/main/java/org/archive/wayback/partition/PartitionsToGraph.java
===================================================================
--- trunk/archive-access/projects/wayback/wayback-core/src/main/java/org/archive/wayback/partition/PartitionsToGraph.java	2010-04-30 02:14:51 UTC (rev 3082)
+++ trunk/archive-access/projects/wayback/wayback-core/src/main/java/org/archive/wayback/partition/PartitionsToGraph.java	2010-04-30 02:16:27 UTC (rev 3083)
@@ -62,23 +62,23 @@
 
 	private static final TimeZone TZ_UTC = TimeZone.getTimeZone("UTC");
 
-	private static String joinInts(int[] a) {
-		StringBuilder sb = new StringBuilder();
-		boolean first = true;
-		for(int i : a) {
-			if(first) {
-				sb.append(i);
-				first = false;
-			} else {
-				sb.append(",").append(i);
-			}
-		}
-		return sb.toString();
-	}
-	private static void printAr(String name, int o[], int n[]) {
-		System.out.format("%s=========\nORIG(%s)\nNORM(%s)\n",
-				name,joinInts(o),joinInts(n));
-	}
+//	private static String joinInts(int[] a) {
+//		StringBuilder sb = new StringBuilder();
+//		boolean first = true;
+//		for(int i : a) {
+//			if(first) {
+//				sb.append(i);
+//				first = false;
+//			} else {
+//				sb.append(",").append(i);
+//			}
+//		}
+//		return sb.toString();
+//	}
+//	private static void printAr(String name, int o[], int n[]) {
+//		System.out.format("%s=========\nORIG(%s)\nNORM(%s)\n",
+//				name,joinInts(o),joinInts(n));
+//	}
 
 	private static int normalizeInt(int input, int localMax, int maxOutput) {
 		double ln = Math.log(localMax);
@@ -108,7 +108,7 @@
 			if(input[i] > localMax) localMax = input[i];
 		}
 		if(localMax < max) {
-			printAr("No normalization",input,input);
+//			printAr("No normalization",input,input);
 			return input;
 		}
 		int normalized[] = new int[input.length];
@@ -123,8 +123,8 @@
 				double pct = iln / ln;
 				double num = pct * max;
 				int idx = (int) num;
-				System.out.format("%d - %d - %f - %f - %f - %f : %d\n",
-						i,input[i],ln,iln,pct,num,idx);
+//				System.out.format("%d - %d - %f - %f - %f - %f : %d\n",
+//						i,input[i],ln,iln,pct,num,idx);
 				if(input[i] < idx) {
 					normalized[i] = input[i];
 				} else {
@@ -132,7 +132,7 @@
 				}
 			}
 		}
-		printAr("NORMALIZED",input,normalized);
+//		printAr("NORMALIZED",input,normalized);
 		return normalized;
 	}
 


This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.