1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
|
/*
* A class for handling shape interaction with libavoid.
*
* Authors:
* Michael Wybrow <mjwybrow@users.sourceforge.net>
*
* Copyright (C) 2005 Michael Wybrow
*
* Released under GNU GPL, read the file 'COPYING' for more information
*/
#include <cstring>
#include <string>
#include <iostream>
#include "sp-item.h"
#include "display/curve.h"
#include "2geom/line.h"
#include "2geom/crossing.h"
#include "2geom/convex-cover.h"
#include "helper/geom-curves.h"
#include "svg/stringstream.h"
#include "conn-avoid-ref.h"
#include "connection-points.h"
#include "sp-conn-end.h"
#include "sp-path.h"
#include "libavoid/router.h"
#include "libavoid/connector.h"
#include "libavoid/geomtypes.h"
#include "xml/node.h"
#include "document.h"
#include "desktop.h"
#include "desktop-handles.h"
#include "sp-namedview.h"
#include "sp-item-group.h"
#include "inkscape.h"
#include <glibmm/i18n.h>
using Avoid::Router;
static Avoid::Polygon avoid_item_poly(SPItem const *item);
SPAvoidRef::SPAvoidRef(SPItem *spitem)
: shapeRef(NULL)
, item(spitem)
, setting(false)
, new_setting(false)
, _transformed_connection()
{
}
SPAvoidRef::~SPAvoidRef()
{
_transformed_connection.disconnect();
// If the document is being destroyed then the router instance
// and the ShapeRefs will have been destroyed with it.
const bool routerInstanceExists = (item->document->router != NULL);
if (shapeRef && routerInstanceExists) {
Router *router = shapeRef->router();
router->removeShape(shapeRef);
delete shapeRef;
}
shapeRef = NULL;
}
void SPAvoidRef::setAvoid(char const *value)
{
if (SP_OBJECT_IS_CLONED(item)) {
// Don't keep avoidance information for cloned objects.
return;
}
new_setting = false;
if (value && (strcmp(value, "true") == 0)) {
new_setting = true;
}
}
void print_connection_points(std::map<int, ConnectionPoint>& cp)
{
std::map<int, ConnectionPoint>::iterator i;
for (i=cp.begin(); i!=cp.end(); ++i)
{
const ConnectionPoint& p = i->second;
std::cout<<p.id<<" "<<p.type<<" "<<p.pos[Geom::X]<<" "<<p.pos[Geom::Y]<<std::endl;
}
}
void SPAvoidRef::setConnectionPoints(gchar const *value)
{
std::set<int> updates;
std::set<int> deletes;
std::set<int> seen;
if (value)
{
/* Rebuild the connection points list.
Update the connectors for which
the endpoint has changed.
*/
gchar ** strarray = g_strsplit(value, "|", 0);
gchar ** iter = strarray;
while (*iter != NULL) {
ConnectionPoint cp;
Inkscape::SVGIStringStream is(*iter);
is>>cp;
cp.type = ConnPointUserDefined;
/* Mark this connection point as seen, so we can delete
the other ones.
*/
seen.insert(cp.id);
if ( connection_points.find(cp.id) != connection_points.end() )
{
/* An already existing connection point.
Check to see if changed, and, if it is
the case, trigger connector update for
the connector attached to this connection
point. This is done by adding the
connection point to a list of connection
points to be updated.
*/
if ( connection_points[cp.id] != cp )
// The connection point got updated.
// Put it in the update list.
updates.insert(cp.id);
}
connection_points[cp.id] = cp;
++iter;
}
/* Delete the connection points that didn't appear
in the new connection point list.
*/
std::map<int, ConnectionPoint>::iterator it;
for (it=connection_points.begin(); it!=connection_points.end(); ++it)
if ( seen.find(it->first) == seen.end())
deletes.insert(it->first);
g_strfreev(strarray);
}
else
{
/* Delete all the user-defined connection points
Actually we do this by adding them to the list
of connection points to be deleted.
*/
std::map<int, ConnectionPoint>::iterator it;
for (it=connection_points.begin(); it!=connection_points.end(); ++it)
deletes.insert(it->first);
}
/* Act upon updates and deletes.
*/
if (deletes.empty() && updates.empty())
// Nothing to do, just return.
return;
// Get a list of attached connectors.
GSList* conns = getAttachedConnectors(Avoid::runningToAndFrom);
for (GSList *i = conns; i != NULL; i = i->next)
{
SPPath* path = SP_PATH(i->data);
SPConnEnd** connEnds = path->connEndPair.getConnEnds();
for (int ix=0; ix<2; ++ix) {
if (connEnds[ix]->type == ConnPointUserDefined) {
if (updates.find(connEnds[ix]->id) != updates.end()) {
if (path->connEndPair.isAutoRoutingConn()) {
path->connEndPair.tellLibavoidNewEndpoints();
} else {
}
}
else if (deletes.find(connEnds[ix]->id) != deletes.end()) {
sp_conn_end_detach(path, ix);
}
}
}
}
g_slist_free(conns);
// Remove all deleted connection points
if (deletes.size())
for (std::set<int>::iterator it = deletes.begin(); it != deletes.end(); ++it)
connection_points.erase(*it);
}
void SPAvoidRef::setConnectionPointsAttrUndoable(const gchar* value, const gchar* action)
{
SPDocument* doc = SP_OBJECT_DOCUMENT(item);
SP_OBJECT(item)->setAttribute( "inkscape:connection-points", value, 0 );
item->updateRepr();
doc->ensure_up_to_date();
SPDocumentUndo::done(doc, SP_VERB_CONTEXT_CONNECTOR, action);
}
void SPAvoidRef::addConnectionPoint(ConnectionPoint &cp)
{
Inkscape::SVGOStringStream ostr;
bool first = true;
int newId = 1;
if ( connection_points.size() )
{
for (IdConnectionPointMap::iterator it = connection_points.begin(); ; )
{
if ( first )
{
first = false;
ostr<<it->second;
}
else
ostr<<'|'<<it->second;
IdConnectionPointMap::iterator prev_it = it;
++it;
if ( it == connection_points.end() || prev_it->first + 1 != it->first )
{
newId = prev_it->first + 1;
break;
}
}
}
cp.id = newId;
if ( first )
{
first = false;
ostr<<cp;
}
else
ostr<<'|'<<cp;
this->setConnectionPointsAttrUndoable( ostr.str().c_str(), _("Add a new connection point") );
}
void SPAvoidRef::updateConnectionPoint(ConnectionPoint &cp)
{
Inkscape::SVGOStringStream ostr;
IdConnectionPointMap::iterator cp_pos = connection_points.find( cp.id );
if ( cp_pos != connection_points.end() )
{
bool first = true;
for (IdConnectionPointMap::iterator it = connection_points.begin(); it != connection_points.end(); ++it)
{
ConnectionPoint* to_write;
if ( it != cp_pos )
to_write = &it->second;
else
to_write = &cp;
if ( first )
{
first = false;
ostr<<*to_write;
}
else
ostr<<'|'<<*to_write;
}
this->setConnectionPointsAttrUndoable( ostr.str().c_str(), _("Move a connection point") );
}
}
void SPAvoidRef::deleteConnectionPoint(ConnectionPoint &cp)
{
Inkscape::SVGOStringStream ostr;
IdConnectionPointMap::iterator cp_pos = connection_points.find( cp.id );
if ( cp_pos != connection_points.end() ) {
bool first = true;
for (IdConnectionPointMap::iterator it = connection_points.begin(); it != connection_points.end(); ++it) {
if ( it != cp_pos ) {
if ( first ) {
first = false;
ostr<<it->second;
} else {
ostr<<'|'<<it->second;
}
}
}
this->setConnectionPointsAttrUndoable( ostr.str().c_str(), _("Remove a connection point") );
}
}
void SPAvoidRef::handleSettingChange(void)
{
SPDesktop *desktop = inkscape_active_desktop();
if (desktop == NULL) {
return;
}
if (sp_desktop_document(desktop) != item->document) {
// We don't want to go any further if the active desktop's document
// isn't the same as the document that this item is part of. This
// case can happen if a new document is loaded from the file chooser
// or via the recent file menu. In this case, we can end up here
// as a rersult of a sp_document_ensure_up_to_date performed on a
// document not yet attached to the active desktop.
return;
}
if (new_setting == setting) {
// Don't need to make any changes
return;
}
setting = new_setting;
Router *router = item->document->router;
_transformed_connection.disconnect();
if (new_setting) {
Avoid::Polygon poly = avoid_item_poly(item);
if (poly.size() > 0) {
_transformed_connection = item->connectTransformed(
sigc::ptr_fun(&avoid_item_move));
const char *id = SP_OBJECT_REPR(item)->attribute("id");
g_assert(id != NULL);
// Get a unique ID for the item.
GQuark itemID = g_quark_from_string(id);
shapeRef = new Avoid::ShapeRef(router, poly, itemID);
router->addShape(shapeRef);
}
}
else
{
g_assert(shapeRef);
router->removeShape(shapeRef);
delete shapeRef;
shapeRef = NULL;
}
}
GSList *SPAvoidRef::getAttachedShapes(const unsigned int type)
{
GSList *list = NULL;
Avoid::IntList shapes;
GQuark shapeId = g_quark_from_string(item->getId());
item->document->router->attachedShapes(shapes, shapeId, type);
Avoid::IntList::iterator finish = shapes.end();
for (Avoid::IntList::iterator i = shapes.begin(); i != finish; ++i) {
const gchar *connId = g_quark_to_string(*i);
SPObject *obj = item->document->getObjectById(connId);
if (obj == NULL) {
g_warning("getAttachedShapes: Object with id=\"%s\" is not "
"found. Skipping.", connId);
continue;
}
SPItem *shapeItem = SP_ITEM(obj);
list = g_slist_prepend(list, shapeItem);
}
return list;
}
GSList *SPAvoidRef::getAttachedConnectors(const unsigned int type)
{
GSList *list = NULL;
Avoid::IntList conns;
GQuark shapeId = g_quark_from_string(item->getId());
item->document->router->attachedConns(conns, shapeId, type);
Avoid::IntList::iterator finish = conns.end();
for (Avoid::IntList::iterator i = conns.begin(); i != finish; ++i) {
const gchar *connId = g_quark_to_string(*i);
SPObject *obj = item->document->getObjectById(connId);
if (obj == NULL) {
g_warning("getAttachedConnectors: Object with id=\"%s\" is not "
"found. Skipping.", connId);
continue;
}
SPItem *connItem = SP_ITEM(obj);
list = g_slist_prepend(list, connItem);
}
return list;
}
Geom::Point SPAvoidRef::getConnectionPointPos(const int type, const int id)
{
g_assert(item);
Geom::Point pos;
const Geom::Matrix& transform = item->i2doc_affine();
// TODO investigate why this was asking for the active desktop:
SPDesktop *desktop = inkscape_active_desktop();
if ( type == ConnPointDefault )
{
// For now, just default to the centre of the item
Geom::OptRect bbox = item->getBounds(item->i2doc_affine());
pos = (bbox) ? bbox->midpoint() : Geom::Point(0, 0);
}
else
{
// Get coordinates from the list of connection points
// that are attached to the item
pos = connection_points[id].pos * transform;
}
return pos;
}
bool SPAvoidRef::isValidConnPointId( const int type, const int id )
{
if ( type < 0 || type > 1 )
return false;
else
{
if ( type == ConnPointDefault )
if ( id < 0 || id > 8 )
return false;
else
{
}
else
return connection_points.find( id ) != connection_points.end();
}
return true;
}
static std::vector<Geom::Point> approxCurveWithPoints(SPCurve *curve)
{
// The number of segments to use for not straight curves approximation
const unsigned NUM_SEGS = 4;
const Geom::PathVector& curve_pv = curve->get_pathvector();
// The structure to hold the output
std::vector<Geom::Point> poly_points;
// Iterate over all curves, adding the endpoints for linear curves and
// sampling the other curves
double seg_size = 1.0 / NUM_SEGS;
double at;
at = 0;
Geom::PathVector::const_iterator pit = curve_pv.begin();
while (pit != curve_pv.end())
{
Geom::Path::const_iterator cit = pit->begin();
while (cit != pit->end())
if (dynamic_cast<Geom::CubicBezier const*>(&*cit))
{
at += seg_size;
if (at <= 1.0 )
poly_points.push_back(cit->pointAt(at));
else
{
at = 0.0;
++cit;
}
}
else
{
poly_points.push_back(cit->finalPoint());
++cit;
}
++pit;
}
return poly_points;
}
static std::vector<Geom::Point> approxItemWithPoints(SPItem const *item, const Geom::Matrix& item_transform)
{
// The structure to hold the output
std::vector<Geom::Point> poly_points;
if (SP_IS_GROUP(item))
{
SPGroup* group = SP_GROUP(item);
// consider all first-order children
for (GSList const* i = sp_item_group_item_list(group); i != NULL; i = i->next) {
SPItem* child_item = SP_ITEM(i->data);
std::vector<Geom::Point> child_points = approxItemWithPoints(child_item, item_transform * child_item->transform);
poly_points.insert(poly_points.end(), child_points.begin(), child_points.end());
}
}
else if (SP_IS_SHAPE(item))
{
SPCurve* item_curve = SP_SHAPE(item)->getCurve();
// make sure it has an associated curve
if (item_curve)
{
// apply transformations (up to common ancestor)
item_curve->transform(item_transform);
std::vector<Geom::Point> curve_points = approxCurveWithPoints(item_curve);
poly_points.insert(poly_points.end(), curve_points.begin(), curve_points.end());
item_curve->unref();
}
}
return poly_points;
}
static Avoid::Polygon avoid_item_poly(SPItem const *item)
{
SPDesktop *desktop = inkscape_active_desktop();
g_assert(desktop != NULL);
double spacing = desktop->namedview->connector_spacing;
Geom::Matrix itd_mat = item->i2doc_affine();
std::vector<Geom::Point> hull_points;
hull_points = approxItemWithPoints(item, itd_mat);
// create convex hull from all sampled points
Geom::ConvexHull hull(hull_points);
// enlarge path by "desktop->namedview->connector_spacing"
// store expanded convex hull in Avoid::Polygn
Avoid::Polygon poly;
Geom::Line hull_edge(hull[-1], hull[0]);
Geom::Line prev_parallel_hull_edge;
prev_parallel_hull_edge.origin(hull_edge.origin()+hull_edge.versor().ccw()*spacing);
prev_parallel_hull_edge.versor(hull_edge.versor());
int hull_size = hull.boundary.size();
for (int i = 0; i <= hull_size; ++i)
{
hull_edge.setBy2Points(hull[i], hull[i+1]);
Geom::Line parallel_hull_edge;
parallel_hull_edge.origin(hull_edge.origin()+hull_edge.versor().ccw()*spacing);
parallel_hull_edge.versor(hull_edge.versor());
// determine the intersection point
Geom::OptCrossing int_pt = Geom::intersection(parallel_hull_edge, prev_parallel_hull_edge);
if (int_pt)
{
Avoid::Point avoid_pt((parallel_hull_edge.origin()+parallel_hull_edge.versor()*int_pt->ta)[Geom::X],
(parallel_hull_edge.origin()+parallel_hull_edge.versor()*int_pt->ta)[Geom::Y]);
poly.ps.push_back(avoid_pt);
}
else
{
// something went wrong...
std::cout<<"conn-avoid-ref.cpp: avoid_item_poly: Geom:intersection failed."<<std::endl;
}
prev_parallel_hull_edge = parallel_hull_edge;
}
return poly;
}
GSList *get_avoided_items(GSList *list, SPObject *from, SPDesktop *desktop,
bool initialised)
{
for (SPObject *child = SP_OBJECT(from)->first_child() ;
child != NULL; child = SP_OBJECT_NEXT(child) ) {
if (SP_IS_ITEM(child) &&
!desktop->isLayer(SP_ITEM(child)) &&
!SP_ITEM(child)->isLocked() &&
!desktop->itemIsHidden(SP_ITEM(child)) &&
(!initialised || SP_ITEM(child)->avoidRef->shapeRef)
)
{
list = g_slist_prepend (list, SP_ITEM(child));
}
if (SP_IS_ITEM(child) && desktop->isLayer(SP_ITEM(child))) {
list = get_avoided_items(list, child, desktop, initialised);
}
}
return list;
}
void avoid_item_move(Geom::Matrix const */*mp*/, SPItem *moved_item)
{
Avoid::ShapeRef *shapeRef = moved_item->avoidRef->shapeRef;
g_assert(shapeRef);
Router *router = moved_item->document->router;
Avoid::Polygon poly = avoid_item_poly(moved_item);
if (!poly.empty()) {
router->moveShape(shapeRef, poly);
}
}
void init_avoided_shape_geometry(SPDesktop *desktop)
{
// Don't count this as changes to the document,
// it is basically just late initialisation.
SPDocument *document = sp_desktop_document(desktop);
bool saved = SPDocumentUndo::get_undo_sensitive(document);
SPDocumentUndo::set_undo_sensitive(document, false);
bool initialised = false;
GSList *items = get_avoided_items(NULL, desktop->currentRoot(), desktop,
initialised);
for ( GSList const *iter = items ; iter != NULL ; iter = iter->next ) {
SPItem *item = reinterpret_cast<SPItem *>(iter->data);
item->avoidRef->handleSettingChange();
}
if (items) {
g_slist_free(items);
}
SPDocumentUndo::set_undo_sensitive(document, saved);
}
/*
Local Variables:
mode:c++
c-file-style:"stroustrup"
c-file-offsets:((innamespace . 0)(inline-open . 0)(case-label . +))
indent-tabs-mode:nil
fill-column:99
End:
*/
// vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=8:softtabstop=4 :
|