I finished the code Can you help me fixed the bug on File chooser on main functi
ID: 3813753 • Letter: I
Question
I finished the code
Can you help me fixed the bug on File chooser on main function plz
------------------- CLass Entry
public class Entry {
//The word to store in the Entry, this will be a key value for your hash table.
private String word;
//The count of how many times the word appears.
private int count;
/**
* Constructor that creates an {@code Entry} object given a word.
*
* @param word The word to set in the {@code Entry}.
*/
public Entry(String word) {
this.word = word;
this.count = 1;
}
/**
* Returns the word of this {@code Entry}.
*
* @return The word of this {@code Entry}.
*/
public String getWord() {
return this.word;
}
/**
* Returns the count of how many times this word appears in the document.
*
* @return the word count.
*/
public int getCount() {
return this.count;
}
/**
* Increases the count of the word in this {@code Entry} by one.
*
*/
public void incrementCount() {
this.count++;
}
@Override
public String toString() {
String result = "";
result += "Word: " + this.word + " " +
"Count: " + this.count;
return result;
}
public int hashCode(String str, int type) {
//You must implement this method!!!!
int hashValue;
if(type ==1){ // primary hash
hashValue = str.hashCode();
return hashValue %7;
}
// secondary hash function
hashValue = str.hashCode();
return 7 - (hashValue % 7);
}
}---------------------------------------------------
----------- CLASS SIMPLELIST
public class SimpleList {
//Initial size of the internal array.
private static final int INITIAL_CAPACITY = 10;
//Internal array of Entry objects.
public Entry[] entries;
//Size of the List
private int size;
/**
* Constructor creates an empty {@code SimpleList} with default initial capacity.
*
*/
public SimpleList() {
this.entries = new Entry[INITIAL_CAPACITY];
this.size = 0;
}
/**
* This method adds a new {@code Entry} to the end of the list. The list will also be resized when necessary.
*
* @param e The entry to add to the end of the list.
*/
public void add(Entry e) {
//Check to see if we need to resize the list
if (this.size == this.entries.length) {
this.resize();
}
this.entries[this.size] = e;
this.size++;
}
/**
* This function finds the {@code Entry} in the list whose word matches the given {@code String}. The function
* returns the index of where the Entry can be found, or -1 if the {@code Entry} was not found.
*
* @param word The word whose {@code Entry} you want to find.
*
* @return Returns the index of where the {@code Entry} was found, -1 otherwise.
*/
public int find(String word) {
for (int i = 0 ; i < this.size ; i++) {
Entry current = this.entries[i];
if (word.equals(current.getWord())) {
return i;
}
}
return -1;
}
/**
* This method returns the {@code Entry} at the given index.
*
* @param index The index of the {@code Entry} to return. {@code index} must be a positive value between 0 to
* size()-1 inclusive.
* @return The {@code Entry} at the given index.
*/
public Entry getEntry(int index) {
return this.entries[index];
}
/**
* This method returns the number of entries in the list.
*
* @return The number of entries in the list.
*/
public int size() {
return this.size;
}
/**
* This method will create a new list double the size of the previous, and copy all values from the old list
* to the new list.
*/
private void resize() {
Entry[] newList = new Entry[this.entries.length * 2];
for (int i = 0 ; i < this.size ; i++) {
newList[i] = this.entries[i];
}
this.entries = newList;
}
public String toString() {
String result = "";
String formatter = "%-20s%-1d";
for (int i = 0 ; i < this.size ; i++) {
Entry e = this.entries[i];
result += String.format(formatter, e.getWord(), e.getCount()) + " ";
}
return result;
}
}
------------------------------ CLASS HashTable ------------------------
import java.util.*;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import javax.swing.JFileChooser;
import javax.swing.JOptionPane;
public class HashTable {
//variable
ArrayList<String> numbers = new ArrayList<> ();
//constructor
public HashTable(ArrayList<String> numbers){
this.numbers = numbers;
}
public SimpleList generateSimpleList(){
SimpleList obj = new SimpleList();
for(int i = 0; i < numbers.size(); i++){
// add number
obj.add(new Entry(numbers.get(i)));
}
return obj;
}
private SimpleList generateHashTable(){
SimpleList obj = new SimpleList();
for(int i =0; i< numbers.size(); i++){
// add number
Entry entry = new Entry(numbers.get(i));
// get hash code
int hash = entry.hashCode(numbers.get(i), 1);
if(obj.getEntry(hash)!= null){ // get hash code success
obj.entries[hash] = entry;
}
else{
hash = entry.hashCode(numbers.get(i),2);
obj.entries[hash] = entry;
}
}
return obj;
}
// main function
public static void main(String args[]){
// read file
JFileChooser jfchooser = new JFileChooser();
ArrayList<String> list = new ArrayList<>();
jfchooser.showOpenDialog(null);
int result = jfchooser.showOpenDialog(null);
if( result == JFileChooser.APPROVE_OPTION){
try{
//FileReader fr = new FileReader()
FileReader fr = null;
JOptionPane.showMessageDialog(null, "Select File");
File file = jfchooser.getSelectedFile();
fr = new FileReader(file);
int num = 1;
while (num != -1) {
num = fr.read();
list.add(String.valueOf(num));
}
}catch(FileNotFoundException ex){
}catch(IOException ex){
}
}
// creating object
HashTable obj = new HashTable(list);
obj.generateSimpleList();
obj.generateHashTable();
}
}
Explanation / Answer
public category Entry within the Entry, this may be a key worth for your hash table.
non-public String word;
//The count of what percentage times the word seems.
non-public int count;
/**
* creator that makes associate object given a word.
*
* @param word The word to line within the .
*/
public Entry(String word)
/**
* Returns the word of this .
*
* @return The word of this .
*/
public String getWord() come this.word;
}
/**
* Returns the count of what percentage times this word seems within the document.
*
* @return the word count.
*/
public int getCount() come this.count;
}
/**
* will increase the count of the word during this by one.
*
*/
public void incrementCount()
@Override
public String toString() should implement this method!!!!
int hashValue;
if(type ==1)come back hashValue %7;
}
// secondary hash perform
hashValue = str.hashCode();
come seven - (hashValue the troubles 7);
}
}---------------------------------------------------
----------- category SIMPLELIST
public category SimpleList the interior array.
non-public static final int INITIAL_CAPACITY = 10;
//Internal array of Entry objects.
public Entry[] entries;
//Size of the List
non-public int size;
/**
* creator creates associate empty with default initial capability.
*
*/
public SimpleList()
/**
* This technique adds a brand new to the tip of the list. The list also will be resized once necessary.
*
* @param e The entry to feature to the tip of the list.
*/
public void add(Entry e) to envision if we want to size the list
if (this.size == this.entries.length)
this.entries[this.size] = e;
this.size++;
}
/**
* This perform finds the within the list whose word matches the given . The perform
* returns the index of wherever the Entry may be found, or -1 if the wasn't found.
*
* @param word The word whose you would like to seek out.
*
* @return Returns the index of wherever the was found, -1 otherwise.
*/
public int find(String word) zero ; i < this.size ; i++)
}
return -1;
}
/**
* This technique returns the at the given index.
*
* @param index The index of the to come. should be a positive worth between zero to
* size()-1 comprehensive.
* @return The at the given index.
*/
public Entry getEntry(int index) come this.entries[index];
}
/**
* This technique returns the amount of entries within the list.
*
* @return the amount of entries within the list.
*/
public int size() come this.size;
}
/**
* This technique can produce a brand new list double the dimensions of the previous, and duplicate all values from the previous list
* to the new list.
*/
non-public void resize() {
Entry[] newList = new Entry[this.entries.length * 2];
for (int i = zero ; i < this.size ; i++)
this.entries = newList;
}
public String toString() {
String result = "";
String formatter = "%-20s%-1d";
for (int i = zero ; i < this.size ; i++)
public SimpleList generateSimpleList()range
obj.add(new Entry(numbers.get(i)));
}
come obj;
}
non-public SimpleList generateHashTable()variety
Entry entry = new Entry(numbers.get(i));
// get hash code
int hash = entry.hashCode(numbers.get(i), 1);
if(obj.getEntry(hash)!= null)
else
}
come obj;
}
// main perform
public static void main(String args[])scan file
JFileChooser jfchooser = new JFileChooser();
ArrayList<String> list = new ArrayList<>();
jfchooser.showOpenDialog(null);
int result = jfchooser.showOpenDialog(null);
if( result == JFileChooser.APPROVE_OPTION)metallic element = new FileReader()
FileReader atomic number 87 = null;
JOptionPane.showMessageDialog(null, "Select File");
File file = jfchooser.getSelectedFile();
atomic number 87 = new FileReader(file);
int num = 1;
whereas (num != -1)
}catch(FileNotFoundException ex)catch(IOException ex)
}
// making object
HashTable obj = new HashTable(list);
obj.generateSimpleList();
obj.generateHashTable();
}
}
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.