| 66 | } |
| 67 | |
| 68 | bool find(const _KeyTp& key, _ValueTp& value) const |
| 69 | { |
| 70 | size_t a = 0, b = vec.size(); |
| 71 | while( b > a ) |
| 72 | { |
| 73 | size_t c = (a + b)/2; |
| 74 | if( vec[c].first < key ) |
| 75 | a = c+1; |
| 76 | else |
| 77 | b = c; |
| 78 | } |
| 79 | |
| 80 | if( a < vec.size() && vec[a].first == key ) |
| 81 | { |
| 82 | value = vec[a].second; |
| 83 | return true; |
| 84 | } |
| 85 | return false; |
| 86 | } |
| 87 | |
| 88 | void get_keys(vector<_KeyTp>& keys) const |
| 89 | { |
no test coverage detected