[snip]
>Sort all elements by some function of position before writing to disk.
>libgeda would be able to read unsorted files, and unchanged files would not
>be written out (as you'd expect). The exact comparison function used isn't
>important, as long as semantically identical schematics have identical
>on-disk representation.
That there is a comparison function or a well defined sorting
order is quite important. Since you are proposing an intelligent sort,
I'm okay with this functionality. A dumb sort would not have have been
a good thing.
-Ales
_______________________________________________
geda-dev mailing list
[email protected]
http://www.seul.org/cgi-bin/mailman/listinfo/geda-dev
