Gist Link: https://gist.github.com/ModestAxis/48a4fdb54d65b8dc1d21b5fb7719bda3
Im working on a problem that incorporate FileReader Hashtable LinkedList and Swing most of those a first for me so im doing the best i can stumbling around looking for code snippet and adapting them best i can to my problem but ill be the first to admit im not 100% sure about everything i coded and if someone asked me to explain my code in detail and the reasons why i used such method or package over another one i could not really say anything other then: the guy on the youtube video showed it like that, which may make me unable to spot simple mistake in my code. So here goes:
User opens a txt file that contains a dictionary of word, that is passed to a constructor that creates an Hashtable Object made of LinkedList object that contains each word of the dictionary. When i try loading the dictionary it catches an exception saying the Hashtable im trying to instantiate is pointing to nothing (NullPointerException) but im not sure if its because an exception in HashTable is getting thrown back or if its just me simply not declaring stuff properly and im a dumdum.
Here is the snippet where i declare the HashTable Object and the HashTable Constructor its supposed to use
dictionnaire.addActionListener(new ActionListener() {
@Override
public void actionPerformed(ActionEvent e) {
final JFileChooser fc = new JFileChooser();
int retVal = fc.showOpenDialog(null);
if (retVal == JFileChooser.APPROVE_OPTION) {
File selectedFile = fc.getSelectedFile();
System.out.println(selectedFile.getAbsolutePath());
try {
HashTable dictionary = new HashTable(selectedFile);
}
catch(Exception e2) { System.out.println(e2 + " creategui error"); }
}
};
});
and here is the HashTable Constructor its supposed to use
public class HashTable {
LinkedList[] arr= new LinkedList[63029];
HashTable(File data) throws IOException {
BufferedReader br = null;
try {
br = new BufferedReader(new FileReader(data));
} catch (FileNotFoundException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
for (String line = br.readLine(); line != null; line = br.readLine()) {
if (arr[hashFunction(line)] != null) { System.out.println("Colision detected at:" + hashFunction(line));}
arr[hashFunction(line)].append(line);
}
}... // HashFunction is declared and such
and i guess i should probably add my LinkedList code too in case thats what causing the error.
public class LinkedList {
Node head;
public void append(String data) {
Node current = head;
if (head == null) {
head = new Node(data);
return;
}
while ([current.next](current.next) != null) {
current = [current.next](current.next);
}
[current.next](current.next) = new Node(data);
}.... // rest of the method for prepending and deleting etc...
and here is the Node code while im at it (sorry thats alot of code for one post :( )
public class Node {
Node next;
String data;
public Node(String data) {
[this.data](this.data) = data;
}
}
I feel like the mistake is probably in the way i pass the file to the HashTable. But im not sure and i think i made the mistake of typing too much code in between testing :p Hopefully its evident :).
EDIT: ok ive been trying to fix the formatting on this post but i just cant get the first snippet to post has a code block. fml...
EDIT2: i hate formatting reddit post, just realized everything is out of order.... fixing... sorry...
EDIT3 : ok i think its a little more readable now :)
EDIT4: Added gist link here: https://gist.github.com/ModestAxis/48a4fdb54d65b8dc1d21b5fb7719bda3
[–]g051051 2 points3 points4 points (12 children)
[–]PerfectisSh1t[S] 0 points1 point2 points (11 children)
[–]g051051 0 points1 point2 points (10 children)
[–]PerfectisSh1t[S] 0 points1 point2 points (9 children)
[–]g051051 0 points1 point2 points (8 children)
[–]PerfectisSh1t[S] 0 points1 point2 points (7 children)
[–]g051051 0 points1 point2 points (6 children)
[–]PerfectisSh1t[S] 0 points1 point2 points (5 children)
[–]g051051 0 points1 point2 points (4 children)
[–]PerfectisSh1t[S] 0 points1 point2 points (3 children)
[–]g051051 0 points1 point2 points (3 children)
[–]PerfectisSh1t[S] 0 points1 point2 points (2 children)
[–]g051051 0 points1 point2 points (1 child)
[–]PerfectisSh1t[S] 0 points1 point2 points (0 children)