Changeset cf022c7 in git
- Timestamp:
- Aug 4, 2005, 3:01:42 PM (19 years ago)
- Branches:
- (u'spielwiese', '17f1d200f27c5bd38f5dfc6e8a0879242279d1d8')
- Children:
- d0c9ea56a0d737ac0501ec7c4b0aa1ef9332eaa4
- Parents:
- ad408c91cc440f15e25c340805838886deb55e13
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/ipshell.cc
rad408c rcf022c7 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ipshell.cc,v 1.12 3 2005-08-04 12:29:33Singular Exp $ */4 /* $Id: ipshell.cc,v 1.124 2005-08-04 13:01:42 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: … … 1873 1873 R->wvhdl=(int**)omAlloc0(n*sizeof(int_ptr)); 1874 1874 // init order, so that rBlocks works correctly 1875 for (j=0; j < n- 2; j++)1875 for (j=0; j < n-1; j++) 1876 1876 R->order[j] = (int) ringorder_unspec; 1877 1877 // orderings … … 1898 1898 { 1899 1899 int jj=j-1; 1900 while((jj> 0)1900 while((jj>=0) 1901 1901 && ((R->order[jj]== ringorder_a) 1902 1902 || (R->order[jj]== ringorder_aa) … … 1904 1904 || (R->order[jj]== ringorder_C) 1905 1905 )) 1906 { 1907 //Print("jj=%, skip %s\n",rSimpleOrdStr(R->order[jj])); 1906 1908 jj--; 1907 if (jj==0) R->block0[j]=1; 1909 } 1910 if (jj<0) R->block0[j]=1; 1908 1911 else R->block0[j]=R->block1[jj]+1; 1909 1912 } … … 1947 1950 break; 1948 1951 case 0: 1952 case ringorder_unspec: 1949 1953 break; 1950 1954 } … … 1953 1957 j=n-2; 1954 1958 if ((R->order[j]==ringorder_c) 1955 || (R->order[j]==ringorder_C)) j--; 1959 || (R->order[j]==ringorder_C) 1960 || (R->order[j]==ringorder_unspec)) j--; 1956 1961 if (R->block1[j] != R->N) 1957 1962 {
Note: See TracChangeset
for help on using the changeset viewer.