Macaulay2 Engine
Loading...
Searching...
No Matches

◆ make_matrix()

void F4GB::make_matrix ( )
private

Definition at line 469 of file f4.cpp.

470{
471 /* loop through all spairs, process,
472 then while there are any columns to process, do so,
473 then process rows.
474 Is this the best order to do it in? Maybe not...
475 */
476
477 //spair *p;
478 std::pair<bool,spair> p;
479 p = mSPairSet.get_next_pair();
480 while (p.first)
481 {
482 process_s_pair(&p.second);
483 p = mSPairSet.get_next_pair();
484 }
485
486 while (next_col_to_process < mat->columns.size())
488
489 // DEBUGGING:
490 if (M2_gbTrace >= 2)
491 {
492 fprintf(stderr,
493 "--matrix--%ld by %ld\n",
494 (long)mat->rows.size(),
495 (long)mat->columns.size());
496 }
497 // show_row_info();
498 // show_column_info();
499 // show_matrix();
500
501 // Now we reorder the columns, possibly rows?
503
504 // reorder_rows(); // This is only here so we can see what we are doing...?
505
506 // For debugging: let's compute the number of non-zero elements above the diagonal in A matrix.
507 // Also, let's compute the amount of space used for:
508 // column info
509 // row info
510 // sum of values in each row
511 // Maybe so A B C D matrices separately.
513}
int next_col_to_process
Definition f4.hpp:185
coefficient_matrix * mat
Definition f4.hpp:186
F4SPairSet mSPairSet
Definition f4.hpp:249
MacaulayMatrixStats macaulayMatrixStats() const
Definition f4.cpp:515
void reorder_columns()
Definition f4.cpp:322
void process_s_pair(spair *p)
Definition f4.cpp:290
void process_column(int c)
Definition f4.cpp:243
int p
int M2_gbTrace
Definition m2-types.cpp:52

References M2_gbTrace, macaulayMatrixStats(), mat, mSPairSet, next_col_to_process, p, process_column(), process_s_pair(), and reorder_columns().

Referenced by do_spairs().