712   bool lookUp(int fan1, int cone1, int fan2, int cone2)  in lookUp()  argument
716     assert(cone1<table[fan1][fan2].size());  in lookUp()
717     assert(cone2<table[fan1][fan2][cone1].size());  in lookUp()
719     return table[fan1][fan2][cone1][cone2];  in lookUp()
721   void set(int fan1, int cone1, int fan2, int cone2)  in set()  argument
725     assert(cone1<table[fan1][fan2].size());  in set()
726     assert(cone2<table[fan1][fan2][cone1].size());  in set()
728     table[fan1][fan2][cone1][cone2]=true;  in set()
729     table[fan2][fan1][cone2][cone1]=true;  in set()
731   BitSet const& nonCandidates(int fan1, int cone1, int fan2)const  in nonCandidates()  argument
735     assert(cone1<table[fan1][fan2].size());  in nonCandidates()
737     return table[fan1][fan2][cone1];  in nonCandidates()
767   bool intersectTriviallyInIntersection(int fan1, int cone1, int fan2, int cone2)  in intersectTriviallyInIntersection()  argument
771     assert(cone1<fanList[fan1].size());  in intersectTriviallyInIntersection()
774     if(knownEmptyIntersectionInIntersection.lookUp(fan1,cone1,fan2,cone2))  in intersectTriviallyInIntersection()
776     if(knownNonEmptyIntersection.lookUp(fan1,cone1,fan2,cone2))  in intersectTriviallyInIntersection()
780     bool ret=haveEmptyIntersection(fanList[fan1][cone1],fanList[fan2][cone2]);  in intersectTriviallyInIntersection()
783       knownEmptyIntersectionInIntersection.set(fan1,cone1,fan2,cone2);  in intersectTriviallyInIntersection()
785       knownNonEmptyIntersection.set(fan1,cone1,fan2,cone2);  in intersectTriviallyInIntersection()
788   const BitSet &getNonCandidates(int fan1, int cone1, int fan2)  in getNonCandidates()  argument
791       intersectTriviallyInIntersection(fan1,cone1,fan2,c2);      in getNonCandidates()
793     return knownEmptyIntersectionInIntersection.nonCandidates(fan1,cone1,fan2);  in getNonCandidates()
795   void markNoIntersectionInIntersection(int fan1, int cone1, int fan2, int cone2)  in markNoIntersectionInIntersection()  argument
797     knownEmptyIntersectionInIntersection.set(fan1,cone1,fan2,cone2);  in markNoIntersectionInIntersection()