std::vector<unsigned short int> vertex_touch_count (v.size(), 0);
typename std::map<std::pair<int,int>,
typename Triangulation<dim,spacedim>::line_iterator>::iterator i;
- for (i=needed_lines.begin(); i!=needed_lines.end(); i++)
+ for (i=needed_lines.begin(); i!=needed_lines.end(); ++i)
{
// touch the vertices of
// this line
std::vector<unsigned short int> vertex_touch_count (v.size(), 0);
typename std::map<std::pair<int,int>,
typename Triangulation<dim,spacedim>::line_iterator>::iterator i;
- for (i=needed_lines.begin(); i!=needed_lines.end(); i++)
+ for (i=needed_lines.begin(); i!=needed_lines.end(); ++i)
{
// touch the vertices of
// this line
typename std::map<types::manifold_id,
SmartPointer<const Manifold<dim,spacedim> , Triangulation<dim, spacedim> > >::const_iterator
bdry_iterator = old_tria.manifold.begin();
- for (; bdry_iterator != old_tria.manifold.end() ; bdry_iterator++)
+ for (; bdry_iterator != old_tria.manifold.end() ; ++bdry_iterator)
manifold[bdry_iterator->first] = bdry_iterator->second;
std::map <std::string, std::vector <std::vector <double> > >::iterator
data_store_begin = data_store.begin ();
- for (; data_store_begin != data_store.end (); data_store_begin++)
+ for (; data_store_begin != data_store.end (); ++data_store_begin)
{
// add an extra row to each vector
// entry
std::map <std::string, std::vector <std::vector <double> > >::iterator
data_store_begin = data_store.begin ();
- for (; data_store_begin != data_store.end (); data_store_begin++)
+ for (; data_store_begin != data_store.end (); ++data_store_begin)
{
// add an extra row to each vector
// entry
unsigned int n_stored = mask->second.n_selected_components(dof_handler->get_fe ().n_components ());
typename std::vector <internal::PointValueHistory::PointGeometryData <dim> >::iterator point = point_geometry_data.begin ();
- for (unsigned int data_store_index = 0; point != point_geometry_data.end (); point++, data_store_index++)
+ for (unsigned int data_store_index = 0; point != point_geometry_data.end (); ++point, ++data_store_index)
{
// Look up the components to add
// in the component_mask, and
// Loop over points and find correct cell
typename std::vector <internal::PointValueHistory::PointGeometryData <dim> >::iterator point = point_geometry_data.begin ();
- for (unsigned int data_store_index = 0; point != point_geometry_data.end (); point++, data_store_index++)
+ for (unsigned int data_store_index = 0; point != point_geometry_data.end (); ++point, ++data_store_index)
{
// we now have a point to query,
// need to know what cell it is in
// we now have the data and need to save it
// loop over data names
typename std::vector<std::string>::const_iterator name = vector_names.begin();
- for (; name != vector_names.end(); name++)
+ for (; name != vector_names.end(); ++name)
{
typename std::map <std::string, std::vector <std::vector <double> > >::iterator data_store_field = data_store.find(*name);
Assert (data_store_field != data_store.end(), ExcMessage("vector_name not in class"));
typename std::vector <internal::PointValueHistory::PointGeometryData <dim> >::iterator point = point_geometry_data.begin ();
Vector <number> value (dof_handler->get_fe().n_components());
- for (unsigned int data_store_index = 0; point != point_geometry_data.end (); point++, data_store_index++)
+ for (unsigned int data_store_index = 0; point != point_geometry_data.end (); ++point, ++data_store_index)
{
// Make a Vector <double> for the value
// at the point. It will have as many
//AssertThrow (!triangulation_changed, ExcDoFHandlerChanged ());
typename std::vector <internal::PointValueHistory::PointGeometryData <dim> >::iterator point = point_geometry_data.begin ();
- for (unsigned int data_store_index = 0; point != point_geometry_data.end (); point++, data_store_index++)
+ for (unsigned int data_store_index = 0; point != point_geometry_data.end (); ++point, ++data_store_index)
{
// for each point, open a file to
// be written to
Vector<double> dof_vector (dof_handler->n_dofs ());
typename std::vector <internal::PointValueHistory::PointGeometryData <dim> >::iterator point = point_geometry_data.begin ();
- for (; point != point_geometry_data.end (); point++)
+ for (; point != point_geometry_data.end (); ++point)
{
for (unsigned int component = 0; component < dof_handler->get_fe ().n_components (); component++)
{
std::vector <std::vector <Point <dim> > > actual_points;
typename std::vector <internal::PointValueHistory::PointGeometryData <dim> >::iterator point = point_geometry_data.begin ();
- for (; point != point_geometry_data.end (); point++)
+ for (; point != point_geometry_data.end (); ++point)
{
actual_points.push_back (point->support_point_locations);
}
// Loop over points and find correct cell
typename std::vector <internal::PointValueHistory::PointGeometryData <dim> >::iterator point = point_geometry_data.begin ();
- for (unsigned int data_store_index = 0; point != point_geometry_data.end (); point++, data_store_index++)
+ for (unsigned int data_store_index = 0; point != point_geometry_data.end (); ++point, ++data_store_index)
{
// we now have a point to query,
// need to know what cell it is in
{
if (!cleared)
{
- for (; point != point_geometry_data.end (); point++)
+ for (; point != point_geometry_data.end (); ++point)
{
out << "# Requested location: " << point->requested_location << "\n";
out << "# DoF_index : Support location (for each component)\n";
{
out << "Mnemonic: data set size (mask size, n true components) : n data sets\n";
}
- for (; data_store_begin != data_store.end (); data_store_begin++)
+ for (; data_store_begin != data_store.end (); ++data_store_begin)
{
// Find field mnemonic
std::string vector_name = data_store_begin->first;
data_store_begin = data_store.begin ();
if (have_dof_handler)
{
- for (; data_store_begin != data_store.end (); data_store_begin++)
+ for (; data_store_begin != data_store.end (); ++data_store_begin)
{
Assert (data_store_begin->second.size() > 0,
ExcInternalError());
{
std::map <std::string, std::vector <std::vector <double> > >::iterator
data_store_begin = data_store.begin ();
- for (; data_store_begin != data_store.end (); data_store_begin++)
+ for (; data_store_begin != data_store.end (); ++data_store_begin)
{
Assert (data_store_begin->second.size() > 0,
ExcInternalError());