Menu
▾
▴
trove4j-tracker — defect tracking list
You can subscribe to this list here.
| 2007 |
Jan
|
Feb
|
Mar
|
Apr
(2) |
May
(1) |
Jun
(10) |
Jul
(17) |
Aug
(6) |
Sep
(2) |
Oct
(4) |
Nov
(5) |
Dec
(7) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2008 |
Jan
|
Feb
|
Mar
(2) |
Apr
(11) |
May
(19) |
Jun
(4) |
Jul
(12) |
Aug
(16) |
Sep
(10) |
Oct
(28) |
Nov
(21) |
Dec
(12) |
| 2009 |
Jan
(3) |
Feb
(7) |
Mar
(24) |
Apr
(1) |
May
|
Jun
(5) |
Jul
(6) |
Aug
(3) |
Sep
(10) |
Oct
(5) |
Nov
(13) |
Dec
|
| 2010 |
Jan
(3) |
Feb
(18) |
Mar
(10) |
Apr
(4) |
May
|
Jun
(4) |
Jul
(2) |
Aug
(4) |
Sep
(19) |
Oct
(1) |
Nov
|
Dec
(1) |
| 2011 |
Jan
(11) |
Feb
(6) |
Mar
(29) |
Apr
|
May
|
Jun
(8) |
Jul
(13) |
Aug
(6) |
Sep
(11) |
Oct
(25) |
Nov
(40) |
Dec
(14) |
| 2012 |
Jan
(19) |
Feb
(4) |
Mar
(4) |
Apr
(2) |
May
(2) |
Jun
(4) |
Jul
(1) |
Aug
(10) |
Sep
(2) |
Oct
|
Nov
|
Dec
|
|
From: SourceForge.net <no...@so...> - 2012-09-06 21:43:33
|
Feature Requests item #1631704, was opened at 2007-01-09 10:05 Message generated for change (Comment added) made by robeden You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424685&aid=1631704&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: Research Status: Open Priority: 4 Private: No Submitted By: Jean-Daniel Fekete (jdfekte) Assigned to: Rob Eden (robeden) Summary: support Sorted{Set,Map}s Initial Comment: Are SortedSets and Maps for primitive types planned for a futur version? I would be interested to have them for my InfoVis Toolkit (ivtk.sourceforge.net). ---------------------------------------------------------------------- >Comment By: Rob Eden (robeden) Date: 2012-09-06 14:43 Message: Nothing to report. Still an open feature request. ---------------------------------------------------------------------- Comment By: Adnan Memon (amemon1) Date: 2012-09-03 23:08 Message: Any updates on this? Do we have one in 3.x version of Trove? ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2008-12-30 11:08 Message: I'm going to try to do some playing around to see if I can make this perform well. ---------------------------------------------------------------------- Comment By: Jean-Daniel Fekete (jdfekte) Date: 2007-01-10 14:02 Message: Logged In: YES user_id=1042961 Originator: YES A Toolkit for Information Visualization has to maintain data structures in memory to allow for fast display and filtering. You can think of it as an in-memory database, except that the tables are column-oriented instead of row-oriented because adding a new column (attribute) is frequent. Just like databases, I need to maintain indexes on the contents of my columns. Since range queries are very important, having a sorted indexing is very important too. Java red-black trees are almost ok except they don't support duplicate keys and they use objects as keys, not primitive types. As you write, not much speedup could be expected but completeness is important I think. Otherwise, I'd have to do it by myself. The prefuse toolkit implemented some of it too (prefuse.sf.net in the utils.collections package) so it really seems useful for lots of people. ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2007-01-10 13:52 Message: Logged In: YES user_id=888530 Originator: NO I don't think the performance of these would be all that great because a good deal of array manipulation would have to take place is we implemented it in a similar manner to the current sets/maps. However, memory usage would be better because you wouldn't need all the primitive container objects. Would this fit your purposes? I'm hesitant because Trove is supposed to be "*High performance* collections", but this is a frequent request, so I'll think about it, if people aren't expecting it to be a lot faster. It's hard to beat a linked list for sorted structures... but the current method is much nicer on the garbage collector. Anyway... maybe if you could talk about your goals for such a structure more it would be helpful. ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2007-01-10 13:05 Message: Logged In: YES user_id=888530 Originator: NO Moving to feature requests. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424685&aid=1631704&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-09-04 06:08:34
|
Feature Requests item #1631704, was opened at 2007-01-09 10:05 Message generated for change (Comment added) made by You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424685&aid=1631704&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: Research Status: Open Priority: 4 Private: No Submitted By: Jean-Daniel Fekete (jdfekte) Assigned to: Rob Eden (robeden) Summary: support Sorted{Set,Map}s Initial Comment: Are SortedSets and Maps for primitive types planned for a futur version? I would be interested to have them for my InfoVis Toolkit (ivtk.sourceforge.net). ---------------------------------------------------------------------- Comment By: https://www.google.com/accounts () Date: 2012-09-03 23:08 Message: Any updates on this? Do we have one in 3.x version of Trove? ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2008-12-30 11:08 Message: I'm going to try to do some playing around to see if I can make this perform well. ---------------------------------------------------------------------- Comment By: Jean-Daniel Fekete (jdfekte) Date: 2007-01-10 14:02 Message: Logged In: YES user_id=1042961 Originator: YES A Toolkit for Information Visualization has to maintain data structures in memory to allow for fast display and filtering. You can think of it as an in-memory database, except that the tables are column-oriented instead of row-oriented because adding a new column (attribute) is frequent. Just like databases, I need to maintain indexes on the contents of my columns. Since range queries are very important, having a sorted indexing is very important too. Java red-black trees are almost ok except they don't support duplicate keys and they use objects as keys, not primitive types. As you write, not much speedup could be expected but completeness is important I think. Otherwise, I'd have to do it by myself. The prefuse toolkit implemented some of it too (prefuse.sf.net in the utils.collections package) so it really seems useful for lots of people. ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2007-01-10 13:52 Message: Logged In: YES user_id=888530 Originator: NO I don't think the performance of these would be all that great because a good deal of array manipulation would have to take place is we implemented it in a similar manner to the current sets/maps. However, memory usage would be better because you wouldn't need all the primitive container objects. Would this fit your purposes? I'm hesitant because Trove is supposed to be "*High performance* collections", but this is a frequent request, so I'll think about it, if people aren't expecting it to be a lot faster. It's hard to beat a linked list for sorted structures... but the current method is much nicer on the garbage collector. Anyway... maybe if you could talk about your goals for such a structure more it would be helpful. ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2007-01-10 13:05 Message: Logged In: YES user_id=888530 Originator: NO Moving to feature requests. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424685&aid=1631704&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-08-27 13:56:59
|
Bugs item #3408867, was opened at 2011-09-13 12:20 Message generated for change (Settings changed) made by robeden You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3408867&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: Correctness Group: Next Minor Release >Status: Closed Resolution: None Priority: 5 Private: No Submitted By: https://www.google.com/accounts () Assigned to: Rob Eden (robeden) Summary: TCustomHashMap equals ClassCastException Initial Comment: The following code is a minimal test case that illustrates the problem. ----- package com.jt.jtp; import gnu.trove.map.hash.TCustomHashMap; import gnu.trove.strategy.HashingStrategy; import java.util.ArrayList; import java.util.Arrays; import java.util.List; import java.util.Random; public class TroveBug { private static byte[] random(int n, Random rnd) { byte[] ba = new byte[n]; for (int i = 0; i < ba.length; i++) { ba[i] = (byte)rnd.nextInt(); } return ba; } private static class ByteArrayStrategy implements HashingStrategy<byte[]> { // Copied from Arrays.hashCode, but applied only to the first four bytes @Override public int computeHashCode(byte[] bytes) { if (bytes == null) return 0; int h = 1; for (int i = 0; i < 4; i++) h = 31 * h + bytes[i]; return h; } @Override public boolean equals(byte[] o1, byte[] o2) { return Arrays.equals(o1, o2); } } public static void main(String[] args) { Random rnd = new Random(1234); TCustomHashMap<byte[], Integer> map = new TCustomHashMap<byte[], Integer>(new ByteArrayStrategy()); List<byte[]> list = new ArrayList<byte[]>(); for (int i = 0; i < 1000; i++) { byte[] ba = random(16, rnd); list.add(ba); map.put(ba, new Integer(i)); } for (int i = 0; i < 1000; i++) { map.remove(list.get(i)); } // Print all nulls! for (int i = 0; i < 1000; i++) { System.out.println(map.get(list.get(i))); } } } ---------------------------------------------------------------------- Comment By: Nobody/Anonymous (nobody) Date: 2012-08-23 22:44 Message: Im not that much of a internet reader to be honest but your sites really nice, keep it up! I'll go ahead and bookmark your website to come back later on. Many thanks http://www.bestdenalijackets4u.com/ ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2011-10-06 21:44 Message: This bug is being put into "pending" status. It will automatically be closed in 14 days in no further action is taken. Please make a comment if you believe the bug to still be relevant. ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2011-10-06 21:44 Message: I guess I don't see the bug. It should print nulls at the end because the elements are being removed from the map in the for loop prior to the println's. I've added the test TCusomtHashMap.testBug4706479() to test all my expectations for this case. ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2011-09-13 12:21 Message: Looking into this... Associated forum topic: https://sourceforge.net/projects/trove4j/forums/forum/121845/topic/4706479 ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3408867&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-08-24 05:44:21
|
Bugs item #3408867, was opened at 2011-09-13 12:20 Message generated for change (Comment added) made by nobody You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3408867&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: Correctness Group: Next Minor Release Status: Pending Resolution: None Priority: 5 Private: No Submitted By: https://www.google.com/accounts () Assigned to: Rob Eden (robeden) Summary: TCustomHashMap equals ClassCastException Initial Comment: The following code is a minimal test case that illustrates the problem. ----- package com.jt.jtp; import gnu.trove.map.hash.TCustomHashMap; import gnu.trove.strategy.HashingStrategy; import java.util.ArrayList; import java.util.Arrays; import java.util.List; import java.util.Random; public class TroveBug { private static byte[] random(int n, Random rnd) { byte[] ba = new byte[n]; for (int i = 0; i < ba.length; i++) { ba[i] = (byte)rnd.nextInt(); } return ba; } private static class ByteArrayStrategy implements HashingStrategy<byte[]> { // Copied from Arrays.hashCode, but applied only to the first four bytes @Override public int computeHashCode(byte[] bytes) { if (bytes == null) return 0; int h = 1; for (int i = 0; i < 4; i++) h = 31 * h + bytes[i]; return h; } @Override public boolean equals(byte[] o1, byte[] o2) { return Arrays.equals(o1, o2); } } public static void main(String[] args) { Random rnd = new Random(1234); TCustomHashMap<byte[], Integer> map = new TCustomHashMap<byte[], Integer>(new ByteArrayStrategy()); List<byte[]> list = new ArrayList<byte[]>(); for (int i = 0; i < 1000; i++) { byte[] ba = random(16, rnd); list.add(ba); map.put(ba, new Integer(i)); } for (int i = 0; i < 1000; i++) { map.remove(list.get(i)); } // Print all nulls! for (int i = 0; i < 1000; i++) { System.out.println(map.get(list.get(i))); } } } ---------------------------------------------------------------------- Comment By: Nobody/Anonymous (nobody) Date: 2012-08-23 22:44 Message: Im not that much of a internet reader to be honest but your sites really nice, keep it up! I'll go ahead and bookmark your website to come back later on. Many thanks http://www.bestdenalijackets4u.com/ ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2011-10-06 21:44 Message: This bug is being put into "pending" status. It will automatically be closed in 14 days in no further action is taken. Please make a comment if you believe the bug to still be relevant. ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2011-10-06 21:44 Message: I guess I don't see the bug. It should print nulls at the end because the elements are being removed from the map in the for loop prior to the println's. I've added the test TCusomtHashMap.testBug4706479() to test all my expectations for this case. ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2011-09-13 12:21 Message: Looking into this... Associated forum topic: https://sourceforge.net/projects/trove4j/forums/forum/121845/topic/4706479 ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3408867&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-08-22 20:03:24
|
Bugs item #3408867, was opened at 2011-09-13 12:20 Message generated for change (Comment added) made by nobody You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3408867&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: Correctness Group: Next Minor Release Status: Pending Resolution: None Priority: 5 Private: No Submitted By: https://www.google.com/accounts () Assigned to: Rob Eden (robeden) Summary: TCustomHashMap equals ClassCastException Initial Comment: The following code is a minimal test case that illustrates the problem. ----- package com.jt.jtp; import gnu.trove.map.hash.TCustomHashMap; import gnu.trove.strategy.HashingStrategy; import java.util.ArrayList; import java.util.Arrays; import java.util.List; import java.util.Random; public class TroveBug { private static byte[] random(int n, Random rnd) { byte[] ba = new byte[n]; for (int i = 0; i < ba.length; i++) { ba[i] = (byte)rnd.nextInt(); } return ba; } private static class ByteArrayStrategy implements HashingStrategy<byte[]> { // Copied from Arrays.hashCode, but applied only to the first four bytes @Override public int computeHashCode(byte[] bytes) { if (bytes == null) return 0; int h = 1; for (int i = 0; i < 4; i++) h = 31 * h + bytes[i]; return h; } @Override public boolean equals(byte[] o1, byte[] o2) { return Arrays.equals(o1, o2); } } public static void main(String[] args) { Random rnd = new Random(1234); TCustomHashMap<byte[], Integer> map = new TCustomHashMap<byte[], Integer>(new ByteArrayStrategy()); List<byte[]> list = new ArrayList<byte[]>(); for (int i = 0; i < 1000; i++) { byte[] ba = random(16, rnd); list.add(ba); map.put(ba, new Integer(i)); } for (int i = 0; i < 1000; i++) { map.remove(list.get(i)); } // Print all nulls! for (int i = 0; i < 1000; i++) { System.out.println(map.get(list.get(i))); } } } ---------------------------------------------------------------------- Comment By: Nobody/Anonymous (nobody) Date: 2012-08-22 13:03 Message: Hi! Do you know if they make any plugins to help with Search Engine Optimization? I'm trying to get my blog to rank for some targeted keywords but I'm not seeing very good success. If you know of any please share. Kudos! http://www.goodwinterjacketsforwomen.us/ ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2011-10-06 21:44 Message: This bug is being put into "pending" status. It will automatically be closed in 14 days in no further action is taken. Please make a comment if you believe the bug to still be relevant. ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2011-10-06 21:44 Message: I guess I don't see the bug. It should print nulls at the end because the elements are being removed from the map in the for loop prior to the println's. I've added the test TCusomtHashMap.testBug4706479() to test all my expectations for this case. ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2011-09-13 12:21 Message: Looking into this... Associated forum topic: https://sourceforge.net/projects/trove4j/forums/forum/121845/topic/4706479 ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3408867&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-08-13 18:33:16
|
Bugs item #3556860, was opened at 2012-08-12 22:30 Message generated for change (Comment added) made by robeden You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3556860&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: API Group: Next Minor Release >Status: Closed >Resolution: Wont Fix Priority: 5 Private: No Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: values() is not Collection<T> Initial Comment: Typical usage of values() in the Java API for Map<K, V> is values() returns Collection<V>. In trove, values() returns Object[] which is really obnoxious to iterate. I don't mind if you provide this but if you could also provide the collection that would make a lot more sense. ---------------------------------------------------------------------- >Comment By: Rob Eden (robeden) Date: 2012-08-13 11:33 Message: Trove imitates the Collections API, but is not intended to be an exact copy (it can't be in many cases). From your description, I assume you're using something like a TIntObjectMap<T>. In this case, you will see two variations: - values() : returns Object[] - values( T[] ) : returns T[] I assume the difficulty iterating comes from needing to case the objects. In which case, you should use the second variation (just like toArray(...) in the Java Collections). Trove's primary purpose is speed and efficiency. Arrays are used in this case because it's the most efficient form and possible to use without memory allocation. Arrays are used throughout Trove, so this is pretty familiar if you use the library heavily. If you're looking more for compatibility with the Collection API and ease of use, take a look at the TDecorators class. That will let you wrap a Trove collection in a Collections interface so it works as you're used to (at a performance cost). ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3556860&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-08-13 05:30:07
|
Bugs item #3556860, was opened at 2012-08-12 22:30 Message generated for change (Tracker Item Submitted) made by nobody You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3556860&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: API Group: Next Minor Release Status: Open Resolution: None Priority: 5 Private: No Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: values() is not Collection<T> Initial Comment: Typical usage of values() in the Java API for Map<K, V> is values() returns Collection<V>. In trove, values() returns Object[] which is really obnoxious to iterate. I don't mind if you provide this but if you could also provide the collection that would make a lot more sense. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3556860&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-08-01 03:35:40
|
Bugs item #3552578, was opened at 2012-07-31 06:33 Message generated for change (Comment added) made by robeden You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3552578&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: Correctness Group: Next Minor Release Status: Closed Resolution: Fixed Priority: 8 Private: No Submitted By: Nobody/Anonymous (nobody) Assigned to: Rob Eden (robeden) Summary: TUnmodifiableIntList equals is broken Initial Comment: Reporting against trove4j 3.0.3 The following test fails: @Test public void testTrove() throws Exception { final TIntArrayList one = new TIntArrayList(new int[]{1, 2, 3, 4}); final TIntArrayList two = new TIntArrayList(new int[]{1, 2, 3, 4}); TIntList uOne = TCollections.unmodifiableList(one); TIntList uTwo = TCollections.unmodifiableList(two); Assert.assertTrue("Expecting one and two to be equal", one.equals(two)); Assert.assertTrue("Expecting uOne and uTwo to be equal", uOne.equals(uTwo)); } ---------------------------------------------------------------------- >Comment By: Rob Eden (robeden) Date: 2012-07-31 20:35 Message: I've released a build with this fix in the "trove experimental" area labeled "build-430 (3.0.4 pre1)": https://sourceforge.net/projects/trove4j/files/trove%20experimental/build-430%20%283.0.4%20pre1%29/ ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2012-07-31 20:14 Message: Fixed in svn change 224. Marked for release in 3.0.4 ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3552578&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-08-01 03:24:49
|
Bugs item #3484640, was opened at 2012-02-05 06:09 Message generated for change (Comment added) made by robeden You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3484640&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: Correctness Group: Next Minor Release >Status: Closed >Resolution: Works For Me Priority: 7 Private: No Submitted By: Nobody/Anonymous (nobody) Assigned to: Rob Eden (robeden) Summary: T#E#LinkedList NullPointerExecption when inserting(0, item) Initial Comment: When performing 'insert(0, item)' on an empty T#E#LinkedList, a NullPointerException is thrown. ---------------------------------------------------------------------- >Comment By: Rob Eden (robeden) Date: 2012-07-31 20:24 Message: Unable to replicate with the following unit test: protected TLinkedList<Data> list; public void setUp() throws Exception { list = new TLinkedList<Data>(); } public void testInsert_bug3484640() { list.insert( 0, new Data( 0 ) ); } ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3484640&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-08-01 03:17:26
|
Bugs item #3484640, was opened at 2012-02-05 06:09 Message generated for change (Settings changed) made by robeden You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3484640&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. >Category: Correctness >Group: Next Minor Release Status: Open Resolution: None >Priority: 7 Private: No Submitted By: Nobody/Anonymous (nobody) >Assigned to: Rob Eden (robeden) Summary: T#E#LinkedList NullPointerExecption when inserting(0, item) Initial Comment: When performing 'insert(0, item)' on an empty T#E#LinkedList, a NullPointerException is thrown. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3484640&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-08-01 03:14:25
|
Bugs item #3552578, was opened at 2012-07-31 06:33 Message generated for change (Comment added) made by robeden You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3552578&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: Correctness Group: Next Minor Release >Status: Closed >Resolution: Fixed Priority: 8 Private: No Submitted By: Nobody/Anonymous (nobody) Assigned to: Rob Eden (robeden) Summary: TUnmodifiableIntList equals is broken Initial Comment: Reporting against trove4j 3.0.3 The following test fails: @Test public void testTrove() throws Exception { final TIntArrayList one = new TIntArrayList(new int[]{1, 2, 3, 4}); final TIntArrayList two = new TIntArrayList(new int[]{1, 2, 3, 4}); TIntList uOne = TCollections.unmodifiableList(one); TIntList uTwo = TCollections.unmodifiableList(two); Assert.assertTrue("Expecting one and two to be equal", one.equals(two)); Assert.assertTrue("Expecting uOne and uTwo to be equal", uOne.equals(uTwo)); } ---------------------------------------------------------------------- >Comment By: Rob Eden (robeden) Date: 2012-07-31 20:14 Message: Fixed in svn change 224. Marked for release in 3.0.4 ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3552578&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-08-01 02:23:57
|
Bugs item #3552578, was opened at 2012-07-31 06:33 Message generated for change (Settings changed) made by robeden You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3552578&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. >Category: Correctness >Group: Next Minor Release Status: Open Resolution: None >Priority: 8 Private: No Submitted By: Nobody/Anonymous (nobody) >Assigned to: Rob Eden (robeden) Summary: TUnmodifiableIntList equals is broken Initial Comment: Reporting against trove4j 3.0.3 The following test fails: @Test public void testTrove() throws Exception { final TIntArrayList one = new TIntArrayList(new int[]{1, 2, 3, 4}); final TIntArrayList two = new TIntArrayList(new int[]{1, 2, 3, 4}); TIntList uOne = TCollections.unmodifiableList(one); TIntList uTwo = TCollections.unmodifiableList(two); Assert.assertTrue("Expecting one and two to be equal", one.equals(two)); Assert.assertTrue("Expecting uOne and uTwo to be equal", uOne.equals(uTwo)); } ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3552578&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-07-31 13:33:49
|
Bugs item #3552578, was opened at 2012-07-31 06:33 Message generated for change (Tracker Item Submitted) made by nobody You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3552578&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: API Group: None Status: Open Resolution: None Priority: 5 Private: No Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: TUnmodifiableIntList equals is broken Initial Comment: Reporting against trove4j 3.0.3 The following test fails: @Test public void testTrove() throws Exception { final TIntArrayList one = new TIntArrayList(new int[]{1, 2, 3, 4}); final TIntArrayList two = new TIntArrayList(new int[]{1, 2, 3, 4}); TIntList uOne = TCollections.unmodifiableList(one); TIntList uTwo = TCollections.unmodifiableList(two); Assert.assertTrue("Expecting one and two to be equal", one.equals(two)); Assert.assertTrue("Expecting uOne and uTwo to be equal", uOne.equals(uTwo)); } ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3552578&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-06-05 14:22:49
|
Bugs item #3531906, was opened at 2012-06-04 07:00 Message generated for change (Comment added) made by robeden You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3531906&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: Next Minor Release >Status: Closed Resolution: None Priority: 5 Private: No Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: ArrayIndexOutOfBoundsException in IndexHashed Initial Comment: Well in our project we use trove 3.0.2 for now and we got below AIOOB. If you need futher explaining regarding this I am willing to to do via email can email me at to...@bl... 02:31:58 [ERROR] Error on calculating rewards for Attackable Fervent Kanabion java.lang.ArrayIndexOutOfBoundsException: 88 at gnu.trove.impl.hash.TIntHash.indexRehashed(TIntHash.java:233) ~[trove-3.0.2.jar:3.0.2] at gnu.trove.impl.hash.TIntHash.index(TIntHash.java:219) ~[trove-3.0.2.jar:3.0.2] at gnu.trove.impl.hash.TIntHash.contains(TIntHash.java:163) ~[trove-3.0.2.jar:3.0.2] at gnu.trove.map.hash.TIntObjectHashMap.containsKey(TIntObjectHashMap.java:181) ~[trove-3.0.2.jar:3.0.2] at com.l2dc.gameserver.model.actor.knownlist.ObjectKnownList.knowsObject(ObjectKnownList.java:123) ~[l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Attackable.calculateRewards(L2Attackable.java:900) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Character.doDie(L2Character.java:2703) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Npc.doDie(L2Npc.java:1621) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Attackable.doDie(L2Attackable.java:650) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.instance.L2MonsterInstance.doDie(L2MonsterInstance.java:338) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.status.CharStatus.reduceHp(CharStatus.java:249) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.status.NpcStatus.reduceHp(NpcStatus.java:58) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.status.AttackableStatus.reduceHp(AttackableStatus.java:56) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Character.reduceCurrentHp(L2Character.java:9450) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Attackable.reduceCurrentHp(L2Attackable.java:612) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Attackable.reduceCurrentHp(L2Attackable.java:542) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.task.chartasks.HitTask.onHitTimer(HitTask.java:210) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.task.chartasks.HitTask.run(HitTask.java:66) [l2dcserver.jar:na] at com.l2dc.gameserver.ThreadPoolManager$RunnableWrapper.run(ThreadPoolManager.java:97) [l2dcserver.jar:na] at java.util.concurrent.Executors$RunnableAdapter.call(Executors.java:471) [na:1.7.0_04] at java.util.concurrent.FutureTask$Sync.innerRun(FutureTask.java:334) [na:1.7.0_04] at java.util.concurrent.FutureTask.run(FutureTask.java:166) [na:1.7.0_04] at java.util.concurrent.ScheduledThreadPoolExecutor$ScheduledFutureTask.access$201(ScheduledThreadPoolExecutor.java:178) [na:1.7.0_$ at java.util.concurrent.ScheduledThreadPoolExecutor$ScheduledFutureTask.run(ScheduledThreadPoolExecutor.java:292) [na:1.7.0_04] at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1110) [na:1.7.0_04] at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:603) [na:1.7.0_04] ---------------------------------------------------------------------- >Comment By: Rob Eden (robeden) Date: 2012-06-05 07:22 Message: This was a usage problem. ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2012-06-04 15:05 Message: Sent this email: -------------------------- Hello - In regard to your bug (quoted below), I'll need more information regarding the environment and a test case would be very helpful. Does this error happen all the time? Frequently? Rarely? etc... I can say that I exercise this code often without issue. The most likely cause of this error is generally that it's being done in a threaded environment without adequate thread safety. Try wrapping the maps in TCollections.synchronizedMap(...) and see if that helps. For now the bug will be put into PENDING state and will automatically close if no further comments are made within 10 days. Please reply to this email or comment on the bug with additional details. Thanks! Rob -------------------------- Putting bug into PENDING state. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3531906&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-06-04 22:05:40
|
Bugs item #3531906, was opened at 2012-06-04 07:00 Message generated for change (Comment added) made by robeden You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3531906&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: Next Minor Release >Status: Pending Resolution: None Priority: 5 Private: No Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: ArrayIndexOutOfBoundsException in IndexHashed Initial Comment: Well in our project we use trove 3.0.2 for now and we got below AIOOB. If you need futher explaining regarding this I am willing to to do via email can email me at to...@bl... 02:31:58 [ERROR] Error on calculating rewards for Attackable Fervent Kanabion java.lang.ArrayIndexOutOfBoundsException: 88 at gnu.trove.impl.hash.TIntHash.indexRehashed(TIntHash.java:233) ~[trove-3.0.2.jar:3.0.2] at gnu.trove.impl.hash.TIntHash.index(TIntHash.java:219) ~[trove-3.0.2.jar:3.0.2] at gnu.trove.impl.hash.TIntHash.contains(TIntHash.java:163) ~[trove-3.0.2.jar:3.0.2] at gnu.trove.map.hash.TIntObjectHashMap.containsKey(TIntObjectHashMap.java:181) ~[trove-3.0.2.jar:3.0.2] at com.l2dc.gameserver.model.actor.knownlist.ObjectKnownList.knowsObject(ObjectKnownList.java:123) ~[l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Attackable.calculateRewards(L2Attackable.java:900) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Character.doDie(L2Character.java:2703) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Npc.doDie(L2Npc.java:1621) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Attackable.doDie(L2Attackable.java:650) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.instance.L2MonsterInstance.doDie(L2MonsterInstance.java:338) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.status.CharStatus.reduceHp(CharStatus.java:249) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.status.NpcStatus.reduceHp(NpcStatus.java:58) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.status.AttackableStatus.reduceHp(AttackableStatus.java:56) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Character.reduceCurrentHp(L2Character.java:9450) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Attackable.reduceCurrentHp(L2Attackable.java:612) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Attackable.reduceCurrentHp(L2Attackable.java:542) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.task.chartasks.HitTask.onHitTimer(HitTask.java:210) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.task.chartasks.HitTask.run(HitTask.java:66) [l2dcserver.jar:na] at com.l2dc.gameserver.ThreadPoolManager$RunnableWrapper.run(ThreadPoolManager.java:97) [l2dcserver.jar:na] at java.util.concurrent.Executors$RunnableAdapter.call(Executors.java:471) [na:1.7.0_04] at java.util.concurrent.FutureTask$Sync.innerRun(FutureTask.java:334) [na:1.7.0_04] at java.util.concurrent.FutureTask.run(FutureTask.java:166) [na:1.7.0_04] at java.util.concurrent.ScheduledThreadPoolExecutor$ScheduledFutureTask.access$201(ScheduledThreadPoolExecutor.java:178) [na:1.7.0_$ at java.util.concurrent.ScheduledThreadPoolExecutor$ScheduledFutureTask.run(ScheduledThreadPoolExecutor.java:292) [na:1.7.0_04] at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1110) [na:1.7.0_04] at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:603) [na:1.7.0_04] ---------------------------------------------------------------------- >Comment By: Rob Eden (robeden) Date: 2012-06-04 15:05 Message: Sent this email: -------------------------- Hello - In regard to your bug (quoted below), I'll need more information regarding the environment and a test case would be very helpful. Does this error happen all the time? Frequently? Rarely? etc... I can say that I exercise this code often without issue. The most likely cause of this error is generally that it's being done in a threaded environment without adequate thread safety. Try wrapping the maps in TCollections.synchronizedMap(...) and see if that helps. For now the bug will be put into PENDING state and will automatically close if no further comments are made within 10 days. Please reply to this email or comment on the bug with additional details. Thanks! Rob -------------------------- Putting bug into PENDING state. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3531906&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-06-04 14:00:30
|
Bugs item #3531906, was opened at 2012-06-04 07:00 Message generated for change (Tracker Item Submitted) made by nobody You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3531906&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: Next Minor Release Status: Open Resolution: None Priority: 5 Private: No Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: ArrayIndexOutOfBoundsException in IndexHashed Initial Comment: Well in our project we use trove 3.0.2 for now and we got below AIOOB. If you need futher explaining regarding this I am willing to to do via email can email me at to...@bl... 02:31:58 [ERROR] Error on calculating rewards for Attackable Fervent Kanabion java.lang.ArrayIndexOutOfBoundsException: 88 at gnu.trove.impl.hash.TIntHash.indexRehashed(TIntHash.java:233) ~[trove-3.0.2.jar:3.0.2] at gnu.trove.impl.hash.TIntHash.index(TIntHash.java:219) ~[trove-3.0.2.jar:3.0.2] at gnu.trove.impl.hash.TIntHash.contains(TIntHash.java:163) ~[trove-3.0.2.jar:3.0.2] at gnu.trove.map.hash.TIntObjectHashMap.containsKey(TIntObjectHashMap.java:181) ~[trove-3.0.2.jar:3.0.2] at com.l2dc.gameserver.model.actor.knownlist.ObjectKnownList.knowsObject(ObjectKnownList.java:123) ~[l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Attackable.calculateRewards(L2Attackable.java:900) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Character.doDie(L2Character.java:2703) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Npc.doDie(L2Npc.java:1621) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Attackable.doDie(L2Attackable.java:650) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.instance.L2MonsterInstance.doDie(L2MonsterInstance.java:338) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.status.CharStatus.reduceHp(CharStatus.java:249) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.status.NpcStatus.reduceHp(NpcStatus.java:58) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.status.AttackableStatus.reduceHp(AttackableStatus.java:56) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Character.reduceCurrentHp(L2Character.java:9450) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Attackable.reduceCurrentHp(L2Attackable.java:612) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.L2Attackable.reduceCurrentHp(L2Attackable.java:542) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.task.chartasks.HitTask.onHitTimer(HitTask.java:210) [l2dcserver.jar:na] at com.l2dc.gameserver.model.actor.task.chartasks.HitTask.run(HitTask.java:66) [l2dcserver.jar:na] at com.l2dc.gameserver.ThreadPoolManager$RunnableWrapper.run(ThreadPoolManager.java:97) [l2dcserver.jar:na] at java.util.concurrent.Executors$RunnableAdapter.call(Executors.java:471) [na:1.7.0_04] at java.util.concurrent.FutureTask$Sync.innerRun(FutureTask.java:334) [na:1.7.0_04] at java.util.concurrent.FutureTask.run(FutureTask.java:166) [na:1.7.0_04] at java.util.concurrent.ScheduledThreadPoolExecutor$ScheduledFutureTask.access$201(ScheduledThreadPoolExecutor.java:178) [na:1.7.0_$ at java.util.concurrent.ScheduledThreadPoolExecutor$ScheduledFutureTask.run(ScheduledThreadPoolExecutor.java:292) [na:1.7.0_04] at java.util.concurrent.ThreadPoolExecutor.runWorker(ThreadPoolExecutor.java:1110) [na:1.7.0_04] at java.util.concurrent.ThreadPoolExecutor$Worker.run(ThreadPoolExecutor.java:603) [na:1.7.0_04] ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3531906&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-06-04 02:11:39
|
Patches item #3015507, was opened at 2010-06-13 08:40 Message generated for change (Comment added) made by robeden You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424684&aid=3015507&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: API Group: Next Major Release >Status: Pending Resolution: None Priority: 5 Private: No Submitted By: Jonathan Shore (tr8dr) Assigned to: Nobody/Anonymous (nobody) Summary: New Comparator API & Comparator based sorting Initial Comment: I've added Comparator templates and associated version of sort for lists. Allows the use of comparators where the default sort semantics is not sufficient. Test cases have been added as well. See patches. Unit test patches will be in next set. ---------------------------------------------------------------------- >Comment By: Rob Eden (robeden) Date: 2012-06-03 19:11 Message: Patch wasn't attached. Please comment within 10 days or record will be automatically closed. ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2010-09-27 20:23 Message: Your files didn't get attached to this request. Could you try again to attach them? ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424684&aid=3015507&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-05-01 23:01:19
|
Feature Requests item #3517066, was opened at 2012-04-11 18:54 Message generated for change (Comment added) made by robeden You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424685&aid=3517066&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: Misc Group: None Status: Closed Priority: 5 Private: No Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: Request for Apache Software License Initial Comment: It would be nice if Trove can provide a duel-license that incorporates 'Apache Software License'. Because LPGL has a controversial clause in section 6: see http://www.javalobby.org/java/forums/t15903.html, which makes it less favourable. Many Thanks Raymond. ---------------------------------------------------------------------- >Comment By: Rob Eden (robeden) Date: 2012-05-01 16:01 Message: One other comment: over the years I and other active contributors (Johan and Jeff) have replaced significant portions of the code. It's possible that we could someday rewrite the "encumbered" portions so we control copyright on all the code. I suppose it would be possible at that point. Realistically I'm not sure we'd get the time or will to do that, but it's possible. I haven't asked Johan about a license change, but I know Jeff and I would be in favor. ---------------------------------------------------------------------- Comment By: Rob Eden (robeden) Date: 2012-05-01 15:56 Message: Unfortunately we're unable to do this. In the past the original author has expressed a reluctance to allow a license change due to his own views and the inability to contact contributors to original code. So, we're basically encumbered at the moment. I can say that I very much disagree with the JavaLobby article. Their interpretation is pretty broken. You need to contribute changes you make to the LGPL library (and this can be upon request, though that's obviously less favorable), but nothing more. This is done by MANY companies. It would be a huge issue if their interpretation was correct. Trove is used in a lot of commercial software, as it should be. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424685&aid=3517066&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-05-01 22:56:06
|
Feature Requests item #3517066, was opened at 2012-04-11 18:54 Message generated for change (Comment added) made by robeden You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424685&aid=3517066&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: Misc Group: None >Status: Closed Priority: 5 Private: No Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: Request for Apache Software License Initial Comment: It would be nice if Trove can provide a duel-license that incorporates 'Apache Software License'. Because LPGL has a controversial clause in section 6: see http://www.javalobby.org/java/forums/t15903.html, which makes it less favourable. Many Thanks Raymond. ---------------------------------------------------------------------- >Comment By: Rob Eden (robeden) Date: 2012-05-01 15:56 Message: Unfortunately we're unable to do this. In the past the original author has expressed a reluctance to allow a license change due to his own views and the inability to contact contributors to original code. So, we're basically encumbered at the moment. I can say that I very much disagree with the JavaLobby article. Their interpretation is pretty broken. You need to contribute changes you make to the LGPL library (and this can be upon request, though that's obviously less favorable), but nothing more. This is done by MANY companies. It would be a huge issue if their interpretation was correct. Trove is used in a lot of commercial software, as it should be. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424685&aid=3517066&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-04-12 01:54:09
|
Feature Requests item #3517066, was opened at 2012-04-11 18:54 Message generated for change (Tracker Item Submitted) made by nobody You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424685&aid=3517066&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: Misc Group: None Status: Open Priority: 5 Private: No Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: Request for Apache Software License Initial Comment: It would be nice if Trove can provide a duel-license that incorporates 'Apache Software License'. Because LPGL has a controversial clause in section 6: see http://www.javalobby.org/java/forums/t15903.html, which makes it less favourable. Many Thanks Raymond. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424685&aid=3517066&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-04-11 21:33:02
|
Patches item #3517029, was opened at 2012-04-11 14:33 Message generated for change (Tracker Item Submitted) made by You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424684&aid=3517029&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: Correctness Group: None Status: Open Resolution: None Priority: 5 Private: No Submitted By: () Assigned to: Nobody/Anonymous (nobody) Summary: Fix for issue #3484640 Initial Comment: This diff is against the 3.0.2 released code. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424684&aid=3517029&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-03-21 06:10:37
|
Bugs item #3509424, was opened at 2012-03-20 09:42 Message generated for change (Comment added) made by robeden You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3509424&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: None Status: Closed Resolution: None Priority: 5 Private: No Submitted By: Fabrizio Pastore (fpastore) Assigned to: Johan Parent (jparent) Summary: TIntObjectHashMap initial capacity wrong Initial Comment: Hi, I noticed that the value passed to the initialCapacity attribute of TIntObjectHashMap constructor seems to not have any relationship with the value returned by method capacity(). Is this a bug or a feature? Following lines show a failing test case: TIntObjectHashMap tIntObjectHashMap0 = new TIntObjectHashMap(200, 2F, 300); assertEquals(200, tIntObjectHashMap0.capacity()); //this test fails, 137 is returned instead of 200 ---------------------------------------------------------------------- >Comment By: Rob Eden (robeden) Date: 2012-03-20 23:10 Message: I wish we had automatic test case generation as we do with the basic code. Our code coverage looks really pitiful because we tend to only cover specific types of collections (for example int maps). Would be nice to generate test cases for all collections to get at least basic coverage. ---------------------------------------------------------------------- Comment By: Johan Parent (jparent) Date: 2012-03-20 22:50 Message: Hi Fabrizio, This does not appear to be a bug in this case. The capacity (~size of the hash table) is always a prime in the trove implementation. The only garuantee is that capacity >= initial_capacity/load_factor. But this is not an obvious thing. Regards, Johan ---------------------------------------------------------------------- Comment By: Fabrizio Pastore (fpastore) Date: 2012-03-20 09:46 Message: I did not mention that I am using Trove as case study for a research purposes on automatic test cases generation. So thanks in advance for your reply. Fabrizio ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3509424&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-03-21 05:50:25
|
Bugs item #3509424, was opened at 2012-03-20 09:42 Message generated for change (Comment added) made by jparent You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3509424&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: None >Status: Closed Resolution: None Priority: 5 Private: No Submitted By: Fabrizio Pastore (fpastore) >Assigned to: Johan Parent (jparent) Summary: TIntObjectHashMap initial capacity wrong Initial Comment: Hi, I noticed that the value passed to the initialCapacity attribute of TIntObjectHashMap constructor seems to not have any relationship with the value returned by method capacity(). Is this a bug or a feature? Following lines show a failing test case: TIntObjectHashMap tIntObjectHashMap0 = new TIntObjectHashMap(200, 2F, 300); assertEquals(200, tIntObjectHashMap0.capacity()); //this test fails, 137 is returned instead of 200 ---------------------------------------------------------------------- >Comment By: Johan Parent (jparent) Date: 2012-03-20 22:50 Message: Hi Fabrizio, This does not appear to be a bug in this case. The capacity (~size of the hash table) is always a prime in the trove implementation. The only garuantee is that capacity >= initial_capacity/load_factor. But this is not an obvious thing. Regards, Johan ---------------------------------------------------------------------- Comment By: Fabrizio Pastore (fpastore) Date: 2012-03-20 09:46 Message: I did not mention that I am using Trove as case study for a research purposes on automatic test cases generation. So thanks in advance for your reply. Fabrizio ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3509424&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-03-20 16:46:45
|
Bugs item #3509424, was opened at 2012-03-20 09:42 Message generated for change (Comment added) made by fpastore You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3509424&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: None Status: Open Resolution: None Priority: 5 Private: No Submitted By: Fabrizio Pastore (fpastore) Assigned to: Nobody/Anonymous (nobody) Summary: TIntObjectHashMap initial capacity wrong Initial Comment: Hi, I noticed that the value passed to the initialCapacity attribute of TIntObjectHashMap constructor seems to not have any relationship with the value returned by method capacity(). Is this a bug or a feature? Following lines show a failing test case: TIntObjectHashMap tIntObjectHashMap0 = new TIntObjectHashMap(200, 2F, 300); assertEquals(200, tIntObjectHashMap0.capacity()); //this test fails, 137 is returned instead of 200 ---------------------------------------------------------------------- >Comment By: Fabrizio Pastore (fpastore) Date: 2012-03-20 09:46 Message: I did not mention that I am using Trove as case study for a research purposes on automatic test cases generation. So thanks in advance for your reply. Fabrizio ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3509424&group_id=39235 |
|
From: SourceForge.net <no...@so...> - 2012-03-20 16:42:03
|
Bugs item #3509424, was opened at 2012-03-20 09:42 Message generated for change (Tracker Item Submitted) made by fpastore You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3509424&group_id=39235 Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: None Group: None Status: Open Resolution: None Priority: 5 Private: No Submitted By: Fabrizio Pastore (fpastore) Assigned to: Nobody/Anonymous (nobody) Summary: TIntObjectHashMap initial capacity wrong Initial Comment: Hi, I noticed that the value passed to the initialCapacity attribute of TIntObjectHashMap constructor seems to not have any relationship with the value returned by method capacity(). Is this a bug or a feature? Following lines show a failing test case: TIntObjectHashMap tIntObjectHashMap0 = new TIntObjectHashMap(200, 2F, 300); assertEquals(200, tIntObjectHashMap0.capacity()); //this test fails, 137 is returned instead of 200 ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=424682&aid=3509424&group_id=39235 |
