Databases
StackOverflow2013
Postsdbo
POHigh performing set like data structure for array of ints for java
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POHigh performing set like data structure for array of ints for java
    primarykey
    data
    text
    <p>I'm looking for a high performing data structure that behaves like a set and where the elements will always be an array of ints. The data structure only needs to fulfill this interface:</p> <pre><code>trait SetX { def size:Int def add(element:Array[Int]) def toArray:Array[Array[Int]] } </code></pre> <p>The set should not contain duplicates and this could be achieved using Arrays.equals(int[] a, int[] a2) - i.e. the values of the arrays can't be the same.</p> <p>Before creating it I have a rough idea of how many elements there will be but need resizing behaviour in case there are more than initially thought. The elements will always be the same length and I know what that is at the time of creation. </p> <p>Of course I could use a Java HashSet (wrapping the arrays of course) but this is being used in a tight loop and it is too slow. I've looked at Trove and that works nicely (by using arrays but providing a TObjectHashingStrategy) but I was hoping that since my requirements are so specific there might be a quicker/more efficient way to do this.</p> <p>Has anyone ever come across this or have an idea how I could accomplish this? </p> <p>The trait above is Scala but I'm very happy with Java libs or code.</p> <hr> <p>I should really say what I am doing. I am basically generating a large number of int arrays in a tight loop and at the end of it I just want to see the unique ones. I never have to remove elements from the set or anything else. Just add lots of int arrays to the set and at the end get out the unique ones.</p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USJohan
    1. USBoomah
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POHigh performing set like data structure for array of ints for java
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POHigh performing set like data structure for array of ints for java
      1. USom-nom-nom
      1. VTFavorite
    3. VO
      singulars
      1. POHigh performing set like data structure for array of ints for java
      1. USmaaartinus
      1. VTFavorite
    1. CODo you need value or reference semantics? That is, if two different arrays with the numbers in the same order are always equal, or if they have to be the same object.
      singulars
      1. POHigh performing set like data structure for array of ints for java
      1. USJoni
    2. COThe interface contract is underspecified. Do you really mean to say that if you call `add()` with a given `Array[Int]` you want to ensure that no other member contains an array with the same integers in the same order? If you don't care about duplicates, then a `Set` is not the right data structure. A simple `List` will suffice.
      singulars
      1. POHigh performing set like data structure for array of ints for java
      1. USJim Garrison
    3. COYes it's also unclear if he wants a set of sets and thus the array order and duplicates would/should not matter.
      singulars
      1. POHigh performing set like data structure for array of ints for java
      1. USAdam Gent
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload