0xOsiris

2025-06-25T15:02:47.986937Z DEBUG engine::persistence: Saving range of blocks first=Some(NumHash { number: 15158170, hash: 0x3061c8217049f8fc8f4e8a427340fd85f8c02bf4ed6201f1821d7d8772164774 }) last=Some(NumHash { number: 15158170, hash: 0x3061c8217049f8fc8f4e8a427340fd85f8c02bf4ed6201f1821d7d8772164774 })
2025-06-25T15:02:47.986983Z DEBUG provider::storage_writer: Writing blocks and execution data to storage block_count=1
2025-06-25T15:02:47.987129Z DEBUG engine::tree: Inserting new block into tree block=NumHash { number: 15158172, hash: 0x9d85a84a7d5bd4b3b0ff1595ab5ad0ced3910740a85794c5f29a68b0a7a1cf9a } parent=0xbb2c2fa051e89feba2d2e3674caadba878632d6693ae9bc16e65032962a7c655 state_root=0x13ed800e3778903bd8803a427abf23ab319cc4a650ed0787fad6d7d2c8ec1a35
2025-06-25T15:02:47.988098Z DEBUG providers::db: Inserted block body block_number=15158170 actions=[(InsertBlockBodyIndices, 56.203µs), (InsertTransactionBlocks, 36.805µs)]
2025-06-25T15:02:47.988117Z DEBUG providers::db: Inserted block block_number=15158170 

0xOsiris

0xOsiris

### Keybase proof

I hereby claim:

  * I am 0xosiris on github.
  * I am 0xosiris (https://keybase.io/0xosiris) on keybase.
  * I have a public key ASBrLVP8Id9YT6JSHDTlWfyYmlSSYTbpKlWboDMj3F1c8go

To claim this, I am signing this object:

0xOsiris

//SPDX-License-Identifier: UNLICENSED
pragma solidity 0.6.12;

pragma experimental ABIEncoderV2;

interface IERC20 {
    event Approval(address indexed owner, address indexed spender, uint value);
    event Transfer(address indexed from, address indexed to, uint value);

    function name() external view returns (string memory);

0xOsiris

//SPDX-License-Identifier: UNLICENSED
pragma solidity 0.6.12;

pragma experimental ABIEncoderV2;

interface IERC20 {
    event Approval(address indexed owner, address indexed spender, uint value);
    event Transfer(address indexed from, address indexed to, uint value);

    function name() external view returns (string memory);

0xOsiris

public class ListSet<T> implements Set<T>{
  private int find(T e){
    int i = 0; 
    while(elements.hasNext()){
      if(elements.next()==null){
        return -1;
      }else{
        if(e==elements.next(){
          return elements.next()
        }