← Back to branch summary

~corrado-maurini/dolfin/tao

« back to all changes in this revision

Viewing changes to dolfin/fem/NonlinearVariationalProblem.cpp

  • Committer: corrado maurini
  • Date: 2012-12-18 12:16:08 UTC
  • mfrom: (6685.78.207 trunk)
  • Revision ID: corrado.maurini@upmc.fr-20121218121608-nk82ly9jgsld9u84
updating with trunk, fix uint in TAO solver and hacking the check for tao FindTAO.cmake

Show diffs side-by-side

added added

removed removed

Lines of Context:
dolfin/fem/NonlinearVariationalProblem.cpp
91
91
    _u(reference_to_no_delete_pointer(u))
92
92
{
93
93
  // Store boundary conditions
94
 
  for (uint i = 0; i < bcs.size(); ++i)
 
94
  for (std::size_t i = 0; i < bcs.size(); ++i)
95
95
    _bcs.push_back(reference_to_no_delete_pointer(*bcs[i]));
96
96
 
97
97
  // Check forms
109
109
    _u(reference_to_no_delete_pointer(u))
110
110
{
111
111
  // Store boundary conditions
112
 
  for (uint i = 0; i < bcs.size(); ++i)
 
112
  for (std::size_t i = 0; i < bcs.size(); ++i)
113
113
    _bcs.push_back(reference_to_no_delete_pointer(*bcs[i]));
114
114
 
115
115
  // Check forms
124
124
    _F(F), _u(u)
125
125
{
126
126
  // Store boundary conditions
127
 
  for (uint i = 0; i < bcs.size(); ++i)
 
127
  for (std::size_t i = 0; i < bcs.size(); ++i)
128
128
    _bcs.push_back(bcs[i]);
129
129
 
130
130
  // Check forms
140
140
    _F(F), _J(J), _u(u)
141
141
{
142
142
  // Store boundary conditions
143
 
  for (uint i = 0; i < bcs.size(); ++i)
 
143
  for (std::size_t i = 0; i < bcs.size(); ++i)
144
144
    _bcs.push_back(bcs[i]);
145
145
 
146
146
  // Check forms