2019-01-09 11:25:45 +00:00
|
|
|
.. index:: !mapping
|
|
|
|
.. _mapping-types:
|
|
|
|
|
|
|
|
Mapping Types
|
|
|
|
=============
|
|
|
|
|
2019-10-18 08:16:03 +00:00
|
|
|
Mapping types use the syntax ``mapping(_KeyType => _ValueType)`` and variables
|
2019-12-16 15:53:09 +00:00
|
|
|
of mapping type are declared using the syntax ``mapping(_KeyType => _ValueType) _VariableName``.
|
|
|
|
The ``_KeyType`` can be any
|
2020-02-04 09:59:23 +00:00
|
|
|
built-in value type, ``bytes``, ``string``, or any contract or enum type. Other user-defined
|
|
|
|
or complex types, such as mappings, structs or array types are not allowed.
|
2019-12-16 15:53:09 +00:00
|
|
|
``_ValueType`` can be any type, including mappings, arrays and structs.
|
2019-01-09 11:25:45 +00:00
|
|
|
|
|
|
|
You can think of mappings as `hash tables <https://en.wikipedia.org/wiki/Hash_table>`_, which are virtually initialised
|
|
|
|
such that every possible key exists and is mapped to a value whose
|
2019-12-16 15:53:09 +00:00
|
|
|
byte-representation is all zeros, a type's :ref:`default value <default-value>`.
|
|
|
|
The similarity ends there, the key data is not stored in a
|
2019-01-09 11:25:45 +00:00
|
|
|
mapping, only its ``keccak256`` hash is used to look up the value.
|
|
|
|
|
|
|
|
Because of this, mappings do not have a length or a concept of a key or
|
2019-09-16 17:55:17 +00:00
|
|
|
value being set, and therefore cannot be erased without extra information
|
|
|
|
regarding the assigned keys (see :ref:`clearing-mappings`).
|
2019-01-09 11:25:45 +00:00
|
|
|
|
|
|
|
Mappings can only have a data location of ``storage`` and thus
|
|
|
|
are allowed for state variables, as storage reference types
|
|
|
|
in functions, or as parameters for library functions.
|
|
|
|
They cannot be used as parameters or return parameters
|
|
|
|
of contract functions that are publicly visible.
|
|
|
|
|
2019-05-16 10:27:30 +00:00
|
|
|
You can mark state variables of mapping type as ``public`` and Solidity creates a
|
2019-10-18 08:16:03 +00:00
|
|
|
:ref:`getter <visibility-and-getters>` for you. The ``_KeyType`` becomes a parameter for the getter.
|
|
|
|
If ``_ValueType`` is a value type or a struct, the getter returns ``_ValueType``.
|
2019-01-09 11:25:45 +00:00
|
|
|
If ``_ValueType`` is an array or a mapping, the getter has one parameter for
|
2019-10-18 08:16:03 +00:00
|
|
|
each ``_KeyType``, recursively.
|
|
|
|
|
|
|
|
In the example below, the ``MappingExample`` contract defines a public ``balances``
|
|
|
|
mapping, with the key type an ``address``, and a value type a ``uint``, mapping
|
|
|
|
an Ethereum address to an unsigned integer value. As ``uint`` is a value type, the getter
|
|
|
|
returns a value that matches the type, which you can see in the ``MappingUser``
|
|
|
|
contract that returns the value at the specified address.
|
2019-01-09 11:25:45 +00:00
|
|
|
|
|
|
|
::
|
|
|
|
|
2020-05-13 15:45:58 +00:00
|
|
|
// SPDX-License-Identifier: GPL-3.0
|
2019-03-05 17:10:09 +00:00
|
|
|
pragma solidity >=0.4.0 <0.7.0;
|
2019-01-09 11:25:45 +00:00
|
|
|
|
|
|
|
contract MappingExample {
|
|
|
|
mapping(address => uint) public balances;
|
|
|
|
|
|
|
|
function update(uint newBalance) public {
|
|
|
|
balances[msg.sender] = newBalance;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
contract MappingUser {
|
|
|
|
function f() public returns (uint) {
|
|
|
|
MappingExample m = new MappingExample();
|
|
|
|
m.update(100);
|
|
|
|
return m.balances(address(this));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-12-16 15:53:09 +00:00
|
|
|
The example below is a simplified version of an
|
|
|
|
`ERC20 token <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/master/contracts/token/ERC20/ERC20.sol>`_.
|
2019-10-18 08:16:03 +00:00
|
|
|
``_allowances`` is an example of a mapping type inside another mapping type.
|
|
|
|
The example below uses ``_allowances`` to record the amount someone else is allowed to withdraw from your account.
|
|
|
|
|
|
|
|
::
|
|
|
|
|
2020-05-13 15:45:58 +00:00
|
|
|
// SPDX-License-Identifier: GPL-3.0
|
2020-01-28 15:34:38 +00:00
|
|
|
pragma solidity >=0.4.22 <0.7.0;
|
2019-10-18 08:16:03 +00:00
|
|
|
|
|
|
|
contract MappingExample {
|
|
|
|
|
|
|
|
mapping (address => uint256) private _balances;
|
|
|
|
mapping (address => mapping (address => uint256)) private _allowances;
|
|
|
|
|
|
|
|
event Transfer(address indexed from, address indexed to, uint256 value);
|
|
|
|
event Approval(address indexed owner, address indexed spender, uint256 value);
|
|
|
|
|
|
|
|
function allowance(address owner, address spender) public view returns (uint256) {
|
|
|
|
return _allowances[owner][spender];
|
|
|
|
}
|
|
|
|
|
|
|
|
function transferFrom(address sender, address recipient, uint256 amount) public returns (bool) {
|
|
|
|
_transfer(sender, recipient, amount);
|
|
|
|
approve(sender, msg.sender, amount);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
function approve(address owner, address spender, uint256 amount) public returns (bool) {
|
|
|
|
require(owner != address(0), "ERC20: approve from the zero address");
|
|
|
|
require(spender != address(0), "ERC20: approve to the zero address");
|
|
|
|
|
|
|
|
_allowances[owner][spender] = amount;
|
|
|
|
emit Approval(owner, spender, amount);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
function _transfer(address sender, address recipient, uint256 amount) internal {
|
|
|
|
require(sender != address(0), "ERC20: transfer from the zero address");
|
|
|
|
require(recipient != address(0), "ERC20: transfer to the zero address");
|
|
|
|
|
|
|
|
_balances[sender] -= amount;
|
|
|
|
_balances[recipient] += amount;
|
|
|
|
emit Transfer(sender, recipient, amount);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2019-11-01 14:07:08 +00:00
|
|
|
.. index:: !iterable mappings
|
|
|
|
.. _iterable-mappings:
|
2019-01-09 11:25:45 +00:00
|
|
|
|
2019-11-01 14:07:08 +00:00
|
|
|
Iterable Mappings
|
|
|
|
-----------------
|
|
|
|
|
2019-12-16 15:53:09 +00:00
|
|
|
You cannot iterate over mappings, i.e. you cannot enumerate their keys.
|
|
|
|
It is possible, though, to implement a data structure on
|
2019-11-01 14:07:08 +00:00
|
|
|
top of them and iterate over that. For example, the code below implements an
|
|
|
|
``IterableMapping`` library that the ``User`` contract then adds data too, and
|
|
|
|
the ``sum`` function iterates over to sum all the values.
|
|
|
|
|
|
|
|
::
|
|
|
|
|
2020-05-13 15:45:58 +00:00
|
|
|
// SPDX-License-Identifier: GPL-3.0
|
2020-01-28 15:34:38 +00:00
|
|
|
pragma solidity >=0.6.0 <0.7.0;
|
2019-11-01 14:07:08 +00:00
|
|
|
|
2019-12-16 15:53:09 +00:00
|
|
|
struct IndexValue { uint keyIndex; uint value; }
|
|
|
|
struct KeyFlag { uint key; bool deleted; }
|
2019-11-01 14:07:08 +00:00
|
|
|
|
2019-12-16 15:53:09 +00:00
|
|
|
struct itmap {
|
|
|
|
mapping(uint => IndexValue) data;
|
|
|
|
KeyFlag[] keys;
|
|
|
|
uint size;
|
|
|
|
}
|
2019-11-01 14:07:08 +00:00
|
|
|
|
2019-12-16 15:53:09 +00:00
|
|
|
library IterableMapping {
|
2019-11-01 14:07:08 +00:00
|
|
|
function insert(itmap storage self, uint key, uint value) internal returns (bool replaced) {
|
|
|
|
uint keyIndex = self.data[key].keyIndex;
|
|
|
|
self.data[key].value = value;
|
|
|
|
if (keyIndex > 0)
|
|
|
|
return true;
|
|
|
|
else {
|
2019-11-07 13:22:14 +00:00
|
|
|
keyIndex = self.keys.length;
|
2020-04-30 16:14:45 +00:00
|
|
|
self.keys.push();
|
2019-11-01 14:07:08 +00:00
|
|
|
self.data[key].keyIndex = keyIndex + 1;
|
|
|
|
self.keys[keyIndex].key = key;
|
|
|
|
self.size++;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
function remove(itmap storage self, uint key) internal returns (bool success) {
|
|
|
|
uint keyIndex = self.data[key].keyIndex;
|
|
|
|
if (keyIndex == 0)
|
|
|
|
return false;
|
|
|
|
delete self.data[key];
|
|
|
|
self.keys[keyIndex - 1].deleted = true;
|
|
|
|
self.size --;
|
|
|
|
}
|
|
|
|
|
|
|
|
function contains(itmap storage self, uint key) internal view returns (bool) {
|
|
|
|
return self.data[key].keyIndex > 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
function iterate_start(itmap storage self) internal view returns (uint keyIndex) {
|
|
|
|
return iterate_next(self, uint(-1));
|
|
|
|
}
|
|
|
|
|
|
|
|
function iterate_valid(itmap storage self, uint keyIndex) internal view returns (bool) {
|
|
|
|
return keyIndex < self.keys.length;
|
|
|
|
}
|
|
|
|
|
|
|
|
function iterate_next(itmap storage self, uint keyIndex) internal view returns (uint r_keyIndex) {
|
|
|
|
keyIndex++;
|
|
|
|
while (keyIndex < self.keys.length && self.keys[keyIndex].deleted)
|
|
|
|
keyIndex++;
|
|
|
|
return keyIndex;
|
|
|
|
}
|
|
|
|
|
|
|
|
function iterate_get(itmap storage self, uint keyIndex) internal view returns (uint key, uint value) {
|
|
|
|
key = self.keys[keyIndex].key;
|
|
|
|
value = self.data[key].value;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// How to use it
|
|
|
|
contract User {
|
|
|
|
// Just a struct holding our data.
|
2019-12-16 15:53:09 +00:00
|
|
|
itmap data;
|
|
|
|
// Apply library functions to the data type.
|
|
|
|
using IterableMapping for itmap;
|
2019-11-01 14:07:08 +00:00
|
|
|
|
|
|
|
// Insert something
|
|
|
|
function insert(uint k, uint v) public returns (uint size) {
|
2019-12-16 15:53:09 +00:00
|
|
|
// This calls IterableMapping.insert(data, k, v)
|
|
|
|
data.insert(k, v);
|
|
|
|
// We can still access members of the struct,
|
|
|
|
// but we should take care not to mess with them.
|
2019-11-01 14:07:08 +00:00
|
|
|
return data.size;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Computes the sum of all stored data.
|
|
|
|
function sum() public view returns (uint s) {
|
2019-12-16 15:53:09 +00:00
|
|
|
for (
|
|
|
|
uint i = data.iterate_start();
|
|
|
|
data.iterate_valid(i);
|
|
|
|
i = data.iterate_next(i)
|
|
|
|
) {
|
|
|
|
(, uint value) = data.iterate_get(i);
|
2019-11-01 14:07:08 +00:00
|
|
|
s += value;
|
|
|
|
}
|
|
|
|
}
|
2019-12-16 15:53:09 +00:00
|
|
|
}
|