uint

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

absolute value

this uint as an i128

this uint as an i32

this uint as an i64

this uint as an int

convert this to a number using the given base. If negative, add "-" as
the first character.

convert this to a number using the given base. If negative, add "-" as
the first character. Extend with leading "0" until the length is at
least len

this uint as an u128

this uint as an u32

this uint as an u64

this uint as an u8

create binary representation

create binary representation with given number of digits.

create decimal representation

create decimal representation with given number of digits.

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 uint fit into an i128?

does this uint fit into an u128?

does this uint fit in 64 bits?

does this uint fit into an u8?

greatest common divisor of this and b

note that this assumes zero to be divisible by any positive integer.

create hexadecimal representation

create hexadecimal representation with given number of digits.

the highest 1 bit in this integer
example: uint 0 => 0
example: uint 1 => 1
example: uint 8 => 4

modulo
returns the remainder of the division

test divisibility by other

bitwise and

NYI make faster: https://en.wikipedia.org/wiki/Multiplication_algorithm#Computational_complexity_of_multiplication
multiply these unsigned ints

exponentation operator:
this uint to the power of other

add two unsigned ints

subtract other from this unsigned int

defining an integer interval from this to other, both inclusive

special cases of interval a..b:

a < b: the interval from a to b, both inclusive
a == b: the interval containing only one element, a
a > b: an empty interval

divide these unsigned ints

preconditions used in 'numeric' for basic operations: true if the
operation is permitted for the given values

create a fraction

shift left

shift right

bitwise xor

bitwise or

create a fraction via unicode fraction slash \u2044 '⁄ '

check if this type of integer is bounded

returns false unless redefined by a specific implementation of integer

create octal representation

create octal representation with given number of digits.

an infinite integer Sequence starting from this up to the maximum value
has_interval.this.max

an infinite integer Sequence starting from this up to the maximum value
has_interval.this.max

NYI: CLEANUP: Eventually remove `postfix ..` or `postfix ..∞` in favor of the
other one, for now this is here to show that `∞` is a legal symbol in an operator.

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: 'prefix +' (identity)

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

bitwise NOT

bitwise NOT (Unicode alias)

sign function resulting in `-1`/`0`/`+1` depending on whether `numeric.this`
is less than, equal or larger than zero

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.

equality: are these unsigned integers equal?

helper feature to init uint from an u32

create hash code for this instance

This should satisfy the following condition:

(T.equality a b) : (T.hash_code a = T.hash_code b)

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`

total order

name of this type, including type parameters, e.g. 'option (list i32)'.

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`.