// Copyright (c) 2012-2015, The CryptoNote developers, The Bytecoin developers // // This file is part of Bytecoin. // // Bytecoin is free software: you can redistribute it and/or modify // it under the terms of the GNU Lesser General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // Bytecoin is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU Lesser General Public License for more details. // // You should have received a copy of the GNU Lesser General Public License // along with Bytecoin. If not, see . #include #include #include #include "crypto/hash.h" #include namespace CryptoNote { class BlockIndex { public: BlockIndex() : m_index(m_container.get<1>()) {} void pop() { m_container.pop_back(); } // returns true if new element was inserted, false if already exists bool push(const crypto::hash& h) { auto result = m_container.push_back(h); return result.second; } bool hasBlock(const crypto::hash& h) const { return m_index.find(h) != m_index.end(); } bool getBlockHeight(const crypto::hash& h, uint64_t& height) const { auto hi = m_index.find(h); if (hi == m_index.end()) return false; height = std::distance(m_container.begin(), m_container.project<0>(hi)); return true; } size_t size() const { return m_container.size(); } void clear() { m_container.clear(); } crypto::hash getBlockId(uint64_t height) const; bool getBlockIds(uint64_t startHeight, size_t maxCount, std::list& items) const; bool findSupplement(const std::list& ids, uint64_t& offset) const; bool getShortChainHistory(std::list& ids) const; crypto::hash getTailId() const; template void serialize(Archive& ar, const unsigned int version) { ar & m_container; } private: typedef boost::multi_index_container < crypto::hash, boost::multi_index::indexed_by< boost::multi_index::random_access<>, boost::multi_index::hashed_unique> > > ContainerT; ContainerT m_container; ContainerT::nth_index<1>::type& m_index; }; }