52 bool relevantUpdateFound =
false;
53 while (
feed_->hasNext())
70 relevantUpdateFound =
true;
Definition: border_observer.h:29
efficiently store borders in boost R-tree
Definition: borderset.h:99
void insert_border(Border *b, bool force_insert=false)
insert new border into this
Definition: borderset.h:225
bool hasBorder(const BorderID &id) const
check whether a border exists in the set
Definition: borderset.h:966
void erase_border(const BorderID &oldID)
erase border from this
Definition: borderset.h:269
Definition: navigation_border_observer.h:29
bool m_changedBordersDuringLastUpdate
Definition: navigation_border_observer.h:31
void init(BorderSet *set)
Definition: navigation_border_observer.h:40
bool navigationReplanningNecessary()
Definition: navigation_border_observer.h:82
bool m_finishedUpdating
Definition: navigation_border_observer.h:32
NavigationBorderObserver()
Definition: navigation_border_observer.h:35
virtual void update() override
Definition: navigation_border_observer.h:50
AFeed< Border > * feed_
Definition: com_patterns.h:133
#define LOG_T(...)
log on trace level
Definition: csvlog.h:28
void set(T *data, T value, int size)
Definition: adoremath.h:39
Definition: areaofeffectconverter.h:20
This struct identifies a Border by the coordinates of the starting and the end point.
Definition: borderid.h:31
std::string toString() const
Write information of the BorderID to a string.
Definition: borderid.h:131
The border struct contains data of the smallest.
Definition: border.h:62
BorderType::TYPE m_type
Definition: border.h:71
BorderID m_id
Definition: border.h:68
bool typeIsChangeable()
Check whether type is Changeable.
Definition: border.h:278