just store as a std::vector of pairs. Lookups aren't done much in qbsp so linear search performance should be fine. epair_order approach gets messy because we sometimes add epairs |
||
|---|---|---|
| .. | ||
| brush.hh | ||
| csg4.hh | ||
| file.hh | ||
| map.hh | ||
| merge.hh | ||
| outside.hh | ||
| portals.hh | ||
| qbsp.hh | ||
| region.hh | ||
| solidbsp.hh | ||
| surfaces.hh | ||
| tjunc.hh | ||
| wad.hh | ||
| winding.hh | ||
| writebsp.hh | ||