<p>In <a href="https://github.com/mlpack/mlpack/pull/699#discussion_r69030868">src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp</a>:</p>
<pre style='color:#555'>> + std::vector<SortStruct<ElemType>> sorted(node->NumChildren());
> +
> + for (size_t i = 0; i < node->NumChildren(); i++)
> + {
> + sorted[i].d = SplitPolicy::Bound(node->Child(i))[axis].Hi();
> + sorted[i].n = i;
> + }
> + // Sort high bounds of children.
> + std::sort(sorted.begin(), sorted.end(), StructComp<ElemType>);
> +
> + size_t splitPointer = fillFactor * node->NumChildren();
> +
> + axisCut = sorted[splitPointer - 1].d;
> +
> + // Check if the partition is suitable.
> + if (!CheckNonLeafSweep(node, axis, axisCut))
</pre>
<p>Absolutely so, I'll add a comment in order to clarify that.</p>
<p style="font-size:small;-webkit-text-size-adjust:none;color:#666;">—<br />You are receiving this because you are subscribed to this thread.<br />Reply to this email directly, <a href="https://github.com/mlpack/mlpack/pull/699/files/e165d759f9ae612b9965f70fbbf8abdb19dc8d07#r69030868">view it on GitHub</a>, or <a href="https://github.com/notifications/unsubscribe/AJ4bFMhFZT3SfLsXxLddPWfb7kYejIiBks5qQuJ2gaJpZM4I3ATw">mute the thread</a>.<img alt="" height="1" src="https://github.com/notifications/beacon/AJ4bFHT4k_M3vyL0-mVuqK9xVSsEmi-5ks5qQuJ2gaJpZM4I3ATw.gif" width="1" /></p>
<div itemscope itemtype="http://schema.org/EmailMessage">
<div itemprop="action" itemscope itemtype="http://schema.org/ViewAction">
<link itemprop="url" href="https://github.com/mlpack/mlpack/pull/699/files/e165d759f9ae612b9965f70fbbf8abdb19dc8d07#r69030868"></link>
<meta itemprop="name" content="View Pull Request"></meta>
</div>
<meta itemprop="description" content="View this Pull Request on GitHub"></meta>
</div>