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 |
||
|---|---|---|
| .. | ||
| common | ||
| light | ||
| qbsp | ||
| vis | ||
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 |
||
|---|---|---|
| .. | ||
| common | ||
| light | ||
| qbsp | ||
| vis | ||