20 #include <unordered_map>
39 while (
feed_->hasNext())
44 auto result =
m_byID.find(oldID);
Definition: border_observer.h:29
void addFeed(adore::mad::AFeed< Border > *feed)
Definition: border_observer.h:64
void discard_radius_based(double x, double y, double z, double radius) override
discard data outside of radius
Definition: border_observer.h:54
BorderObserver()
Definition: border_observer.h:31
void update() override
Definition: border_observer.h:37
efficiently store borders in boost R-tree
Definition: borderset.h:99
void removeBorders(const BorderSubSet &subset)
remove all borders in the given set
Definition: borderset.h:593
BorderID2Border m_byID
Definition: borderset.h:109
void insert_border(Border *b, bool force_insert=false)
insert new border into this
Definition: borderset.h:225
void erase_border(const BorderID &oldID)
erase border from this
Definition: borderset.h:269
itRegion2Border getBordersOutsideRegion(double x0, double x1, double y0, double y1)
get all borders outside of region as iterator pair
Definition: borderset.h:464
Definition: com_patterns.h:29
Observer pattern to manage feed data in a storage class.
Definition: com_patterns.h:131
AFeed< Border > * feed_
Definition: com_patterns.h:133
x
Definition: adore_set_goal.py:30
y
Definition: adore_set_goal.py:31
z
Definition: adore_set_goal.py:32
Definition: areaofeffectconverter.h:20
This struct identifies a Border by the coordinates of the starting and the end point.
Definition: borderid.h:31
The border struct contains data of the smallest.
Definition: border.h:62