| 972 | } |
| 973 | |
| 974 | Node *FindKey(const KT key) |
| 975 | { |
| 976 | HashTraits Traits; |
| 977 | Node *n = MainPosition(key); |
| 978 | while (n != NULL && !n->IsNil() && Traits.Compare(n->Pair.Key, key)) |
| 979 | { |
| 980 | n = n->Next; |
| 981 | } |
| 982 | return n == NULL || n->IsNil() ? NULL : n; |
| 983 | } |
| 984 | |
| 985 | const Node *FindKey(const KT key) const |
| 986 | { |