good morning!!!!

Skip to content
Snippets Groups Projects
  1. Jun 21, 2017
    • Zsolt Felföldi's avatar
      les: code refactoring (#14416) · a5d08c89
      Zsolt Felföldi authored
      This commit does various code refactorings:
      
      - generalizes and moves the request retrieval/timeout/resend logic out of LesOdr
        (will be used by a subsequent PR)
      - reworks the peer management logic so that all services can register with
        peerSet to get notified about added/dropped peers (also gets rid of the ugly
        getAllPeers callback in requestDistributor)
      - moves peerSet, LesOdr, requestDistributor and retrieveManager initialization
        out of ProtocolManager because I believe they do not really belong there and the
        whole init process was ugly and ad-hoc
      a5d08c89
    • Jim McDonald's avatar
      ethclient: fix TransactionByHash pending return value. (#14663) · 60e27b51
      Jim McDonald authored
      As per #14661 TransactionByHash always returns false for pending.
      This uses blockNumber rather than blockHash to ensure that it returns
      the correct value for pending and will not suffer side-effects if
      eth_getTransactionByHash is fixed in future.
      60e27b51
  2. Jun 20, 2017
    • Felix Lange's avatar
      trie: more node iterator improvements (#14615) · 693d9ccb
      Felix Lange authored
      * ethdb: remove Set
      
      Set deadlocks immediately and isn't part of the Database interface.
      
      * trie: add Err to Iterator
      
      This is useful for testing because the underlying NodeIterator doesn't
      need to be kept in a separate variable just to get the error.
      
      * trie: add LeafKey to iterator, panic when not at leaf
      
      LeafKey is useful for callers that can't interpret Path.
      
      * trie: retry failed seek/peek in iterator Next
      
      Instead of failing iteration irrecoverably, make it so Next retries the
      pending seek or peek every time.
      
      Smaller changes in this commit make this easier to test:
      
      * The iterator previously returned from Next on encountering a hash
        node. This caused it to visit the same path twice.
      * Path returned nibbles with terminator symbol for valueNode attached
        to fullNode, but removed it for valueNode attached to shortNode. Now
        the terminator is always present. This makes Path unique to each node
        and simplifies Leaf.
      
      * trie: add Path to MissingNodeError
      
      The light client trie iterator needs to know the path of the node that's
      missing so it can retrieve a proof for it. NodeIterator.Path is not
      sufficient because it is updated when the node is resolved and actually
      visited by the iterator.
      
      Also remove unused fields. They were added a long time ago before we
      knew which fields would be needed for the light client.
      693d9ccb
  3. Jun 16, 2017
  4. Jun 15, 2017
  5. Jun 13, 2017
  6. Jun 12, 2017
  7. Jun 08, 2017
  8. Jun 07, 2017
  9. Jun 06, 2017
  10. Jun 05, 2017
  11. Jun 01, 2017
  12. May 31, 2017
Loading