Changeset 52cc7a4 in git
- Timestamp:
- Aug 18, 2008, 2:26:02 PM (15 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', '23b0a9c07070b684aa12355009488dc00d9501e3')
- Children:
- 6d898347af76d4482a05fd199bfbad769f001a03
- Parents:
- da2fc8d3786d00597bd91e3c2d5c1488846cb301
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/wrapper.cc
rda2fc8 r52cc7a4 31 31 T->root=NULL; 32 32 33 for (int i=0; i < v->idelems(); i++)33 for (int i=0; i < IDELEMS(v); i++) 34 34 { 35 35 if (v->m[i]!=NULL) … … 60 60 ideal I=(ideal)v->Data(); 61 61 BOOLEAN is_zero=TRUE; 62 for (int i=0; i < I ->idelems(); i++)62 for (int i=0; i < IDELEMS(I); i++) 63 63 { 64 64 if ((I->m[i]!=NULL)&& (pIsConstant(I->m[i]))) -
kernel/sca.cc
rda2fc8 r52cc7a4 7 7 * Author: motsak (Oleksandr Motsak) 8 8 * Created: 2006/12/18 9 * Version: $Id: sca.cc,v 1.2 7 2008-07-26 14:28:03 motsakExp $9 * Version: $Id: sca.cc,v 1.28 2008-08-18 12:25:35 Singular Exp $ 10 10 *******************************************************************/ 11 11 … … 2700 2700 assume( (iFirstAltVar >= 1) && (iLastAltVar <= r->N) && (iFirstAltVar <= iLastAltVar) ); 2701 2701 2702 const int iSize = id->idelems();2702 const int iSize = IDELEMS(id); 2703 2703 2704 2704 if (iSize == 0) return id; … … 2710 2710 { 2711 2711 Print("ideal id: \n"); 2712 for (int i = 0; i < id->idelems(); i++)2712 for (int i = 0; i < IDELEMS(id); i++) 2713 2713 { 2714 2714 Print("; id[%d] = ", i+1); … … 2730 2730 { 2731 2731 Print("ideal temp: \n"); 2732 for (int i = 0; i < temp->idelems(); i++)2732 for (int i = 0; i < IDELEMS(temp); i++) 2733 2733 { 2734 2734 Print("; temp[%d] = ", i+1); -
kernel/structs.h
rda2fc8 r52cc7a4 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: structs.h,v 1.5 4 2008-08-18 10:39:57Singular Exp $ */6 /* $Id: structs.h,v 1.55 2008-08-18 12:25:35 Singular Exp $ */ 7 7 /* 8 8 * ABSTRACT … … 697 697 int ncols; 698 698 #define IDELEMS(i) ((i)->ncols) 699 inline int& idelems(void) { return ncols; }700 699 }; 701 700 … … 771 770 772 771 #if defined(__cplusplus) 773 inline int si_max(const int a, const int b) { return (a>b) ? a : b; }774 inline int si_min(const int a, const int b) { return (a<b) ? a : b; }775 inline long si_max(const long a, const long b) { return (a>b) ? a : b; }776 inline long si_min(const long a, const long b) { return (a<b) ? a : b; }772 static inline int si_max(const int a, const int b) { return (a>b) ? a : b; } 773 static inline int si_min(const int a, const int b) { return (a<b) ? a : b; } 774 static inline long si_max(const long a, const long b) { return (a>b) ? a : b; } 775 static inline long si_min(const long a, const long b) { return (a<b) ? a : b; } 777 776 #else 778 777 #define si_max(A,B) ((A) > (B) ? (A) : (B)) -
kernel/tgb.cc
rda2fc8 r52cc7a4 5 5 * Computer Algebra System SINGULAR * 6 6 ****************************************/ 7 /* $Id: tgb.cc,v 1.15 7 2008-06-27 12:10:58 brickenExp $ */7 /* $Id: tgb.cc,v 1.158 2008-08-18 12:25:35 Singular Exp $ */ 8 8 /* 9 9 * ABSTRACT: slimgb and F4 implementation … … 2901 2901 current_degree=1; 2902 2902 2903 max_pairs=5*I ->idelems();2903 max_pairs=5*IDELEMS(I); 2904 2904 2905 2905 apairs=(sorted_pair_node**) omalloc(sizeof(sorted_pair_node*)*max_pairs); 2906 2906 pair_top=-1; 2907 2907 2908 int n=I ->idelems();2908 int n=IDELEMS(I); 2909 2909 array_lengths=n; 2910 2910 … … 2973 2973 add_to_basis_ideal_quotient(I->m[0],this,NULL); 2974 2974 2975 assume(strat->sl== strat->Shdl->idelems()-1);2975 assume(strat->sl==IDELEMS(strat->Shdl)-1); 2976 2976 if(!(F4_mode)) 2977 2977 { … … 3003 3003 add_to_basis_ideal_quotient(I->m[i],this,NULL); 3004 3004 } 3005 for(i=0;i<I ->idelems();i++)3005 for(i=0;i<IDELEMS(I);i++) 3006 3006 { 3007 3007 I->m[i]=NULL;
Note: See TracChangeset
for help on using the changeset viewer.