Searched refs:chosenFans (Results 1 – 8 of 8) sorted by relevance
| /dports/math/gfan/gfan0.6.2/src/ |
| H A D | halfopencone.backup.cpp | 813 IntegerVector chosenFans; member
825 chosenFans(fans_.size()), in RecursionData()
883 chosenFans[index]=bestIndex; in rek()
884 usedFans[chosenFans[index]]=true; in rek()
894 P.printVector(chosenFans,false,2); in rek()
932 for(int i=0;i<fans[chosenFans[index]].size();i++) in rek()
938 if(table.intersectTriviallyInIntersection(chosenFans[j],chosen[j],chosenFans[index],i)) in rek()
944 if(ok && !haveEmptyIntersection(current,fans[chosenFans[index]][i])) in rek()
948 HalfOpenCone next=intersection(current,fans[chosenFans[index]][i],false); in rek()
1001 usedFans[chosenFans[index]]=false; in rek()
[all …]
|
| H A D | halfopencone.cpp | 1178 IntegerVector chosenFans; member
1193 chosenFans(fans_.size()), in RecursionData()
1301 processor.process(current,chosenFans,chosen); in rek()
1333 chosenFans[index]=bestIndex; in rek()
1334 usedFans[chosenFans[index]]=true; in rek()
1346 P.printVector(chosenFans,false,2); in rek()
1384 for(int i=0;i<fans[chosenFans[index]].size();i++) in rek()
1398 if(table.intersectTriviallyInIntersection(chosenFans[j],chosen[j],chosenFans[index],i)) in rek()
1484 usedFans[chosenFans[index]]=false; in rek()
1486 chosenFans[index]=-1; in rek()
[all …]
|
| H A D | halfopencone.h | 64 …virtual void process(HalfOpenCone const &c, IntegerVector const &chosenFans, IntegerVector const &…
|
| H A D | app_tropicalintersection.cpp | 62 …void process(HalfOpenCone const &c, IntegerVector const &chosenFans, IntegerVector const &chosenCo… in process() argument
|
| /dports/math/gfanlib/gfan0.6.2/src/ |
| H A D | halfopencone.backup.cpp | 813 IntegerVector chosenFans; member
825 chosenFans(fans_.size()), in RecursionData()
883 chosenFans[index]=bestIndex; in rek()
884 usedFans[chosenFans[index]]=true; in rek()
894 P.printVector(chosenFans,false,2); in rek()
932 for(int i=0;i<fans[chosenFans[index]].size();i++) in rek()
938 if(table.intersectTriviallyInIntersection(chosenFans[j],chosen[j],chosenFans[index],i)) in rek()
944 if(ok && !haveEmptyIntersection(current,fans[chosenFans[index]][i])) in rek()
948 HalfOpenCone next=intersection(current,fans[chosenFans[index]][i],false); in rek()
1001 usedFans[chosenFans[index]]=false; in rek()
[all …]
|
| H A D | halfopencone.cpp | 1178 IntegerVector chosenFans; member
1193 chosenFans(fans_.size()), in RecursionData()
1301 processor.process(current,chosenFans,chosen); in rek()
1333 chosenFans[index]=bestIndex; in rek()
1334 usedFans[chosenFans[index]]=true; in rek()
1346 P.printVector(chosenFans,false,2); in rek()
1384 for(int i=0;i<fans[chosenFans[index]].size();i++) in rek()
1398 if(table.intersectTriviallyInIntersection(chosenFans[j],chosen[j],chosenFans[index],i)) in rek()
1484 usedFans[chosenFans[index]]=false; in rek()
1486 chosenFans[index]=-1; in rek()
[all …]
|
| H A D | halfopencone.h | 64 …virtual void process(HalfOpenCone const &c, IntegerVector const &chosenFans, IntegerVector const &…
|
| H A D | app_tropicalintersection.cpp | 62 …void process(HalfOpenCone const &c, IntegerVector const &chosenFans, IntegerVector const &chosenCo… in process() argument
|