Changeset 19addd1 in git for gfanlib/gfanlib_zcone.cpp
- Timestamp:
- Oct 25, 2013, 6:22:01 PM (10 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 69b2c1754cbeecd7c1b844e71e2101e1b3794062
- Parents:
- b7b2c516034df879b01c7c8666bbdf0928da91dc
- git-author:
- Yue Ren <ren@mathematik.uni-kl.de>2013-10-25 18:22:01+02:00
- git-committer:
- Yue Ren <ren@mathematik.uni-kl.de>2013-10-25 18:25:28+02:00
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
gfanlib/gfanlib_zcone.cpp
rb7b2c5 r19addd1 44 44 dd_colrange d_input,j; 45 45 dd_RepresentationType rep=dd_Inequality; 46 dd_boolean found=dd_FALSE, newformat=dd_FALSE, successful=dd_FALSE;47 char command[dd_linelenmax], comsave[dd_linelenmax];46 // dd_boolean found=dd_FALSE, newformat=dd_FALSE, successful=dd_FALSE; 47 // char command[dd_linelenmax], comsave[dd_linelenmax]; 48 48 dd_NumberType NT; 49 49 50 50 (*Error)=dd_NoError; 51 51 52 rep=dd_Inequality; newformat=dd_TRUE;52 rep=dd_Inequality; // newformat=dd_TRUE; 53 53 54 54 m_input=g.getHeight(); … … 70 70 } 71 71 72 successful=dd_TRUE;72 // successful=dd_TRUE; 73 73 74 74 return M; … … 108 108 { 109 109 bool ret; 110 dd_MatrixPtr M=NULL ,M2=NULL,M3=NULL;111 dd_colrange d;110 dd_MatrixPtr M=NULL/*,M2=NULL,M3=NULL*/; 111 // dd_colrange d; 112 112 dd_ErrorType err=dd_NoError; 113 dd_rowset redrows,linrows,ignoredrows, basisrows;114 dd_colset ignoredcols, basiscols;115 dd_DataFileType inputfile;116 FILE *reading=NULL;113 // dd_rowset redrows,linrows,ignoredrows, basisrows; 114 // dd_colset ignoredcols, basiscols; 115 // dd_DataFileType inputfile; 116 // FILE *reading=NULL; 117 117 118 118 cddinitGmp(); … … 121 121 if (err!=dd_NoError) goto _L99; 122 122 123 d=M->colsize;123 // d=M->colsize; 124 124 125 125 static dd_Arow temp; … … 339 339 if(numberOfRows==0)return;//the full space, so description is already irredundant 340 340 341 dd_rowset r=NULL;341 // dd_rowset r=NULL; 342 342 ZMatrix g=inequalities; 343 343 g.append(equations); 344 344 345 dd_LPSolverType solver=dd_DualSimplex;345 // dd_LPSolverType solver=dd_DualSimplex; 346 346 dd_MatrixPtr A=NULL; 347 347 dd_ErrorType err=dd_NoError; … … 402 402 int numberOfRows=numberOfEqualities+numberOfInequalities; 403 403 404 dd_rowset r=NULL;404 // dd_rowset r=NULL; 405 405 ZMatrix g=inequalities; 406 406 g.append(equations); … … 448 448 void dual(ZMatrix const &inequalities, ZMatrix const &equations, ZMatrix &dualInequalities, ZMatrix &dualEquations) 449 449 { 450 int result;450 // int result; 451 451 452 452 dd_MatrixPtr A=NULL; … … 472 472 473 473 return; 474 _L99:475 assert(0);474 // _L99: 475 // assert(0); 476 476 } 477 477 // this procedure is take from cddio.c. … … 556 556 int dim2=inequalities.getHeight(); 557 557 if(dim2==0)return std::vector<std::vector<int> >(); 558 int dimension=inequalities.getWidth();558 // int dimension=inequalities.getWidth(); 559 559 560 560 dd_MatrixPtr A=NULL; … … 603 603 604 604 return ret; 605 _L99:606 assert(0);607 return std::vector<std::vector<int> >();605 // _L99: 606 // assert(0); 607 // return std::vector<std::vector<int> >(); 608 608 } 609 609 … … 707 707 inequalities=LpSolver::fastNormals(inequalities2); 708 708 goto noFallBack; 709 fallBack://alternativ (disabled)710 lpSolver.removeRedundantRows(inequalities,equations,true);709 // fallBack://alternativ (disabled) 710 // lpSolver.removeRedundantRows(inequalities,equations,true); 711 711 noFallBack:; 712 712 } … … 730 730 } 731 731 732 std::ostream &operator<<(std::ostream &f, ZCone const &c)732 void operator<<(std::ostream &f, ZCone const &c) 733 733 { 734 734 f<<"Ambient dimension:"<<c.n<<std::endl; … … 741 741 742 742 ZCone::ZCone(int ambientDimension): 743 preassumptions(PCP_impliedEquationsKnown|PCP_facetsKnown), 744 state(1), 745 n(ambientDimension), 746 multiplicity(1), 747 linearForms(ZMatrix(0,ambientDimension)), 743 748 inequalities(ZMatrix(0,ambientDimension)), 744 749 equations(ZMatrix(0,ambientDimension)), 745 n(ambientDimension), 746 state(1), 747 preassumptions(PCP_impliedEquationsKnown|PCP_facetsKnown), 750 haveExtremeRaysBeenCached(false) 751 { 752 } 753 754 755 ZCone::ZCone(ZMatrix const &inequalities_, ZMatrix const &equations_, int preassumptions_): 756 preassumptions(preassumptions_), 757 state(0), 758 n(inequalities_.getWidth()), 748 759 multiplicity(1), 749 haveExtremeRaysBeenCached(false), 750 linearForms(ZMatrix(0,ambientDimension)) 751 { 752 } 753 754 755 ZCone::ZCone(ZMatrix const &inequalities_, ZMatrix const &equations_, int preassumptions_): 760 linearForms(ZMatrix(0,inequalities_.getWidth())), 756 761 inequalities(inequalities_), 757 762 equations(equations_), 758 state(0), 759 preassumptions(preassumptions_), 760 multiplicity(1), 761 haveExtremeRaysBeenCached(false), 762 n(inequalities_.getWidth()), 763 linearForms(ZMatrix(0,inequalities_.getWidth())) 763 haveExtremeRaysBeenCached(false) 764 764 { 765 765 assert(preassumptions_<4);//OTHERWISE WE ARE DOING SOMETHING STUPID LIKE SPECIFYING AMBIENT DIMENSION … … 1042 1042 std::vector<std::vector<int> > indices=lpSolver.extremeRaysInequalityIndices(inequalities); 1043 1043 1044 for( inti=0;i<indices.size();i++)1044 for(unsigned i=0;i<indices.size();i++) 1045 1045 { 1046 1046 /* At this point we know lineality space, implied equations and … … 1082 1082 1083 1083 std::vector<int> asVector(inequalities.getHeight()); 1084 for( intj=0;j<indices[i].size();j++){asVector[indices[i][j]]=1;}1084 for(unsigned j=0;j<indices[i].size();j++){asVector[indices[i][j]]=1;} 1085 1085 ZMatrix equations=this->equations; 1086 1086 ZVector theInequality; 1087 1087 1088 for( intj=0;j<asVector.size();j++)1088 for(unsigned j=0;j<asVector.size();j++) 1089 1089 if(asVector[j]) 1090 1090 equations.appendRow(inequalities[j]); … … 1229 1229 ZCone ZCone::faceContaining(ZVector const &v)const 1230 1230 { 1231 assert(n== v.size());1231 assert(n==(int)v.size()); 1232 1232 assert(contains(v)); 1233 1233 ZMatrix newEquations=equations;
Note: See TracChangeset
for help on using the changeset viewer.