Searched refs:mFeatStartId (Results 1 – 6 of 6) sorted by relevance
95 if ( !ok[mFeatStartId[i] + j] ) in reduce()97 …if ( mLabelPositions.at( mFeatStartId[i] + j )->getNumOverlaps() == 0 ) // if candidate has no ove… in reduce()100 ok[mFeatStartId[i] + j] = true; in reduce()108 lpid = mFeatStartId[i] + k; in reduce()179 label = mFeatStartId[i] + j; in init_sol_falp()209 …for ( int i = mFeatStartId[probFeatId]; i < mFeatStartId[probFeatId] + mFeatNbLp[probFeatId]; i++ ) in init_sol_falp()247 start_p = mFeatStartId[i]; in init_sol_falp()332 if ( !( tmpsol[seed] == -1 && i == -1 ) && i + mFeatStartId[seed] != tmpsol[seed] ) in chain()336 lid = mFeatStartId[seed] + i; in chain()662 const int startIndexForLabelPlacements = mFeatStartId[i]; in getSolution()[all …]
113 …ndidate( int feature, int candidate ) const { return mLabelPositions[ mFeatStartId[feature] + cand… in featureCandidate()206 std::vector< int > mFeatStartId; variable
280 prob->mFeatStartId.resize( prob->mFeatureCount ); in extract()321 prob->mFeatStartId[i] = idlp; in extract()
95 if ( !ok[mFeatStartId[i] + j] ) in reduce()97 …if ( mLabelPositions.at( mFeatStartId[i] + j )->getNumOverlaps() == 0 ) // if candidate has no ove… in reduce()100 ok[mFeatStartId[i] + j] = true; in reduce()108 lpid = mFeatStartId[i] + k; in reduce()179 label = mFeatStartId[i] + j; in init_sol_falp()209 …for ( int i = mFeatStartId[probFeatId]; i < mFeatStartId[probFeatId] + mFeatNbLp[probFeatId]; i++ ) in init_sol_falp()247 start_p = mFeatStartId[i]; in init_sol_falp()327 if ( !( tmpsol[seed] == -1 && i == -1 ) && i + mFeatStartId[seed] != tmpsol[seed] ) in chain()331 lid = mFeatStartId[seed] + i; in chain()666 const int startIndexForLabelPlacements = mFeatStartId[i]; in getSolution()[all …]
112 …ndidate( int feature, int candidate ) const { return mLabelPositions[ mFeatStartId[feature] + cand… in featureCandidate()200 std::vector< int > mFeatStartId; variable
278 prob->mFeatStartId.resize( prob->mFeatureCount ); in extract()319 prob->mFeatStartId[i] = idlp; in extract()