We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 9492049 commit c5861edCopy full SHA for c5861ed
src/RefinementTree.cpp
@@ -88,13 +88,12 @@ namespace prlearn {
88
}
89
90
else {
91
- size_t j = 0;
92
for(size_t i = 0; i < n_labels; ++i)
93
{
+ size_t j = 0;
94
for(;j < _mapping.size() && _mapping[j]._label < next_labels[i]; ++j) {};
95
- if(j >= _mapping.size()) return val;
96
- if(_mapping[j]._label != next_labels[i])
97
- continue;
+ if(j >= _mapping.size()) continue;
+ if(_mapping[j]._label != next_labels[i]) continue;
98
const auto& res = _mapping[j];
99
auto node = _nodes[res._nid].get_leaf(point, res._nid, _nodes);
100
auto v = _nodes[node]._predictor._q.avg();
0 commit comments