| 64 | else if (cmp(c)(n->p, p)) _ins(p, n->r, INC(c)); } |
| 65 | void clear() { _clr(root); root = NULL; } |
| 66 | void _clr(node *n) { |
| 67 | if (n) _clr(n->l), _clr(n->r), delete n; } |
| 68 | pair<pt, bool> nearest_neighbour(const pt &p, |
| 69 | bool allow_same=true) { |
| 70 | double mn = INFINITY, cs[K]; |
nothing calls this directly
no outgoing calls
no test coverage detected