21#ifndef __ANTARES_TOOLBOX_MAP_BINDING_CONSTRAINT_H__
22#define __ANTARES_TOOLBOX_MAP_BINDING_CONSTRAINT_H__
50 return tyBindingConstraint;
55 virtual bool selected()
const
59 virtual void selected(
bool v);
75 virtual bool contains(
const int,
const int,
double& )
85 virtual bool isContained(
const int,
const int,
const int,
const int)
const
108 return pConnections.empty();
112 return (uint)pConnections.size();
115 void add(
Item* item);
117 bool remove(
Item* item);
123 Infos() : weight(1.), selected(false)
126 Infos(
const Infos& c) : weight(c.weight), selected(false)
133 using Connections = std::map<Connection*, Infos>;
134 Connections pConnections;
138 TextPart() : text(), color(0, 0, 0), size(0, 0)
141 TextPart(
const wxString& s,
const int r,
const int g,
const int b) : text(s), color(r, g, b)
148 void refreshCache(wxDC& dc);
151 std::vector<TextPart> pTextParts;
Definition bindingconstraint.h:31
virtual void extendBoundingBox(wxPoint &, wxPoint &)
Extends the bounding box.
Definition bindingconstraint.h:100
virtual void refreshCache(wxDC &dc)
Refresh the cache (even if not invalidated)
Definition bindingconstraint.cpp:125
virtual ~BindingConstraint()
Destructor.
Definition bindingconstraint.cpp:34
virtual Type type() const
Type.
Definition bindingconstraint.h:48
virtual bool isContained(const int, const int, const int, const int) const
Get if the drawing representation of the node is contained inside a bounding box.
Definition bindingconstraint.h:85
virtual void draw(DrawingContext &dc)
Draw the node.
Definition bindingconstraint.cpp:44
virtual bool contains(const int, const int, double &)
Get if the drawing representation of the node contains the point (x,y)
Definition bindingconstraint.h:75
Drawing Context.
Definition drawingcontext.h:43
Manager & manager()
Get the manager.
Definition item.h:91
bool pSelected
Selected.
Definition item.h:267
Item(Manager &manager, const int zPos=0)
Constructor.
Definition item.cpp:30
A convenient container for nodes on the graph.
Definition manager.h:46