Insert the value at the given key into the map
Insert the value at the given key into the map
key
inserted value
the map for the chaining calls
Tests if the field is contained in the map.
Tests if the field is contained in the map. Returns true if exists, otherwise returns false
tested field
true if exists in the map, otherwise false
Time complexity: O(1)
Returns the value at the given key into the map
Returns the value at the given key into the map
key
Some if the value exists in the map, None otherwise
Increment a value at the given key in the map
Increment a value at the given key in the map
key
increment by this
value after incrementation
Returns all keys defined in the map
Returns all keys defined in the map
all used keys
Removes the specified members from the sorted map stored at key.
Removes the specified members from the sorted map stored at key. Non existing members are ignored. An error is returned when key exists and does not hold a sorted map.
fields to be removed
the map for chaining calls
Time complexity: O(N) where N is the number of members to be removed.
Returns the length of the collection stored at key.
Returns the length of the collection stored at key. If key does not exist, it is interpreted as an empty collection and 0 is returned. An error is returned when the value stored at key is not a proper collection.
Time complexity: O(1)
size of the list
Returns all elements in the map
Returns all elements in the map
all elements in the map
Time complexity: O(N) where N is the map cardinality.
Returns all values stored in the map
Returns all values stored in the map
all stored values
Redis Hashes are simply hash maps with strings as keys. It is possible to add elements to a Redis Hashes by adding new elements into the collection.
This simplified wrapper implements only unordered Maps.
Data type of the inserted element