diff options
Diffstat (limited to 'meowpp/dsa/KD_Tree.h')
| -rw-r--r-- | meowpp/dsa/KD_Tree.h | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/meowpp/dsa/KD_Tree.h b/meowpp/dsa/KD_Tree.h index 05f9b1b..e3bd73b 100644 --- a/meowpp/dsa/KD_Tree.h +++ b/meowpp/dsa/KD_Tree.h @@ -43,12 +43,12 @@ private: Vector vector_; ssize_t lChild_; ssize_t rChild_; - + Node(Vector v, ssize_t l, ssize_t r): vector_(v), lChild_(l), rChild_(r){ } }; typedef std::vector<Node> Nodes; - + class Sorter { private: Nodes const* nodes_; @@ -187,16 +187,16 @@ private: public: //! Custom Type: Vectors is \c std::vector<Vector> typedef typename std::vector<Vector> Vectors; - + //! @brief constructor, with dimension = 1 KD_Tree(): kNIL_(-1), root_(kNIL_), needRebuild_(false), dimension_(1) { } - + //! @brief constructor, given dimension KD_Tree(size_t dimension): kNIL_(-1), root_(kNIL_), needRebuild_(false), dimension_(dimension) { } - + //! @brief destructor ~KD_Tree() { } @@ -254,7 +254,7 @@ public: } /*! - * @brief 查找 + * @brief 查找 * * 於set中找尋距離指定向量前 \c i 近的向量, 並依照由近而遠的順序排序. * 如果有兩個向量\c v1,v2 距離一樣, 且 \c cmp 為\c true , 則直接依照 |