Changeset 5c187b in git


Ignore:
Timestamp:
Oct 22, 1999, 11:07:08 AM (24 years ago)
Author:
Olaf Bachmann <obachman@…>
Branches:
(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', '00e2e9c41af3fde1273eb3633f4c0c7c3db2579d')
Children:
6f73cfacb2f11a3f3e9096814cdfee48026b890a
Parents:
37c5b38924d40017b1e773d5675c259d1e72f3c4
Message:
* system("mtrack", <filename>)
* linalg.lib included in a;ll.lib
* killall functionality extended to killall("not", name1, name2,...)


git-svn-id: file:///usr/local/Singular/svn/trunk@3763 2c84dea3-7e68-4137-9b89-c4e89433aadc
Location:
Singular
Files:
14 edited

Legend:

Unmodified
Added
Removed

  • Singular/LIB/all.lib

    r37c5b3 r5c187b  
    1 // $Id: all.lib,v 1.21 1999-08-16 10:55:45 obachman Exp $
     1// $Id: all.lib,v 1.22 1999-10-22 09:07:07 obachman Exp $
    22///////////////////////////////////////////////////////////////////////////////
    33
    4 version="$Id: all.lib,v 1.21 1999-08-16 10:55:45 obachman Exp $";
     4version="$Id: all.lib,v 1.22 1999-10-22 09:07:07 obachman Exp $";
    55info="
    66LIBRARY:  all.lib   Load all libraries
    … …  
    1717  invar.lib     PROCEDURES FOR COMPUTING INVARIANTS OF (C,+)-ACTIONS
    1818  latex.lib     PROCEDURES FOR TYPESET OF SINGULAROBJECTS IN LATEX2E
     19  linalg.lib    PROCEDURES FOR PROCEDURES FOR ALGORITHMIC LINEAR ALGEBRA
    1920  matrix.lib    PROCEDURES FOR MATRIX OPERATIONS
    2021  normal.lib    PROCEDURES FOR COMPUTING THE NORMALIZATION
    … …  
    5051LIB "invar.lib";
    5152LIB "latex.lib";
     53LIB "linalg.lib";
    5254LIB "matrix.lib";
    5355LIB "normal.lib";

  • Singular/LIB/general.lib

    r37c5b3 r5c187b  
    1 // $Id: general.lib,v 1.21 1999-09-27 17:54:57 Singular Exp $
     1// $Id: general.lib,v 1.22 1999-10-22 09:07:07 obachman Exp $
    22//GMG, last modified 18.6.99
    33///////////////////////////////////////////////////////////////////////////////
    44
    5 version="$Id: general.lib,v 1.21 1999-09-27 17:54:57 Singular Exp $";
     5version="$Id: general.lib,v 1.22 1999-10-22 09:07:07 obachman Exp $";
    66info="
    77LIBRARY:  general.lib   PROCEDURES OF GENERAL TYPE
    … …  
    413413         killall(\"not\", \"type_name\"); kills all user-defined variables,
    414414         except those of type \"type_name\" and except loaded procedures
     415         killall(\"not\", \"name_1\", \"name_2\", ...);
     416         kills all user-defined variables, except those of name \"name_i\"
     417         and except loaded procedures
    415418RETURN:  no return value
    416419NOTE:    killall should never be used inside a procedure
    … …  
    418421"
    419422{
    420    list L=names(); int joni=size(L);
    421    if( size(#)==0 )
    422    {
    423       for ( ; joni>0; joni-- )
    424       {
    425          if( L[joni]!="LIB" and typeof(`L[joni]`)!="proc" ) { kill `L[joni]`; }
    426       }
    427    }
    428    else
    429    {
    430      if( size(#)==1 )
    431      {
    432        if( #[1] == "proc" )
    433        {
    434           for ( joni=size(L); joni>0; joni-- )
     423  list L=names(); int joni=size(L);
     424  int no_kill, j;
     425  for (j=1; j<=size(#); j++)
     426  {
     427    if (typeof(#[j]) != "string")
     428    {
     429      ERROR("Need string as " + string(j) + "th argument");
     430    }
     431  }
     432 
     433  // kills all user-defined variables but not loaded procedures
     434  if( size(#)==0 )
     435  {
     436    for ( ; joni>0; joni-- )
     437    {
     438      if( L[joni]!="LIB" and typeof(`L[joni]`)!="proc" ) { kill `L[joni]`; }
     439    }
     440  }
     441  else
     442  {
     443    // kills all user-defined variables
     444    if( size(#)==1 )
     445    {
     446      // of type proc
     447      if( #[1] == "proc" )
     448      {
     449        for ( joni=size(L); joni>0; joni-- )
     450        {
     451          if((L[joni]!="killall") and (L[joni]=="LIB" or typeof(`L[joni]`)=="proc"))
     452          { kill `L[joni]`; }
     453        }
     454      }
     455      else
     456      { 
     457        // other types
     458        for ( ; joni>2; joni-- )
     459        {
     460          if(typeof(`L[joni]`)==#[1] and L[joni]!="LIB" and typeof(`L[joni]`)!="proc") { kill `L[joni]`; }
     461        }
     462      }
     463    }
     464    else
     465    {
     466      // kills all user-defined variables whose name or type is not #i
     467      for ( ; joni>2; joni-- )
     468      {
     469        if ( L[joni] != "LIB" && typeof(`L[joni]`) != "proc")
     470        {
     471          no_kill = 0;
     472          for (j=2; j<= size(#); j++)
    435473          {
    436              if((L[joni]!="killall") and (L[joni]=="LIB" or typeof(`L[joni]`)=="proc"))
    437                { kill `L[joni]`; }
     474            if (typeof(`L[joni]`)==#[j] or L[joni] == #[j])
     475            {
     476              no_kill = 1;
     477              break;
     478            }
    438479          }
    439        }
    440        else
    441        {
    442           for ( ; joni>2; joni-- )
     480          if (! no_kill)
    443481          {
    444             if(typeof(`L[joni]`)==#[1] and L[joni]!="LIB" and typeof(`L[joni]`)!="proc") { kill `L[joni]`; }
     482            kill `L[joni]`;
    445483          }
    446484        }
    447      }
    448      else
    449      {
    450         for ( ; joni>2; joni-- )
    451         {
    452           if(typeof(`L[joni]`)!=#[2] and L[joni]!="LIB" and typeof(`L[joni]`)!="proc") { kill `L[joni]`; }
    453         }
    454      }
     485      }
     486    }
    455487  }
    456   return();
    457488}
    458489example

  • Singular/LIB/linalg.lib

    r37c5b3 r5c187b  
    33//////////////////////////////////////////////////////////////////////////////
    44
    5 version="$Id: linalg.lib,v 1.1 1999-08-18 12:07:02 siebert Exp $";
     5version="$Id: linalg.lib,v 1.2 1999-10-22 09:07:07 obachman Exp $";
    66info="
    77LIBRARY:  linalg.lib    PROCEDURES FOR ALGORITHMIC LINEAR ALGEBRA
    … …  
    1616 diag_test(A);
    1717 busadj(A);         coefficients of Adj(E*t-A) and coefficients of det(E*t-A)
    18  charpoly(A,v);     characteristic polynom of A. ( using busadj(A) )
     18 charpoly(A,v);     characteristic polynomial of A. ( using busadj(A) )
    1919 adj(A);            ( using busadj(A) )
    2020 det_B(A);          determinant of A. ( uses busadj(A) )
    … …  
    353353"USAGE:   busadj(A);  A =  square matrix
    354354RETURN:  list L;
    355          L[1] contains the (n+1)coefficients of the characteristic polynom of A
     355         L[1] contains the (n+1)coefficients of the characteristic polynomial of A
    356356              X=L[1][1]+..+L[1][k]*t^(k-1)+..+(L[1][n+1]=1)*t^n
    357357         L[2] contains the n matrices Hk of type nxn with
    358358              bA=(Hn-1)*t^(n-1)+...+H0   ,( Hk=L[2][k+1] )
    359               this matrix polynom forms the busadjunkte bA=adj(E*t-A)
     359              this matrix polynomial forms the busadjoint bA=adj(E*t-A)
    360360EXAMPLE: example busadj; shows an example"
    361361{
    … …  
    410410"USAGE:   charpoly(A,v); A = square matrix, v = name of a ringvariable
    411411NOTE:    A must be constant in the variable v. The computation uses busadj(A).
    412 RETURN:  poly, characteristic polynom det(E*v-A)
     412RETURN:  poly, characteristic polynomial det(E*v-A)
    413413EXAMPLE: example charpoly; shows an example"
    414414{
    … …  
    480480"USAGE:    adj(A);  A = square matrix
    481481NOTE:     computation uses busadj(A)
    482 RETURN:   englisch(Adjunkte?)
     482RETURN:   adjoint
    483483EXAMPLE:  example adj; shows an example"
    484484{
    … …  
    514514RETURN:    list Inv with Inv[1]=matrix I and Inv[2]=poly p
    515515           and I*A = unitmat(n)*p;
    516 NOTE:      p=1 if 1/det(A) is computeable and  p=det(A) if not
     516NOTE:      p=1 if 1/det(A) is computable and  p=det(A) if not
    517517EXAMPLE:   example inverse_B; shows an example"
    518518{
    … …  
    585585RETURN:    list Inv with Inv[1]=matrix I and Inv[2]=poly p
    586586           and I*A = unitmat(n)*p;
    587 NOTE:      p=1 if 1/det(A) is computeable and  p=det(A) if not
     587NOTE:      p=1 if 1/det(A) is computable and  p=det(A) if not
    588588EXAMPLE:   example inverse_L; shows an example"
    589589{
    … …  
    635635proc gaussred(matrix A)
    636636"USAGE:     gaussred(A);   any constant matrix A
    637 RETURN:    list Z:  Z[1]=P , Z[2]=U , Z[3]=S , Z[4]=rank(ENGLISCH?)
    638            gives an row reduced matrix S, a permutation matrix P and a
    639            normalized (untere Dreiecksmatrix->ENGLISCH?) U , with
    640 
    641                     P*A=U*S           
     637RETURN:    list Z:  Z[1]=P , Z[2]=U , Z[3]=S , Z[4]=rank(A)
     638           gives a row reduced matrix S, a permutation matrix P and a
     639           normalized lower triangular matrix U , with P*A=U*S           
    642640EXAMPLE:   example gaussred; shows an example"
    643641{
    … …  
    718716"EXAMPLE";echo=2;
    719717ring r=0,(x),dp;
    720 int n=random(1,10);
    721 int m=random(1,10);
    722 matrix A[n][m]=random(10,n,m);
     718matrix A[5][4]=1,3,-1,4,2,5,-1,3,1,3,-1,4,0,4,-3,1,-3,1,-5,-2;
    723719print(A);
    724720list Z=gaussred(A);
    … …  
    734730proc gaussred_pivot(matrix A)
    735731"USAGE:     gaussred(A);   any constant matrix A
    736 RETURN:    list Z:  Z[1]=P , Z[2]=U , Z[3]=S , Z[4]=rank(ENGLISCH?)
    737            gives an row reduced matrix S, a permutation matrix P and a
    738            normalized (untere Dreiecksmatrix->ENGLISCH?) U , with
    739 
     732RETURN:    list Z:  Z[1]=P , Z[2]=U , Z[3]=S , Z[4]=rank(A)
     733           gives n row reduced matrix S, a permutation matrix P and a
     734           normalized lower triangular matrix U , with
    740735                    P*A=U*S
    741736NOTE:      with row pivoting           
    … …  
    816811"EXAMPLE";echo=2;
    817812ring r=0,(x),dp;
    818 int n=random(1,10);
    819 int m=random(1,10);
    820 matrix A[n][m]=random(10,n,m);
     813matrix A[5][4]=1,3,-1,4,2,5,-1,3,1,3,-1,4,0,4,-3,1,-3,1,-5,-2;
    821814print(A);
    822815list Z=gaussred(A);
    … …  
    876869"USAGE:     gaussred(A);   constant invertible matrix A
    877870RETURN:    list Z:  Z[1]=P , Z[2]=U , Z[3]=D , Z[4]=O
    878            gives an row reduced matrix S, a permutation matrix P and a
    879            normalized (untere Dreiecksmatrix->ENGLISCH?) U , with
    880 
    881                     P*A=U*D*O
    882            D diagonal matrix, O normalized (obere Dreiecksmatrix->ENGLISCH)
     871           gives a permutation matrix P, a
     872           normalized lower triangular matrix U ,
     873           a diagonal matrix D, and a normalized upper triangular matrix O
     874           withP*A=U*D*O
    883875NOTE:      Z[1]=-1 means A is not regular
    884876EXAMPLE:   example gaussred; shows an example"

  • Singular/LIB/tst.lib

    r37c5b3 r5c187b  
    1 // $Id: tst.lib,v 1.18 1999-10-19 17:17:17 obachman Exp $
     1// $Id: tst.lib,v 1.19 1999-10-22 09:07:08 obachman Exp $
    22//(obachman, last modified 6/30/98)
    33/////////////////////////////////////////////////////////////////////////////
    44
    5 version="$Id: tst.lib,v 1.18 1999-10-19 17:17:17 obachman Exp $";
     5version="$Id: tst.lib,v 1.19 1999-10-22 09:07:08 obachman Exp $";
    66info="
    77LIBRARY:  tst.lib      PROCEDURES FOR RUNNING AUTOMATIC TST TESTS
    … …  
    2222
    2323/////////////////////////////////////////////////////////////////////////////
    24 
    2524proc tst_system(string s, list #)
    2625"USAGE:    tst_system(s); s string

  • Singular/extra.cc

    r37c5b3 r5c187b  
    22*  Computer Algebra System SINGULAR      *
    33*****************************************/
    4 /* $Id: extra.cc,v 1.110 1999-10-14 14:27:02 obachman Exp $ */
     4/* $Id: extra.cc,v 1.111 1999-10-22 09:07:00 obachman Exp $ */
    55/*
    66* ABSTRACT: general interface to internals of Singular ("system" command)
    … …  
    579579#endif
    580580#endif /* HAVE_DYNAMIC_LOADING */
     581
     582/*==================== mtrack ==================================*/
     583    if(strcmp(sys_cmd,"mtrack")==0)
     584    {
     585#ifdef MLIST
     586      FILE *fd = NULL;
     587      if ((h!=NULL) &&(h->Typ()==STRING_CMD))
     588      {
     589        fd = fopen((char*) h->Data(), "w");
     590        if (fd == NULL)
     591          Warn("Can not open %s for writing og mtrack. Using stdout");
     592      }
     593      mmTestList((fd == NULL ? stdout: fd), 0);
     594      if (fd != NULL) fclose(fd);
     595      return FALSE;
     596#else
     597     WerrorS("mtrack not supported without MLIST");
     598     return TRUE;
     599#endif     
     600    }
     601    else
    581602/*==================== naIdeal ==================================*/
    582603    if(strcmp(sys_cmd,"naIdeal")==0)

  • Singular/iparith.cc

    r37c5b3 r5c187b  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: iparith.cc,v 1.182 1999-10-20 13:30:01 obachman Exp $ */
     4/* $Id: iparith.cc,v 1.183 1999-10-22 09:07:01 obachman Exp $ */
    55
    66/*
    … …  
    18521852  int wmaxl=maxl;
    18531853  ideal u_id=(ideal)u->Data();
     1854 
    18541855  maxl--;
    18551856  if ((maxl==-1) && (iiOp!=MRES_CMD))

  • Singular/kstd1.cc

    r37c5b3 r5c187b  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: kstd1.cc,v 1.42 1999-10-20 07:33:40 siebert Exp $ */
     4/* $Id: kstd1.cc,v 1.43 1999-10-22 09:07:02 obachman Exp $ */
    55/*
    66* ABSTRACT:
    … …  
    14251425  }
    14261426  if (Q!=NULL) updateResult(strat->Shdl,Q,strat);
     1427  idTest(strat->Shdl);
    14271428  return (strat->Shdl);
    14281429}

  • Singular/mmbt.c

    r37c5b3 r5c187b  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: mmbt.c,v 1.12 1999-10-14 14:27:18 obachman Exp $ */
     4/* $Id: mmbt.c,v 1.13 1999-10-22 09:07:03 obachman Exp $ */
    55/*
    66* ABSTRACT: backtrace: part of memory subsystem (for linux/elf)
    … …  
    7171
    7272  while ((fp!=NULL) && ((unsigned long)fp>4095) 
    73 /*  && ((unsigned long)fp < ((unsigned long)0x80000000)) */
     73  && ((unsigned long)fp < ((unsigned long)0xf0000000))
    7474  && *fp && (pc = getpc (fp))
    7575  && !entrypc (pc) && (i<BT_MAXSTACK))
    … …  
    159159}
    160160
    161 void mmPrintStack(unsigned long *stack, int all)
    162 {
    163   mmPrintStackFrames(stack, 0, BT_MAXSTACK, all);
    164 }
    165 
    166 void mmDBPrintThisStack(void* memblock, int all, int free)
     161void mmPrintStack(FILE *fd, unsigned long *stack, int all)
     162{
     163  mmPrintStackFrames(fd, stack, 0, BT_MAXSTACK, all);
     164}
     165
     166void mmDBPrintThisStack(FILE *fd, void* memblock, int all, int free)
    167167{
    168168#ifdef MTRACK_FREE
    169169  if (free)
    170     mmPrintStackFrames(((DBMCB*) memblock)->bt_freed_stack, 0, BT_MAXSTACK, all);
     170    mmPrintStackFrames(fd, ((DBMCB*) memblock)->bt_freed_stack, 0, BT_MAXSTACK, all);
    171171  else
    172172#endif
    173     mmPrintStackFrames(((DBMCB*) memblock)->bt_allocated_stack, 0, BT_MAXSTACK, all);
     173    mmPrintStackFrames(fd, ((DBMCB*) memblock)->bt_allocated_stack, 0, BT_MAXSTACK, all);
    174174}
    175175   
    176 void mmDBPrintStack(void* memblock, int all)
    177 {
    178   mmPrintStackFrames(((DBMCB*) memblock)->bt_allocated_stack, 0, BT_MAXSTACK, all);
    179 }
    180 
    181 void mmDBPrintStackFrames(void* memblock, int start, int end)
    182 {
    183   mmPrintStackFrames(((DBMCB*) memblock)->bt_allocated_stack, start, end,
     176void mmDBPrintStack(FILE *fd, void* memblock, int all)
     177{
     178  mmPrintStackFrames(fd, ((DBMCB*) memblock)->bt_allocated_stack, 0, BT_MAXSTACK, all);
     179}
     180
     181void mmDBPrintStackFrames(FILE *fd, void* memblock, int start, int end)
     182{
     183  mmPrintStackFrames(fd, ((DBMCB*) memblock)->bt_allocated_stack, start, end,
    184184                     MM_PRINT_ALL_STACK);
    185185}
    186186
    187187/* print stack */
    188 void mmPrintStackFrames(unsigned long *bt_stack, int start, int end, int mm)
     188void mmPrintStackFrames(FILE *fd, unsigned long *bt_stack, int start, int end, int mm)
    189189{
    190190  int i=start;
    191   PrintS(" ");
     191  fprintf( fd," ");
    192192  do
    193193  {
    … …  
    197197    {
    198198      if ((mm & MM_PRINT_ALL_STACK) || strncmp(s, "mm", 2) !=0)
    199         fprintf( stderr,":%s",s);
     199        fprintf( fd,":%s",s);
    200200      if (strcmp(s, "main") == 0) break;
    201201    }
    202202    else
    203       fprintf( stderr,":%lx",(long)bt_stack[i]);
     203      fprintf( fd,":%lx",(long)bt_stack[i]);
    204204    i++;
    205205  } while ((i<end) && (bt_stack[i]!=0));
    206   fprintf( stderr,"\n");
     206  fprintf( fd,"\n");
    207207}
    208208#endif /* linux, i386 */

  • Singular/mmbt.h

    r37c5b3 r5c187b  
    44*  Computer Algebra System SINGULAR     *
    55****************************************/
    6 /* $Id: mmbt.h,v 1.4 1999-09-29 17:03:35 obachman Exp $ */
     6/* $Id: mmbt.h,v 1.5 1999-10-22 09:07:04 obachman Exp $ */
    77/*
    88* ABSTRACT: backtrace: part of memory subsystem (for linux/elf)
    … …  
    2626void mmP2cNameInit(); /* init. of PC -> Name resolution */
    2727char * mmP2cName(unsigned long p); /* PC -> Name resolution */
    28 void mmPrintStack(unsigned long *stack, int mm);
    29 void mmDBPrintStack(void* memblock, int mm);
    30 void mmDBPrintStackFrames(void* memblock, int start, int end);
    31 void mmPrintStackFrames(unsigned long *bt_stack, int start, int end, int mm);
    32 void mmDBPrintThisStack(void* memblock, int all, int free);
     28void mmPrintStack(FILE *fd, unsigned long *stack, int mm);
     29void mmDBPrintStack(FILE *fd, void* memblock, int mm);
     30void mmDBPrintStackFrames(FILE *fd, void* memblock, int start, int end);
     31void mmPrintStackFrames(FILE *fd, unsigned long *bt_stack, int start, int end, int mm);
     32void mmDBPrintThisStack(FILE *fd, void* memblock, int all, int free);
    3333#endif /* linux, i386 */
    3434#endif /* not optimize */

  • Singular/mmcheck.c

    r37c5b3 r5c187b  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: mmcheck.c,v 1.13 1999-10-19 14:55:38 obachman Exp $ */
     4/* $Id: mmcheck.c,v 1.14 1999-10-22 09:07:04 obachman Exp $ */
    55
    66/*
    … …  
    129129                 what->allocated_fname, what->freed_lineno );
    130130#ifdef MTRACK
    131   mmDBPrintThisStack(what, MM_PRINT_ALL_STACK, 0);
     131  mmDBPrintThisStack(stderr, what, MM_PRINT_ALL_STACK, 0);
    132132#endif
    133133

  • Singular/mmemory.h

    r37c5b3 r5c187b  
    44*  Computer Algebra System SINGULAR     *
    55****************************************/
    6 /* $Id: mmemory.h,v 1.26 1999-10-19 14:55:39 obachman Exp $ */
     6/* $Id: mmemory.h,v 1.27 1999-10-22 09:07:05 obachman Exp $ */
    77/*
    88* ABSTRACT
    99*/
    1010#include <stdlib.h>
     11#include <stdio.h>
    1112
    1213#ifdef __cplusplus
    … …  
    172173void mmStartReferenceWatch();
    173174void mmStopReferenceWatch();
    174 void mmTestList (int all);
     175void mmTestList(FILE *fd, int all);
    175176
    176177#else

  • Singular/mmisc.c

    r37c5b3 r5c187b  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: mmisc.c,v 1.18 1999-10-19 14:55:39 obachman Exp $ */
     4/* $Id: mmisc.c,v 1.19 1999-10-22 09:07:05 obachman Exp $ */
    55
    66/*
    … …  
    364364
    365365#ifdef MLIST
    366 void mmTestList (int all)
     366void mmTestList (FILE *fd, int all)
    367367{
    368368  DBMCB * what=mm_theDBused.next;
    369   fprintf(stderr,"list of used blocks:\n");
     369  fprintf(fd,"list of used blocks:\n");
    370370  while (what!=NULL)
    371371  {
    372372    if ((all & MM_PRINT_ALL_ADDR) || ! (what->flags & MM_INITFLAG))
    373373    {
    374       fprintf( stderr, "%d bytes at %p allocated in: %s:%d",
     374      fprintf( fd, "%d bytes at %p allocated in: %s:%d",
    375375               (int)what->size, what, what->allocated_fname, what->allocated_lineno);
    376376#ifdef MTRACK
    377       mmDBPrintStack(what, all);
     377      mmDBPrintStack(fd, what, all);
    378378#else
    379       fprintf( stderr, "\n");
     379      fprintf( fd, "\n");
    380380#endif
    381381    }

  • Singular/polys-comp.h

    r37c5b3 r5c187b  
    44*  Computer Algebra System SINGULAR     *
    55****************************************/
    6 /* $Id: polys-comp.h,v 1.15 1999-10-19 12:42:46 obachman Exp $ */
     6/* $Id: polys-comp.h,v 1.16 1999-10-22 09:07:05 obachman Exp $ */
    77
    88/***************************************************************
    … …  
    1414
    1515#include "polys-impl.h"
    16 #include "syz.h"
     16
     17// need to undefine this, since longs might be negative
     18#define unsigned
    1719
    1820#ifdef WORDS_BIGENDIAN
    … …  
    9496}
    9597
     98#define unsigned unsigned
     99
    96100#endif // POLYS_COMP_H
    97101

  • Singular/scanner.l

    r37c5b3 r5c187b  
    33*  Computer Algebra System SINGULAR     *
    44****************************************/
    5 /* $Id: scanner.l,v 1.22 1999-10-14 14:27:29 obachman Exp $ */
     5/* $Id: scanner.l,v 1.23 1999-10-22 09:07:06 obachman Exp $ */
    66#include <stdio.h>
    77#include <string.h>
    … …  
    276276                           #ifdef MDEBUG
    277277                             #ifdef MLIST
    278                              mmTestList(0);
     278                             mmTestList(stdout, 0);
    279279                             #endif
    280280                           #endif
Note: See TracChangeset for help on using the changeset viewer.