Fuzion Logo
fuzion-lang.dev — The Fuzion Language Portal
JavaScript seems to be disabled. Functionality is limited.

partially_orderable

property.partially_orderable

partially_orderable -- feature for immutable values that have an infix <=
predicate that defines a partial order

features inheriting from partially_orderable define a partial order of their
values

NYI: the compiler should check that features inheriting from this are
actually immutable.

Functions

 => 
String
[Inherited from  Any]
create a String from this instance. Unless redefined, `a.as_string` will
create `"instance[T]"` where `T` is the dynamic type of `a`
(R 
type
, F 
type
: Typed_Function R, f F)
 => 
R
[Inherited from  Any]
dynamic_apply -- apply `f.call` to `Any.this`'s dynamic type and value

This can be used to perform operation on values depending on their dynamic
type.

Here is an example that takes a `Sequence Any` that may contain boxed values
of types `i32` and `f64`. We can now write a feature `get_f64` that extracts
these values converted to `f64` and build a function `sum` that sums them up
as follows:


NYI: IMPROVEMENT: #5892: If this is fixed, we could write

 => 
Type
[Inherited from  Any]
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.
 => 
String
[Inherited from  Any]
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.

Type Functions

 => 
String
[Inherited from  Type]
string representation of this type to be used for debugging.

result has the form "Type of '<name>'", but this might change in the future

redefines:

 => 
Type
[Inherited from  Type]
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.

redefines:

(a property.partially_orderable.this.type, b property.partially_orderable.this.type)
 => 
bool
equality check for immutable values
(T 
type
)
 => 
bool
[Inherited from  Type]
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.


it is most useful in conjunction with preconditions or `if` statements as in


or

(a property.partially_orderable.this.type, b property.partially_orderable.this.type)
 => 
bool
[Abstract feature]
does a come before b or is equal to b?
 => 
String
[Inherited from  Type]
name of this type, including type parameters, e.g. 'option (list i32)'.
 => 
String
[Inherited from  Type]
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

redefines:

 => 
Type
[Inherited from  Any]
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`.

Applicable universe features

These are features in universe, that have an argument with a type constraint that matches this features type and can therefore be used with it.
(T 
type
:
property.equatable, a T, b T)
 => 
bool
equals -- feature that compares two values using the equality relation
defined in their type
(T 
type
:
property.equatable, a T, b T)
 => 
bool
infix = -- infix operation as short-hand for 'equals'
infix <= -- infix operation as short-hand for 'lteq'
(T 
type
:
property.equatable, a T, b T)
 => 
bool
infix = -- infix operation as short-hand for 'equals'
is `a` contained in `Set` `s`?

This should usually be called using type inference as in

is `a` not contained in `Set` `s`?

This should usually be called using type inference as in

(T 
type
:
property.equatable, a T, b T)
 => 
bool
infix ≟ -- infix operation as short-hand for 'equals'
infix ≤ -- infix operation as short-hand for 'lteq'
(T 
type
:
property.partially_orderable, a T, b T)
 => 
bool
lteq -- feature that compares two values using the lteq relation
defined in their type
memoize `f`.
wraps f so that f will only be called once for every unique input.

The term "memoization" was coined by Donald Michie in 1968 and
is derived from the Latin word "memorandum" ("to be remembered"),
usually truncated as "memo" in American English, and thus carries
the meaning of "turning a function into something to be remembered".
https://en.wikipedia.org/wiki/Memoization

example:

0.095dev (2025-09-09 14:29:31 GIT hash 98644f8f651c2101a0730cfe31c5807993b7603b built by fridi@fzen)