On Wed, Nov 5, 2008 at 2:38 PM, Joaquin M Lopez Munoz
Oh, sorry, I didn't understand your scenario at first. I thought you have one container with millions of elements, when what you have is millions of containers with a few elements (22) each. Is that right?
Yes exactly, sorry I wasn't clear.
Absolutely, just add some prime which is roughly 53/2, say 23. I'm sorry this is forcing you to change B.MI source code. Please report back whether this improves things.
I was trying this as you responded. I tried 23 and things improved greatly. It now uses less memory than std::map (as you suspected) by about 1%, or 1.2MB in my small graph test case. This will go up to about 120MB in my large graph test case, so that's very helpful. For more gains over std::map - Graph load times decreased by 3.4%. Graph search time decreased by 17%. Graph save times decreased by 14%. By the way, I've always been impressed by how quickly you respond on these mailing lists in the past. You continue to impress ;) Thanks, --Michael Fawcett