»
ordered_map
container.ordered_map
(OK
type
:
property.orderable, V type
, k0 Sequence OK, v0 Sequence V):
Map OK, V is
[Contains abstract features]
¶Type Parameters
Constructors
entry represents the pair of key and value at the given
index i of the ordered map.
index i of the ordered map.
Functions
(k container.ordered_map.OK, v container.ordered_map.V) => container.this.ordered_map container.ordered_map.OK container.ordered_map.V[Contains abstract features]¶
(k container.ordered_map.OK, v container.ordered_map.V)
=>
container.this.ordered_map container.ordered_map.OK container.ordered_map.V[Contains abstract features]
¶add mapping from k to v
(LM type:mutate) => container.Mutable_Map container.ordered_map.OK container.ordered_map.V[Redefinition of container.Map.as_mutable_map][Contains abstract features]¶
(LM
type
:
mutate) =>
container.Mutable_Map container.ordered_map.OK container.ordered_map.V[Redefinition of container.Map.as_mutable_map]
[Contains abstract features]
¶create a mutable 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.
check if key k is present in the set of keys
(k container.ordered_map.OK) => option container.ordered_map.V[Redefinition of container.Map.index [ ]][Contains abstract features]¶
(k container.ordered_map.OK)
=>
option container.ordered_map.V[Redefinition of container.Map.index [ ]]
[Contains abstract features]
¶get the value k is mapped to, or nil if none.
performance is O(log size).
performance is O(log size).
=> Sequence (tuple container.ordered_map.OK container.ordered_map.V)[Redefinition of container.Map.items][Contains abstract features]¶
=>
Sequence (tuple container.ordered_map.OK container.ordered_map.V)[Redefinition of container.Map.items]
[Contains abstract features]
¶get an array 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.
number of entries in this map
a sorted array of entries of this map
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.ordered_map container.ordered_map.type.OK container.ordered_map.type.V[Redefinition of container.Map.type.empty][Contains abstract features]¶
=>
container.ordered_map container.ordered_map.type.OK container.ordered_map.type.V[Redefinition of container.Map.type.empty]
[Contains abstract features]
¶create an empty instance of ordered_map
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)
Lookup performance is O(log size) since it uses binary search in a
sorted array. When deterministic performance is desired, an ordered map
should be preferred over a hash map.
performance of creation of the map is in O(n log n) where n is
keys.length.