// ---------------------------------------------------------------------
//
-// Copyright (C) 2004 - 2014 by the deal.II authors
+// Copyright (C) 2004 - 2015 by the deal.II authors
//
// This file is part of the deal.II library.
//
-// check CompressedSetSparsityPattern::row_begin iterators. since we create
+// check CompressedSetSparsityPattern::begin iterators. since we create
// quite some output here, choose smaller number of rows and entries than in
// the other tests
for (unsigned int i=0; i<N; ++i)
{
unsigned int index = 0;
- for (CompressedSetSparsityPattern::row_iterator
- j = csp.row_begin(i); j != csp.row_end(i); ++j, ++index)
- deallog << i << ' ' << index << ' ' << *j
+ for (CompressedSetSparsityPattern::iterator
+ j = csp.begin(i); j != csp.end(i); ++j, ++index)
+ deallog << i << ' ' << index << ' ' << j->column()
<< std::endl;
}
}
// ---------------------------------------------------------------------
//
-// Copyright (C) 2004 - 2014 by the deal.II authors
+// Copyright (C) 2004 - 2015 by the deal.II authors
//
// This file is part of the deal.II library.
//
for (unsigned int i=0; i<N; ++i)
{
unsigned int index = 0;
- for (CompressedSetSparsityPattern::row_iterator
- j = csp.row_begin(i); j != csp.row_end(i); ++j, ++index)
- deallog << i << ' ' << index << ' ' << *j
+ for (CompressedSetSparsityPattern::iterator
+ j = csp.begin(i); j != csp.end(i); ++j, ++index)
+ deallog << i << ' ' << index << ' ' << j->column()
<< std::endl;
}
}
// ---------------------------------------------------------------------
//
-// Copyright (C) 2003 - 2014 by the deal.II authors
+// Copyright (C) 2003 - 2015 by the deal.II authors
//
// This file is part of the deal.II library.
//
for (unsigned int l=0; l<20; ++l)
{
const unsigned int line = l*(sp.n_rows()/20);
- for (CompressedSetSparsityPattern::row_iterator
- c = sp.row_begin(line); c!=sp.row_end(line); ++c)
- deallog << *c << " ";
+ for (CompressedSetSparsityPattern::iterator
+ c = sp.begin(line); c!=sp.end(line); ++c)
+ deallog << c->column() << " ";
deallog << std::endl;
}
// ---------------------------------------------------------------------
//
-// Copyright (C) 2003 - 2014 by the deal.II authors
+// Copyright (C) 2003 - 2015 by the deal.II authors
//
// This file is part of the deal.II library.
//
block_row = sp.get_row_indices().global_to_local(line);
for (unsigned int col=0; col<n_components; ++col)
{
- for (CompressedSetSparsityPattern::row_iterator
- c = sp.block(block_row.first,col).row_begin(block_row.second);
- c!=sp.block(block_row.first,col).row_end(block_row.second); ++c)
- deallog << *c
+ for (CompressedSetSparsityPattern::iterator
+ c = sp.block(block_row.first,col).begin(block_row.second);
+ c!=sp.block(block_row.first,col).end(block_row.second); ++c)
+ deallog << c->column()
<< " ";
deallog << std::endl;
}
for (unsigned int l=0; l<20; ++l)
{
const unsigned int line = l*(sp.n_rows()/20);
- for (CompressedSetSparsityPattern::row_iterator
- c = sp.row_begin(line); c!=sp.row_end(line); ++c)
- deallog << *c << " ";
+ for (CompressedSetSparsityPattern::iterator
+ c = sp.begin(line); c!=sp.end(line); ++c)
+ deallog << c->column() << " ";
deallog << std::endl;
}
block_row = sp.get_row_indices().global_to_local(line);
for (unsigned int col=0; col<n_components; ++col)
{
- for (CompressedSetSparsityPattern::row_iterator
- c = sp.block(block_row.first,col).row_begin(block_row.second);
- c!=sp.block(block_row.first,col).row_end(block_row.second); ++c)
- deallog << *c
+ for (CompressedSetSparsityPattern::iterator
+ c = sp.block(block_row.first,col).begin(block_row.second);
+ c!=sp.block(block_row.first,col).end(block_row.second); ++c)
+ deallog << c->column()
<< " ";
deallog << std::endl;
}
// ---------------------------------------------------------------------
//
-// Copyright (C) 2003 - 2014 by the deal.II authors
+// Copyright (C) 2003 - 2015 by the deal.II authors
//
// This file is part of the deal.II library.
//
for (unsigned int l=0; l<20; ++l)
{
const unsigned int line = l*(sp.n_rows()/20);
- for (CompressedSetSparsityPattern::row_iterator
- c = sp.row_begin(line); c!=sp.row_end(line); ++c)
- deallog << *c << " ";
+ for (CompressedSetSparsityPattern::iterator
+ c = sp.begin(line); c!=sp.end(line); ++c)
+ deallog << c->column() << " ";
deallog << std::endl;
}
// ---------------------------------------------------------------------
//
-// Copyright (C) 2003 - 2014 by the deal.II authors
+// Copyright (C) 2003 - 2015 by the deal.II authors
//
// This file is part of the deal.II library.
//
block_row = sp.get_row_indices().global_to_local(line);
for (unsigned int col=0; col<n_blocks; ++col)
{
- for (CompressedSetSparsityPattern::row_iterator
- c = sp.block(block_row.first,col).row_begin(block_row.second);
- c!=sp.block(block_row.first,col).row_end(block_row.second); ++c)
- deallog << *c
+ for (CompressedSetSparsityPattern::iterator
+ c = sp.block(block_row.first,col).begin(block_row.second);
+ c!=sp.block(block_row.first,col).end(block_row.second); ++c)
+ deallog << c->column()
<< " ";
deallog << std::endl;
}
// ---------------------------------------------------------------------
//
-// Copyright (C) 2003 - 2014 by the deal.II authors
+// Copyright (C) 2003 - 2015 by the deal.II authors
//
// This file is part of the deal.II library.
//
for (unsigned int l=0; l<20; ++l)
{
const unsigned int line = l*(sp.n_rows()/20);
- for (CompressedSetSparsityPattern::row_iterator
- c = sp.row_begin(line); c!=sp.row_end(line); ++c)
- deallog << *c << " ";
+ for (CompressedSetSparsityPattern::iterator
+ c = sp.begin(line); c!=sp.end(line); ++c)
+ deallog << c->column() << " ";
deallog << std::endl;
}
// ---------------------------------------------------------------------
//
-// Copyright (C) 2003 - 2014 by the deal.II authors
+// Copyright (C) 2003 - 2015 by the deal.II authors
//
// This file is part of the deal.II library.
//
block_row = sp.get_row_indices().global_to_local(line);
for (unsigned int col=0; col<n_blocks; ++col)
{
- for (CompressedSetSparsityPattern::row_iterator
- c = sp.block(block_row.first,col).row_begin(block_row.second);
- c!=sp.block(block_row.first,col).row_end(block_row.second); ++c)
- deallog << *c
+ for (CompressedSetSparsityPattern::iterator
+ c = sp.block(block_row.first,col).begin(block_row.second);
+ c!=sp.block(block_row.first,col).end(block_row.second); ++c)
+ deallog << c->column()
<< " ";
deallog << std::endl;
}
// ---------------------------------------------------------------------
//
-// Copyright (C) 2003 - 2014 by the deal.II authors
+// Copyright (C) 2003 - 2015 by the deal.II authors
//
// This file is part of the deal.II library.
//
for (unsigned int l=0; l<20; ++l)
{
const unsigned int line = l*(sp.n_rows()/20);
- for (CompressedSetSparsityPattern::row_iterator
- c = sp.row_begin(line); c!=sp.row_end(line); ++c)
- deallog << *c << " ";
+ for (CompressedSetSparsityPattern::iterator
+ c = sp.begin(line); c!=sp.end(line); ++c)
+ deallog << c->column() << " ";
deallog << std::endl;
}
// ---------------------------------------------------------------------
//
-// Copyright (C) 2003 - 2014 by the deal.II authors
+// Copyright (C) 2003 - 2015 by the deal.II authors
//
// This file is part of the deal.II library.
//
block_row = sp.get_row_indices().global_to_local(line);
for (unsigned int col=0; col<n_components; ++col)
{
- for (CompressedSetSparsityPattern::row_iterator
- c = sp.block(block_row.first,col).row_begin(block_row.second);
- c!=sp.block(block_row.first,col).row_end(block_row.second); ++c)
- deallog << *c
+ for (CompressedSetSparsityPattern::iterator
+ c = sp.block(block_row.first,col).begin(block_row.second);
+ c!=sp.block(block_row.first,col).end(block_row.second); ++c)
+ deallog << c->column()
<< " ";
deallog << std::endl;
}
// ---------------------------------------------------------------------
//
-// Copyright (C) 2003 - 2014 by the deal.II authors
+// Copyright (C) 2003 - 2015 by the deal.II authors
//
// This file is part of the deal.II library.
//
for (unsigned int l=0; l<20; ++l)
{
const unsigned int line = l*(sp.n_rows()/20);
- for (CompressedSetSparsityPattern::row_iterator
- c = sp.row_begin(line); c!=sp.row_end(line); ++c)
- deallog << *c << " ";
+ for (CompressedSetSparsityPattern::iterator
+ c = sp.begin(line); c!=sp.end(line); ++c)
+ deallog << c->column() << " ";
deallog << std::endl;
}
// ---------------------------------------------------------------------
//
-// Copyright (C) 2003 - 2014 by the deal.II authors
+// Copyright (C) 2003 - 2015 by the deal.II authors
//
// This file is part of the deal.II library.
//
block_row = sp.get_row_indices().global_to_local(line);
for (unsigned int col=0; col<n_components; ++col)
{
- for (CompressedSetSparsityPattern::row_iterator
- c = sp.block(block_row.first,col).row_begin(block_row.second);
- c!=sp.block(block_row.first,col).row_end(block_row.second); ++c)
- deallog << *c
+ for (CompressedSetSparsityPattern::iterator
+ c = sp.block(block_row.first,col).begin(block_row.second);
+ c!=sp.block(block_row.first,col).end(block_row.second); ++c)
+ deallog << c->column()
<< " ";
deallog << std::endl;
}
{
deallog << "Block " << std::setw(3) << i;
std::vector<unsigned int> entries;
- for (SparsityPattern::row_iterator b = bl.row_begin(i); b != bl.row_end(i); ++b)
- entries.push_back(*b);
+ for (SparsityPattern::iterator b = bl.begin(i); b != bl.end(i); ++b)
+ entries.push_back(b->column());
std::sort(entries.begin(), entries.end());
{
deallog << "Block " << std::setw(3) << i;
std::vector<unsigned int> entries;
- for (SparsityPattern::row_iterator b = bl.row_begin(i); b != bl.row_end(i); ++b)
- entries.push_back(*b);
+ for (SparsityPattern::iterator b = bl.begin(i); b != bl.end(i); ++b)
+ entries.push_back(b->column());
std::sort(entries.begin(), entries.end());