[java] finding in a HashSet

[mickey]

Hello,
I'm new to java and my problem is this:

class Word {
    private String _value;
    public Word(String value) { _value = new String(value); }
}
 
 
//main
HashSet< Word >  dictionary = new HashSet< Word >();
dictionary.add( new Word( "goodbye" );
dictionary.add( new Word( "hi" );
dictionary.add( new Word( "hello" );
 
if ( dictionary.contains( Word( "hello" ) )) ) { //how to to this?
 
}

class Word {
    private String _value;
    public Word(String value) { _value = new String(value); }
}


//main
HashSet< Word >  dictionary = new HashSet< Word >();
dictionary.add( new Word( "goodbye" );
dictionary.add( new Word( "hi" );
dictionary.add( new Word( "hello" );

if ( dictionary.contains( Word( "hello" ) )) ) { //how to to this?

}

To copy to clipboard, switch view to plain text mode 

I need to know if dictionary contains that word. I know it's simple but I can't do it

Any hints, please?

[wysota]

What exactly is the problem? As I see the class has a "contains" method.

[mickey]

apart that maybye I forget a "new Word( "hello" )" (because without new it doens't compile), it's never true: it don't find "hello"...

EDIT:
furtheremore:
I notice that if I do:

dictionary.add( new Word( "hello" );
dictionary.add( new Word( "hello" );

dictionary.add( new Word( "hello" );
dictionary.add( new Word( "hello" );

To copy to clipboard, switch view to plain text mode 

it adds to word("hello") twice. I'd like no copies inside that. I chose HashSet because it doens't keep copies. it worked fine when I had HashSet<String>, but now it doesn't work anything....

[wysota]

Did you implement the comparison operator for your class?