| 131 | // order, after the signature generation the entries at the same |
| 132 | // links get further sorted by their peer node ranks. |
| 133 | struct HashedPeer { |
| 134 | HashedPeer(size_t l, SigNode* p) : link_hash(l), peer(p) {} |
| 135 | |
| 136 | struct LessByRank { |
| 137 | bool operator()(const SigNode::HashedPeer& left, |
| 138 | const SigNode::HashedPeer& right) { |
| 139 | return left.peer->unique_rank_ < right.peer->unique_rank_; |
| 140 | } |
| 141 | }; |
| 142 | |
| 143 | size_t link_hash; |
| 144 | SigNode* peer; |
| 145 | }; |
| 146 | using HashedPeerVector = std::vector<HashedPeer>; |
| 147 | const HashedPeerVector& hashed_peers() const { return hashed_peers_; } |
| 148 |
no outgoing calls