return;
}
else
- pointer += (*dof_handler.finite_elements)[this_fe_index].dofs_per_vertex + 1;
+ pointer += static_cast<types::global_dof_index>(
+ (*dof_handler.finite_elements)[this_fe_index].dofs_per_vertex + 1);
}
}
if (this_fe_index == fe_index)
return *(pointer + 1 + local_index);
else
- pointer += (*dof_handler.finite_elements)[this_fe_index].dofs_per_vertex + 1;
+ pointer += static_cast<types::global_dof_index>(
+ (*dof_handler.finite_elements)[this_fe_index].dofs_per_vertex + 1);
}
}
return counter;
else
{
- pointer += (*dof_handler.finite_elements)[this_fe_index].dofs_per_vertex + 1;
+ pointer += static_cast<types::global_dof_index>(
+ (*dof_handler.finite_elements)[this_fe_index].dofs_per_vertex + 1);
++counter;
}
}
Assert (this_fe_index != numbers::invalid_dof_index,
ExcInternalError());
- pointer += (*dof_handler.finite_elements)[this_fe_index].dofs_per_vertex + 1;
+ pointer += static_cast<types::global_dof_index>(
+ (*dof_handler.finite_elements)[this_fe_index].dofs_per_vertex + 1);
++counter;
}
}
last_row = max_my_gid(input_row_map)+1;
std::vector<int> n_entries_per_row(last_row - first_row);
+ // Trilinos wants the row length as an int
+ // this is hopefully never going to be a problem.
for (size_type row=first_row; row<last_row; ++row)
- n_entries_per_row[row-first_row] = sp.row_length(row);
+ n_entries_per_row[row-first_row] = static_cast<int>(sp.row_length(row));
if (input_row_map.Comm().NumProc() > 1)
graph.reset(new Epetra_FECrsGraph(Copy, input_row_map,