34 #define NAMED_RTREE_QUAL RTree<Named*, Named, float, 2, Named::StoringVisitor> 37 inline float NAMED_RTREE_QUAL::RectSphericalVolume(Rect* a_rect) {
39 const float extent0 = a_rect->m_max[0] - a_rect->m_min[0];
40 const float extent1 = a_rect->m_max[1] - a_rect->m_min[1];
41 return .78539816f * (extent0 * extent0 + extent1 * extent1);
45 inline NAMED_RTREE_QUAL::Rect NAMED_RTREE_QUAL::CombineRect(Rect* a_rectA, Rect* a_rectB) {
46 ASSERT(a_rectA && a_rectB);
48 newRect.m_min[0] =
rtree_min(a_rectA->m_min[0], a_rectB->m_min[0]);
49 newRect.m_max[0] =
rtree_max(a_rectA->m_max[0], a_rectB->m_max[0]);
50 newRect.m_min[1] =
rtree_min(a_rectA->m_min[1], a_rectB->m_min[1]);
51 newRect.m_max[1] =
rtree_max(a_rectA->m_max[1], a_rectB->m_max[1]);
83 void Insert(
const float a_min[2],
const float a_max[2],
Named*
const& a_data) {
84 NAMED_RTREE_QUAL::Insert(a_min, a_max, a_data);
94 void Remove(
const float a_min[2],
const float a_max[2],
Named*
const& a_data) {
95 NAMED_RTREE_QUAL::Remove(a_min, a_max, a_data);
103 NAMED_RTREE_QUAL::RemoveAll();
117 return NAMED_RTREE_QUAL::Search(a_min, a_max, c);
void Insert(const float a_min[2], const float a_max[2], Named *const &a_data)
Insert entry.
A RT-tree for efficient storing of SUMO's Named objects.
void RemoveAll()
Remove all enrties.
void Remove(const float a_min[2], const float a_max[2], Named *const &a_data)
Remove entry.
int Search(const float a_min[2], const float a_max[2], const Named::StoringVisitor &c) const
Find all within search rectangle.
Base class for objects which have an id.
Allows to store the object; used as context while traveling the rtree in TraCI.