Changeset c858487 in git


Ignore:
Timestamp:
Nov 14, 2022, 11:15:59 AM (18 months ago)
Author:
Frédéric Chapoton <chapoton@…>
Branches:
(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
Children:
6cf934536bdf5e13d6b4393257098584b66634f1
Parents:
4a4df3a51856131bd5ba1a1a2a154aac107f2a74
Message:
fix many typos in kernel/
Files:
29 edited

Legend:

Unmodified
Added
Removed

  • .codespell_ignore

    r4a4df3a rc858487  
    1 strat
    21ende
     2erros
    33froms
    4 witht
    54fromt
     5intot
    66ist
    77modul
     8nin
     9nnumber
    810padd
    9 nnumber
    10 nin
     11preverse
    1112ressources
     13sring
     14strat
     15witht
     16wth

  • kernel/GBEngine/gr_kstd2.cc

    r4a4df3a rc858487  
    301301      }
    302302    }
    303     // first try usal division
     303    // first try usual division
    304304    if (p_LmDivisibleBy(strat->S[j],(*h).p,currRing))
    305305    {

  • kernel/GBEngine/kChinese.cc

    r4a4df3a rc858487  
    6363  long *d=(long*)s;
    6464  s+=SIZEOF_LONG;
    65   if (((*d)&1)==1) // immidiate number
     65  if (((*d)&1)==1) // immediate number
    6666  {
    6767    *n=(number)(*d);

  • kernel/GBEngine/kspoly.cc

    r4a4df3a rc858487  
    10071007#endif
    10081008    p_ExpVectorAddSub(sigMult,PR->GetLmCurrRing(),PW->GetLmCurrRing(),currRing);
    1009     //I have also to set the leading coeficient for sigMult (in the case of rings)
     1009    //I have also to set the leading coefficient for sigMult (in the case of rings)
    10101010    if(rField_is_Ring(currRing))
    10111011    {
    … …  
    10411041      if(sigMult != NULL)
    10421042        PR->sig = pHead(pSub(PR->sig, sigMult));
    1043       //The sigs have the same lm, have to substract
     1043      //The sigs have the same lm, have to subtract
    10441044      //It may happen that now the signature is 0 (drop)
    10451045      if(PR->sig == NULL)
    … …  
    14331433/***************************************************************
    14341434 *
    1435  * Auxillary Routines
     1435 * Auxiliary Routines
    14361436 *
    14371437 *

  • kernel/GBEngine/kstd1.cc

    r4a4df3a rc858487  
    5757
    5858/* the list of all options which may be used by option and test */
    59 /* defintion of ALL options: libpolys/misc/options.h */
     59/* definition of ALL options: libpolys/misc/options.h */
    6060VAR BITSET validOpts=Sy_bit(0)
    6161                |Sy_bit(1)
    … …  
    135135  if (intoT)
    136136  {
    137     // need to do it exacly like this: otherwise
     137    // need to do it exactly like this: otherwise
    138138    // we might get errors
    139139    LObject L= *h;
    … …  
    21302130  // do only a reduction of the leading term
    21312131//#define KSTD_NF_ECART  2
    2132   // only local: recude even with bad ecart
     2132  // only local: reduce even with bad ecart
    21332133  poly   p;
    21342134  int   i;
    … …  
    22342234  /*- release temp data------------------------------- -*/
    22352235  cleanT(strat);
    2236   assume(strat->L==NULL); /*strat->L unsed */
     2236  assume(strat->L==NULL); /*strat->L unused */
    22372237  assume(strat->B==NULL); /*strat->B unused */
    22382238  omFreeSize((ADDRESS)strat->T,strat->tmax*sizeof(TObject));
    … …  
    22752275  // do only a reduction of the leading term
    22762276//#define KSTD_NF_ECART  2
    2277   // only local: recude even with bad ecart
     2277  // only local: reduce even with bad ecart
    22782278  poly   p;
    22792279  int   i;
    … …  
    23872387  }
    23882388  /*- release temp data------------------------------- -*/
    2389   assume(strat->L==NULL); /*strat->L unsed */
     2389  assume(strat->L==NULL); /*strat->L unused */
    23902390  assume(strat->B==NULL); /*strat->B unused */
    23912391  omFreeSize((ADDRESS)strat->T,strat->tmax*sizeof(TObject));

  • kernel/GBEngine/kstd1.h

    r4a4df3a rc858487  
    1818  // do only a reduction of the leading term
    1919#define KSTD_NF_ECART  2
    20   // only local: recude even with bad ecart
     20  // only local: reduce even with bad ecart
    2121#define KSTD_NF_NONORM 4
    2222  // only global: avoid normalization, return a multiply of NF

  • kernel/GBEngine/kstd2.cc

    r4a4df3a rc858487  
    660660/*  unsigned long alpha_k = twoPow(leadRing->ch - k_ind2);
    661661  if (1 == 0 && alpha_k <= a)
    662   {  // Temporarly disabled, reducing coefficients not compatible with std TODO Oliver
     662  {  // Temporarily disabled, reducing coefficients not compatible with std TODO Oliver
    663663    zeroPoly = p_ISet((a / alpha_k)*alpha_k, tailRing);
    664664    for (int i = 1; i <= leadRing->N; i++)
    … …  
    702702int redRing_Z (LObject* h,kStrategy strat)
    703703{
    704   if (h->IsNull()) return 0; // spoly is zero (can only occure with zero divisors)
     704  if (h->IsNull()) return 0; // spoly is zero (can only occur with zero divisors)
    705705  if (strat->tl<0) return 1;
    706706
    … …  
    861861{
    862862  if (strat->tl<0) return 1;
    863   if (h->IsNull()) return 0; // spoly is zero (can only occure with zero divisors)
     863  if (h->IsNull()) return 0; // spoly is zero (can only occur with zero divisors)
    864864
    865865  int at/*,i*/;
    … …  
    24482448    strat->use_buckets = 1;
    24492449#endif
    2450   // redtailBBa against T for inhomogenous input
     2450  // redtailBBa against T for inhomogeneous input
    24512451  if (!TEST_OPT_OLDSTD)
    24522452    withT = ! strat->homog;
    … …  
    29422942#endif
    29432943
    2944   // redtailBBa against T for inhomogenous input
     2944  // redtailBBa against T for inhomogeneous input
    29452945  // if (!TEST_OPT_OLDSTD)
    29462946  //   withT = ! strat->homog;
    … …  
    44184418    strat->use_buckets = 1;
    44194419#endif
    4420   // redtailBBa against T for inhomogenous input
     4420  // redtailBBa against T for inhomogeneous input
    44214421  //  if (!TEST_OPT_OLDSTD)
    44224422  //    withT = ! strat->homog;

  • kernel/GBEngine/kutil.cc

    r4a4df3a rc858487  
    83088308        // diff should be zero, but sometimes also the initial generating
    83098309        // elements of the input ideal reduce to zero. then there is an
    8310         // index-gap between the signatures. for these inbetween signatures we
     8310        // index-gap between the signatures. for these in-between signatures we
    83118311        // can safely set syzIdx[j] = 0 as no such element will be ever computed
    83128312        // in the following.
    … …  
    83538353    // diff should be zero, but sometimes also the initial generating
    83548354    // elements of the input ideal reduce to zero. then there is an
    8355     // index-gap between the signatures. for these inbetween signatures we
     8355    // index-gap between the signatures. for these in-between signatures we
    83568356    // can safely set syzIdx[j] = 0 as no such element will be ever computed
    83578357    // in the following.
    … …  
    93349334  /*- save result -*/
    93359335  strat->S[atS] = p.p;
    9336   strat->sig[atS] = p.sig; // TODO: get ths correct signature in here!
     9336  strat->sig[atS] = p.sig; // TODO: get the correct signature in here!
    93379337  if (strat->honey) strat->ecartS[atS] = p.ecart;
    93389338  if (p.sev == 0)
    … …  
    94779477  assume(strat->tailRing == p.tailRing);
    94789478  // redMoraNF complains about this -- but, we don't really
    9479   // neeed this so far
     9479  // need this so far
    94809480  assume(p.pLength == 0 || pLength(p.p) == p.pLength || rIsSyzIndexRing(currRing)); // modulo syzring
    94819481  assume(!strat->homog || (p.FDeg == p.pFDeg()));
    … …  
    95659565  assume(strat->tailRing == p.tailRing);
    95669566  // redMoraNF complains about this -- but, we don't really
    9567   // neeed this so far
     9567  // need this so far
    95689568  assume(p.pLength == 0 || (int)pLength(p.p) == p.pLength || rIsSyzIndexRing(currRing)); // modulo syzring
    95699569  assume(p.FDeg == p.pFDeg());

  • kernel/GBEngine/kutil.h

    r4a4df3a rc858487  
    768768// Reduces PR at Current->next with PW
    769769// Assumes PR != NULL, Current contained in PR
    770 //         Current->next != NULL, LM(PW) devides LM(Current->next)
     770//         Current->next != NULL, LM(PW) divides LM(Current->next)
    771771// Changes: PR
    772772// Const:   PW

  • kernel/GBEngine/ratgring.cc

    r4a4df3a rc858487  
    497497  poly H  = NULL;
    498498  HH = p_HeadRat(p1,is,r); //p_Copy(p_HeadRat(p1,is,r),r); // lm_D(g)
    499 //  H  = r->nc->p_Procs.mm_Mult_p(m, p_Copy(HH, r), r); // d^aplha lm_D(g)
    500   H  = nc_mm_Mult_p(m, HH, r); // d^aplha lm_D(g) == h_g in the paper
     499//  H  = r->nc->p_Procs.mm_Mult_p(m, p_Copy(HH, r), r); // d^alpha lm_D(g)
     500  H  = nc_mm_Mult_p(m, HH, r); // d^alpha lm_D(g) == h_g in the paper
    501501
    502502  poly K  = p_GetCoeffRat(H,  is, r); //p_Copy( p_GetCoeffRat(H,  is, r), r); // k in the paper
    … …  
    538538#endif
    539539
    540 //  out = r->nc->p_Procs.mm_Mult_p(m, out, r); // d^aplha t_g
    541   out = nc_mm_Mult_p(m, out, r); // d^aplha t_g
     540//  out = r->nc->p_Procs.mm_Mult_p(m, out, r); // d^alpha t_g
     541  out = nc_mm_Mult_p(m, out, r); // d^alpha t_g
    542542  p_Delete(&m,r);
    543543

  • kernel/GBEngine/sca.cc

    r4a4df3a rc858487  
    484484  //  due to std( SB, p).
    485485  // Note that after initBuchMora :: initSSpecial all these additional
    486   // elements are in S and T (and some pairs are in L, which also has no initiall
     486  // elements are in S and T (and some pairs are in L, which also has no initial
    487487  // elements!!!)
    488488  if(TEST_OPT_SB_1)

  • kernel/GBEngine/syz1.cc

    r4a4df3a rc858487  
    18071807  return result; /// Don't change the syzstr???
    18081808
    1809   // TODO: cleanup thses!
     1809  // TODO: cleanup these!
    18101810  if( fullres != NULL && syzstr->fullres == NULL )
    18111811    syzstr->fullres = fullres;

  • kernel/GBEngine/syz2.cc

    r4a4df3a rc858487  
    898898/*3
    899899* reorders the result (stored in orderedRes) according
    900 * to the seqence given by res
     900* to the sequence given by res
    901901*/
    902902static void syReOrdResult_Hilb(syStrategy syzstr,int maxindex,int maxdeg)

  • kernel/GBEngine/syz3.cc

    r4a4df3a rc858487  
    10521052
    10531053/*3
    1054 * updates the pairs inthe higher modules
     1054* updates the pairs in the higher modules
    10551055*/
    10561056static void updatePairsHIndex(SSet *resPairs,int *l_pairs,syStrategy /*syzstr*/,

  • kernel/GBEngine/syz4.cc

    r4a4df3a rc858487  
    781781 * subtree attached to the node which represents this term, see reference.
    782782 *
    783  * If use_tensor_trick == true, the current module is modfied after each
     783 * If use_tensor_trick == true, the current module is modified after each
    784784 * lifting step in the resolution: any term which contains a variable which
    785785 * does not appear among the (induced) leading terms is deleted. Note that the

  • kernel/GBEngine/test.cc

    r4a4df3a rc858487  
    449449  poly p1=pISet(1);
    450450
    451   // create tthe polynomial 2*x^3*z^2
     451  // create the polynomial 2*x^3*z^2
    452452  poly p2=p_ISet(2,R);
    453453  pSetExp(p2,1,3);

  • kernel/Makefile.am

    r4a4df3a rc858487  
    4343${builddir}/libkernelCommon.la
    4444
    45 ### TODO: the following has to be addapted...
     45### TODO: the following has to be adapted...
    4646TESTS_ENVIRONMENT = SINGULARPATH='${abs_top_builddir}/libpolys/polys/.libs:${abs_top_builddir}/factory/gftables'
    4747TESTS_ENVIRONMENT += SINGULAR_ROOT_DIR='${abs_top_builddir}'

  • kernel/fglm/fglmhom.cc

    r4a4df3a rc858487  
    223223    for ( s= dat.numMonoms - 1; s >= 0; s-- ) {
    224224//        dat.monlist[s].mon.sm= pPermPoly( dat.monlist[s].mon.dm, vperm, currRing->N, NULL, 0 );
    225       // obachman: changed the folowing to reflect the new calling interface of
     225      // obachman: changed the following to reflect the new calling interface of
    226226      // pPermPoly -- Tim please check whether this is correct!
    227227        dat.monlist[s].mon.sm= pPermPoly( dat.monlist[s].mon.dm, vperm, oldRing, NULL, 0 );

  • kernel/ideals.cc

    r4a4df3a rc858487  
    559559    rChangeCurrRing(orig_ring);
    560560
    561   /* interprete result ----------------------------------------*/
     561  /* interpret result ----------------------------------------*/
    562562  result = idInit(IDELEMS(tempstd),maxrk);
    563563  k = 0;
    … …  
    21642164
    21652165/*3
    2166 *handles for some ideal operations the ring/syzcomp managment
     2166*handles for some ideal operations the ring/syzcomp management
    21672167*returns all syzygies (componentwise-)shifted by -syzcomp
    21682168*or -syzcomp-1 (in case of ideals as input)
    … …  
    25832583/*2
    25842584*decomposes the monom in a part of coefficients described by the
    2585 *complement of how and a monom in variables occuring in how, the
     2585*complement of how and a monom in variables occurring in how, the
    25862586*index of which in kbase is returned as integer pos (-1 if it don't
    25872587*exists)

  • kernel/mod2.h

    r4a4df3a rc858487  
    8888
    8989/*******************************************************************
    90  * Miscellanous Defines
     90 * Miscellaneous Defines
    9191 ******************************************************************/
    9292#ifndef HAVE_LIBPARSER
    … …  
    186186   The omDebug routines are controlled by the values of OM_TRACK, OM_CHECK
    187187   and OM_KEEP.  There meaning is roughly as follows:
    188    OM_TRACK: strored with address                              : extra space
    189      0     : no additional info is stored                      : 0
    190      1     : file:line of location where address was allocated : 1 word
    191      2     : plus backtrace of stack where adress was allocated: 6 words
    192      3     : plus size/bin info and front-, and back padding   : 9 words
    193      4     : plus file:line of location where adress was freed : 10 words
    194      5     : plus backtrace of stack where adress was allocated: 15 words
     188   OM_TRACK: stored with address                                 : extra space
     189     0     : no additional info is stored                        : 0
     190     1     : file:line of location where address was allocated   : 1 word
     191     2     : plus backtrace of stack where address was allocated : 6 words
     192     3     : plus size/bin info and front-, and back padding     : 9 words
     193     4     : plus file:line of location where address was freed : 10 words
     194     5     : plus backtrace of stack where address was allocated : 15 words
    195195   OM_CHECK: checks done
    196196     0     : no checks
    … …  
    224224     ExternalRoutine();
    225225     om_Opts.MinCheck = check; omOpts.MinTrack = track; omOpts.Keep = keep;
    226    ensures that all calls omDebug routines  occuring during the computation of
     226   ensures that all calls omDebug routines  occurring during the computation of
    227227   ExternalRoutine() are done with OM_CHECK==3 and OM_TRACK==5, and
    228228   calls to omFree only mark addresses as free and not really free them.
    … …  
    254254   + You can safely use any free/realloc routine in combination with any alloc
    255255     routine (including the debug versions): E.g., an address allocated with
    256      omAllocBin can be freed with omfree, or an adress allocated with
     256     omAllocBin can be freed with omfree, or an address allocated with
    257257     om(Debug)Alloc can be freed with omfree, or omFree, or omFreeSize, etc.
    258258     However, keep in mind that the efficiency decreases from

  • kernel/old/old.Poly.h

    r4a4df3a rc858487  
    340340    ptr->print();
    341341  }
    342   //* ressource managed by Singular
     342  //* resource managed by Singular
    343343  char* c_string() const{
    344344

  • kernel/old/old.PowerSeries.h

    r4a4df3a rc858487  
    141141  PowerSeriesBase(const numerator_type &a, const denominator_type & b):numerator(a),denominator(b){
    142142    assume(a.getRing()==b.getRing());
    143     //asume b!=NULL
     143    //assume b!=NULL
    144144  }
    145145  typedef PowerSeriesInputIterator<traits> iterator;

  • kernel/oswrapper/feread.cc

    r4a4df3a rc858487  
    124124  #endif
    125125  #ifndef READLINE_READLINE_H_OK
    126     /* declare everything we need explicitely and do not rely on includes */
     126    /* declare everything we need explicitly and do not rely on includes */
    127127    EXTERN_VAR char * rl_readline_name;
    128128    EXTERN_VAR char *rl_line_buffer;

  • kernel/oswrapper/test.cc

    r4a4df3a rc858487  
    314314  poly p1=pISet(1);
    315315
    316   // create tthe polynomial 2*x^3*z^2
     316  // create the polynomial 2*x^3*z^2
    317317  poly p2=p_ISet(2,R);
    318318  pSetExp(p2,1,3);

  • kernel/oswrapper/vspace.h

    r4a4df3a rc858487  
    116116#endif
    117117#ifdef HAVE_CPP_THREADS
    118   // We only need to define the copy constructur for the
     118  // We only need to define the copy constructor for the
    119119  // atomic version, as the std::atomic_flag constructor
    120120  // is deleted.

  • kernel/polys.cc

    r4a4df3a rc858487  
    99#include "polys/clapconv.h"
    1010
    11 /// Widely used global variable which specifies the current polynomial ring for Singular interpreter and legacy implementatins.
     11/// Widely used global variable which specifies the current polynomial ring for Singular interpreter and legacy implementations.
    1212/// @Note: one should avoid using it in newer designs, for example due to possible problems in parallelization with threads.
    1313VAR ring  currRing = NULL;

  • kernel/polys.h

    r4a4df3a rc858487  
    1 /*! \file kernel/polys.h Compatiblity layer for legacy polynomial operations (over @ref currRing)
     1/*! \file kernel/polys.h Compatibility layer for legacy polynomial operations (over @ref currRing)
    22
    33 Macro defines for legacy polynomial operations used in @ref kernel_page and @ref singular_page.
    … …  
    55 Notice that they have different prefix: `p` instead of `p_`.
    66
    7  See also related global ring variable and the correct ring changeing routine:
     7 See also related global ring variable and the correct ring changing routine:
    88 - \ref currRing
    99 - \ref rChangeCurrRing
    … …  
    5252/***************************************************************
    5353 *
    54  * Allocation/Initalization/Deletion
     54 * Allocation/Initialization/Deletion
    5555 * except for pHead, all polys must be != NULL
    5656 *
    … …  
    162162/// polynomial division a/b, ignoring the rest
    163163/// via singclap_pdivide resp. idLift
    164 /// destroyes a,b
     164/// destroys a,b
    165165poly p_Divide(poly a, poly b, const ring r);
    166166/// polynomial division a/b, ignoring the rest
    … …  
    222222
    223223
    224 /// Assume: If considerd only as poly in any component of p
     224/// Assume: If considered only as poly in any component of p
    225225/// (say, monomials of other components of p are set to 0),
    226226/// then p is already sorted correctly
    … …  
    275275/***************************************************************
    276276 *
    277  * Degree stuff -- see p_polys.cc for explainations
     277 * Degree stuff -- see p_polys.cc for explanations
    278278 *
    279279 ***************************************************************/
    … …  
    371371#define   pMinDeg(p,w) p_MinDeg(p,w,currRing)
    372372#define   pSeries(n,p,u,w) p_Series(n,p,u,w,currRing)
    373 // maximum weigthed degree of all monomials of p, w is indexed from
     373// maximum weighted degree of all monomials of p, w is indexed from
    374374// 1..pVariables
    375375

  • kernel/preimage.cc

    r4a4df3a rc858487  
    1919*shifts the variables between minvar and maxvar of p  \in p_ring to the
    2020*first maxvar-minvar+1 variables in the actual ring
    21 *be carefull: there is no range check for the variables of p
     21*be careful: there is no range check for the variables of p
    2222*/
    2323static poly pChangeSizeOfPoly(ring p_ring, poly p,int minvar,int maxvar, const ring dst_r)
    … …  
    132132                              tmpR);
    133133  }
    134   // we ignore here homogenity - may be changed later:
     134  // we ignore here homogeneity - may be changed later:
    135135
    136136  temp2 = kStd(temp1,NULL,isNotHomog,NULL);

  • kernel/test.cc

    r4a4df3a rc858487  
    544544  poly p1=pISet(1);
    545545
    546   // create tthe polynomial 2*x^3*z^2
     546  // create the polynomial 2*x^3*z^2
    547547  poly p2=p_ISet(2,R);
    548548  pSetExp(p2,1,3);
Note: See TracChangeset for help on using the changeset viewer.