mirror of
https://github.com/tornadocash/tornado-trees.git
synced 2024-12-04 23:15:01 +01:00
minor
This commit is contained in:
parent
e209000550
commit
5912a5c030
@ -116,7 +116,7 @@ contract TornadoTrees is EnsResolve {
|
|||||||
// Find the segment with correct array length
|
// Find the segment with correct array length
|
||||||
bool direction = elementExists(_tornadoTreesV1, _type, _from);
|
bool direction = elementExists(_tornadoTreesV1, _type, _from);
|
||||||
do {
|
do {
|
||||||
_from = direction ? _from + _step : _from - _step; // safe math?
|
_from = direction ? _from + _step : _from - _step;
|
||||||
} while (direction == elementExists(_tornadoTreesV1, _type, _from));
|
} while (direction == elementExists(_tornadoTreesV1, _type, _from));
|
||||||
uint256 high = direction ? _from : _from + _step;
|
uint256 high = direction ? _from : _from + _step;
|
||||||
uint256 low = direction ? _from - _step : _from;
|
uint256 low = direction ? _from - _step : _from;
|
||||||
@ -129,7 +129,7 @@ contract TornadoTrees is EnsResolve {
|
|||||||
} else {
|
} else {
|
||||||
high = mid;
|
high = mid;
|
||||||
}
|
}
|
||||||
mid = (high + low) / 2;
|
mid = (low + high) / 2;
|
||||||
}
|
}
|
||||||
return mid + 1;
|
return mid + 1;
|
||||||
}
|
}
|
||||||
@ -139,7 +139,7 @@ contract TornadoTrees is EnsResolve {
|
|||||||
string memory _type,
|
string memory _type,
|
||||||
uint256 index
|
uint256 index
|
||||||
) public view returns (bool success) {
|
) public view returns (bool success) {
|
||||||
// Try to get the element. If it succeeds array the length is higher, it it reverts the length is equal or lower
|
// Try to get the element. If it succeeds the array length is higher, it it reverts the length is equal or lower
|
||||||
(success, ) = address(_tornadoTreesV1).staticcall{ gas: 2500 }(abi.encodeWithSignature(_type, index));
|
(success, ) = address(_tornadoTreesV1).staticcall{ gas: 2500 }(abi.encodeWithSignature(_type, index));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user