| compare_key_to_node(V *k, kdnnrec< U, V > *r) | guma::kdtsearch |  [static] | 
| kdtsearch(int dim, int maxNeighbors) | guma::kdtsearch |  [inline] | 
| length(const gul::Ptr< V > &P) | guma::kdtsearch | |
| m_dim | guma::kdtsearch | |
| m_maxDist | guma::kdtsearch | |
| m_maxNeighbors | guma::kdtsearch | |
| m_neighbors | guma::kdtsearch | |
| m_nNeighbors | guma::kdtsearch | |
| operator delete(void *p, size_t s) | gul::pool_object |  [inline] | 
| operator new(size_t s) | gul::pool_object |  [inline] | 
| process_node(const U &P, const kdtnode< U, V > *n, const gul::Ptr< V > &D, V d, gul::List< gul::ListNode< kdtsnode< U, V > > > &stack) | guma::kdtsearch | |
| scan_records(const U &P, const gul::List< gul::ListNode< kdrec< U, V > > > &recs) | guma::kdtsearch | 
1.2.13.1 written by Dimitri van Heesch,
 © 1997-2001