Changeset 9f48f5 in git


Ignore:
Timestamp:
May 31, 2023, 2:54:44 PM (14 months ago)
Author:
Hans Schoenemann <hannes@…>
Branches:
(u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'd25190065115c859833252500a64cfb7b11e3a50')
Children:
6b7c2017a11017f0704671f93f0b3d7e33ea3f57
Parents:
2a45f43424a5f5b8bc30e399dac03c3a2b624f3b
Message:
format
Files:
23 edited

Legend:

Unmodified
Added
Removed
  • Singular/blackbox.h

    r2a45f43 r9f48f5  
    8181void printBlackboxTypes();
    8282
    83 /// struct for containing list of blackbox names and the number of them. 
     83/// struct for containing list of blackbox names and the number of them.
    8484struct blackbox_list {
    8585        int count;
  • Singular/dyn_modules/customstd/customstd.cc

    r2a45f43 r9f48f5  
    659659  p->iiAddCproc("customstd.lib","std_print_spoly",FALSE,std_print_spoly);
    660660  p->iiAddCproc("customstd.lib","syz_print_spoly",FALSE,std_print_spoly);
    661  
     661
    662662  return (MAX_TOK);
    663663}
  • Singular/dyn_modules/freealgebra/freealgebra.cc

    r2a45f43 r9f48f5  
    4141      return TRUE;
    4242    }
    43     int ncGenCount = 0; 
     43    int ncGenCount = 0;
    4444    if (iiCheckTypes(args,t2,0))
    4545      ncGenCount = (int)(long) args->next->next->Data();
  • Singular/dyn_modules/loctriv/loctriv.cc

    r2a45f43 r9f48f5  
    2727    ring syz_ring;
    2828    intvec *w=NULL;
    29  
     29
    3030    assume(currRing != NULL);
    3131    orig_ring=currRing;
     
    3333    rSetSyzComp(k,syz_ring);
    3434    rChangeCurrRing(syz_ring);
    35  
     35
    3636    if (orig_ring != syz_ring)
    3737    {
     
    4242      s_h1 = h1;
    4343    }
    44  
     44
    4545    s_h3=kStd(s_h1,NULL,testHomog,&w,NULL,k);
    46  
     46
    4747    if (orig_ring != syz_ring)
    4848    {
  • Singular/dyn_modules/systhreads/doc/threadpools.md

    r2a45f43 r9f48f5  
    6262
    6363A job is a descriptor for a piece of work that a thread is meant to
    64 perform. The basic job is 
     64perform. The basic job is
    6565
    6666    job j = createJob(string func[, def arg1, ..., def argn]);
  • Singular/dyn_modules/systhreads/shared.cc

    r2a45f43 r9f48f5  
    25452545  }
    25462546  Job *job;
    2547   if (cmd.argtype(first_arg) == type_job) 
     2547  if (cmd.argtype(first_arg) == type_job)
    25482548    job = *(Job **)(cmd.arg(first_arg));
    25492549  else
  • Singular/grammar.cc

    r2a45f43 r9f48f5  
    22
    33/* Skeleton implementation for Bison's Yacc-like parsers in C
    4    
     4
    55      Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006,
    66   2009, 2010 Free Software Foundation, Inc.
    7    
     7
    88   This program is free software: you can redistribute it and/or modify
    99   it under the terms of the GNU General Public License as published by
    1010   the Free Software Foundation, either version 3 of the License, or
    1111   (at your option) any later version.
    12    
     12
    1313   This program is distributed in the hope that it will be useful,
    1414   but WITHOUT ANY WARRANTY; without even the implied warranty of
    1515   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    1616   GNU General Public License for more details.
    17    
     17
    1818   You should have received a copy of the GNU General Public License
    1919   along with this program.  If not, see <http://www.gnu.org/licenses/>.  */
     
    2828   Bison output files to be licensed under the GNU General Public
    2929   License without this special exception.
    30    
     30
    3131   This special exception was added by the Free Software Foundation in
    3232   version 2.2 of Bison.  */
  • Singular/grammar.h

    r2a45f43 r9f48f5  
    22
    33/* Skeleton interface for Bison's Yacc-like parsers in C
    4    
     4
    55      Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006,
    66   2009, 2010 Free Software Foundation, Inc.
    7    
     7
    88   This program is free software: you can redistribute it and/or modify
    99   it under the terms of the GNU General Public License as published by
    1010   the Free Software Foundation, either version 3 of the License, or
    1111   (at your option) any later version.
    12    
     12
    1313   This program is distributed in the hope that it will be useful,
    1414   but WITHOUT ANY WARRANTY; without even the implied warranty of
    1515   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    1616   GNU General Public License for more details.
    17    
     17
    1818   You should have received a copy of the GNU General Public License
    1919   along with this program.  If not, see <http://www.gnu.org/licenses/>.  */
     
    2828   Bison output files to be licensed under the GNU General Public
    2929   License without this special exception.
    30    
     30
    3131   This special exception was added by the Free Software Foundation in
    3232   version 2.2 of Bison.  */
  • Tst/Manual/annfspecial.tst

    r2a45f43 r9f48f5  
    22LIB "dmod.lib";
    33ring r = 0,(x,y),dp;
    4 poly F = x3-y2; 
    5 bernsteinBM(F); // the roots of Bernstein-Sato poly: -7/6, -1, -5/6 
     4poly F = x3-y2;
     5bernsteinBM(F); // the roots of Bernstein-Sato poly: -7/6, -1, -5/6
    66// *** first example: generic root
    7 def A = annfspecial(F,-5/6); 
     7def A = annfspecial(F,-5/6);
    88setring A; print(annfalpha); kill A; setring r;
    99// *** second example:  exceptional root since its distance to -1 is integer 2
  • Tst/Short/bug_subst.tst

    r2a45f43 r9f48f5  
    55poly p=(x+y)^10;
    66poly q;
    7 q = subst(p,x,x+y); 
     7q = subst(p,x,x+y);
    88ideal P=p;
    99ideal Q=subst(P,x,x+y);
  • Tst/Short/invar_lib.tst

    r2a45f43 r9f48f5  
    1818setring Invar::polyring;
    1919// The reynolds operator is computed using the Omega process.
    20 Invar::reynolds(x(1)*x(4)); 
     20Invar::reynolds(x(1)*x(4));
    2121
    22 setring Invar::group;                 
     22setring Invar::group;
    2323
    2424"EXAMPLE 2:";
     
    5555"EXAMPLE 2:";
    5656
    57 setring Invar::group;                 
     57setring Invar::group;
    5858weights=-4,-3,-2,1,1,2,3,4;     // a harder example
    5959matrix m=torusrep(weights);
     
    9696"EXAMPLE 2:";
    9797finite(4);                              // Cyclic group of order 4
    98 matrix id=unitmat(4);                   
     98matrix id=unitmat(4);
    9999matrix m4[4][4]=0,1,0,0,0,0,1,0,0,0,0,1,1,0,0,0;
    100100                                        // matrix of (1 2 3 4)
  • Tst/Short/liftstd_m.tst

    r2a45f43 r9f48f5  
    5151print(S);
    5252reduce(G-A1*T1,A2);
    53  
     53
    5454S=modulo(A1,A2,T2,"std");
    5555print(T2);
  • factory/FLINTconvert.cc

    r2a45f43 r9f48f5  
    10071007CFFList
    10081008convertFLINTFq_nmod_mpoly_factor2FacCFFList (
    1009                    fq_nmod_mpoly_factor_t fac, 
     1009                   fq_nmod_mpoly_factor_t fac,
    10101010                   const fq_nmod_mpoly_ctx_t& ctx,
    10111011                   const int N,
  • factory/FLINTconvert.h

    r2a45f43 r9f48f5  
    317317#if __FLINT_RELEASE >= 20700
    318318CanonicalForm
    319 convertFq_nmod_mpoly_t2FacCF (const fq_nmod_mpoly_t poly,    ///< [in] 
     319convertFq_nmod_mpoly_t2FacCF (const fq_nmod_mpoly_t poly,    ///< [in]
    320320                              const fq_nmod_mpoly_ctx_t& ctx,///< [in] context
    321321                              const int N,                   ///< [in] #vars
  • factory/cf_switches.cc

    r2a45f43 r9f48f5  
    4141  On(SW_USE_FL_GCD_P);
    4242  On(SW_USE_FL_GCD_0);
    43 #if (__FLINT_RELEASE >= 20700) 
     43#if (__FLINT_RELEASE >= 20700)
    4444  On(SW_USE_FL_FAC_P);
    4545#endif
  • factory/facFqBivar.cc

    r2a45f43 r9f48f5  
    174174    Variable beta= rootOf (mipo.mapinto());
    175175    CanonicalForm buf= GF2FalphaRep (A, beta);
    176 #ifdef HAVE_NTL   
     176#ifdef HAVE_NTL
    177177    if (getCharacteristic() > 2)
    178178#else
     
    223223#endif
    224224    }
    225 #ifdef HAVE_NTL   
     225#ifdef HAVE_NTL
    226226    else
    227227    {
     
    235235                                                           x, beta);
    236236    }
    237 #endif   
     237#endif
    238238    setCharacteristic (getCharacteristic(), k, cGFName);
    239239    for (CFFListIterator i= factorsA; i.hasItem(); i++)
     
    247247  else if (alpha.level() != 1)
    248248  {
    249 #ifdef HAVE_NTL 
     249#ifdef HAVE_NTL
    250250    if (getCharacteristic() > 2)
    251251#else
     
    308308                                                           x, alpha);
    309309    }
    310 #endif   
     310#endif
    311311  }
    312312  else
     
    315315#ifdef HAVE_NTL
    316316    if (degree (A) < 300)
    317 #endif   
     317#endif
    318318    {
    319319      nmod_poly_t FLINTA;
     
    15021502}
    15031503#endif
    1504  
     1504
    15051505#ifdef HAVE_NTL
    15061506long isReduced (const mat_zz_pE& M)
  • factory/fac_util.cc

    r2a45f43 r9f48f5  
    178178{
    179179    return prod( a, a.min(), a.max() );
    180 }   
     180}
    181181
    182182void
  • libpolys/coeffs/flintcf_Qrat.h

    r2a45f43 r9f48f5  
    2222  char **names;
    2323  int N;
    24   #ifdef QA_DEBUG 
     24  #ifdef QA_DEBUG
    2525  coeffs C;
    2626  #endif
  • libpolys/coeffs/gnumpfl.cc

    r2a45f43 r9f48f5  
    199199{
    200200  assume( getCoeffType(r) == n_long_R );
    201  
     201
    202202  gmp_float* f;
    203203  if ( ((gmp_float*)b)->isZero() )
  • libpolys/coeffs/longrat.cc

    r2a45f43 r9f48f5  
    570570    return INT_TO_SR(0);
    571571  }
    572      
     572
    573573  mpf_t *f = ((gmp_complex*)from)->real()._mpfp();
    574574
  • libpolys/polys/flintconv.cc

    r2a45f43 r9f48f5  
    166166void convSingNFlintN(fmpq_t f, number n, const coeffs cf)
    167167{
    168   if (getCoeffType(cf)==n_Q) /* QQ, bigint */ 
     168  if (getCoeffType(cf)==n_Q) /* QQ, bigint */
    169169  {
    170170    fmpq_init(f);
  • libpolys/polys/simpleideals.cc

    r2a45f43 r9f48f5  
    246246  int idelems=IDELEMS(ide);
    247247
    248   k=0; 
     248  k=0;
    249249  while((k<idelems)&&(ide->m[k] != NULL)) k++;
    250250  if (k==idelems) return idelems;
Note: See TracChangeset for help on using the changeset viewer.