Hi Sophie, What you're describing is odd and while the hash set is allocated with a fixed small size initially, it's resized as you add more elements. Can you please post the full stack trace of the exception?
On Tue, May 21, 2013 at 12:35 PM, Sophie Sperner <[email protected]>wrote: > Dear all, > > After a while of debugging I understand that 3 elements were added fine, > but when adding the fourth one it does not crash but says > "com.sun.jdi.InvocationException occurred invoking method." So a table > (hashtable?) of fixed size is created. Why that's happening? > > > > On 21 May 2013 10:18, Sophie Sperner <[email protected]> wrote: > > > Dear all, > > > > May i ask please about usage a bit here? > > > > Previously I had: > > > > import com.carrotsearch.hppc.IntSet; > > import com.carrotsearch.hppc.IntOpenHashSet; > > IntSet columnValues = new IntOpenHashSet(); > > for loop (...) { > > if (columnValues.contains(x)) continue; > > ... > > columnValues.add(x); > > } > > > > It worked well. Now I changed: > > > > import org.apache.mahout.math.set.AbstractIntSet; > > import org.apache.mahout.math.set.OpenIntHashSet; > > AbstractIntSet columnValues = new OpenIntHashSet(); > > for loop (...) { > > if (columnValues.contains(x)) continue; > > ... > > columnValues.add(x); > > } > > > > And it works for up to 5 added elements and then hangs on forever. I'm > > sorry, how correctly should I use a simple integer hashset here? I guess > > something wrong in initialization step. Unfortunately in javadoc there is > > no explanation on how to use your classes so I'm asking here. > > > > Thank you and have a nice day! > > > > > > On 20 May 2013 14:23, Suneel Marthi <[email protected]> wrote: > > > >> > >> > >> > >> > >> ________________________________ > >> From: Sophie Sperner <[email protected]> > >> To: [email protected] > >> Sent: Monday, May 20, 2013 6:01 AM > >> Subject: Re: mahout colt collections > >> > >> > >> Dear all, > >> > >> > >> > Can you say a bit more about what you want to do? > >> > > >> > >> I have an algorithm that finds infrequent patterns in a matrix. I use > hppc > >> libraries to store various data needed to traverse the search space or > >> store found patterns. I want to convert it to the same one but with > mahout > >> collections used instead of hppc. Very simple. > >> > >> To Dawid: I commented all such things: new HashMap(n, 1) so the map is > not > >> instantiated with highest load but it can indeed have lots of elements > >> inside. To be honest I do not know where the bug is at the moment, but I > >> think somewhere in a structure of your library (maybe it's not a bug and > >> weird behaviour). At the moment interesting to convert to mahout to see > if > >> the bug remains. If yes, then I have to debug it. > >> > >> To Stevo: Thank you, I found docs by other link, no problem. Can I > please > >> ask one more simple question: what is the difference between > >> mahout-math-0.7.jar and mahout-math-0.7-sources.jar . I mean which jar > lib > >> I should add to my project? > >> > >> mahout-math-x.jar is the compiled one. > >> > >> mahout-math-x-sources.jar has the source code. > >> > >> For execution u only need mahout-math-x.jar. > >> > >> > >> Wish you all the best :) > >> > >> -- > >> Yours, > >> Sophie > >> > > > > > > > > -- > > Yours, > > Sophie > > > > > > -- > Yours, > Sophie >
