Lines Matching refs:sidx
106 sidx0.copyTo(sidx);
107 std::sort(sidx.begin(), sidx.end());
112 setRangeVector(sidx, n);
227 bool ok = addTree( w->sidx ) >= 0;
238 int DTreesImpl::addTree(const vector<int>& sidx )
259 int w_root = addNodeAndTrySplit(-1, sidx);
351 int DTreesImpl::addNodeAndTrySplit( int parent, const vector<int>& sidx )
368 int i, n = node.sample_count = (int)sidx.size();
372 calcValue( nidx, sidx );
379 const int* s = &sidx[0];
394 node.split = findBestSplit( sidx );
400 node.defaultDir = calcDir( node.split, sidx, sleft, sright );
646 const int* sidx = &_sidx[0];
664 int si = sidx[i];
682 int si = sidx[curr];
