mirror of
https://github.com/DrBeef/Raze.git
synced 2024-12-24 03:20:49 +00:00
120 lines
3.7 KiB
C++
120 lines
3.7 KiB
C++
//-------------------------------------------------------------------------
|
|
/*
|
|
Copyright (C) 2022 Christoph Oelckers
|
|
|
|
This is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU General Public License
|
|
as published by the Free Software Foundation; either version 2
|
|
of the License, or (at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
|
See the GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
|
|
*/
|
|
//-------------------------------------------------------------------------
|
|
//
|
|
// updatesector utilities. Uses a breadth-first algorithm similar
|
|
// but not identical to EDuke32's updatesectorneighbor.
|
|
|
|
|
|
// checker functions for updatesector's template parameter.
|
|
inline int inside0(double x, double y, double z, const sectortype* sect)
|
|
{
|
|
return inside(x, y, sect);
|
|
}
|
|
|
|
inline int insideZ(double x, double y, double z, const sectortype* sect)
|
|
{
|
|
double cz, fz;
|
|
getzsofslopeptr(sect, x, y, &cz, &fz);
|
|
return (z >= cz && z <= fz && inside(x, y, sect) != 0);
|
|
}
|
|
|
|
template<class Inside>
|
|
void DoUpdateSector(double x, double y, double z, int* sectnum, double maxDistance, Inside checker)
|
|
{
|
|
double maxDistSq = maxDistance * maxDistance;
|
|
|
|
if (validSectorIndex(*sectnum))
|
|
{
|
|
if (checker(x, y, z, §or[*sectnum]))
|
|
return;
|
|
|
|
BFSSearch search(sector.Size(), *sectnum);
|
|
|
|
int iter = 0;
|
|
for (unsigned listsectnum; (listsectnum = search.GetNext()) != BFSSearch::EOL;)
|
|
{
|
|
auto lsect = §or[listsectnum];
|
|
if (checker(x, y, z, lsect))
|
|
{
|
|
*sectnum = listsectnum;
|
|
return;
|
|
}
|
|
|
|
for (auto& wal : wallsofsector(lsect))
|
|
{
|
|
if (wal.nextsector >= 0 && !search.Check(wal.nextsector) && (iter == 0 || SquareDistToSector(x, y, wal.nextSector()) <= maxDistSq))
|
|
search.Add(wal.nextsector);
|
|
}
|
|
iter++;
|
|
}
|
|
}
|
|
|
|
for (int i = (int)sector.Size() - 1; i >= 0; i--)
|
|
if (checker(x, y, z, §or[i]))
|
|
{
|
|
*sectnum = i;
|
|
return;
|
|
}
|
|
*sectnum = -1;
|
|
}
|
|
|
|
|
|
constexpr int MAXUPDATESECTORDIST = 96;
|
|
|
|
inline void updatesector(const DVector3& pos, sectortype** const sectp)
|
|
{
|
|
int sectno = *sectp ? sector.IndexOf(*sectp) : -1;
|
|
DoUpdateSector(pos.X, pos.Y, pos.Z, §no, MAXUPDATESECTORDIST, inside0);
|
|
*sectp = sectno == -1 ? nullptr : §or[sectno];
|
|
}
|
|
|
|
inline void updatesector(const DVector2& pos, sectortype** const sectp)
|
|
{
|
|
int sectno = *sectp ? sector.IndexOf(*sectp) : -1;
|
|
DoUpdateSector(pos.X, pos.Y, 0, §no, MAXUPDATESECTORDIST, inside0);
|
|
*sectp = sectno == -1 ? nullptr : §or[sectno];
|
|
}
|
|
|
|
|
|
inline void updatesectorz(const DVector3& pos, sectortype** const sectp)
|
|
{
|
|
int sectno = *sectp ? sector.IndexOf(*sectp) : -1;
|
|
DoUpdateSector(pos.X, pos.Y, pos.Z, §no, MAXUPDATESECTORDIST, insideZ);
|
|
*sectp = sectno == -1 ? nullptr : §or[sectno];
|
|
}
|
|
|
|
inline void updatesectorneighbor(const DVector3& pos, sectortype** const sect, double maxDistance = MAXUPDATESECTORDIST)
|
|
{
|
|
int sectno = *sect? sector.IndexOf(*sect) : -1;
|
|
DoUpdateSector(pos.X, pos.Y, 0, §no, maxDistance, inside0);
|
|
*sect = sectno < 0? nullptr : §or[sectno];
|
|
}
|
|
|
|
[[deprecated]]
|
|
inline void updatesector(int x_, int y_, int* sectnum)
|
|
{
|
|
double x = x_ * inttoworld;
|
|
double y = y_ * inttoworld;
|
|
|
|
DoUpdateSector(x, y, 0, sectnum, MAXUPDATESECTORDIST, inside0);
|
|
}
|
|
|