Remove "available since" comments (#4424)
Co-authored-by: Hadrien Croubois <hadrien.croubois@gmail.com>
This commit is contained in:
@ -35,8 +35,6 @@ library MerkleProof {
|
||||
|
||||
/**
|
||||
* @dev Calldata version of {verify}
|
||||
*
|
||||
* _Available since v4.7._
|
||||
*/
|
||||
function verifyCalldata(bytes32[] calldata proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
|
||||
return processProofCalldata(proof, leaf) == root;
|
||||
@ -47,8 +45,6 @@ library MerkleProof {
|
||||
* from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
|
||||
* hash matches the root of the tree. When processing the proof, the pairs
|
||||
* of leafs & pre-images are assumed to be sorted.
|
||||
*
|
||||
* _Available since v4.4._
|
||||
*/
|
||||
function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {
|
||||
bytes32 computedHash = leaf;
|
||||
@ -60,8 +56,6 @@ library MerkleProof {
|
||||
|
||||
/**
|
||||
* @dev Calldata version of {processProof}
|
||||
*
|
||||
* _Available since v4.7._
|
||||
*/
|
||||
function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {
|
||||
bytes32 computedHash = leaf;
|
||||
@ -76,8 +70,6 @@ library MerkleProof {
|
||||
* `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
|
||||
*
|
||||
* CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
|
||||
*
|
||||
* _Available since v4.7._
|
||||
*/
|
||||
function multiProofVerify(
|
||||
bytes32[] memory proof,
|
||||
@ -92,8 +84,6 @@ library MerkleProof {
|
||||
* @dev Calldata version of {multiProofVerify}
|
||||
*
|
||||
* CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
|
||||
*
|
||||
* _Available since v4.7._
|
||||
*/
|
||||
function multiProofVerifyCalldata(
|
||||
bytes32[] calldata proof,
|
||||
@ -113,8 +103,6 @@ library MerkleProof {
|
||||
* CAUTION: Not all merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
|
||||
* is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
|
||||
* tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
|
||||
*
|
||||
* _Available since v4.7._
|
||||
*/
|
||||
function processMultiProof(
|
||||
bytes32[] memory proof,
|
||||
@ -171,8 +159,6 @@ library MerkleProof {
|
||||
* @dev Calldata version of {processMultiProof}.
|
||||
*
|
||||
* CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
|
||||
*
|
||||
* _Available since v4.7._
|
||||
*/
|
||||
function processMultiProofCalldata(
|
||||
bytes32[] calldata proof,
|
||||
|
||||
Reference in New Issue
Block a user