Difference between revisions of "Type inference"
Jump to navigation
Jump to search
Hzwakenberg (talk | contribs) m |
|||
| Line 1: | Line 1: | ||
| − | Type inference is an algorithm allowing |
+ | Type inference is an algorithm allowing LibertyEiffel to statically compute the true type of the objects at run time. |
| − | Usually this algorithm allows to simplify the generated code by deleting [[dynamic binding]] sites when the static type is computed to be reduced to a |
+ | Usually this algorithm allows to simplify the generated code by deleting [[dynamic binding]] sites when the static type is computed to be reduced to a unique dynamic type. This simplification is summed up and displayed by the [[compile|compiler]] when using the <TT>-verbose</TT> flag. It's called ''type inference score''; it is the fraction of simplified binding sites over the total number of sites. |
One should note that a 100% score is usually not possible, nor desirable; else your project is not really written in an OO spirit... |
One should note that a 100% score is usually not possible, nor desirable; else your project is not really written in an OO spirit... |
||
Revision as of 18:46, 4 March 2016
Type inference is an algorithm allowing LibertyEiffel to statically compute the true type of the objects at run time.
Usually this algorithm allows to simplify the generated code by deleting dynamic binding sites when the static type is computed to be reduced to a unique dynamic type. This simplification is summed up and displayed by the compiler when using the -verbose flag. It's called type inference score; it is the fraction of simplified binding sites over the total number of sites.
One should note that a 100% score is usually not possible, nor desirable; else your project is not really written in an OO spirit...