Hi, Am 24.03.2009 um 22:36 schrieb mikel:
CLOS says that if two matches are otherwise equally specific, the one on the left wins. Similarly, it says that if two classes define slots with the same name, the one farthest from the root of the class heterarchy (as defined by a standard traversal algorithm) wins. You can make a theoretical argument that these choices are arbitrary, and that the programmer should control those decisions. In practice, the CLOS approach is not a problem because:
Thank you for the long explanation. Please allow me to be sceptical (fatigued and after all long day of work). CLOS is certainly a powerful system, but reading these rules makes me headaches. To use a gf I need to understand, which dispatch sequence, graph traversing algorithms or class definition orders are used. I will almost certainly mess this up. I personally prefer the explicit style, where I declare which method to prefer over another. So I don't have to rely on my leaky memory. But this is only some fuzzy feeling. I will certainly try gf when I'm in a more awaken state. Sincerely Meikel
smime.p7s
Description: S/MIME cryptographic signature
