John Peterson wrote: > On Thu, Oct 16, 2008 at 3:09 PM, John Peterson <[EMAIL PROTECTED]> wrote: >> On Thu, Oct 16, 2008 at 2:38 PM, Derek Gaston <[EMAIL PROTECTED]> wrote: >>> Without providing the inverse maps the only thing I can think to do is loop >>> over the face maps that are there until you find the position holding the ID > > Or use std::find(). That way it will even look like fancy C++ ;-)
It doesn't count as an O(N^2) algorithm if you never have to explicitly type N, right? But seriously: use the convenient but unnecessarily-slightly-slow algorithm now, replace it with static inverse maps if benchmarking shows a problem. I suspect benchmarking will show that I/O is really slow, and I/O plus a couple redundant CPU cycles is equally really slow. --- Roy ------------------------------------------------------------------------- This SF.Net email is sponsored by the Moblin Your Move Developer's challenge Build the coolest Linux based applications with Moblin SDK & win great prizes Grand prize is a trip for two to an Open Source event anywhere in the world http://moblin-contest.org/redirect.php?banner_id=100&url=/ _______________________________________________ Libmesh-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/libmesh-devel
