-
Got it. This is somewhat more of a problem; I cannot remove a key and let that array slot be reused because of a race between writing a new key/value and an olde reader. I can completely kill slots, although is not efficient if the same key is inserted & removed repeatedly.
Cliff.
2009-08-14 05:32:50 UTC in Highly Scalable Java
-
No, I'm pretty sure the code is correct as-is. I'd be happy to look at a counter example if you have one.
Cliff.
2009-08-11 16:51:28 UTC in Highly Scalable Java
-
Keys & Values are not kept around after a remove; instead a Tombstone is inserted into the table. This will keep only the backing array 'full' until a resize, but it will not consume any other storage than the backing array. In particular, large things put in a Set and then removed will NOT be kept alive by the Set.
If you have a counter-example, please send it to me.
Cliff.
2009-08-11 16:48:41 UTC in Highly Scalable Java
-
Fix with 1.1.2
Thanks for the nice bug report.
Cliff.
2009-08-11 16:41:25 UTC in Highly Scalable Java
-
cliffclick made 1 file-release changes.
2009-08-11 16:40:02 UTC in Highly Scalable Java
-
cliffclick made 1 file-release changes.
2009-08-11 16:39:02 UTC in Highly Scalable Java
-
cliffclick committed patchset 76 of module high-scale-lib to the Highly Scalable Java CVS repository, changing 5 files.
2009-08-11 16:19:30 UTC in Highly Scalable Java
