mutable_tree_map
container.mutable_tree_map
(LM
type
:
mutate, KEY type
:
property.orderable, VAL type
):
Mutable_Map KEY, VAL is
[Private constructor]
¶mutable_tree_map -- a mutable map using an AVL tree
Type Parameters
Functions
create an immutable map from this
create a string containing all mappings
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
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
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.
get the value stored in this map at key k, nil if k is not
contained in this map
contained in this map
get the value stored in this map at key k,
if it does not exist, v is added and returned
if it does not exist, v is added and returned
check if key k is present in the set of keys
get the value k is mapped to, or nil if none.
convenience feature to add a key-value pair to this map
does the same as `put k v`
does the same as `put k v`
get a sequence of all key/value pairs in this map
get a sequence of all keys in this map
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.
add the mapping k -> v as a new entry to this map
add all key-value pairs to this map
for existing keys, value gets updated
for existing keys, value gets updated
remove the mapping from k to some value from this map
returns the value that k previously mapped to, or nil if
no mapping was actually removed
returns the value that k previously mapped to, or nil if
no mapping was actually removed
add the mapping k -> v as a new entry to this map
returns the value that k previously mapped to, or nil if
k was not yet contained in this map
returns the value that k previously mapped to, or nil if
k was not yet contained in this map
returns the size of the map, i.e. the number of elements it contains
get a sequence of all values in this map
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
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.
endless hierarchy of types, so dynamic_type is redefined to just return
Type.type here.
returns an empty tree of elements of type A.
returns a tree of elements of type A that contains just the element a.
initialize a map from a Sequence of key value tuples
initialize a map from a Sequence of key value tuples
if the freeze argument is true, then the map is frozen
after being populated with the entries from the Sequence.
if the freeze argument is true, then the map is frozen
after being populated with the entries from the Sequence.
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
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
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
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`.
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.
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:
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)