template<typename Key, typename Value>
class MinK< Key, Value >
Definition at line 53 of file kdtree.cpp.
template<typename Key, typename Value >
MinK< Key, Value >::MinK |
( |
Key |
max_key, |
|
|
int |
k |
|
) |
| |
Definition at line 81 of file kdtree.cpp.
82 max_key_(max_key), elements_count_(0), k_(k < 1 ? 1 : k), max_index_(0) {
83 elements_ =
new Element[k_];
template<typename Key , typename Value >
template<typename Key, typename Value>
template<typename Key, typename Value>
int MinK< Key, Value >::elements_count |
( |
| ) |
|
|
inline |
Definition at line 69 of file kdtree.cpp.
69 {
return elements_count_; }
template<typename Key, typename Value>
bool MinK< Key, Value >::insert |
( |
Key |
k, |
|
|
Value |
v |
|
) |
| |
Definition at line 99 of file kdtree.cpp.
100 if (elements_count_ < k_) {
101 elements_[elements_count_++] = Element(key, value);
102 if (key > elements_[max_index_].key)
103 max_index_ = elements_count_ - 1;
105 }
else if (key < elements_[max_index_].key) {
107 elements_[max_index_] = Element(key, value);
109 for (
int i = 0; i < elements_count_; i++) {
110 if (elements_[i].key > elements_[max_index_].key)
template<typename Key , typename Value >
const Key & MinK< Key, Value >::max_insertable_key |
( |
| ) |
|
Definition at line 92 of file kdtree.cpp.
93 if (elements_count_ < k_)
95 return elements_[max_index_].
key;
The documentation for this class was generated from the following file: