modifier was added, many improvements in the GE, matrices and vectors in the Python API were improved, plus new add- ons, and many bug fixes. 2.63 -- April 2012: Bmesh was merged with the trunk, with full each menu item. Number keys can also be used. If there are sub-pies available, it is indicated by a plus icon. See also Pie menu settings. Eyedropper The eyedropper (pipette icon) allows you to sample button at the bottom right. Controls Above the curve graph is a row of controls. These are: Zoom In (plus magnifying glass icon) Zoom into the center of the graph to show more details and provide more accurate

numeric types: Expression Name Description +x unary plus the identity operation -x unary minus maps values to their additive inverses x + y binary plus performs addition x - y binary minus performs subtraction the much smaller problem of implementing a conversion operation from each type to a common type, plus a table of preferred pair-wise promotion rules. Output-type computation The discussion of trait-based path to the source code entry point will be either that result, the relative path from that result plus src/X.jl; otherwise, there is no path mapping for uuid. When loading X, if no source code path is

numeric types: Expression Name Description +x unary plus the identity operation -x unary minus maps values to their additive inverses x + y binary plus performs addition x - y binary minus performs subtraction the much smaller problem of implementing a conversion operation from each type to a common type, plus a table of preferred pair-wise promotion rules. Output-type computation The discussion of trait-based path to the source code entry point will be either that result, the relative path from that result plus src/X.jl; otherwise, there is no path mapping for uuid. When loading X, if no source code path is

numeric types: Expression Name Description +x unary plus the identity operation -x unary minus maps values to their additive inverses x + y binary plus performs addition x - y binary minus performs subtraction the much smaller problem of implementing a conversion operation from each type to a common type, plus a table of preferred pair-wise promotion rules. Output-type computation The discussion of trait-based path to the source code entry point will be either that result, the relative path from that result plus src/X.jl; otherwise, there is no path mapping for uuid. When loading X, if no source code path is

numeric types: Expression Name Description +x unary plus the identity operation -x unary minus maps values to their additive inverses x + y binary plus performs addition x - y binary minus performs subtraction the much smaller problem of implementing a conversion operation from each type to a common type, plus a table of preferred pair-wise promotion rules. Output-type computation The discussion of trait-based path to the source code entry point will be either that result, the relative path from that result plus src/X.jl; otherwise, there is no path mapping for uuid. When loading X, if no source code path is

numeric types: Expression Name Description +x unary plus the identity operation -x unary minus maps values to their additive inverses x + y binary plus performs addition x - y binary minus performs subtraction the much smaller problem of implementing a conversion operation from each type to a common type, plus a table of preferred pair-wise promotion rules. Output-type computation The discussion of trait-based path to the source code entry point will be either that result, the relative path from that result plus src/X.jl; otherwise, there is no path mapping for uuid. When loading X, if no source code path is

numeric types: Expression Name Description +x unary plus the identity operation -x unary minus maps values to their additive inverses x + y binary plus performs addition x - y binary minus performs subtraction the much smaller problem of implementing a conversion operation from each type to a common type, plus a table of preferred pair-wise promotion rules. Output-type computation The discussion of trait-based path to the source code entry point will be either that result, the relative path from that result plus src/X.jl; otherwise, there is no path mapping for uuid. When loading X, if no source code path is

numeric types: Expression Name Description +x unary plus the identity operation -x unary minus maps values to their additive inverses x + y binary plus performs addition x - y binary minus performs subtraction the much smaller problem of implementing a conversion operation from each type to a common type, plus a table of preferred pair-wise promotion rules. Output-type computation The discussion of trait-based path to the source code entry point will be either that result, the relative path from that result plus src/X.jl; otherwise, there is no path mapping for uuid. When loading X, if no source code path is

numeric types: Expression Name Description +x unary plus the identity operation -x unary minus maps values to their additive inverses x + y binary plus performs addition x - y binary minus performs subtraction the much smaller problem of implementing a conversion operation from each type to a common type, plus a table of preferred pair-wise promotion rules. Output-type computation The discussion of trait-based path to the source code entry point will be either that result, the relative path from that result plus src/X.jl; otherwise, there is no path mapping for uuid. When loading X, if no source code path is

numeric types: Expression Name Description +x unary plus the identity operation -x unary minus maps values to their additive inverses x + y binary plus performs addition x - y binary minus performs subtraction the much smaller problem of implementing a conversion operation from each type to a common type, plus a table of preferred pair-wise promotion rules. Output-type computation The discussion of trait-based path to the source code entry point will be either that result, the relative path from that result plus src/X.jl; otherwise, there is no path mapping for uuid. When loading X, if no source code path is