HashSet with array

[pi4r0n]

Hello ALL

I have got 2 method:

1st - Returns Set <Integer> which contains an array
2nd - Takes returned value from 1st method as HashSet argument.

Then I need to find consecutive numbers like 1,2 in order to find the numbers I need to first loop through the HashSet, but there is no length, so how do I do it ??

Cheers in advance for all your support

pi4r0n

[Fubarable]

1st - Returns Set <Integer> which contains an array

This confuses me. How can a Set<Integer> contain an array?

Then I need to find consecutive numbers like 1,2 in order to find the numbers I need to first loop through the HashSet, but there is no length, so how do I do it ??

HashSet has a size() method. It also implements the Iterable interface and you can iterate through it with this or the foreach loop.

[kwgivler]

See: HashSet (Java Platform SE 6)

Is this what you are trying to do?

Set<Integer> set = hashSet.keySet();
		Iterator<Integer> setIt = hashSet.iterator();
		while(setIt.hasNext())
		{
                     int num = setIt.next()
                     <Do stuff>
		}

[Junky]

Another problem: HashSet makes no guarantee of the order of the components. If you are looking to see if values are in order then a HashSet is the wrong choice. TreeSet or extracting values into another Collection and then sorting them would be better.

[pi4r0n]

I just found a post on this forum that might relates to what I am trying to do.

I'll take it as a example and will see how it goes