merit_left,merit_right])&gt;merit_here, 
0075             keep_original = 0;
0076             bin_tree.merit    = [merit_left, merit_right];
0077             bin_tree.points   = [points_left(1:end), points_right(2:end)];
0078         <span class="keyword">end</span>
0079     <span class="keyword">end</span>
0080     <span class="keyword">if</span> keep_original,
0081        bin_tree.merit = merit_here;
0082        bin_tree.points = [index(1),index(end)];
0083     <span class="keyword">end</span>
0084 <span 