columns.add_range(3*myid, 3*myid+3);
columns.compress();
- sp.reinit(rows, columns, MPI_COMM_WORLD, 0);
+ sp.reinit(rows, columns, MPI_COMM_WORLD, 0u);
deallog << "SP::is_compressed(): " << sp.is_compressed() << std::endl;
for (unsigned int i=2*myid; i<2*myid+2; ++i)
columns.compress();
// this creates a matrix with optimized path for off-processor entries
- sp.reinit(rows, columns, writable_rows, MPI_COMM_WORLD, 0);
+ sp.reinit(rows, columns, writable_rows, MPI_COMM_WORLD, 0u);
for (unsigned int i=2*myid; i<2*myid+2; ++i)
for (unsigned int j=0; j<3*n_procs; ++j)
// reinit, this time without giving writable rows -> Trilinos must manage
// ghost entries and throw away the off-processor sparsity pattern
- sp.reinit(rows, columns, MPI_COMM_WORLD, 0);
+ sp.reinit(rows, columns, MPI_COMM_WORLD, 0u);
for (unsigned int i=2*myid; i<2*myid+2; ++i)
for (unsigned int j=0; j<3*n_procs; ++j)
// now create again a pattern with writable rows
- sp.reinit(rows, columns, writable_rows, MPI_COMM_WORLD, 0);
+ sp.reinit(rows, columns, writable_rows, MPI_COMM_WORLD, 0u);
for (unsigned int i=2*myid; i<2*myid+2; ++i)
for (unsigned int j=0; j<3*n_procs; ++j)