From c95234c4ca7cd89989b8b58efe0cbedc7c93867e Mon Sep 17 00:00:00 2001
From: Jim Martens <github@2martens.de>
Date: Wed, 12 Jul 2017 14:27:20 +0200
Subject: [PATCH] Moved main method to top and removed obsolete parameter

Signed-off-by: Jim Martens <github@2martens.de>
---
 blatt8/src/blatt8/Apriori.java | 38 +++++++---------------------------
 1 file changed, 7 insertions(+), 31 deletions(-)

diff --git a/blatt8/src/blatt8/Apriori.java b/blatt8/src/blatt8/Apriori.java
index 7d563b6..47abf1b 100644
--- a/blatt8/src/blatt8/Apriori.java
+++ b/blatt8/src/blatt8/Apriori.java
@@ -15,6 +15,11 @@ public class Apriori {
     private static int         numItems        = 0;
     private static int         numTransactions = 0;
     
+    public static void main(String[] args) {
+        analyzeTransactionFile();
+        AprioriAlgorithm();
+    }
+    
     private static void analyzeTransactionFile() {
         try (BufferedReader br = new BufferedReader(new FileReader(path))) {
             String line;
@@ -66,7 +71,7 @@ public class Apriori {
                         int[] c = new int[k];
                         System.arraycopy(I1, 0, c, 0, k - 1);
                         c[k - 1] = itemset[k - 2];
-                        if (!prune(c)) {
+                        if (!prune()) {
                             candidates.add(c);
                         }
                     }
@@ -81,31 +86,8 @@ public class Apriori {
         }
     }
     
-    
-    private static boolean prune(int[] c) {
-        //		if(new Random().nextInt(50)==0)return false;
+    private static boolean prune() {
         return false;
-        //		for(int skip=0;skip<c.length;skip++){
-        //			int[] subset = new int[c.length-1];
-        //			for(int i=0;i<c.length-1;i++){
-        //				if(i>=skip)
-        //					subset[i]=c[i+1];
-        //				else
-        //					subset[i]=c[i];
-        //			}
-        //			boolean match=false;
-        //			for(int i=0;i<itemsets.size();i++){
-        //				if(compare(itemsets.get(i),subset)){
-        //					match=true;
-        //					break;
-        //				}
-        //			}
-        //			if(!match)
-        //				return true;
-        //
-        //		}
-        //		return false;
-        
     }
     
     private static boolean contains(int[] a, int[] b) {
@@ -184,10 +166,4 @@ public class Apriori {
         System.out.println(print);
     }
     
-    
-    public static void main(String[] args) {
-        analyzeTransactionFile();
-        AprioriAlgorithm();
-    }
-    
 }