I want to create a programm that would read data from a file and will put each distinct item in a hashtable,counting how often it appears.I want to count first how often single characters or numbers appear,then how often the combination of two characters appear,three characters etc. More specifically... How can I use hashtable to count the appearances of some items in a file.For example how often is the letter a used,letter b etc.I am using hashtable.class in java.util.* ,but what I can not do is associate each letter that I am reading with a place in the hashtable. For example the following code creates a hashtable called numbers with the default capacity and load factor.Then one-two-three are used as the keys and 1-2-3 as the values. Hashtable numbers = new Hashtable(); numbers.put("one", new Integer(1)); numbers.put("two", new Integer(2)); numbers.put("three", new Integer(3)); I want my hashtable to read a file one character or one number at a time and count their appearances. The data would most probably be in the form abc abcd a abce ecf e fg or 123 12346 12 348 7 2 3456 52 364725 Thanks a lot for suggestions to my previous question as well as to future ones. jkouris@hotmail.com
john kappas
Posts
-
Help with program for counting using hashtable -
Hashing with quadratic probingthnx a lot
-
Help with program for counting using hashtableI want to create a programm that would read data from a file and will put each distinct item in a hashtable,counting how often it appears.I want to count first how often single characters or numbers appear,then how often the combination of two characters appear,three characters etc. More specifically... How can I use hashtable to count the appearances of some items in a file.For example how often is the letter a used,letter b etc.I am using hashtable.class in java.util.* ,but what I can not do is associate each letter that I am reading with a place in the hashtable. For example the following code creates a hashtable called numbers with the default capacity and load factor.Then one-two-three are used as the keys and 1-2-3 as the values. Hashtable numbers = new Hashtable(); numbers.put("one", new Integer(1)); numbers.put("two", new Integer(2)); numbers.put("three", new Integer(3)); I want my hashtable to read a file one character or one number at a time and count their appearances. The data would most probably be in the form abc abcd a abce ecf e fg or 123 12346 12 348 7 2 3456 52 364725 Thanks a lot for suggestions to my previous question as well as to future ones. jkouris@hotmail.com
-
Hashing with quadratic probingThe following Java class implements hashing with open addressing,using quadratic probing to resolve collisions.When I try to compile it (using microsoft's visual java),it gives me this error:Undefined name 'OpenAddressException' at line32.Could someone please tell me what is wrong with it? [jkouris@hotmail.com] --------------------------------------------------------------------------------------------------- public class OpenAddress { private int[] Element; private int TableSize; private int EmptyCell; OpenAddress(int tablesize) { int index; TableSize=tablesize; EmptyCell=0; Element=new int[tablesize]; for(index=0;index