Searched refs:WhatSector (Results 1 – 9 of 9) sorted by relevance
465 int sec = LineDefs[lines[0]]->WhatSector(sides[0]); in SameSector()469 if (sec != LineDefs[lines[k]]->WhatSector(sides[k])) in SameSector()505 int sec = LineDefs[lines[i]]->WhatSector(- sides[i]); in NeighboringSector()547 return LineDefs[opp_ld]->WhatSector(opp_side); in IslandSector()561 int sec = LineDefs[lines[k]]->WhatSector(sides[k]); in DetermineSector()597 int sec = LineDefs[lines[k]]->WhatSector(sides[k]); in GetAllSectors()1241 if (L->WhatSector(SIDE_LEFT ) >= 0) unused.clear(L->WhatSector(SIDE_LEFT )); in AssignSectorToSpace()1242 if (L->WhatSector(SIDE_RIGHT) >= 0) unused.clear(L->WhatSector(SIDE_RIGHT)); in AssignSectorToSpace()
513 int sec_num = L->WhatSector(side); in PlaneAlignPart()514 const Sector *front = Sectors[L->WhatSector(side)]; in PlaneAlignPart()515 const Sector *back = Sectors[L->WhatSector(-side)]; in PlaneAlignPart()759 if (L->WhatSector(SIDE_LEFT) == L->WhatSector(SIDE_RIGHT)) in R_SubdivideSector()785 bool is_right = (L->WhatSector(SIDE_RIGHT) == num); in R_SubdivideSector()
989 if (L->WhatSector(SIDE_LEFT ) >= 0) result->set(L->WhatSector(SIDE_LEFT )); in DuddedSectors()990 if (L->WhatSector(SIDE_RIGHT) >= 0) result->set(L->WhatSector(SIDE_RIGHT)); in DuddedSectors()1008 int sec_num = L->WhatSector(what_side); in DuddedSectors()1030 if (L2->WhatSector(opp_side) == sec_num) in DuddedSectors()
117 bool same_left = (L2->WhatSector(SIDE_LEFT) == L1->WhatSector(SIDE_LEFT)); in MergeSandwichLines()118 bool same_right = (L2->WhatSector(SIDE_RIGHT) == L1->WhatSector(SIDE_RIGHT)); in MergeSandwichLines()
577 int sec1 = L->WhatSector(SIDE_RIGHT); in CalcPropagation()578 int sec2 = L->WhatSector(SIDE_LEFT); in CalcPropagation()
365 int WhatSector(int side) const;
255 int LineDef::WhatSector(int side) const in WhatSector() function in LineDef
620 return LineDefs[opp]->WhatSector(opp_side); in OppositeSector()
241 if (L->TwoSided() && (L->WhatSector(SIDE_LEFT) == L->WhatSector(SIDE_RIGHT))) in Vertex_FindDanglers()