find kd-tree node whose key is identical to key . uses algorithm translated from 352.srch.c of gonnet & baeza-yates . concode_field_sep KDNode m_root concode_elem_sep int m_count concode_elem_sep int m_K concode_field_sep Vector<Pair<double[],Object>> rangePoints concode_elem_sep void insert concode_elem_sep Object[] range concode_elem_sep String toString concode_elem_sep void delete concode_elem_sep Object nearest concode_elem_sep Object[] nearest concode_elem_sep Vector<Pair<double[],Object>> nearestNPoints
Object function ( double [ ] arg0 ) { if ( arg0 . length != m_K ) { throw new RuntimeException ( "srini_string" ) ; } KDNode loc0 = KDNode . srch ( new HPoint ( arg0 ) , m_root , m_K ) ; return ( loc0 == null ? null : loc0 . v ) ; }