WeakHashSet: replace WeakHashMap by a structure that takes less memory.

Beedraz / recovered-from-google-code

Automatically exported from code.google.com/p/beedraz

0 stars 0 forks source link

WeakHashSet: replace WeakHashMap by a structure that takes less memory. #23

Closed GoogleCodeExporter closed 8 years ago

GoogleCodeExporter commented 8 years ago

While profiling the memory use of the qBasePlus program, we discovered that
WeakHashSet has, by far, the most live instances (25.494, while    
AbstractDependentBeed$1 has 6.031,00 instances).

Conclusion: trying to reduce the memory use of WeakHashSet is meaningful.

Original issue reported on code.google.com by nelesmee...@gmail.com on 15 May 2007 at 9:46

GoogleCodeExporter commented 8 years ago

Original comment by nelesmee...@gmail.com on 15 May 2007 at 9:47

GoogleCodeExporter commented 8 years ago

Original comment by nelesmee...@gmail.com on 15 May 2007 at 9:47

Added labels: Type-Enhancement
Removed labels: Type-Defect

GoogleCodeExporter commented 8 years ago

First version of memory efficient weak hash set added. Tests that exists are 
GREEN, but there is no specific test 
for this class. THERE WILL BE ERRORS HERE, I'm sure, but for now, it seems to 
work.

TODO: write good unit test (for Set, and extension for Weakness)

Original comment by jandockx on 15 May 2007 at 5:05

Changed state: Started
Added labels: Priority-High
Removed labels: Priority-Medium

GoogleCodeExporter commented 8 years ago

Some more ideas on memory efficiency are implemented in AbstractBeed and 
AbstractUpdateSource.

Original comment by jandockx on 16 May 2007 at 8:10

GoogleCodeExporter commented 8 years ago

Original comment by jandockx on 25 May 2007 at 11:27

Changed state: Fixed