Method contains

code/data-structures/kd_tree.cpp:54–54

            construct(pts, from, mid - 1, INC(c)),
            construct(pts, mid + 1, to, INC(c))); }
  bool contains(const pt &p) { return _con(p, root, 0); }
  bool _con(const pt &p, node *n, int c) {
    if (!n) return false;
    if (cmp(c)(p, n->p)) return _con(p, n->l, INC(c));