| dump_statistics() | guma::rkdtree_base | |
| dump_tree() | guma::rkdtree_base | |
| insert(const U *rec) | guma::rkdtree | [inline] |
| insert(kdtnode< U, V > *T, const kdrec< U, V > &rec) | guma::rkdtree | |
| join(kdtnode< U, V > *A, kdtnode< U, V > *B, int i) | guma::rkdtree | |
| m_dim | guma::rkdtree_base | |
| m_root | guma::rkdtree_base | |
| nearest_neighbors(const U &P, int m, gul::Ptr< kdnnrec< U, V > > &M) | guma::rkdtree_base | |
| operator delete(void *p, size_t s) | gul::pool_object | [inline] |
| operator new(size_t s) | gul::pool_object | [inline] |
| remove(const U *rec, gul::List< gul::ListNode< kdrec< U, V > > > &outrecs) | guma::rkdtree | [inline] |
| remove(kdtnode< U, V > *T, const kdrec< U, V > &rec, gul::List< gul::ListNode< kdrec< U, V > > > &outrecs) | guma::rkdtree | |
| rkdtree(int dim) | guma::rkdtree | [inline] |
| rkdtree_base(int dim) | guma::rkdtree_base | [inline] |
| split(kdtnode< U, V > *T, const V &key, int i, kdtnode< U, V > **retL, kdtnode< U, V > **retR, gul::List< gul::ListNode< kdrec< U, V > > > &C) | guma::rkdtree | |
| split(kdtnode< U, V > *T, const kdrec< U, V > &X, int i, kdtnode< U, V > **retL, kdtnode< U, V > **retR, gul::List< gul::ListNode< kdrec< U, V > > > &C) | guma::rkdtree | [inline] |
| split_recs(gul::List< gul::ListNode< kdrec< U, V > > > &recs, const V &key, int i, gul::List< gul::ListNode< kdrec< U, V > > > &recs1, gul::List< gul::ListNode< kdrec< U, V > > > &recs2, gul::List< gul::ListNode< kdrec< U, V > > > &C) | guma::rkdtree_base | |
| split_recs(gul::List< gul::ListNode< kdrec< U, V > > > &recs, const U &X, int i, gul::List< gul::ListNode< kdrec< U, V > > > &recs1, gul::List< gul::ListNode< kdrec< U, V > > > &recs2, gul::List< gul::ListNode< kdrec< U, V > > > &C) | guma::rkdtree_base | [inline] |
| ~rkdtree() | guma::rkdtree | [inline] |
| ~rkdtree_base() | guma::rkdtree_base | [inline] |
