Integer « Set « Java Collection Q&A

1. Java HashSet to int array    stackoverflow.com

I've got a HashSet with a bunch of (you guessed it) integers in it. I want to turn it into an array, but calling

hashset.toArray();

2. Simple Question:Output of below Java program    stackoverflow.com

public class abc1 {

 private String s;

 public abc1(String s){this.s=s;}
 public static void main(String args[])
 {
  HashSet<Object> hs=new HashSet<Object>();
  abc1 a1= new abc1("abc");
  abc1 a2= new abc1("abc");
  ...

3. how to represent an integer array using java.util.BitSet?    stackoverflow.com

I need to represent an array of integers using BitSet. Can somebody explain me the logic required to do this ?

4. Using TreeSet contains() in Java with Integers    stackoverflow.com

import java.io.*;
import java.util.*;

class StepfordHouses {

    private ArrayList<Integer> houses; // A list containing houses
    private TreeSet<Integer> ordered; // An ordered treeset of houses
    ...

5. equality of item in java hashset    stackoverflow.com

I need to implement equals() method for an Item that may be put in a hashset of it's Maker.The Item can have fields as below

class Item{
    private String ...

6. SortedSet comparing on equality one field and sorting by another    stackoverflow.com

Please review code:

/* Run1.java */
package test;

import java.util.Iterator;
import java.util.SortedSet;
import java.util.TreeSet;

public class Run1 
{
    static public void main(String[] args)
    {
        ...

7. SortedSet for integers with GNU trove    stackoverflow.com

I'm migrating some code over to GNU trove for performance reasons. However, I do have some TreeSets, where I need rather fast update and lookups along with a sorted iteration - the ...

8. SortedSet and my own Integer comparator    java-forums.org

Note that the ordering maintained by a set (whether or not an explicit comparator is provided) must be consistent with equals if it is to correctly implement the Set interface. (See Comparable or Comparator for a precise definition of consistent with equals.) This is so because the Set interface is defined in terms of the equals operation, but a TreeSet instance ...

9. How can i remove the integer and the double in the TREESET in java?    forums.oracle.com

10. BitSet with index > Integer.MAX    forums.oracle.com

@ejp: sorry but i don't understand how Set could resolve my problem of using BitSet with more than Integer.MAX bit ? . I can implement one that use long array ( long[] data ) to store the data of BitSet, long type for index, so the max of bit support is about : MAX_ARRAY_LENGTH x sizeof(long) x 8 = 137.438.953.472 (bit) ...

11. Best way to add (mask) bits from an int to a bitset?    forums.oracle.com

UPDATE: I just remembered a post by Baftos suggesting a custom bitoutputstream class. I could use that together with a ByteArrayOutputStream and double buffer my way through the data, avoiding the use of BitSet altogether. Still, if using BitSet is noticeably advantageous, and just for curiousity's sake I'm still interested in the answer to this question. Edited by: mzatanoskas on Mar ...

12. How to create a TreeSet?    forums.oracle.com