Update with latest Substrate metadata (#2233)

This commit is contained in:
Jaco Greeff
2020-05-05 11:33:04 +02:00
committed by GitHub
parent 2fc17a66e1
commit 458b7fa7e4
4 changed files with 145 additions and 80 deletions
@@ -364,10 +364,8 @@
" data is equal to its default value.",
"",
" # <weight>",
" - `O(K)` with `K` being complexity of `on_killed_account`",
" - `O(1)`",
" - 1 storage read and deletion.",
" - 1 call to `on_killed_account` callback with unknown complexity `K`",
" - 1 event.",
" # </weight>"
]
}
@@ -430,7 +428,7 @@
{
"name": "DbWeight",
"type": "RuntimeDbWeight",
"value": "0x008793030000000000c2eb0b00000000",
"value": "0x40787d010000000000e1f50500000000",
"documentation": [
" The weight of runtime database operations the runtime can invoke."
]
@@ -438,7 +436,7 @@
{
"name": "BlockExecutionWeight",
"type": "Weight",
"value": "0x0000000000000000",
"value": "0x00f2052a01000000",
"documentation": [
" The base weight of executing a block, independent of the transactions in the block."
]
@@ -446,7 +444,7 @@
{
"name": "ExtrinsicBaseWeight",
"type": "Weight",
"value": "0x8096980000000000",
"value": "0x4059730700000000",
"documentation": [
" The base weight of an Extrinsic in the block, independent of the of extrinsic being executed."
]
@@ -540,8 +538,9 @@
" - `calls`: The calls to be dispatched from the same origin.",
"",
" # <weight>",
" - The sum of the weights of the `calls`.",
" - One event.",
" - Base weight: 14.39 + .987 * c µs",
" - Plus the sum of the weights of the `calls`.",
" - Plus one additional event. (repeat read/write)",
" # </weight>",
"",
" This will return `Ok` in all circumstances. To determine the success of the batch, an",
@@ -569,7 +568,8 @@
" The dispatch origin for this call must be _Signed_.",
"",
" # <weight>",
" - The weight of the `call` + 10,000.",
" - Base weight: 2.861 µs",
" - Plus the weight of the `call`",
" # </weight>"
]
},
@@ -634,6 +634,15 @@
" - Storage: inserts one item, value size bounded by `MaxSignatories`, with a",
" deposit taken for its lifetime of",
" `MultisigDepositBase + threshold * MultisigDepositFactor`.",
" -------------------------------",
" - Base Weight:",
" - Create: 46.55 + 0.089 * S µs",
" - Approve: 34.03 + .112 * S µs",
" - Complete: 40.36 + .225 * S µs",
" - DB Weight:",
" - Reads: Multisig Storage, [Caller Account]",
" - Writes: Multisig Storage, [Caller Account]",
" - Plus Call Weight",
" # </weight>"
]
},
@@ -689,6 +698,13 @@
" - Storage: inserts one item, value size bounded by `MaxSignatories`, with a",
" deposit taken for its lifetime of",
" `MultisigDepositBase + threshold * MultisigDepositFactor`.",
" ----------------------------------",
" - Base Weight:",
" - Create: 44.71 + 0.088 * S",
" - Approve: 31.48 + 0.116 * S",
" - DB Weight:",
" - Read: Multisig Storage, [Caller Account]",
" - Write: Multisig Storage, [Caller Account]",
" # </weight>"
]
},
@@ -734,6 +750,11 @@
" - One event.",
" - I/O: 1 read `O(S)`, one remove.",
" - Storage: removes one item.",
" ----------------------------------",
" - Base Weight: 37.6 + 0.084 * S",
" - DB Weight:",
" - Read: Multisig Storage, [Caller Account]",
" - Write: Multisig Storage, [Caller Account]",
" # </weight>"
]
}
@@ -993,7 +1014,7 @@
"Map": {
"hasher": "Twox64Concat",
"key": "u32",
"value": "Vec<RawVRFOutput>",
"value": "Vec<Randomness>",
"linked": false
}
},
@@ -1004,7 +1025,7 @@
"name": "Initialized",
"modifier": "Optional",
"type": {
"Plain": "MaybeVrf"
"Plain": "MaybeRandomness"
},
"fallback": "0x00",
"documentation": [
@@ -1035,7 +1056,7 @@
{
"name": "EpochDuration",
"type": "u64",
"value": "0xc800000000000000",
"value": "0x1400000000000000",
"documentation": [
" The number of **slots** that an epoch takes. We couple sessions to",
" epochs, i.e. we start a new session once the new epoch begins."
@@ -1107,8 +1128,11 @@
"",
" # <weight>",
" - `O(T)` where `T` complexity of `on_timestamp_set`",
" - 2 storage mutations (codec `O(1)`).",
" - 1 storage read and 1 storage mutation (codec `O(1)`). (because of `DidUpdate::take` in `on_finalize`)",
" - 1 event handler `on_timestamp_set` `O(T)`.",
" - Benchmark: 8.523 (min squares analysis)",
" - NOTE: This benchmark was done for a runtime with insignificant `on_timestamp_set` handlers.",
" New benchmarking is needed when adding new handlers.",
" # </weight>"
]
}
@@ -1500,7 +1524,10 @@
" - Removing enough funds from an account will trigger `T::DustRemoval::on_unbalanced`.",
" - `transfer_keep_alive` works the same way as `transfer`, but has an additional",
" check that the transfer will not kill the origin account.",
"",
" ---------------------------------",
" - Base Weight: 73.64 µs, worst case scenario (account created, account removed)",
" - DB Weight: 1 Read and 1 Write to destination account",
" - Origin account is already in memory, so no DB operations for them.",
" # </weight>"
]
},
@@ -1533,6 +1560,11 @@
" # <weight>",
" - Independent of the arguments.",
" - Contains a limited number of reads and writes.",
" ---------------------",
" - Base Weight:",
" - Creating: 27.56 µs",
" - Killing: 35.11 µs",
" - DB Weight: 1 Read, 1 Write to `who`",
" # </weight>"
]
},
@@ -1579,7 +1611,12 @@
"",
" 99% of the time you want [`transfer`] instead.",
"",
" [`transfer`]: struct.Module.html#method.transfer"
" [`transfer`]: struct.Module.html#method.transfer",
" # <weight>",
" - Cheaper than transfer because account cannot be killed.",
" - Base Weight: 51.4 µs",
" - DB Weight: 1 Read and 1 Write to dest (sender is in overlay already)",
" #</weight>"
]
}
],
@@ -5584,15 +5621,18 @@
"Vec<(AccountId,Balance)>"
],
"documentation": [
" A new term with new members. This indicates that enough candidates existed, not that",
" enough have has been elected. The inner value must be examined for this purpose."
" A new term with new members. This indicates that enough candidates existed to run the",
" election, not that enough have has been elected. The inner value must be examined for",
" this purpose. A `NewTerm([])` indicates that some candidates got their bond slashed and",
" none were elected, whilst `EmptyTerm` means that no candidates existed to begin with."
]
},
{
"name": "EmptyTerm",
"args": [],
"documentation": [
" No (or not enough) candidates existed for this round."
" No (or not enough) candidates existed for this round. This is different from",
" `NewTerm([])`. See the description of `NewTerm`."
]
},
{
@@ -6230,9 +6270,9 @@
" proposal is awarded.",
"",
" # <weight>",
" - O(1).",
" - Limited storage reads.",
" - One DB change, one extra DB entry.",
" - Complexity: O(1)",
" - DbReads: `ProposalCount`, `origin account`",
" - DbWrites: `ProposalCount`, `Proposals`, `origin account`",
" # </weight>"
]
},
@@ -6248,9 +6288,9 @@
" Reject a proposed spend. The original deposit will be slashed.",
"",
" # <weight>",
" - O(1).",
" - Limited storage reads.",
" - One DB clear.",
" - Complexity: O(1)",
" - DbReads: `Proposals`, `rejected proposer account`",
" - DbWrites: `Proposals`, `rejected proposer account`",
" # </weight>"
]
},
@@ -6267,9 +6307,9 @@
" and the original deposit will be returned.",
"",
" # <weight>",
" - O(1).",
" - Limited storage reads.",
" - One DB change.",
" - Complexity: O(1).",
" - DbReads: `Proposals`, `Approvals`",
" - DbWrite: `Approvals`",
" # </weight>"
]
},
@@ -6300,10 +6340,10 @@
" Emits `NewTip` if successful.",
"",
" # <weight>",
" - `O(R)` where `R` length of `reason`.",
" - One balance operation.",
" - One storage mutation (codec `O(R)`).",
" - One event.",
" - Complexity: `O(R)` where `R` length of `reason`.",
" - encoding and hashing of 'reason'",
" - DbReads: `Reasons`, `Tips`, `who account data`",
" - DbWrites: `Tips`, `who account data`",
" # </weight>"
]
},
@@ -6330,10 +6370,10 @@
" Emits `TipRetracted` if successful.",
"",
" # <weight>",
" - `O(T)`",
" - One balance operation.",
" - Two storage removals (one read, codec `O(T)`).",
" - One event.",
" - Complexity: `O(1)`",
" - Depends on the length of `T::Hash` which is fixed.",
" - DbReads: `Tips`, `origin account`",
" - DbWrites: `Reasons`, `Tips`, `origin account`",
" # </weight>"
]
},
@@ -6368,10 +6408,13 @@
" Emits `NewTip` if successful.",
"",
" # <weight>",
" - `O(R + T)` where `R` length of `reason`, `T` is the number of tippers. `T` is",
" naturally capped as a membership set, `R` is limited through transaction-size.",
" - Two storage insertions (codecs `O(R)`, `O(T)`), one read `O(1)`.",
" - One event.",
" - Complexity: `O(R + T)` where `R` length of `reason`, `T` is the number of tippers.",
" - `O(T)`: decoding `Tipper` vec of length `T`",
" `T` is charged as upper bound given by `ContainsLengthBound`.",
" The actual cost depends on the implementation of `T::Tippers`.",
" - `O(R)`: hashing and encoding of reason of length `R`",
" - DbReads: `Tippers`, `Reasons`",
" - DbWrites: `Reasons`, `Tips`",
" # </weight>"
]
},
@@ -6403,9 +6446,15 @@
" has started.",
"",
" # <weight>",
" - `O(T)`",
" - One storage mutation (codec `O(T)`), one storage read `O(1)`.",
" - Up to one event.",
" - Complexity: `O(T)` where `T` is the number of tippers.",
" decoding `Tipper` vec of length `T`, insert tip and check closing,",
" `T` is charged as upper bound given by `ContainsLengthBound`.",
" The actual cost depends on the implementation of `T::Tippers`.",
"",
" Actually weight could be lower as it depends on how many tips are in `OpenTip` but it",
" is weighted as if almost full i.e of length `T-1`.",
" - DbReads: `Tippers`, `Tips`",
" - DbWrites: `Tips`",
" # </weight>"
]
},
@@ -6428,9 +6477,12 @@
" as the hash of the tuple of the original tip `reason` and the beneficiary account ID.",
"",
" # <weight>",
" - `O(T)`",
" - One storage retrieval (codec `O(T)`) and two removals.",
" - Up to three balance operations.",
" - Complexity: `O(T)` where `T` is the number of tippers.",
" decoding `Tipper` vec of length `T`.",
" `T` is charged as upper bound given by `ContainsLengthBound`.",
" The actual cost depends on the implementation of `T::Tippers`.",
" - DbReads: `Tips`, `Tippers`, `tip finder`",
" - DbWrites: `Reasons`, `Tips`, `Tippers`, `tip finder`",
" # </weight>"
]
}
@@ -7162,7 +7214,7 @@
{
"name": "Sudid",
"args": [
"bool"
"DispatchResult"
],
"documentation": [
" A sudo just took place."
@@ -7280,7 +7332,18 @@
"type": "Signature"
}
],
"documentation": []
"documentation": [
" # <weight>",
" - Complexity: `O(K + E)` where K is length of `Keys` and E is length of",
" `Heartbeat.network_state.external_address`",
"",
" - `O(K)`: decoding of length `K`",
" - `O(E)`: decoding/encoding of length `E`",
" - DbReads: pallet_session `Validators`, pallet_session `CurrentIndex`, `Keys`,",
" `ReceivedHeartbeats`",
" - DbWrites: `ReceivedHeartbeats`",
" # </weight>"
]
}
],
"events": [
@@ -7545,9 +7608,7 @@
" - `O(R)` where `R` registrar-count (governance-bounded and code-bounded).",
" - One storage mutation (codec `O(R)`).",
" - One event.",
" - Benchmarks:",
" - 78.71 + R * 0.965 µs (min squares analysis)",
" - 94.28 + R * 0.991 µs (min squares analysis)",
" - Benchmark: 24.63 + R * 0.53 µs (min squares analysis)",
" # </weight>"
]
},
@@ -7578,9 +7639,7 @@
" - One balance reserve operation.",
" - One storage mutation (codec-read `O(X' + R)`, codec-write `O(X + R)`).",
" - One event.",
" - Benchmarks:",
" - 136.6 + R * 0.62 + X * 2.62 µs (min squares analysis)",
" - 146.2 + R * 0.372 + X * 2.98 µs (min squares analysis)",
" - Benchmark: 59.44 + R * 0.389 + X * 1.434 µs (min squares analysis)",
" # </weight>"
]
},
@@ -7613,9 +7672,7 @@
" - One storage read (codec complexity `O(P)`).",
" - One storage write (codec complexity `O(S)`).",
" - One storage-exists (`IdentityOf::contains_key`).",
" - Benchmarks:",
" - 115.2 + P * 5.11 + S * 6.67 µs (min squares analysis)",
" - 121 + P * 4.852 + S * 7.111 µs (min squares analysis)",
" - Benchmark: 39.43 + P * 2.522 + S * 3.698 µs (min squares analysis)",
" # </weight>"
]
},
@@ -7641,8 +7698,8 @@
" - `2` storage reads and `S + 2` storage deletions.",
" - One event.",
" - Benchmarks:",
" - 152.3 + R * 0.306 + S * 4.967 + X * 1.697 µs (min squares analysis)",
" - 139.5 + R * 0.466 + S * 5.304 + X * 1.895 µs (min squares analysis)",
" - 57.36 + R * 0.019 + S * 2.577 + X * 0.874 µs (median slopes analysis)",
" - 57.06 + R * 0.006 + S * 2.579 + X * 0.878 µs (min squares analysis)",
" # </weight>"
]
},
@@ -7681,9 +7738,7 @@
" - One balance-reserve operation.",
" - Storage: 1 read `O(R)`, 1 mutate `O(X + R)`.",
" - One event.",
" - Benchmarks:",
" - 154 + R * 0.932 + X * 3.302 µs (min squares analysis)",
" - 172.9 + R * 0.69 + X * 3.304 µs (min squares analysis)",
" - Benchmark: 59.02 + R * 0.488 + X * 1.7 µs (min squares analysis)",
" # </weight>"
]
},
@@ -7712,9 +7767,7 @@
" - One balance-reserve operation.",
" - One storage mutation `O(R + X)`.",
" - One event.",
" - Benchmarks:",
" - 135.3 + R * 0.574 + X * 3.394 µs (min squares analysis)",
" - 144.3 + R * 0.316 + X * 3.53 µs (min squares analysis)",
" - Benchmark: 50.05 + R * 0.321 + X * 1.688 µs (min squares analysis)",
" # </weight>"
]
},
@@ -7742,8 +7795,7 @@
" # <weight>",
" - `O(R)`.",
" - One storage mutation `O(R)`.",
" - Benchmarks:",
" - 23.81 + R * 0.774 µs (min squares analysis)",
" - Benchmark: 8.848 + R * 0.425 µs (min squares analysis)",
" # </weight>"
]
},
@@ -7771,7 +7823,7 @@
" # <weight>",
" - `O(R)`.",
" - One storage mutation `O(R)`.",
" - Benchmark: 24.59 + R * 0.832 µs (min squares analysis)",
" - Benchmark: 10.05 + R * 0.438 µs (min squares analysis)",
" # </weight>"
]
},
@@ -7799,7 +7851,7 @@
" # <weight>",
" - `O(R)`.",
" - One storage mutation `O(R)`.",
" - Benchmark: 22.85 + R * 0.853 µs (min squares analysis)",
" - Benchmark: 8.985 + R * 0.413 µs (min squares analysis)",
" # </weight>"
]
},
@@ -7838,7 +7890,7 @@
" - Up to one account-lookup operation.",
" - Storage: 1 read `O(R)`, 1 mutate `O(R + X)`.",
" - One event.",
" - Benchmark: 110.7 + R * 1.066 + X * 3.402 µs (min squares analysis)",
" - Benchmark: 47.77 + R * 0.336 + X * 1.664 µs (min squares analysis)",
" # </weight>"
]
},
@@ -7869,7 +7921,7 @@
" - One balance-reserve operation.",
" - `S + 2` storage mutations.",
" - One event.",
" - Benchmark: 167.4 + R * 1.107 + S * 5.343 + X * 2.294 µs (min squares analysis)",
" - Benchmark: 101.9 + R * 0.091 + S * 2.589 + X * 0.871 µs (min squares analysis)",
" # </weight>"
]
}
@@ -9598,9 +9650,13 @@
"",
" # <weight>",
" - `O(1)`.",
" - One balance-lock operation.",
" - One storage read (codec `O(1)`) and up to one removal.",
" - One event.",
" - DbWeight: 2 Reads, 2 Writes",
" - Reads: Vesting Storage, Balances Locks, [Sender Account]",
" - Writes: Vesting Storage, Balances Locks, [Sender Account]",
" - Benchmark:",
" - Unlocked: 48.76 + .048 * l µs (min square analysis)",
" - Locked: 44.43 + .284 * l µs (min square analysis)",
" - Using 50 µs fixed. Assuming less than 50 locks on any user, else we may want factor in number of locks.",
" # </weight>"
]
},
@@ -9624,10 +9680,13 @@
"",
" # <weight>",
" - `O(1)`.",
" - Up to one account lookup.",
" - One balance-lock operation.",
" - One storage read (codec `O(1)`) and up to one removal.",
" - One event.",
" - DbWeight: 3 Reads, 3 Writes",
" - Reads: Vesting Storage, Balances Locks, Target Account",
" - Writes: Vesting Storage, Balances Locks, Target Account",
" - Benchmark:",
" - Unlocked: 44.3 + .294 * l µs (min square analysis)",
" - Locked: 48.16 + .103 * l µs (min square analysis)",
" - Using 50 µs fixed. Assuming less than 50 locks on any user, else we may want factor in number of locks.",
" # </weight>"
]
},
@@ -9655,8 +9714,12 @@
" Emits `VestingCreated`.",
"",
" # <weight>",
" - Creates a new storage entry, but is protected by a minimum transfer",
"\t amount needed to succeed.",
" - `O(1)`.",
" - DbWeight: 3 Reads, 3 Writes",
" - Reads: Vesting Storage, Balances Locks, Target Account, [Sender Account]",
" - Writes: Vesting Storage, Balances Locks, Target Account, [Sender Account]",
" - Benchmark: 100.3 + .365 * l µs (min square analysis)",
" - Using 100 µs fixed. Assuming less than 50 locks on any user, else we may want factor in number of locks.",
" # </weight>"
]
}
File diff suppressed because one or more lines are too long