source: issm/oecreview/Archive/21724-22754/ISSM-21912-21913.diff

../trunk-jpl/src/wrappers/M1qn3/M1qn3.cpp

@@ -111 +111 @@
                                 &reverse,&indic,izs,rzs,(void*)&data_struct);
 
         switch(int(omode)){
-                case 0:  _printf0_("   Stop requested\n"); break;
+                case 0: /* _printf0_("   Stop requested\n");*/ break;
                 case 1:  _printf0_("   Convergence reached (gradient satisfies stopping criterion)\n"); break;
                 case 2:  _printf0_("   Bad initialization\n"); break;
                 case 3:  _printf0_("   Line search failure\n"); break;
@@ -163 +163 @@
                 for(int i=0;i<*n;i++) X[i]=Xs[ds->priorn*i+ds->counter];
                 for(int i=0;i<*n;i++) G[i]=Gs[ds->priorn*i+ds->counter];
         }
-
-        printf("J [i] = %g\n",*pf);
 }
 #endif