2martens/dis
1
0
Fork 0
Code Issues 1 Pull Requests Projects Releases Wiki Activity

Removed obsolete type specification

Browse Source 
Signed-off-by: Jim Martens <github@2martens.de>
This commit is contained in:
Jim Martens
2017-07-12 09:37:25 +02:00
parent 64fd37e53d
commit 143aec106c
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
blatt8/src/blatt8/Apriori.java
View File

@ -51,7 +51,7 @@ public class Apriori {
private static void generateCandidates() { private static void generateCandidates() {
int k = itemsets.get(0).length + 1; int k = itemsets.get(0).length + 1;
List<int[]> candidates = new ArrayList<int[]>(); List<int[]> candidates = new ArrayList<>();
for (int i = 0; i < itemsets.size(); i++) { for (int i = 0; i < itemsets.size(); i++) {
for (int[] itemset : itemsets) { for (int[] itemset : itemsets) {
int[] I1 = itemsets.get(i); int[] I1 = itemsets.get(i);
@ -131,7 +131,7 @@ public class Apriori {
} }
private static void find_frequent_1_itemsets() { private static void find_frequent_1_itemsets() {
itemsets = new ArrayList<int[]>(); itemsets = new ArrayList<>();
for (int i = 0; i < numItems; i++) { for (int i = 0; i < numItems; i++) {
int[] cand = {i}; int[] cand = {i};
itemsets.add(cand); itemsets.add(cand);
@ -141,7 +141,7 @@ public class Apriori {
} }
private static void calculateFrequentItemsets() { private static void calculateFrequentItemsets() {
List<int[]> frequent = new ArrayList<int[]>(); List<int[]> frequent = new ArrayList<>();
int[] counter = new int[itemsets.size()]; int[] counter = new int[itemsets.size()];
try (BufferedReader br = new BufferedReader(new FileReader(path))) { try (BufferedReader br = new BufferedReader(new FileReader(path))) {
String line; String line;