MCPcopy Create free account
hub / github.com/SuprDewd/CompetitiveProgramming / bound

Method bound

code/data-structures/kd_tree.cpp:33–37  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

31 }
32 return sqrt(sum); }
33 bb bound(double l, int c, bool left) {
34 pt nf(from.coord), nt(to.coord);
35 if (left) nt.coord[c] = min(nt.coord[c], l);
36 else nf.coord[c] = max(nf.coord[c], l);
37 return bb(nf, nt); } };
38 struct node {
39 pt p; node *l, *r;
40 node(pt _p, node *_l, node *_r)

Callers 1

_nnMethod · 0.80

Calls 1

bbClass · 0.85

Tested by

no test coverage detected