Searching in HashSet

Question

I have 2 HashSet

Set<String> firstSet = new HashSet<String>();
Set<String> secondSet= new HashSet<String>();

Suppose

firstSet contains String as [A-ABC,B-BCD,C-CDE,D-DEF,L-POK] ;

secondSet contains String as [A,B,C,D,L,K,M] ;

Can i split each elements within firstSet like [A,B,C] without for loop and then do

firstSet.contains(secondSet);

or is their any appropriate way for doing this ?

Answer 1

Make firstSet instead a Map.

final Map map<String, String> = new HashMap<String, String();
map.put("A", "ABC");
map.put("B", "BCD");
...


map.keySet().containsAll(secondSet);

If that doesn't address your issue, perhaps you could explain in a bit more detail what you're trying to accomplish. There is no way to act on every element of a set without walking through every element of the set.