-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi,
A while ago I was trying something to attack the 1000-opamp-footprints problem (aka the transistor problem) and it looked promising. But it would have really helped me if the libgeda file format had a way to uniquely identify a COMPLEX - more than just a refdes, which can easily be duplicated in the current slotting mechanism. I'm thinking along the lines of some sort of uuid=056e81a8-4c07-42e1-a64e-9d815d433368 style attribute: something that, in C, can be converted into a pointer to a COMPLEX. In about two weeks I'd like to add this to libgeda, when I will be free from any "all your copyrights are belong to us" employment contract clause. In the meantime I'd like to know of any objections, Super Important recommendations, etc. I was thinking of just ripping some code from CVS where it generates commitid attributes, but I'm open to any better ideas. I'm not sure if I like the idea of just *numbering* all the COMPLEX'es in a schematic file, since then I'd have to worry about keeping independent number spaces from stomping on each other. - -- Your Mom is so dumb that she tried to minimize a 12 variable function to a minimal sum of products expression using a karnaugh map instead of the Quine-McCluskey Algorithm. -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.6 (GNU/Linux) iD8DBQFGaShowyMv24BBd/gRAuJgAJ9nmC8qCxSSuiebGB2o4Yywi057FACdFdcI tcA0kPjxmGzfciWjetdfAj4= =AKaE -----END PGP SIGNATURE----- _______________________________________________ geda-dev mailing list [email protected] http://www.seul.org/cgi-bin/mailman/listinfo/geda-dev
