String representation of this path

e.g. "/folder/file" or "relative_folder/file"

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: ENHANCEMENT: #5892: If this is fixed, we could write

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.

consider this to represent a file
and return just name of the file
without its path.

get the parent of this path

if folder is root folder or .
nil is returned

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.

relativize path `p` based on this path.

e.g. "/tmp/folder".relative "/tmp/folder/file" will return "file"

resolve o in this path

e.g.


effectively returns

checks if this path starts with path `p`

both this and path p must either be absolute or relative
for this to return true.

e.g. (path.of "/tmp/file").starts_with (path.of "/tmp") = true

get subpath from x (included) to y (excluded)

e.g.
path.of "/tmp/folder/file" .subpath 0 2 = path.of "/tmp/folder"

return the suffix of the file_name

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 implements the default equality relation for values of this type.

This relation must be

- reflexive (equality a a),
- symmetric (equality a b = equality b a), and
- transitive ((equality a b && equality b c) : equality a c).

result is true iff 'a' is considered to represent the same abstract value
as 'b'.

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.


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


or

define order for paths

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

instatiates a path via a given String
if paths starts with / it is considered to be
absolute rather than realive.

instatiates a path

e.g.

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

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

equals -- feature that compares two values using the equality relation
defined in their type

hash of a value

infix = -- infix operation as short-hand for 'equals'

does this come strictly before other?

infix <= -- infix operation as short-hand for 'lteq'

three-way comparison between this and other.

result is < 0 if this < other
result is > 0 if this > other
result is = 0 if this = other

infix = -- infix operation as short-hand for 'equals'

does this come strictly after other?

does this come after other?

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

infix ≟ -- infix operation as short-hand for 'equals'

infix ≤ -- infix operation as short-hand for 'lteq'

does this come after other?

three-way comparison between this and other.

result is < 0 if this < other
result is > 0 if this > other
result is = 0 if this = other

does this come strictly before other?

does this come strictly after other?

lteq -- feature that compares two values using the lteq relation
defined in their type

maximum of two values

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:

minimum of two values