| 56 | const _ValueTp& operator [](size_t idx) const { return vec[idx]; } |
| 57 | |
| 58 | void add(const _KeyTp& k, const _ValueTp& val) |
| 59 | { |
| 60 | pair<_KeyTp, _ValueTp> p(k, val); |
| 61 | vec.push_back(p); |
| 62 | size_t i = vec.size()-1; |
| 63 | for( ; i > 0 && vec[i].first < vec[i-1].first; i-- ) |
| 64 | std::swap(vec[i-1], vec[i]); |
| 65 | CV_Assert( i == 0 || vec[i].first != vec[i-1].first ); |
| 66 | } |
| 67 | |
| 68 | bool find(const _KeyTp& key, _ValueTp& value) const |
| 69 | { |
no test coverage detected