Hi Holger,
Thanks for your support, we'll review your code ASAP.
For some information on topological sorting some may look in
'The Algorithm Design Manual' by Skiena.
Arnaud
-> -----Original Message-----
-> From: Holger Krug [mailto:[EMAIL PROTECTED]]
-> Sent: Monday, September 10, 2001 2:23 PM
-> To: [EMAIL PROTECTED]
-> Subject: [castor-dev] PATCH: sort class maps before creating class
-> descriptors
->
->
-> Appended is a patch which solved a problem I reported earlier at
-> http://castor.exolab.org/list-archive/msg10221.html
->
-> The patch performs a topological sorting on the classes of a mapping
-> to let the classes not dependent on and not extending other classes to
-> be processed first (processing classes means here: creating their
-> class descriptors).
->
-> Furthermore the patch gives more detailed error messages in the case
-> of dependency/extension cycles in the mapping.
->
-> The patch assumes that not only the dependency relation between classes
-> is not allowed to have cycles but even the combined dependency/extension
-> relation.
->
-> The patch is insofar a quick hack as general algorithms like topological
-> sorting should be organized in utility classes but not in the main code.
-> But for the time being it does what it shall do.
->
-> PLEASE CHECK THE PATCH AND ADD IT TO THE CVS VERSION.
->
-> If somebody wants to understand the topological sorting algorithm used,
-> I took it from Robert Sedgewick, "Algorithms". Unfortunately I have only
-> a German version of the book at hand, so I cannot give the page numbers.
->
->
-> --
-> Holger Krug
-> [EMAIL PROTECTED]
->
-----------------------------------------------------------
If you wish to unsubscribe from this mailing, send mail to
[EMAIL PROTECTED] with a subject of:
unsubscribe castor-dev
