☰
reduce
Sequence.reduce
§(R type, init Sequence.reduce.R, f Function (choice Sequence.reduce.R (abort Sequence.reduce.R)) Sequence.reduce.R Sequence.T):Any => Sequence.reduce.R
§(R
type
, init Sequence.reduce.R, f Function (choice Sequence.reduce.R (abort Sequence.reduce.R)) Sequence.reduce.R Sequence.T):
Any =>
Sequence.reduce.RFunctions
create a String from this instance. Unless redefined, `a.as_string` will
create `"instance[T]"` where `T` is the dynamic type of `a`
create `"instance[T]"` where `T` is the dynamic type of `a`
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 hierachy 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 hierachy of types. So for Type values, dynamic_type is redefined
to just return Type.type.
and a reducing function f.
the reduction is finished once f yields abort or
if the end of the sequence is reached.