Lines Matching defs:score
146 IndexType score ; /* the score used to maintain heap, if col is alive */
523 Col [col].shared2.score = 0 ;
694 Kills dense or empty columns and rows, calculates an initial score for
723 IndexType score ; /* current column score */
728 IndexType min_score ; /* smallest column score */
812 /* now find the initial matlab score for each column */
820 score = 0 ;
836 score += Row [row].shared1.degree - 1 ;
838 score = numext::mini(score, n_col) ;
852 /* set column length and set score */
853 COLAMD_ASSERT (score >= 0) ;
854 COLAMD_ASSERT (score <= n_col) ;
856 Col [c].shared2.score = score ;
883 COLAMD_DEBUG4 (("place %d score %d minscore %d ncol %d\n",
884 c, Col [c].shared2.score, min_score, n_col)) ;
886 /* === Add columns score to DList =============================== */
888 score = Col [c].shared2.score ;
892 COLAMD_ASSERT (score >= 0) ;
893 COLAMD_ASSERT (score <= n_col) ;
894 COLAMD_ASSERT (head [score] >= COLAMD_EMPTY) ;
896 /* now add this column to dList at proper score location */
897 next_col = head [score] ;
901 /* if there already was a column with the same score, set its */
907 head [score] = c ;
909 /* see if this score is less than current min */
910 min_score = numext::mini(min_score, score) ;
963 IndexType pivot_col_score ; /* score of pivot column */
969 IndexType max_score ; /* maximum possible score */
970 IndexType cur_score ; /* score of current column */
977 IndexType min_score ; /* smallest column score */
1023 /* remember score for defrag check */
1024 pivot_col_score = Col [pivot_col].shared2.score ;
1131 /* score is the sum of the pivot row "length", plus the size of the */
1134 /* excluded from the column score (we thus use an approximate */
1140 /* the pivot row. Thus, the amortized time to compute a column score */
1170 cur_score = Col [col].shared2.score ;
1295 /* save score so far */
1296 Col [col].shared2.score = cur_score ;
1368 /* retrieve score so far and add on pivot row's degree. */
1371 cur_score = Col [col].shared2.score + pivot_row_degree ;
1373 /* calculate the max possible score as the number of */
1378 /* make the score the external degree of the union-of-rows */
1381 /* make sure score is less or equal than the max score */
1385 /* store updated score */
1386 Col [col].shared2.score = cur_score ;
1404 /* see if this score is less than current min */
1542 linear in the sum of the sizes (lengths) of each column whose score has
1625 Col [c].shared2.score != Col [super_c].shared2.score)
1657 COLAMD_ASSERT (Col [c].shared2.score == Col [super_c].shared2.score) ;
