In the Scala 2.8 reference, section 5.3.3 p. 69 (in 77 PDFs), the following paragraphs appear:
x is a type of code> base code C ). After this, the real suppression of x in D , L (C) is mixed in all the base classes, which is a successful type D . L (c) means (in the original text it is a calligraphic capital such as \ ell Symbol)? The phrase "classes ... what does succeed D " mean? I am not familiar with signaling.
The bottom line is L (C) in all base squares (C The complete legacy series of), in which the order is given in the form of a series, any at the top, and the bottom on C Naturally D means, is more in series D .
The long explanation is that we want to know, for each class, its "parents" - for implementation purposes and general clarity (this is very dirty in C ++, where many innumerable inheritance Is allowed). This is simple in java - you have only a straightforward superclass, however, due to the Mikshan-class structure in Scala, which is a form of multiple heritage (possibly many symptoms from a superclass), the base class of any class is guided Esaic graph occurs in the form of graph. Linearization of the base classes of L (C) C, which starts with superclass, and adds attributes (and their base squares), such as they make a chain and near each class You can read more about this in section 6 of your base classes above themselves. This is a good, comprehensive framework of convenience.
Comments
Post a Comment