BoundsTrack.h (2854B)
1 /* 2 =========================================================================== 3 4 Doom 3 BFG Edition GPL Source Code 5 Copyright (C) 1993-2012 id Software LLC, a ZeniMax Media company. 6 7 This file is part of the Doom 3 BFG Edition GPL Source Code ("Doom 3 BFG Edition Source Code"). 8 9 Doom 3 BFG Edition Source Code is free software: you can redistribute it and/or modify 10 it under the terms of the GNU General Public License as published by 11 the Free Software Foundation, either version 3 of the License, or 12 (at your option) any later version. 13 14 Doom 3 BFG Edition Source Code is distributed in the hope that it will be useful, 15 but WITHOUT ANY WARRANTY; without even the implied warranty of 16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 GNU General Public License for more details. 18 19 You should have received a copy of the GNU General Public License 20 along with Doom 3 BFG Edition Source Code. If not, see <http://www.gnu.org/licenses/>. 21 22 In addition, the Doom 3 BFG Edition Source Code is also subject to certain additional terms. You should have received a copy of these additional terms immediately following the terms and conditions of the GNU General Public License which accompanied the Doom 3 BFG Edition Source Code. If not, please request a copy in writing from id Software at the address below. 23 24 If you have questions concerning this license or the applicable additional terms, you may contact in writing id Software LLC, c/o ZeniMax Media Inc., Suite 120, Rockville, Maryland 20850 USA. 25 26 =========================================================================== 27 */ 28 29 #ifndef __BOUNDSTRACK_H__ 30 #define __BOUNDSTRACK_H__ 31 32 33 struct shortBounds_t; 34 35 class idBoundsTrack { 36 public: 37 idBoundsTrack(); 38 ~idBoundsTrack(); 39 40 void ClearAll(); 41 42 // more than this will thrash a 32k L1 data cache 43 static const int MAX_BOUNDS_TRACK_INDEXES = 2048; 44 45 // the bounds will be clamped and rounded to short integers 46 void SetIndex( const int index, const idBounds & bounds ); 47 48 // an index that has been cleared will never be returned by FindIntersections() 49 void ClearIndex( const int index ); 50 51 // returns the number of indexes filled in intersectedIndexes[] 52 // 53 // The intersections may include some bounds that are not truly overlapping 54 // due to the rounding from float to short integers. 55 int FindIntersections( const idBounds & testBounds, int intersectedIndexes[ MAX_BOUNDS_TRACK_INDEXES ] ) const; 56 57 // validate implementation 58 void Test(); 59 60 private: 61 // All elements that haven't had SetIndex() called since ClearAll() will be 62 // in the cleared state, so they can safely be compared against by an 63 // unwound loop. 64 shortBounds_t *boundsList; // [MAX_BOUNDS_TRACK_INDEXES] 65 66 // set to 0 at ClearAll(), maintained greater than the highest index passed 67 // to SetIndex() since ClearAll(). 68 int maxIndex; 69 }; 70 71 72 #endif // __BOUNDSTRACK_H__