On Mon, 2 Jun 2008, Roy Stogner wrote: > On Mon, 2 Jun 2008, Martin Luethi wrote: > >> Benjamin Kirk writes: >>>> Making the "bins" larger would just make the problem less likely to >>>> trigger. Using our old keys (based on pointer values) would fail on >>>> a ParallelMesh. Searching all neighboring bin keys would make >>>> LocationMap::find() take 3^d times longer, but that's the best fix I >>>> can think of. Anyone else have any suggestions before I get to it? > > On second glance, it might not be so bad. I've written the code to > check the central bin key before looking at any adjacent keys, which > means it'll only take 27 times longer 0.001% (or whatever) of the > time.
On third glance, this will still slow down failed lookups, each time a new node is created for the first time and isn't in the lookup table... but better to have correct code than fast incorrect code; it's in SVN now. --- Roy ------------------------------------------------------------------------- This SF.net email is sponsored by: Microsoft Defy all challenges. Microsoft(R) Visual Studio 2008. http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/ _______________________________________________ Libmesh-users mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/libmesh-users
