Change more places for trilinos XXX64

git-svn-id: https://svn.dealii.org/branches/branch_bigger_global_dof_indices_4@29037 0785d39b-7218-0410-832d-ea1e28bc413d

diff --git a/deal.II/source/lac/trilinos_sparse_matrix.cc b/deal.II/source/lac/trilinos_sparse_matrix.cc
index 3bf1ea37353b91a99220384d97398f304db54f30..ef89d1e715e477f7828031fe1a52bf3974d14f11 100644 (file)
--- a/deal.II/source/lac/trilinos_sparse_matrix.cc
+++ b/deal.II/source/lac/trilinos_sparse_matrix.cc
@@ -446,8 +446,8 @@ namespace TrilinosWrappers
 
     column_space_map.reset (new Epetra_Map (input_col_map));
 
-    const size_type first_row = input_row_map.MinMyGID(),
-                       last_row = input_row_map.MaxMyGID()+1;
+    const size_type first_row = input_row_map.MinMyGID64(),
+                       last_row = input_row_map.MaxMyGID64()+1;
     std::vector<int> n_entries_per_row(last_row-first_row);
 
     for (size_type row=first_row; row<last_row; ++row)

diff --git a/deal.II/source/lac/trilinos_sparsity_pattern.cc b/deal.II/source/lac/trilinos_sparsity_pattern.cc
index fe76eed3dab87966049f15dbc1671039f1e64b10..ea9fc2014d6cabf653737c9620903a87e2c878da 100644 (file)
--- a/deal.II/source/lac/trilinos_sparsity_pattern.cc
+++ b/deal.II/source/lac/trilinos_sparsity_pattern.cc
@@ -272,11 +272,11 @@ namespace TrilinosWrappers
 
     if (input_row_map.Comm().NumProc() > 1)
       graph.reset(new Epetra_FECrsGraph(Copy, input_row_map,
-                                        n_entries_per_row[input_row_map.MinMyGID()],
+                                        n_entries_per_row[input_row_map.MinMyGID64()],
                                         false));
     else
       graph.reset(new Epetra_FECrsGraph(Copy, input_row_map, input_col_map,
-                                        n_entries_per_row[input_row_map.MinMyGID()],
+                                        n_entries_per_row[input_row_map.MinMyGID64()],
                                         false));
   }
 
@@ -343,8 +343,8 @@ namespace TrilinosWrappers
     Assert (input_row_map.LinearMap() == true,
             ExcMessage ("This function is not efficient if the map is not contiguous."));
 
-    const size_type first_row = input_row_map.MinMyGID(),
-                       last_row = input_row_map.MaxMyGID()+1;
+    const size_type first_row = input_row_map.MinMyGID64(),
+                       last_row = input_row_map.MaxMyGID64()+1;
     std::vector<int> n_entries_per_row(last_row - first_row);
 
     for (size_type row=first_row; row<last_row; ++row)
@@ -598,8 +598,8 @@ namespace TrilinosWrappers
   SparsityPattern::local_range () const
   {
     size_type begin, end;
-    begin = graph -> RowMap().MinMyGID();
-    end = graph -> RowMap().MaxMyGID()+1;
+    begin = graph -> RowMap().MinMyGID64();
+    end = graph -> RowMap().MaxMyGID64()+1;
 
     return std::make_pair (begin, end);
   }