| 778 | typedef std::stack<HashNodes> HashStack; |
| 779 | |
| 780 | void popHashNodes( HashStack &stack, size_t size, IECore::MurmurHash &h ) |
| 781 | { |
| 782 | while( stack.size() > size ) |
| 783 | { |
| 784 | h.append( (uint64_t)stack.top().size() ); |
| 785 | std::sort( stack.top().begin(), stack.top().end() ); |
| 786 | for( HashNodes::const_iterator nIt = stack.top().begin(), nEIt = stack.top().end(); nIt != nEIt; ++nIt ) |
| 787 | { |
| 788 | h.append( nIt->name ); |
| 789 | h.append( nIt->exactMatch ); |
| 790 | } |
| 791 | stack.pop(); |
| 792 | } |
| 793 | } |
| 794 | |
| 795 | } |
| 796 |