aboutsummaryrefslogtreecommitdiff
path: root/src/cryptonote_core/blockchain.h
diff options
context:
space:
mode:
authormoneromooo-monero <moneromooo-monero@users.noreply.github.com>2018-12-24 15:35:42 +0000
committermoneromooo-monero <moneromooo-monero@users.noreply.github.com>2018-12-25 15:19:41 +0000
commit6f2081f86759b33e1b07ff62df4411ba8655b0c7 (patch)
tree343c2d44fc4f7ac464dcc5dd30bf8acd27182ace /src/cryptonote_core/blockchain.h
parentMerge pull request #4902 (diff)
downloadmonero-6f2081f86759b33e1b07ff62df4411ba8655b0c7.tar.xz
cryptonote_core: revert extra_tx_map
While the lookups are faster, the zeroCommit calls have to be done again when storing the new outputs in the db, which ends up making the whole thing slower after all, and the ways this can be cached aren't very nice code wise, so let's forget it since the gains aren't very large anyway.
Diffstat (limited to 'src/cryptonote_core/blockchain.h')
-rw-r--r--src/cryptonote_core/blockchain.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/cryptonote_core/blockchain.h b/src/cryptonote_core/blockchain.h
index 877828f81..ee394d2b7 100644
--- a/src/cryptonote_core/blockchain.h
+++ b/src/cryptonote_core/blockchain.h
@@ -918,7 +918,7 @@ namespace cryptonote
* @param outputs return-by-reference the outputs collected
*/
void output_scan_worker(const uint64_t amount,const std::vector<uint64_t> &offsets,
- std::vector<output_data_t> &outputs, const std::vector<output_data_t> &extra_tx_map) const;
+ std::vector<output_data_t> &outputs) const;
/**
* @brief computes the "short" and "long" hashes for a set of blocks