/usr/include/libwildmagic/Wm5BoxManager.h is in libwildmagic-dev 5.13-1+b2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 | // Geometric Tools, LLC
// Copyright (c) 1998-2014
// Distributed under the Boost Software License, Version 1.0.
// http://www.boost.org/LICENSE_1_0.txt
// http://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
//
// File Version: 5.0.1 (2010/10/01)
#ifndef WM5BOXMANAGER_H
#define WM5BOXMANAGER_H
#include "Wm5PhysicsLIB.h"
#include "Wm5AxisAlignedBox3.h"
#include "Wm5EdgeKey.h"
namespace Wm5
{
template <typename Real>
class WM5_PHYSICS_ITEM BoxManager
{
public:
// Construction and destruction.
explicit BoxManager (std::vector<AxisAlignedBox3<Real> >& boxes);
~BoxManager ();
// This function is called by the constructor and does the sort-and-sweep
// to initialize the update system. However, if you add or remove items
// from the array of boxes after the constructor call, you will need
// to call this function once before you start the multiple calls of the
// update function.
void Initialize ();
// After the system is initialized, you can move the boxes using this
// function. It is not enough to modify the input array of boxes
// since the endpoint values stored internally by this class must also
// change. You can also retrieve the current rectangles information.
void SetBox (int i, const AxisAlignedBox3<Real>& box);
void GetBox (int i, AxisAlignedBox3<Real>& box) const;
// When you are finished moving boxes, call this function to determine
// the overlapping boxes. An incremental update is applied to determine
// the new set of overlapping boxes.
void Update ();
// If (i,j) is in the overlap set, then box i and box j are
// overlapping. The indices are those for the the input array. The
// set elements (i,j) are stored so that i < j.
const std::set<EdgeKey>& GetOverlap () const;
private:
class Endpoint
{
public:
Real Value; // endpoint value
int Type; // '0' if interval min, '1' if interval max.
int Index; // index of interval containing this endpoint
// Support for sorting of endpoints.
bool operator< (const Endpoint& endpoint) const;
};
void InsertionSort (std::vector<Endpoint>& endPoint,
std::vector<int>& lookup);
std::vector<AxisAlignedBox3<Real> >* mBoxes;
std::vector<Endpoint> mXEndpoints, mYEndpoints, mZEndpoints;
std::set<EdgeKey> mOverlap;
// The intervals are indexed 0 <= i < n. The endpoint array has 2*n
// entries. The original 2*n interval values are ordered as b[0], e[0],
// b[1], e[1], ..., b[n-1], e[n-1]. When the endpoint array is sorted,
// the mapping between interval values and endpoints is lost. In order
// to modify interval values that are stored in the endpoint array, we
// need to maintain the mapping. This is done by the following lookup
// table of 2*n entries. The value mLookup[2*i] is the index of b[i]
// in the endpoint array. The value mLookup[2*i+1] is the index of
// e[i] in the endpoint array.
std::vector<int> mXLookup, mYLookup, mZLookup;
};
typedef BoxManager<float> BoxManagerf;
typedef BoxManager<double> BoxManagerd;
}
#endif
|