39 #define NAMED_RTREE_QUAL RTree<Named*, Named, float, 2, Named::StoringVisitor, float, 8, 4>
42 inline float NAMED_RTREE_QUAL::RectSphericalVolume(Rect* a_rect) {
44 const float extent0 = a_rect->m_max[0] - a_rect->m_min[0];
45 const float extent1 = a_rect->m_max[1] - a_rect->m_min[1];
46 return .78539816f * (extent0 * extent0 + extent1 * extent1);
50 inline NAMED_RTREE_QUAL::Rect NAMED_RTREE_QUAL::CombineRect(Rect* a_rectA, Rect* a_rectB) {
51 ASSERT(a_rectA && a_rectB);
53 newRect.m_min[0] =
rtree_min(a_rectA->m_min[0], a_rectB->m_min[0]);
54 newRect.m_max[0] =
rtree_max(a_rectA->m_max[0], a_rectB->m_max[0]);
55 newRect.m_min[1] =
rtree_min(a_rectA->m_min[1], a_rectB->m_min[1]);
56 newRect.m_max[1] =
rtree_max(a_rectA->m_max[1], a_rectB->m_max[1]);
70 class NamedRTree :
private RTree<Named*, Named, float, 2, Named::StoringVisitor > {
89 void Insert(
const float a_min[2],
const float a_max[2],
Named* a_data) {
100 void Remove(
const float a_min[2],
const float a_max[2],
Named* a_data) {
virtual void Insert(const ELEMTYPE a_min[NUMDIMS], const ELEMTYPE a_max[NUMDIMS], const DATATYPE &a_dataId)
void Remove(const float a_min[2], const float a_max[2], Named *a_data)
Remove entry.
void Insert(const float a_min[2], const float a_max[2], Named *a_data)
Insert entry.
virtual int Search(const ELEMTYPE a_min[NUMDIMS], const ELEMTYPE a_max[NUMDIMS], const CONTEXT &c) const
DK 15.10.2008 - begin.
A RT-tree for efficient storing of SUMO's Named objects.
void RemoveAll()
Remove all enrties.
virtual void Remove(const ELEMTYPE a_min[NUMDIMS], const ELEMTYPE a_max[NUMDIMS], const DATATYPE &a_dataId)
void RemoveAll()
DK 15.10.2008 - end.
Base class for objects which have an id.
Allows to store the object; used as context while traveling the rtree in TraCI.
int Search(const float a_min[2], const float a_max[2], const Named::StoringVisitor &c) const
Find all within search rectangle.