public Block[] FindBlocks(Keccak blockHash, int numberOfBlocks, int skip, bool reverse)
 {
     return(_wrapped.FindBlocks(blockHash, numberOfBlocks, skip, reverse));
 }
Beispiel #2
0
 public Block[] Find(Keccak hash, int numberOfBlocks, int skip, bool reverse)
 {
     return(_blockTree.FindBlocks(hash, numberOfBlocks, skip, reverse));
 }