Description Usage Arguments Details Value Author(s) References Examples
There are a number of different methods for computing the class linearization.
The methods described here are discussed in more detail in the vignette
for this package. LPO
and computeClassLinearization
are
aliases, the former being easier to type, the latter more descriptive.
1 2 | computeClassLinearization(inClass, C3 = FALSE)
LPO(inClass, C3 = FALSE)
|
inClass |
The class for which a linearization of its is wanted. |
C3 |
Whether or not to use the C3 method in computing the linearization. |
For many different computations, especially method dispatch, an algorithm for specifying a linear order of the class inheritance tree is needed. All object oriented programming languages support the computation of a linearization. Local precedence order (LPO) uses the order of the direct superclasses, given in the class definition, in computing the linearization, with earlier superclasses considered more specific than later ones. If there are no duplicate class labels in the hierarchy then this is then simply a bread-first search of the superclass definitions. But when one or more classes are inherited from different superclasses this definition becomes more complicated, and can in fact not be satisfied.
A vector with the class linearization, the.
R. Gentleman
Monotonic Superclass Linearization for Dylan, K. Barrett and others, 1996, OOPSLA
1 2 3 4 5 6 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.