> You are quite correct about this. I ran our memory logger to compare the > size of memory of a map<int,int> and a vector of pair<int,int>, both with 8M > elements. The results were pretty striking
Wow, sounds like we need a MaplikeVector<> to borrow Roy's terminology from the ParallelMesh stuff. Something that supports foo.insert(key,value); foo.sort() val = foo[key]; // where we assert we've been sorted I'll see if I can get one started in include/utils. Presumably that would be of interest to Moose as well, no? -Ben ------------------------------------------------------------------------------ Android is increasing in popularity, but the open development platform that developers love is also attractive to malware creators. Download this white paper to learn more about secure code signing practices that can help keep Android apps secure. http://pubads.g.doubleclick.net/gampad/clk?id=65839951&iu=/4140/ostg.clktrk _______________________________________________ Libmesh-devel mailing list Libmesh-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/libmesh-devel
