»
mutable_tree_map
container.mutable_tree_map
(LM
type
:
mutate, KEY type
:
property.orderable, VAL type
):
Mutable_Map KEY, VAL is
[Contains abstract features]
[Private constructor]
¶mutable_tree_map -- a mutable map using an AVL tree
Type Parameters
Functions
=> container.Map container.mutable_tree_map.KEY container.mutable_tree_map.VAL[Redefinition of container.Mutable_Map.as_map][Contains abstract features]¶
=>
container.Map container.mutable_tree_map.KEY container.mutable_tree_map.VAL[Redefinition of container.Mutable_Map.as_map]
[Contains abstract features]
¶create an immutable map from this
create a string containing all mappings
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.
freeze the map, such that it is no longer mutable afterwards
(k container.mutable_tree_map.KEY) => option container.mutable_tree_map.VAL[Redefinition of container.Mutable_Map.get][Contains abstract features]¶
(k container.mutable_tree_map.KEY)
=>
option container.mutable_tree_map.VAL[Redefinition of container.Mutable_Map.get]
[Contains abstract features]
¶get the value stored in this map at key k, nil if k is not
contained in this map
contained in this map
(k container.Mutable_Map.K, v container.Mutable_Map.V) => container.Mutable_Map.V[Inherited from Mutable_Map][Contains abstract features]¶
(k container.Mutable_Map.K, v container.Mutable_Map.V)
=>
container.Mutable_Map.V[Inherited from Mutable_Map]
[Contains abstract features]
¶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
(k container.Mutable_Map.K) => option container.Mutable_Map.V[Inherited from Mutable_Map][Contains abstract features]¶
(k container.Mutable_Map.K)
=>
option container.Mutable_Map.V[Inherited from Mutable_Map]
[Contains abstract features]
¶get the value k is mapped to, or nil if none.
(k container.Mutable_Map.K, v container.Mutable_Map.V) => unit[Inherited from Mutable_Map][Contains abstract features]¶
(k container.Mutable_Map.K, v container.Mutable_Map.V)
=>
unit[Inherited from Mutable_Map]
[Contains abstract features]
¶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`
=> Sequence (tuple container.mutable_tree_map.KEY container.mutable_tree_map.VAL)[Redefinition of container.Mutable_Map.items][Contains abstract features]¶
=>
Sequence (tuple container.mutable_tree_map.KEY container.mutable_tree_map.VAL)[Redefinition of container.Mutable_Map.items]
[Contains abstract features]
¶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.
(k container.mutable_tree_map.KEY, v container.mutable_tree_map.VAL) => unit[Redefinition of container.Mutable_Map.put][Contains abstract features]¶
(k container.mutable_tree_map.KEY, v container.mutable_tree_map.VAL)
=>
unit[Redefinition of container.Mutable_Map.put]
[Contains abstract features]
¶add the mapping k -> v as a new entry to this map
(kvs Sequence (tuple container.Mutable_Map.K container.Mutable_Map.V)) => unit[Inherited from Mutable_Map][Contains abstract features]¶
(kvs Sequence (tuple container.Mutable_Map.K container.Mutable_Map.V))
=>
unit[Inherited from Mutable_Map]
[Contains abstract features]
¶add all key-value pairs to this map
for existing keys, value gets updated
for existing keys, value gets updated
(key container.mutable_tree_map.KEY) => option container.mutable_tree_map.VAL[Redefinition of container.Mutable_Map.remove][Contains abstract features]¶
(key container.mutable_tree_map.KEY)
=>
option container.mutable_tree_map.VAL[Redefinition of container.Mutable_Map.remove]
[Contains abstract features]
¶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
(k container.mutable_tree_map.KEY, v container.mutable_tree_map.VAL) => option container.mutable_tree_map.VAL[Contains abstract features]¶
(k container.mutable_tree_map.KEY, v container.mutable_tree_map.VAL)
=>
option container.mutable_tree_map.VAL[Contains abstract features]
¶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.
=> container.mutable_tree_map container.mutable_tree_map.type.LM container.mutable_tree_map.type.KEY container.mutable_tree_map.type.VAL[Redefinition of container.Mutable_Map.type.empty][Contains abstract features]¶
=>
container.mutable_tree_map container.mutable_tree_map.type.LM container.mutable_tree_map.type.KEY container.mutable_tree_map.type.VAL[Redefinition of container.Mutable_Map.type.empty]
[Contains abstract features]
¶returns an empty tree of elements of type A.
(k container.mutable_tree_map.type.KEY, v container.mutable_tree_map.type.VAL) => container.mutable_tree_map container.mutable_tree_map.type.LM container.mutable_tree_map.type.KEY container.mutable_tree_map.type.VAL[Contains abstract features]¶
(k container.mutable_tree_map.type.KEY, v container.mutable_tree_map.type.VAL)
=>
container.mutable_tree_map container.mutable_tree_map.type.LM container.mutable_tree_map.type.KEY container.mutable_tree_map.type.VAL[Contains abstract features]
¶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.
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
same
pre T : property.equatable
=>
a = b
or
val(n T) is
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
same
pre T : property.equatable
=>
a = b
or
val(n T) is
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`.
0.094dev (2025-06-18 15:08:51 GIT hash 89cffc23ae669b0898a5564fefbf793fcb8e5ca7 built by fridi@fzen)