|
rippled
|

Public Types | |
| using | StackEntry = std::tuple< SHAMapInnerNode *, SHAMapNodeID, int, int, bool > |
| using | DeferredNode = std::tuple< SHAMapInnerNode *, SHAMapNodeID, int, std::shared_ptr< SHAMapTreeNode > > |
Public Member Functions | |
| MissingNodes ()=delete | |
| MissingNodes (const MissingNodes &)=delete | |
| MissingNodes & | operator= (const MissingNodes &)=delete |
| MissingNodes (int max, SHAMapSyncFilter *filter, int maxDefer, std::uint32_t generation) | |
Public Attributes | |
| int | max_ |
| SHAMapSyncFilter * | filter_ |
| const int | maxDefer_ |
| std::uint32_t | generation_ |
| std::vector< std::pair< SHAMapNodeID, uint256 > > | missingNodes_ |
| std::set< SHAMapHash > | missingHashes_ |
| std::stack< StackEntry, std::deque< StackEntry > > | stack_ |
| int | deferred_ |
| std::mutex | deferLock_ |
| std::condition_variable | deferCondVar_ |
| std::vector< DeferredNode > | finishedReads_ |
| std::map< SHAMapInnerNode *, SHAMapNodeID > | resumes_ |
| using ripple::SHAMap::MissingNodes::StackEntry = std::tuple< SHAMapInnerNode*, SHAMapNodeID, int, int, bool> |
|
delete |
|
delete |
| ripple::SHAMap::MissingNodes::MissingNodes | ( | int | max, |
| SHAMapSyncFilter * | filter, | ||
| int | maxDefer, | ||
| std::uint32_t | generation | ||
| ) |
|
delete |
| SHAMapSyncFilter* ripple::SHAMap::MissingNodes::filter_ |
| std::uint32_t ripple::SHAMap::MissingNodes::generation_ |
| std::vector<std::pair<SHAMapNodeID, uint256> > ripple::SHAMap::MissingNodes::missingNodes_ |
| std::set<SHAMapHash> ripple::SHAMap::MissingNodes::missingHashes_ |
| std::stack<StackEntry, std::deque<StackEntry> > ripple::SHAMap::MissingNodes::stack_ |
| std::mutex ripple::SHAMap::MissingNodes::deferLock_ |
| std::condition_variable ripple::SHAMap::MissingNodes::deferCondVar_ |
| std::vector<DeferredNode> ripple::SHAMap::MissingNodes::finishedReads_ |
| std::map<SHAMapInnerNode*, SHAMapNodeID> ripple::SHAMap::MissingNodes::resumes_ |
1.8.17