| … | |
… | |
| 120 | los [LOS_X0 + (half_x + 1)][dy + LOS_Y0].flags = FLG_QUEUED; |
120 | los [LOS_X0 + (half_x + 1)][dy + LOS_Y0].flags = FLG_QUEUED; |
| 121 | |
121 | |
| 122 | // now reset the los area and also add blocked flags |
122 | // now reset the los area and also add blocked flags |
| 123 | // which supposedly is faster than doing it inside the |
123 | // which supposedly is faster than doing it inside the |
| 124 | // spiral path algorithm below, except when very little |
124 | // spiral path algorithm below, except when very little |
| 125 | // area is visible, in which case it is slower, evening |
125 | // area is visible, in which case it is slower. which evens |
| 126 | // out los calculation times between large and small los maps. |
126 | // out los calculation times between large and small los maps. |
| 127 | // apply_lights also iterates over this area, maybe these |
127 | // apply_lights also iterates over this area, maybe these |
| 128 | // two passes could be combined somehow. |
128 | // two passes could be combined somehow. |
| 129 | unordered_mapwalk (pl->observe, -half_x, -half_y, half_x, half_y) |
129 | unordered_mapwalk (pl->observe, -half_x, -half_y, half_x, half_y) |
| 130 | { |
130 | { |
