Changeset 056f98 in git
- Timestamp:
- Apr 12, 2001, 4:34:22 PM (22 years ago)
- Branches:
- (u'spielwiese', '828514cf6e480e4bafc26df99217bf2a1ed1ef45')
- Children:
- 97090ad53dca442139c9aae6aad469070d418aea
- Parents:
- 937cbcd9541714ba32c2fe91312690e65edf6f2f
- Location:
- IntegerProgramming
- Files:
-
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
IntegerProgramming/IP_algorithms.cc
r937cbcd r056f98 2427 2427 { 2428 2428 cerr<<"ERROR: int solve(INPUT_FILE, INPUT_FILE):\n" 2429 "cannot read from first input file , possibly not found"<<endl;2429 "cannot read from first input file "<< PROBLEM <<", possibly not found"<<endl; 2430 2430 return 0; 2431 2431 } … … 2434 2434 { 2435 2435 cerr<<"ERROR: int solve(INPUT_FILE, INPUT_FILE):\n" 2436 "cannot read from second input file , possibly not found"<<endl;2436 "cannot read from second input file "<< GROEBNER <<", possibly not found"<<endl; 2437 2437 return 0; 2438 2438 } -
IntegerProgramming/Makefile.in
r937cbcd r056f98 20 20 21 21 INSTALL = @INSTALL@ 22 INSTALL_PROGRAM = @INSTALL_PROGRAM@ 22 INSTALL_PROGRAM = @INSTALL_PROGRAM@ -s 23 23 MKINSTALLDIRS = ../mkinstalldirs 24 24 … … 83 83 $(OBJECTS1) 84 84 $(CXX) $^ -o $@ $(LDFLAGS) 85 strip $(MAIN1)86 85 87 86 $(MAIN2): term_ordering.o binomial.o list.o BigInt.o LLL.o matrix.o \ … … 90 89 $(OBJECTS2) 91 90 $(CXX) $^ -o $@ $(LDFLAGS) 92 strip $(MAIN2)93 91 94 92 $(MAIN3): term_ordering.o binomial.o list.o BigInt.o LLL.o matrix.o \ … … 97 95 $(OBJECTS3) 98 96 $(CXX) $^ -o $@ $(LDFLAGS) 99 strip $(MAIN3)100 97 101 98 $(MAIN4): term_ordering.o binomial.o list.o BigInt.o LLL.o matrix.o \ … … 104 101 $(OBJECTS4) 105 102 $(CXX) $^ -o $@ $(LDFLAGS) 106 strip $(MAIN4)107 103 108 104 $(LLL): $(OBJECTS_LLL) 109 105 $(CXX) $^ -o $@ $(LDFLAGS) 110 strip $(LLL)111 106 112 107 Makefile: Makefile.in -
IntegerProgramming/matrix.cc
r937cbcd r056f98 552 552 r=columns-r; 553 553 F=new short[r]; 554 memset(F,0,r*sizeof(short)); 554 555 short counter=0; 555 556 for(short j=0;j<columns;j++) … … 565 566 { 566 567 F=new short[r]; 568 memset(F,0,r*sizeof(short)); 567 569 short counter=0; 568 570 for(short j=0;j<columns;j++) … … 608 610 short number_of_sat_var=0; 609 611 sat_var=new short[columns/2]; 612 memset(sat_var,0,sizeof(short)*(columns/2)); 610 613 611 614 BOOLEAN* ideal_saturated_by_var=new BOOLEAN[columns]; -
IntegerProgramming/solve_IP.cc
r937cbcd r056f98 249 249 250 250 char* GROEBNER=new char[128]; 251 memset(GROEBNER,0,128); 251 252 short i=0; 252 while(argv[argc-2][i]!='\0' && argv[argc-2][i]!='.' )253 while(argv[argc-2][i]!='\0' && argv[argc-2][i]!='.' && argv[argc-2][i]>' ') 253 254 { 254 255 GROEBNER[i]=argv[argc-2][i]; -
IntegerProgramming/term_ordering.cc
r937cbcd r056f98 257 257 258 258 if(weight_vector[i]<0) 259 { 260 cout << "neg found at i="<<i<<":" <<weight_vector[i] <<"\n"; 259 261 negative_weight=TRUE; 262 } 260 263 if(weight_vector[i]==0) 261 264 zero_weight=TRUE;
Note: See TracChangeset
for help on using the changeset viewer.