| 194 | // Ordering by node order and highest available hash (it must be |
| 195 | // previously computed). |
| 196 | struct NodeOrderLess { |
| 197 | bool operator()(const SigNode* left, const SigNode* right) { |
| 198 | return left->topo_hash_.back() < right->topo_hash_.back(); |
| 199 | } |
| 200 | }; |
| 201 | |
| 202 | private: |
| 203 | const NodeDef* node_; |