Need some help to finish this code (finding the number of unique words ...)

[rubiks]

How do I find the number of unique words and the total number of words from a random text file.

This is what I got so far...
------------------------------------------

import java.io.*;
import java.util.*;
import java.util.Scanner;
import java.io.File;




class test {

public static void main(String [] args) {

File file = new File("...; "); // random text file


try {
String [] word;
int [] numer;
int numberOfUniqueWords;
int i;
String s;
String m= " ";
Scanner f = new Scanner(file);
while (f.hasNextLine()) {
String line = f.nextLine();
word=line.split(m);


for(i=0; i<word.length; i++) {

s=word[i];






System.out.println();
}

}
f.close();



}catch(Exception e) {}





}
}

[AndrewM16921]

Go through the file line by line, split by whitespace (similar to what you're doing, though for simplicity a space is fine). Then, I suggest using a HashMap<String, Integer> to keep track of each word's count. Basically, if the hashmap already contains the word, then you increment it's integer value. Otherwise, you add the value of 1 to it. Then, at the end, iterate through it.

[JosAH]

A small detail: don't split on a single space " " but split on "\\s+" instead.

kind regards,

Jos

[rubiks]

Im trying to do the code without using HashMap, and Im stuck.

[JosAH]

Im trying to do the code without using HashMap, and Im stuck.

Why? Because you don't know how Maps work? One more reason to read its API documentation.

kind regards,

Jos

[rubiks]

So its not possible to do it without HashMap?

[JosAH]

So its not possible to do it without HashMap?

Sure it is, but you have to do a lot of nasty bookkeeping programming that is already done for you by a Map ... why reinvent the wheel? If you want to use simple arrays (because you already understand them), your code will look like Fortran ...

kind regards,

Jos

[rubiks]

Whats Fortran ?

[AndrewM16921]

Whats Fortran ?

A programming language invented in like (I think) 1957. We've come a long way since then :P

[JosAH]

A programming language invented in like (I think) 1957. We've come a long way since then :P

1954; and there wasn't any formal language theory in those days yet (Noam Chomsky); it took almost 180 man years to build that first 'formula translator' ...

kind regards,

Jos

[jim829]

Ahh! My first programming language. Fortran IV. Computed gotos; arithmetic if statements. And it actually passed values by name. You could change the value of literal constants!

Regards,
Jim

[JosAH]

Ahh! My first programming language. Fortran IV. Computed gotos; arithmetic if statements. And it actually passed values by name. You could change the value of literal constants!

And don't forget the biggest horror: equivalence relations for those common blocks *shudder*

kind regards,

Jos

[jim829]

Actually, I liked equivalence relations. I wrote a solitaire game. All the variables had a specific location in the huge equivalence array. When I wanted to save state so that someone could resume their game at a later time. I just wrote out the array. It could be read it later to resume the game. Setting them all up and debugging was somewhat of a pain.

Regards,
Jim

[JosAH]

Those were the 'lame' uses of equvalence relations; the real 'fun' (mind the quotes) starts when you define an equivalence relation between D and IA where D is a REAL*8 and IA is followed by IB, as in INTEGER*4 IA, IB; oh, the sheer fun we had ...

kind regards,

Jos