Lines Matching defs:split
69 int dim; // split dimension; >=0 for nodes, -1 for leaves
166 __instype *split = median;
167 for (; split != last && deref(ctor(*split), dim) ==
168 deref(ctor(*median), dim); ++split);
170 if (split == last) { // leaf
172 for (--split; split >= first; --split) {
176 n.value = ctor(*split);
191 int left = insert(first, split, ctor);
193 int right = insert(split, last, ctor);
