Lines Matching refs:GetSize

106   int GetSize() const { return m_size; }  in GetSize()  function in ManualBuffer
147 inline int GetSize() const { return m_size; } in GetSize() function in EnhancedSmart::Slice
167 if (Smart<T>::m_active != rhs.GetSize()) Smart<T>::ResizeClear(rhs.GetSize()); in operator =()
168 for (int i = 0; i < rhs.GetSize(); i++) Smart<T>::m_data[i] = rhs.m_data[i]; in operator =()
274 int init = key % m_table.GetSize(); in Find()
276 for (; idx < m_table.GetSize(); idx++) { in Find()
301 for (++m_last; m_last < m_table.GetSize(); m_last++) { in Pop()
315 m_table.ResizeClear(old_table.GetSize() * 2); in Rehash()
316 for (int i = 0; i < old_table.GetSize(); i++) { in Rehash()
346 int init = key % m_table.GetSize(); in Find()
348 for (; idx < m_table.GetSize(); idx++) { in Find()
372 for (int i = 0; i < m_table.GetSize(); i++) m_table[i].key = -1; in ClearTable()
379 m_table.ResizeClear(old_table.GetSize() * 2); in Rehash()
380 for (int i = 0; i < old_table.GetSize(); i++) { in Rehash()
404 rows.ResizeClear(in_rows.GetSize()); in Set()
405 for (int i = 0; i < in_rows.GetSize(); i++) rows[i] = in_rows[i]; in Set()
406 cols.ResizeClear(in_cols.GetSize()); in Set()
407 for (int i = 0; i < in_cols.GetSize(); i++) cols[i] = in_cols[i]; in Set()
423 int GetSize() { return m_size; } in GetSize() function in FExact::PendingPathExtremesTable
427 int init = key % m_table.GetSize(); in Find()
429 for (; idx < m_table.GetSize(); idx++) { in Find()
454 … for (int i = 0; i < m_table.GetSize(); i++) if (m_table[i].key >= 0 && !m_table[i].inprogress) { in Pop()
468 m_table.ResizeClear(old_table.GetSize() * 2); in Rehash()
469 for (int i = 0; i < old_table.GetSize(); i++) { in Rehash()
594 m_key_multipliers.Resize(m_row_marginals.GetSize()); in FExact()
596 for (int i = 1; i < m_row_marginals.GetSize(); i++) in FExact()
601 assert((m_row_marginals[m_row_marginals.GetSize() - 2] + 1) <= in FExact()
602 (std::numeric_limits<int>::max() / m_key_multipliers[m_row_marginals.GetSize() - 2])); in FExact()
620 for (int j = 0; j < m_col_marginals.GetSize(); j++) { in FExact()
622 for (int i = 0; i < m_row_marginals.GetSize(); i++) { in FExact()
623 if (m_row_marginals.GetSize() == table.NumRows()) { in FExact()
645 for (int i = 0; i < denominator.GetSize(); i++) ret_val -= m_facts[denominator[i]]; in logMultinomial()
653 for (int i = 0; i < denominator.GetSize(); i++) ret_val -= m_facts[denominator[i]]; in logMultinomial()
667 int k = m_col_marginals.GetSize(); in Calculate()
671 MarginalArray row_diff(m_row_marginals.GetSize()); in Calculate()
672 MarginalArray irn(m_row_marginals.GetSize()); in Calculate()
677 int kb = m_col_marginals.GetSize() - k; in Calculate()
684 for (int i = kb + 1; i < m_col_marginals.GetSize(); i++) ntot += m_col_marginals[i]; in Calculate()
687 … for (int i = 0; i < m_row_marginals.GetSize(); i++) irn[i] = m_row_marginals[i] - row_diff[i]; in Calculate()
691 if (irn.GetSize() == 2) { in Calculate()
699 for (; i < irn.GetSize(); i++) if (irn[i] != 0) break; in Calculate()
706 MarginalArray::Slice sub_rows = irn.GetSlice(nrb, irn.GetSize() - 1); in Calculate()
707 … MarginalArray::Slice sub_cols = m_col_marginals.GetSlice(kb + 1, m_col_marginals.GetSize() - 1); in Calculate()
719 for (int i = 2; i < irn.GetSize(); i++) kval += irn[i] * m_key_multipliers[i]; in Calculate()
762 for (int i = m_row_marginals.GetSize() - 1; i > 0; i--) { in Calculate()
779 int k = m_col_marginals.GetSize(); in ThreadedCalculate()
791 for (int i = 0; i < path_calcs.GetSize(); i++) { in ThreadedCalculate()
799 …for (int i = 2; i < m_row_marginals.GetSize(); i++) kval += m_row_marginals[i] * m_key_multipliers… in ThreadedCalculate()
809 if (m_pending_path_nodes[k].GetSize()) { in ThreadedCalculate()
811 while (m_pending_path_extremes[k].GetSize()) { in ThreadedCalculate()
813 if (m_completed_path_extremes[k].GetSize()) { in ThreadedCalculate()
817 for (int i = 0; i < temp_completed.GetSize(); i++) { in ThreadedCalculate()
824 for (int i = 0; i < m_pending_path_nodes[k].GetSize(); i++) { in ThreadedCalculate()
847 for (int i = 0; i < m_completed_path_extremes[k].GetSize(); i++) { in ThreadedCalculate()
857 for (int i = 0; i < m_pending_path_nodes[k].GetSize(); i++) { in ThreadedCalculate()
878 for (int i = 0; i < path_calcs.GetSize(); i++) path_calcs[i]->SetFinished(); in ThreadedCalculate()
880 for (int i = 0; i < path_calcs.GetSize(); i++) path_calcs[i]->Join(); in ThreadedCalculate()
888 MarginalArray row_marginals(m_row_marginals.GetSize()); in handleNode()
889 MarginalArray row_diff(row_marginals.GetSize()); in handleNode()
890 MarginalArray irn(row_marginals.GetSize()); in handleNode()
894 int kb = m_col_marginals.GetSize() - k; in handleNode()
902 for (int i = kb + 1; i < m_col_marginals.GetSize(); i++) ntot += m_col_marginals[i]; in handleNode()
905 for (int i = 0; i < row_marginals.GetSize(); i++) irn[i] = row_marginals[i] - row_diff[i]; in handleNode()
912 for (; nrb < irn.GetSize(); nrb++) if (irn[nrb] != 0) break; in handleNode()
916 MarginalArray::Slice sub_rows = irn.GetSlice(nrb, irn.GetSize() - 1); in handleNode()
917 MarginalArray::Slice sub_cols = m_col_marginals.GetSlice(kb + 1, m_col_marginals.GetSize() - 1); in handleNode()
929 for (int i = 2; i < irn.GetSize(); i++) kval += irn[i] * m_key_multipliers[i]; in handleNode()
939 for (int i = 0; i < m_completed_path_extremes[k].GetSize(); i++) { in handleNode()
959 int pending_idx = m_pending_path_nodes[k].GetSize(); in handleNode()
964 int pending_idx = m_pending_path_nodes[k].GetSize(); in handleNode()
984 while (m_fexact->m_path_extremes_queue.GetSize() == 0 && m_run) { in Run()
1000 …h = m_fexact->longestPath(p.rows.GetSlice(0, p.rows.GetSize() - 1), p.cols.GetSlice(0, p.cols.GetS… in Run()
1005 …m_fexact->shortestPath(p.rows.GetSlice(0, p.rows.GetSize() - 1), p.cols.GetSlice(0, p.cols.GetSize in Run()
1012 int completed_idx = m_fexact->m_completed_path_extremes[k].GetSize(); in Run()
1033 kmax = row_marginals.GetSize() - 1; in generateFirstDaughter()
1034 kd = row_marginals.GetSize(); in generateFirstDaughter()
1072 for (; idx < row_diff.GetSize(); idx++) { in generateNewDaughter()
1115 for (int i = 0; i < cur_node->past_entries.GetSize(); i++) { in handlePastPaths()
1164 int new_idx = past_entries.GetSize(); in recordPath()
1180 for (int i = row_marginals.GetSize() - 1; i > 0; i--) { in unpackMarginals()
1209 int init = key % m_table->GetSize(); in longestPath()
1211 for (; idx < m_table->GetSize(); idx++) { in longestPath()
1247 for (int i = 0; i < m_table->GetSize(); i++) (*m_table)[i].Value1() = -1; in longestPath()
1254 m_table = new Array<Pair<int, double> >(old_table->GetSize() * 2); in longestPath()
1255 for (int i = 0; i < m_table->GetSize(); i++) (*m_table)[i].Value1() = -1; in longestPath()
1256 m_stack.Resize(old_table->GetSize() * 2); in longestPath()
1257 for (int i = 0; i < old_table->GetSize(); i++) { in longestPath()
1268 if (row_marginals.GetSize() <= 1) { in longestPath()
1270 for (int i = 0; i < col_marginals.GetSize(); i++) longest_path -= m_facts[col_marginals[i]]; in longestPath()
1275 if (col_marginals.GetSize() <= 1) { in longestPath()
1277 for (int i = 0; i < row_marginals.GetSize(); i++) longest_path -= m_facts[row_marginals[i]]; in longestPath()
1282 if (row_marginals.GetSize() == 2 && col_marginals.GetSize() == 2) { in longestPath()
1290 if (row_marginals[row_marginals.GetSize() - 1] <= row_marginals[0] + col_marginals.GetSize()) { in longestPath()
1293 …if (!min && col_marginals[col_marginals.GetSize() - 1] <= col_marginals[0] + row_marginals.GetSize in longestPath()
1306 if (row_marginals.GetSize() >= col_marginals.GetSize()) { in longestPath()
1314 Array<int> nt(lcol.GetSize()); in longestPath()
1316 for (int i = 1; i < lcol.GetSize(); i++) nt[i] = nt[i - 1] - lcol[i]; in longestPath()
1319 Array<double> alen(col_marginals.GetSize() + 1); in longestPath()
1326 int nc1s = lcol.GetSize() - 2; in longestPath()
1327 int kyy = lcol[lcol.GetSize() - 1] + 1; in longestPath()
1329 Array<int> lb(lrow.GetSize()); in longestPath()
1330 Array<int> nu(lrow.GetSize()); in longestPath()
1331 Array<int> nr(lrow.GetSize()); in longestPath()
1339 int nr1 = lrow.GetSize() - 1; in longestPath()
1358 for (int i = lcol.GetSize() - 1; i > 0; i--) { in longestPath()
1366 for (int i = 1; i < lcol.GetSize(); i++) nt[i] = nt[i - 1] - lcol[i]; in longestPath()
1369 if (lrow[lrow.GetSize() - 1] <= lrow[0] + lcol.GetSize()) { in longestPath()
1370 …min = longestPathSpecial(lrow.GetSlice(0, lrow.GetSize() - 1), lcol.GetSlice(0, lcol.GetSize() - 1… in longestPath()
1372 if (!min && lcol[lcol.GetSize() - 1] <= lcol[0] + lrow.GetSize()) { in longestPath()
1373 …min = longestPathSpecial(lrow.GetSlice(0, lrow.GetSize() - 1), lcol.GetSlice(0, lcol.GetSize() - 1… in longestPath()
1382 } else if (lrow.GetSize() > 2 && vht[active_vht].GetEntryCount()) { in longestPath()
1386 lrow.ResizeClear(lrow.GetSize() - 1); in longestPath()
1387 for (int i = 0; i < lrow.GetSize(); i++) lrow[i] = tmp[i + 1]; in longestPath()
1411 int nc1 = lcol.GetSize() - lev - 1; in longestPath()
1417 alen[lcol.GetSize()] = alen[lev + 1] + m_facts[nr[lev]]; in longestPath()
1418 lb[lcol.GetSize() - 1] = nr[lev]; in longestPath()
1420 double v = val + alen[lcol.GetSize()]; in longestPath()
1421 if (lrow.GetSize() == 2) { in longestPath()
1422 for (int i = 0; i < lcol.GetSize(); i++) v += m_facts[lcol[i] - lb[i]]; in longestPath()
1425 } else if (lrow.GetSize() == 3 && lcol.GetSize() == 2) { in longestPath()
1435 Array<int> it(lcol.GetSize()); in longestPath()
1436 for (int i = 0; i < lcol.GetSize(); i++) it[i] = lcol[i] - lb[i]; in longestPath()
1438 if (lcol.GetSize() == 2) { in longestPath()
1446 for (int i = 2; i < lcol.GetSize(); i++) key = it[i] + key * kyy; in longestPath()
1467 Array<int> nd(row_marginals.GetSize() - 1); in longestPathSpecial()
1468 Array<int> ne(col_marginals.GetSize()); in longestPathSpecial()
1469 Array<int> m(col_marginals.GetSize()); in longestPathSpecial()
1472 int is = col_marginals[0] / row_marginals.GetSize(); in longestPathSpecial()
1474 int ix = col_marginals[0] - row_marginals.GetSize() * is; in longestPathSpecial()
1478 for (int i = 1; i < col_marginals.GetSize(); i++) { in longestPathSpecial()
1479 ix = col_marginals[i] / row_marginals.GetSize(); in longestPathSpecial()
1482 ix = col_marginals[i] - row_marginals.GetSize() * ix; in longestPathSpecial()
1487 for (int i = nd.GetSize() - 2; i >= 0; i--) nd[i] += nd[i + 1]; in longestPathSpecial()
1490 int nrow1 = row_marginals.GetSize() - 1; in longestPathSpecial()
1491 for (int i = (row_marginals.GetSize() - 1); i > 0; i--) { in longestPathSpecial()
1497 for (int i = 0; i < col_marginals.GetSize(); i++) { in longestPathSpecial()
1500 val += is * m_facts[ix + 1] + (row_marginals.GetSize() - is) * m_facts[ix]; in longestPathSpecial()
1514 dest.Resize(src.GetSize() - 1); in removeFromVector()
1516 for (int i = idx_remove + 1; i < src.GetSize(); i++) dest[i - 1] = src[i]; in removeFromVector()
1522 dest.Resize(src.GetSize()); in reduceZeroInVector()
1527 for (; i < (src.GetSize() - 1); i++) { in reduceZeroInVector()
1535 for (++i; i < src.GetSize(); i++) dest[i] = src[i]; in reduceZeroInVector()
1544 if (row_marginals.GetSize() == 1) { in shortestPath()
1545 for (int i = 0; i < col_marginals.GetSize(); i++) shortest_path -= m_facts[col_marginals[i]]; in shortestPath()
1550 if (col_marginals.GetSize() == 1) { in shortestPath()
1551 for (int i = 0; i < row_marginals.GetSize(); i++) shortest_path -= m_facts[row_marginals[i]]; in shortestPath()
1556 if (row_marginals.GetSize() == 2 && col_marginals.GetSize() == 2) { in shortestPath()
1568 …const int ROW_BUFFER_SIZE = (row_marginals.GetSize() + col_marginals.GetSize() + 1) * row_marginal… in shortestPath()
1569 …const int COL_BUFFER_SIZE = (row_marginals.GetSize() + col_marginals.GetSize() + 1) * col_marginal… in shortestPath()
1572 Array<Array<int, ManualBuffer> > row_stack(row_marginals.GetSize() + col_marginals.GetSize() + 1); in shortestPath()
1573 Array<Array<int, ManualBuffer> > col_stack(row_marginals.GetSize() + col_marginals.GetSize() + 1); in shortestPath()
1574 for (int i = 0; i < row_stack.GetSize(); i++) { in shortestPath()
1575 row_stack[i].SetBuffer(GetInternalPtr(row_data) + (i * row_marginals.GetSize())); in shortestPath()
1576 col_stack[i].SetBuffer(GetInternalPtr(col_data) + (i * col_marginals.GetSize())); in shortestPath()
1579 row_stack[0].Resize(row_marginals.GetSize()); in shortestPath()
1580 …for (int i = 0; i < row_marginals.GetSize(); i++) row_stack[0][i] = row_marginals[row_marginals.Ge… in shortestPath()
1581 col_stack[0].Resize(col_marginals.GetSize()); in shortestPath()
1582 …for (int i = 0; i < col_marginals.GetSize(); i++) col_stack[0][i] = col_marginals[col_marginals.Ge… in shortestPath()
1586 Array<double> y_stack(row_marginals.GetSize() + col_marginals.GetSize() + 1); in shortestPath()
1587 Array<int> l_stack(row_marginals.GetSize() + col_marginals.GetSize() + 1); in shortestPath()
1588 Array<int> m_stack(row_marginals.GetSize() + col_marginals.GetSize() + 1); in shortestPath()
1589 Array<int> n_stack(row_marginals.GetSize() + col_marginals.GetSize() + 1); in shortestPath()
1602 if (row_stack[istk].GetSize() >= col_stack[istk].GetSize()) { in shortestPath()
1603 m = col_stack[istk].GetSize() - 1; in shortestPath()
1606 m = row_stack[istk].GetSize(); in shortestPath()
1610 if (row_stack[istk].GetSize() <= col_stack[istk].GetSize()) { in shortestPath()
1611 m = row_stack[istk].GetSize() - 1; in shortestPath()
1614 m = col_stack[istk].GetSize(); in shortestPath()
1618 if (row_stack[istk].GetSize() <= col_stack[istk].GetSize()) { in shortestPath()
1619 m = row_stack[istk].GetSize() - 1; in shortestPath()
1622 m = col_stack[istk].GetSize() - 1; in shortestPath()
1651 if (row_stack[istk + 1].GetSize() == 1 || col_stack[istk + 1].GetSize() == 1) { in shortestPath()
1652 if (row_stack[istk + 1].GetSize() == 1) { in shortestPath()
1653 … for (int i = 0; i < col_stack[istk + 1].GetSize(); i++) y += m_facts[col_stack[istk + 1][i]]; in shortestPath()
1655 if (col_stack[istk + 1].GetSize() == 1) { in shortestPath()
1656 … for (int i = 0; i < row_stack[istk + 1].GetSize(); i++) y += m_facts[row_stack[istk + 1][i]]; in shortestPath()