Iterate over the key/value pairs the map contains.
Discard every key/value pair defined in the map, leaving an empty map.
Iterate over the key/value pairs the map contains.
Test whether a given value is a Signal.Map with identical contents to
this map.
Test whether the map is empty.
Iterate over the keys the map contains.
Return a read-only view of the map.
Obtain a Signal.Computed representing the current value of the given key in the map. The signal will update when the value changes, and will not respond to changes to any other elements of the map.
Get a signal reflecting the value at the given key, as in
Signal.Map.signal, except that if the key isn't defined,
initialise it with the value produced by calling defaultFn first, as in
Signal.Map.getOrSet.
Get the size of the map.
Iterate over the values associated with every key in the map.
StaticisTest whether a value is a Signal.Map.
A map which behaves like a signal.
Any read operation on the map, like Signal.Map.get, Signal.Map.size, or iteration, acts like a Signal.State.get, registering the map as a dependency in any computed signals or effects it's used in. Correspondingly, any write operation to the map will cause all of these dependencies to update as with a Signal.State.set.
Note that there's no granularity to this access by default: if you read only a single key from the map inside a computed signal, any write to the map, even to a different key, causes the signal to recompute. If you want granularity (and you normally do), use Signal.Map.signal instead of Signal.Map.get.