How to use HashSet.contains() to check elements?

[langnoi]

I'm new to programming and trying to use HashSet.contains() method to check for elements in one HashSet exist in another HashSet. I defined a boolean method, compareString, to check if all the elements in stringExpected exists in stringActual. For some reason, it always return 'FALSE', any ideas?

This is what I have:

String[] stringExpected {"a", "b", "c"};

String[] stringActual {"a", "b", "c"};

boolean compareString(StringI[] stringExpected, String[] stringActual)
{

HashSet sActual = new HashSet();
HashSet sExpected = new HashSet();

for (int i = 0; i < uris.length; ++i)
{
sExpected.add(stringExpected);
}
for (int i = 0; i < stringActual.length; ++i)
{
sActual.add(stringActual);
}

return sActual.contains(sExpected);
}

 

[stefanwagner]

what is uris.length?

However - your test

return sActual.contains(sExpected);

tests, whether a HashSet contains another HashSet, but the first HashSet contains Strings - not HashSets.

return sActual.containsAll (sExpected);

might be what you're looking for.

don't visit my homepage:

http://home.arcor.de/hirnstrom/bewerbung

 

[Diancecht]

Just another way:

String[] arrayA;
String[] arrayB;
boolean containSameElements = java.util.Arrays.equals(java.util.Arrays.sort(arrayA),java.util.Arrays.sort(arrayB));

Cheers,
Dian

 

[langnoi]

Thanks Stefan and Diancecht for your help. I got it working now.