Re: Complexity of new hardware
Mike Shaver <[email protected]>
| Newsgroups | gmane.games.devel.algorithms |
|---|---|
| Message-ID | <[email protected]> |
On Sat, Apr 18, 2009 at 10:27 AM, Jon Watte <[email protected]> wrote: > Yes; the only thing that is annoying is the repeating-yourself problem. > I find I usually need to repeat myself one and a half time. > First, it's the declaration. > Then, it's the repeat of the declaration, in macro form. > Finally, it's some small bits of macro that builds the > helpers/visitors/registration needed to make it all "go." With a full C++ parser available, you could generate a lot of that from just the declaration, right? https://developer.mozilla.org/en/Dehydra Requires a GCC plugin, so the code you want to scan has to be compilable by GCC, but that's not a very large burden considering the benefits you get. We use Dehydra analyses to ensure that certain classes are only ever allocated on the stack, and to ensure that certain transitive invariants hold (like locks-not-held, etc.) with simple annotations in the source code. Mike ------------------------------------------------------------------------------ Stay on top of everything new and different, both inside and around Java (TM) technology - register by April 22, and save $200 on the JavaOne (SM) conference, June 2-5, 2009, San Francisco. 300 plus technical and hands-on sessions. Register today. Use priority code J9JMT32. http://p.sf.net/sfu/p _______________________________________________ GDAlgorithms-list mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list Archives: http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list