Changeset 410eb0d in git


Ignore:
Timestamp:
Oct 16, 2015, 10:50:03 AM (9 years ago)
Author:
Hans Schoenemann <hannes@…>
Branches:
(u'spielwiese', '17f1d200f27c5bd38f5dfc6e8a0879242279d1d8')
Children:
616d4c8fef38ed9edb525a7623cc88710697713f
Parents:
a311b308796b46b4d4f62c4adfb1226432365f62e8c9869fa7ddf44e8d06637799419f0dddd8c607
Message:
Merge pull request #728 from jgmbenoit/lintian/spelling

correct spelling error as reported by eyes and Lintian
Files:
4 edited

Legend:

Unmodified
Added
Removed

  • IntegerProgramming/IP_algorithms.cc

    ra311b30 r410eb0d  
    130130  {
    131131    cerr<<"ERROR: int Conti_Traverso(INPUT_FILE, const BOOLEAN&):\n"
    132       "number of variables / matrix columns must be positve"<<endl;
     132      "number of variables / matrix columns must be positive"<<endl;
    133133    return 0;
    134134  }
    … …  
    211211  {
    212212    cerr<<"ERROR: int Conti_Traverso(INPUT_FILE, const BOOLEAN&):\n"
    213       "number of constraints / matrix rows must be positve"<<endl;
     213      "number of constraints / matrix rows must be positive"<<endl;
    214214    // Solving problems without constraints is possible, but not very
    215215    // interesting (because trivial). To avoid the problems and the overhead
    … …  
    418418  {
    419419    cerr<<"ERROR: int Positive_Conti_Traverso(INPUT_FILE, const BOOLEAN&):\n"
    420       "number of variables / matrix columns must be positve"<<endl;
     420      "number of variables / matrix columns must be positive"<<endl;
    421421    return 0;
    422422  }
    … …  
    499499  {
    500500    cerr<<"ERROR: int Positive_Conti_Traverso(INPUT_FILE, const BOOLEAN&):\n"
    501       "number of constraints / matrix rows must be positve"<<endl;
     501      "number of constraints / matrix rows must be positive"<<endl;
    502502    // Solving problems without constraints is possible, but not very
    503503    // interesting (because trivial). To avoid the problems and the overhead
    … …  
    715715  {
    716716    cerr<<"ERROR: int Elim_Conti_Traverso(INPUT_FILE, const BOOLEAN&):\n"
    717       "number of variables / matrix columns must be positve"<<endl;
     717      "number of variables / matrix columns must be positive"<<endl;
    718718    return 0;
    719719  }
    … …  
    796796  {
    797797    cerr<<"ERROR: int Elim_Conti_Traverso(INPUT_FILE, const BOOLEAN&):\n"
    798       "number of constraints / matrix rows must be positve"<<endl;
     798      "number of constraints / matrix rows must be positive"<<endl;
    799799    // Solving problems without constraints is possible, but not very
    800800    // interesting (because trivial). To avoid the problems and the overhead
    … …  
    10041004  {
    10051005    cerr<<"ERROR: int Pottier(INPUT_FILE, const BOOLEAN&):\n"
    1006       "number of variables / matrix columns must be positve"<<endl;
     1006      "number of variables / matrix columns must be positive"<<endl;
    10071007    return 0;
    10081008  }
    … …  
    10851085  {
    10861086    cerr<<"ERROR: int Pottier(INPUT_FILE, const BOOLEAN&):\n"
    1087       "number of constraints / matrix rows must be positve"<<endl;
     1087      "number of constraints / matrix rows must be positive"<<endl;
    10881088    // Solving problems without constraints is possible, but not very
    10891089    // interesting (because trivial). To avoid the problems and the overhead
    … …  
    12921292  {
    12931293    cerr<<"ERROR: int Hosten_Sturmfels(INPUT_FILE, const BOOLEAN&):\n"
    1294       "number of variables / matrix columns must be positve"<<endl;
     1294      "number of variables / matrix columns must be positive"<<endl;
    12951295    return 0;
    12961296  }
    … …  
    13731373  {
    13741374    cerr<<"ERROR: int Hosten_Sturmfels(INPUT_FILE, const BOOLEAN&):\n"
    1375       "number of constraints / matrix rows must be positve"<<endl;
     1375      "number of constraints / matrix rows must be positive"<<endl;
    13761376    // Solving problems without constraints is possible, but not very
    13771377    // interesting (because trivial). To avoid the problems and the overhead
    … …  
    17031703  {
    17041704    cerr<<"ERROR: int DiBiase_Urbanke(INPUT_FILE, const BOOLEAN&):\n"
    1705       "number of variables / matrix columns must be positve"<<endl;
     1705      "number of variables / matrix columns must be positive"<<endl;
    17061706    return 0;
    17071707  }
    … …  
    17841784  {
    17851785    cerr<<"ERROR: int DiBiase_Urbanke(INPUT_FILE, const BOOLEAN&):\n"
    1786       "number of constraints / matrix rows must be positve"<<endl;
     1786      "number of constraints / matrix rows must be positive"<<endl;
    17871787    // Solving problems without constraints is possible, but not very
    17881788    // interesting (because trivial). To avoid the problems and the overhead
    … …  
    20712071  {
    20722072    cerr<<"ERROR: int Bigatti_LaScala_Robbiano(INPUT_FILE, const BOOLEAN&):\n"
    2073       "number of variables / matrix columns must be positve"<<endl;
     2073      "number of variables / matrix columns must be positive"<<endl;
    20742074    return 0;
    20752075  }
    … …  
    21552155  {
    21562156    cerr<<"ERROR: int Bigatti_LaScala_Robbiano(INPUT_FILE, const BOOLEAN&):\n"
    2157       "number of constraints / matrix rows must be positve"<<endl;
     2157      "number of constraints / matrix rows must be positive"<<endl;
    21582158    // Solving problems without constraints is possible, but not very
    21592159    // interesting (because trivial). To avoid the problems and the overhead
    … …  
    37123712  {
    37133713    cerr<<"ERROR: int change_cost(INPUT_FILE, INPUT_FILE):\n"
    3714       "number of variables in second input file must be positve"<<endl;
     3714      "number of variables in second input file must be positive"<<endl;
    37153715    return 0;
    37163716  }

  • IntegerProgramming/ideal.cc

    ra311b30 r410eb0d  
    352352
    353353  w=_w;
    354   // The argument term_ordering should be given by a homogenous grading.
     354  // The argument term_ordering should be given by a homogeneous grading.
    355355
    356356  if(A._kernel_dimension==-2)
    … …  
    433433      cerr<<"\nWARNING: ideal& ideal::Hosten_Sturmfels_ideal(matrix&, "
    434434        "const term_ordering&):\nInvalid row space vector does not induce "
    435         "homogenous grading."<<endl;
     435        "homogeneous grading."<<endl;
    436436
    437437    binomial* bin=new binomial(A.columns,generator,w);
    … …  
    576576
    577577  w=_w;
    578   // The argument term_ordering should be given by a homogenous grading.
     578  // The argument term_ordering should be given by a homogeneous grading.
    579579
    580580  if(A._kernel_dimension==-2)
    … …  
    685685      cerr<<"\nWARNING: ideal& ideal::Bigatti_LaScala_Robbiano_ideal(matrix&, "
    686686        "const term_ordering&):\nInvalid row space vector does not induce "
    687         "homogenous grading."<<endl;
     687        "homogeneous grading."<<endl;
    688688
    689689    binomial* bin=new binomial(A.columns+1,generator,w);

  • Singular/LIB/resgraph.lib

    ra311b30 r410eb0d  
    104104  {
    105105//--- do not leave any garbage in the public directories
    106     j=system("sh","commnd rm " + outfile + " " + @filename);
     106    j=system("sh","command rm " + outfile + " " + @filename);
    107107  }
    108108  return();
    … …  
    290290  {
    291291//--- do not leave any garbage in the public directories
    292     j=system("sh","commnd rm " + @filename + ".jpg "+ @filename);
     292    j=system("sh","command rm " + @filename + ".jpg "+ @filename);
    293293  }
    294294  return();

  • kernel/linear_algebra/linearAlgebra.h

    ra311b30 r410eb0d  
    457457 * These will be combuted by Heron's iteration formula, with iteration
    458458 * stopping when two successive approximations of the square root differ by
    459  * no more than the given tolerance, which is assumed to be a positve real
     459 * no more than the given tolerance, which is assumed to be a positive real
    460460 * number.
    461461 **/
Note: See TracChangeset for help on using the changeset viewer.