On Wed, 10 Jul 2013, Derek Gaston wrote:
> Wait - I see what you're asking... In that case you're one step ahead of me. ;-) I'm mostly just trying to see if I understand your problem and your proposal. But I am also trying to see if there are less intrusive ways to manage the same effect. If you have to do a hash map anyway, could you index by point for nodes and by a std::pair of elem->point(0) and elem->point(1) for elements? Or does this need to work in the moving mesh case too? I admit, it would be nice to have a way to prevent the trickier FE types (those which choose basis sign based on some global ordering of points) from breaking when the mesh gets distorted. I'd rather avoid adding a mandatory extra 8 bytes to every DofObject, but I don't see any insuperable obstacle to adding an optional 8 bytes; this could even be run-time optional since we already have to have that variable-size _idx_buf in there. The only practical obstacle is that the _idx_buf code is *already* scary complicated. --- Roy ------------------------------------------------------------------------------ See everything from the browser to the database with AppDynamics Get end-to-end visibility with application monitoring from AppDynamics Isolate bottlenecks and diagnose root cause in seconds. Start your free trial of AppDynamics Pro today! http://pubads.g.doubleclick.net/gampad/clk?id=48808831&iu=/4140/ostg.clktrk _______________________________________________ Libmesh-devel mailing list Libmesh-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/libmesh-devel
