☰
complex
num.complex
Type Parameters
Fields
Constructors
absolute value using `|a|` built from a `prefix |` and `postfix |` as an operator
alias of `a.abs`
Due to the low precedence of `|`, this works also on expressions like `|a-b|`, even
with spaces `| a-b |`, `|a - b|`, `| a-b|` or `|a-b |`.
Nesting, however, does not work, e.g, `| - |a| |`, this requires parentheses `|(- |a|)|`.
NYI: CLEANUP: Due to #3081, we need `postfix |` as the first operation, should be
`prefix |` firstFunctions
absolute value
this numeric value as an u8
Get the dynamic type of this instance. For value instances `x`, this is
equal to `type_of x`, but for `x` with a `ref` type `x.dynamic_type` gives
the actual runtime type, while `type_of x` results in the static
compile-time type.
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types. So for Type values, dynamic_type is redefined
to just return Type.type.
does this numeric value fit into an u8? This is redefined by children
of numeric that support `as_u8`.
basic operations: 'infix %' (division remainder)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix *]
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
Type Parameters
Fields
Constructors
absolute value using `|a|` built from a `prefix |` and `postfix |` as an operator
alias of `a.abs`
Due to the low precedence of `|`, this works also on expressions like `|a-b|`, even
with spaces `| a-b |`, `|a - b|`, `| a-b|` or `|a-b |`.
Nesting, however, does not work, e.g, `| - |a| |`, this requires parentheses `|(- |a|)|`.
NYI: CLEANUP: Due to #3081, we need `postfix |` as the first operation, should be
`prefix |` firstFunctions
absolute value
this numeric value as an u8
Get the dynamic type of this instance. For value instances `x`, this is
equal to `type_of x`, but for `x` with a `ref` type `x.dynamic_type` gives
the actual runtime type, while `type_of x` results in the static
compile-time type.
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types. So for Type values, dynamic_type is redefined
to just return Type.type.
does this numeric value fit into an u8? This is redefined by children
of numeric that support `as_u8`.
basic operations: 'infix %' (division remainder)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix *]
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
Fields
Constructors
absolute value using `|a|` built from a `prefix |` and `postfix |` as an operator
alias of `a.abs`
Due to the low precedence of `|`, this works also on expressions like `|a-b|`, even
with spaces `| a-b |`, `|a - b|`, `| a-b|` or `|a-b |`.
Nesting, however, does not work, e.g, `| - |a| |`, this requires parentheses `|(- |a|)|`.
NYI: CLEANUP: Due to #3081, we need `postfix |` as the first operation, should be
`prefix |` firstFunctions
absolute value
this numeric value as an u8
Get the dynamic type of this instance. For value instances `x`, this is
equal to `type_of x`, but for `x` with a `ref` type `x.dynamic_type` gives
the actual runtime type, while `type_of x` results in the static
compile-time type.
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types. So for Type values, dynamic_type is redefined
to just return Type.type.
does this numeric value fit into an u8? This is redefined by children
of numeric that support `as_u8`.
basic operations: 'infix %' (division remainder)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix *]
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
Constructors
absolute value using `|a|` built from a `prefix |` and `postfix |` as an operator
alias of `a.abs`
Due to the low precedence of `|`, this works also on expressions like `|a-b|`, even
with spaces `| a-b |`, `|a - b|`, `| a-b|` or `|a-b |`.
Nesting, however, does not work, e.g, `| - |a| |`, this requires parentheses `|(- |a|)|`.
NYI: CLEANUP: Due to #3081, we need `postfix |` as the first operation, should be
`prefix |` firstFunctions
absolute value
this numeric value as an u8
Get the dynamic type of this instance. For value instances `x`, this is
equal to `type_of x`, but for `x` with a `ref` type `x.dynamic_type` gives
the actual runtime type, while `type_of x` results in the static
compile-time type.
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types. So for Type values, dynamic_type is redefined
to just return Type.type.
does this numeric value fit into an u8? This is redefined by children
of numeric that support `as_u8`.
basic operations: 'infix %' (division remainder)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix *]
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
Constructors
absolute value using `|a|` built from a `prefix |` and `postfix |` as an operator
alias of `a.abs`
Due to the low precedence of `|`, this works also on expressions like `|a-b|`, even
with spaces `| a-b |`, `|a - b|`, `| a-b|` or `|a-b |`.
Nesting, however, does not work, e.g, `| - |a| |`, this requires parentheses `|(- |a|)|`.
NYI: CLEANUP: Due to #3081, we need `postfix |` as the first operation, should be
`prefix |` firstFunctions
absolute value
this numeric value as an u8
Get the dynamic type of this instance. For value instances `x`, this is
equal to `type_of x`, but for `x` with a `ref` type `x.dynamic_type` gives
the actual runtime type, while `type_of x` results in the static
compile-time type.
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types. So for Type values, dynamic_type is redefined
to just return Type.type.
does this numeric value fit into an u8? This is redefined by children
of numeric that support `as_u8`.
basic operations: 'infix %' (division remainder)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix *]
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
absolute value using `|a|` built from a `prefix |` and `postfix |` as an operator
alias of `a.abs`
Due to the low precedence of `|`, this works also on expressions like `|a-b|`, even
with spaces `| a-b |`, `|a - b|`, `| a-b|` or `|a-b |`.
Nesting, however, does not work, e.g, `| - |a| |`, this requires parentheses `|(- |a|)|`.
NYI: CLEANUP: Due to #3081, we need `postfix |` as the first operation, should be
`prefix |` first
alias of `a.abs`
Due to the low precedence of `|`, this works also on expressions like `|a-b|`, even
with spaces `| a-b |`, `|a - b|`, `| a-b|` or `|a-b |`.
Nesting, however, does not work, e.g, `| - |a| |`, this requires parentheses `|(- |a|)|`.
NYI: CLEANUP: Due to #3081, we need `postfix |` as the first operation, should be
`prefix |` first
Functions
absolute value
this numeric value as an u8
Get the dynamic type of this instance. For value instances `x`, this is
equal to `type_of x`, but for `x` with a `ref` type `x.dynamic_type` gives
the actual runtime type, while `type_of x` results in the static
compile-time type.
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types. So for Type values, dynamic_type is redefined
to just return Type.type.
does this numeric value fit into an u8? This is redefined by children
of numeric that support `as_u8`.
basic operations: 'infix %' (division remainder)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix *]
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
absolute value
this numeric value as an u8
Get the dynamic type of this instance. For value instances `x`, this is
equal to `type_of x`, but for `x` with a `ref` type `x.dynamic_type` gives
the actual runtime type, while `type_of x` results in the static
compile-time type.
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types. So for Type values, dynamic_type is redefined
to just return Type.type.
does this numeric value fit into an u8? This is redefined by children
of numeric that support `as_u8`.
basic operations: 'infix %' (division remainder)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix *]
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
this numeric value as an u8
Get the dynamic type of this instance. For value instances `x`, this is
equal to `type_of x`, but for `x` with a `ref` type `x.dynamic_type` gives
the actual runtime type, while `type_of x` results in the static
compile-time type.
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types. So for Type values, dynamic_type is redefined
to just return Type.type.
does this numeric value fit into an u8? This is redefined by children
of numeric that support `as_u8`.
basic operations: 'infix %' (division remainder)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix *]
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
this numeric value as an u8
Get the dynamic type of this instance. For value instances `x`, this is
equal to `type_of x`, but for `x` with a `ref` type `x.dynamic_type` gives
the actual runtime type, while `type_of x` results in the static
compile-time type.
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types. So for Type values, dynamic_type is redefined
to just return Type.type.
does this numeric value fit into an u8? This is redefined by children
of numeric that support `as_u8`.
basic operations: 'infix %' (division remainder)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix *]
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
this numeric value as an u8
Get the dynamic type of this instance. For value instances `x`, this is
equal to `type_of x`, but for `x` with a `ref` type `x.dynamic_type` gives
the actual runtime type, while `type_of x` results in the static
compile-time type.
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types. So for Type values, dynamic_type is redefined
to just return Type.type.
does this numeric value fit into an u8? This is redefined by children
of numeric that support `as_u8`.
basic operations: 'infix %' (division remainder)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix *]
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
Get the dynamic type of this instance. For value instances `x`, this is
equal to `type_of x`, but for `x` with a `ref` type `x.dynamic_type` gives
the actual runtime type, while `type_of x` results in the static
compile-time type.
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types. So for Type values, dynamic_type is redefined
to just return Type.type.
equal to `type_of x`, but for `x` with a `ref` type `x.dynamic_type` gives
the actual runtime type, while `type_of x` results in the static
compile-time type.
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types. So for Type values, dynamic_type is redefined
to just return Type.type.
does this numeric value fit into an u8? This is redefined by children
of numeric that support `as_u8`.
basic operations: 'infix %' (division remainder)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix *]
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
does this numeric value fit into an u8? This is redefined by children
of numeric that support `as_u8`.
of numeric that support `as_u8`.
basic operations: 'infix %' (division remainder)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix *]
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
basic operations: 'infix %' (division remainder)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix *]
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix *]
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§
(b num.this.complex.this num.complex.C)
=>
num.this.complex num.complex.C [Redefinition of numeric.infix *]
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
basic operations: 'infix **' (exponentiation)
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§
(b num.this.complex.this num.complex.C)
=>
num.this.complex num.complex.C [Redefinition of numeric.infix +]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§
(b num.this.complex.this num.complex.C)
=>
num.this.complex num.complex.C [Redefinition of numeric.infix -]
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§(b num.this.complex.this num.complex.C) => num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§
(b num.this.complex.this num.complex.C)
=>
num.this.complex num.complex.C [Redefinition of numeric.infix /]
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
basic operations
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
preconditions for basic operations: true if the operation's result is
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
representable and defined for the given values
default implementations all return `true` such that children have to
redefine these only for partial operations such as those resulting in
an overflow or that are undefined like a division by zero for most
types.
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
basic operations: 'prefix -' (negation)
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
overflow checking operations
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
saturating operations
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zeroType Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zero
is less than, equal or larger than zero
Type Functions
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
string representation of this type to be used for debugging.
result has the form "Type of '<name>'", but this might change in the future
result has the form "Type of '<name>'", but this might change in the future
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
There is no dynamic type of a type instance since this would result in an
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.equality]equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§
(a num.complex num.complex.type.C, b num.complex num.complex.type.C)
=>
bool [Redefinition of numeric.type.equality]
equality
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
the value corresponding to v in whatever integer implementation we have,
maximum in case of overflow
maximum in case of overflow
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
create hash code for this instance
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
This should satisfy the following condition:
(T.equality a b) : (T.hash_code a = T.hash_code b)
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
the imaginary unit
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
Is this type assignable to a type parameter with constraint `T`?
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
The result of this is a compile-time constant that can be used to specialize
code for a particular type.
is_of_integer_type(n T : numeric) => T : integer
say (is_of_integer_type 1234) # true
say (is_of_integer_type 3.14) # false
it is most useful in conjunction preconditions or `if` statements as in
pair(a,b T) is
=>
or
val(n T) is
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
additional restrictions on when equality is permitted,
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
e.g., `option T` might require `T : property.equatable`.
to implement `equality`
§(a num.complex num.complex.type.C, b num.complex num.complex.type.C) => bool [Redefinition of numeric.type.lteq]total order ignoring imag
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
§
(a num.complex num.complex.type.C, b num.complex num.complex.type.C)
=>
bool [Redefinition of numeric.type.lteq]
total order ignoring imag
NYI: Does this make sense mathematically?
NYI: Does this make sense mathematically?
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
name of this type, including type parameters, e.g. 'option (list i32)'.
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
identity element for 'infix *'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
convenience prefix operator to create a string from a value.
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
This permits usage of `$` as a prefix operator in a similar way both
inside and outside of constant strings: $x and "$x" will produce the
same string.
NYI: Redefinition allows the type feature to be distinguished from its normal counterpart, see #3913
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
monoid of numeric with infix * operation. Will create product of all elements
it is applied to.
it is applied to.
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
monoid of numeric with infix *^ operation. Will create product of all elements
it is applied to, stopping at max/min value in case of overflow.
it is applied to, stopping at max/min value in case of overflow.
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
monoid of numeric with infix + operation. Will create sum of all elements it
is applied to.
is applied to.
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
monoid of numeric with infix +^ operation. Will create sum of all elements it
is applied to, stopping at max/min value in case of overflow.
is applied to, stopping at max/min value in case of overflow.
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
the constant '10' in whatever integer implementation we have, maximum in case of overflow
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
the constant '2' in whatever integer implementation we have, maximum in case of overflow
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
Get a type as a value.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
This is a feature with the effect equivalent to Fuzion's `expr.type` call tail.
It is recommended to use `expr.type` and not `expr.type_value`.
`type_value` is here to show how this can be implemented and to illustrate the
difference to `dynamic_type`.
identity element for 'infix +'
identity element for 'infix +'
complex provides complex numbers based on a numeric type (e.g. f64, i32).
A complex number consists of a real and an imaginary part.