node.cpp revision ac980509f9d3a167bd16e505c487ac2e5a659124
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh * Editable node - implementation.
9dc68827cbd515262ecb8d5ae8547d9e82c72e00Jon A. Cruz * Krzysztof KosiĆski <tweenk.pl@gmail.com>
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh * Copyright (C) 2009 Authors
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh * Released under GNU GPL, read the file 'COPYING' for more information
3711b3e25395437ee0a09dbbb2a76d999c4ef322mikloshstatic SelectableControlPoint::ColorSet node_colors = {
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh {0x0000ffff, 0x000000ff}, // normal fill, stroke when selected
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh {0xff000000, 0x000000ff}, // mouseover fill, stroke when selected
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh {0xff000000, 0x000000ff} // clicked fill, stroke when selected
3711b3e25395437ee0a09dbbb2a76d999c4ef322mikloshstd::ostream &operator<<(std::ostream &out, NodeType type)
c53f16f52840e8c0f2be9c1cc3af633c0ba1552emiklosh/** Computes an unit vector of the direction from first to second control point */
c53f16f52840e8c0f2be9c1cc3af633c0ba1552emikloshstatic Geom::Point direction(Geom::Point const &first, Geom::Point const &second) {
c53f16f52840e8c0f2be9c1cc3af633c0ba1552emiklosh * Control point of a cubic Bezier curve in a path.
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh * Handle keeps the node type invariant only for the opposite handle of the same node.
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh * Keeping the invariant on node moves is left to the %Node class.
3711b3e25395437ee0a09dbbb2a76d999c4ef322mikloshHandle::Handle(NodeSharedData const &data, Geom::Point const &initial_pos, Node *parent)
68664e00e2372534b4df2fdc5f54f836bafece18miklosh : ControlPoint(data.desktop, initial_pos, Gtk::ANCHOR_CENTER, SP_CTRL_SHAPE_CIRCLE, 7.0,
cb814cb0df20053ca3ef16ce55da474435daf045miklosh _handle_line = sp_canvas_item_new(data.handle_line_group, SP_TYPE_CTRLLINE, NULL);
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh //sp_canvas_item_hide(_handle_line);
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Node *node_towards = _parent->nodeToward(this); // node in direction of this handle
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Node *node_away = _parent->nodeAwayFrom(this); // node in the opposite direction
1667116521643e2475184b048e0abb77a2aa9735miklosh Handle *towards = node_towards ? node_towards->handleAwayFrom(_parent) : NULL;
1667116521643e2475184b048e0abb77a2aa9735miklosh Handle *towards_second = node_towards ? node_towards->handleToward(_parent) : NULL;
1667116521643e2475184b048e0abb77a2aa9735miklosh // The handle becomes degenerate.
1667116521643e2475184b048e0abb77a2aa9735miklosh // Adjust node type as necessary.
1667116521643e2475184b048e0abb77a2aa9735miklosh // If both handles become degenerate, convert to parent cusp node
75b857d473541532819bd791105cb352c9a43214buliabyak // Only 1 handle becomes degenerate
c53f16f52840e8c0f2be9c1cc3af633c0ba1552emiklosh // do nothing for other node types
c53f16f52840e8c0f2be9c1cc3af633c0ba1552emiklosh // If the segment between the handle and the node
1667116521643e2475184b048e0abb77a2aa9735miklosh // in its direction becomes linear and there are smooth nodes
1667116521643e2475184b048e0abb77a2aa9735miklosh // at its ends, make their handles colinear with the segment
68664e00e2372534b4df2fdc5f54f836bafece18miklosh if (_parent->type() == NODE_SMOOTH && Node::_is_line_segment(_parent, node_away)) {
68664e00e2372534b4df2fdc5f54f836bafece18miklosh // restrict movement to the line joining the nodes
68664e00e2372534b4df2fdc5f54f836bafece18miklosh Geom::Point direction = _parent->position() - node_away->position();
68664e00e2372534b4df2fdc5f54f836bafece18miklosh // project the relative position on the direction line
68664e00e2372534b4df2fdc5f54f836bafece18miklosh Geom::Point new_delta = (Geom::dot(delta, direction)
c53f16f52840e8c0f2be9c1cc3af633c0ba1552emiklosh // fall through - auto nodes degrade into smooth nodes
c53f16f52840e8c0f2be9c1cc3af633c0ba1552emiklosh /* for smooth nodes, we need to rotate the other handle so that it's colinear
c53f16f52840e8c0f2be9c1cc3af633c0ba1552emiklosh * with the dragged one while conserving length. */
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // for symmetric nodes, place the other handle on the opposite side
c53f16f52840e8c0f2be9c1cc3af633c0ba1552emiklosh other->setRelativePos(-(new_pos - _parent->position()));
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh default: break;
1667116521643e2475184b048e0abb77a2aa9735miklosh sp_ctrlline_set_coords(SP_CTRLLINE(_handle_line), _parent->position(), position());
1667116521643e2475184b048e0abb77a2aa9735miklosh // update degeneration info and visibility
1667116521643e2475184b048e0abb77a2aa9735miklosh if (Geom::are_near(position(), _parent->position()))
1667116521643e2475184b048e0abb77a2aa9735miklosh else _degenerate = false;
1667116521643e2475184b048e0abb77a2aa9735miklosh if (_parent->_handles_shown && _parent->visible() && !_degenerate) {
1667116521643e2475184b048e0abb77a2aa9735miklosh if (isDegenerate()) return;
68664e00e2372534b4df2fdc5f54f836bafece18mikloshvoid Handle::setDirection(Geom::Point const &from, Geom::Point const &to)
3711b3e25395437ee0a09dbbb2a76d999c4ef322mikloshchar const *Handle::handle_type_to_localized_string(NodeType type)
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh case NODE_SYMMETRIC: return _("Symmetric node handle");
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh case NODE_AUTO: return _("Auto-smooth node handle");
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh default: return "";
7a7fa095a483e8b652af9f00e5169f62c84f09b9mikloshbool Handle::_eventHandler(SPEventContext *event_context, GdkEvent *event)
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh if (held_only_shift(event->key) && _parent->_type == NODE_CUSP) {
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // when Shift+S is pressed when hovering over a handle belonging to a cusp node,
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // hold this handle in place; otherwise process normally
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // this handle is guaranteed not to be degenerate
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh other()->move(_parent->position() - (position() - _parent->position()));
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh _parent->_pm().update(); // magic triple combo to add undo event
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh return true;
d37634d73670180f99a3e0ea583621373d90ec4fJohan Engelen default: break;
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh default: break;
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh return ControlPoint::_eventHandler(event_context, event);
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh return false;
7a7fa095a483e8b652af9f00e5169f62c84f09b9mikloshvoid Handle::dragged(Geom::Point &new_pos, GdkEventMotion *event)
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh SnapManager &sm = _desktop->namedview->snap_manager;
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh boost::optional<Inkscape::Snapper::SnapConstraint> ctrl_constraint;
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // with Alt, preserve length
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh new_pos = parent_pos + Geom::unit_vector(new_pos - parent_pos) * _saved_length;
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // with Ctrl, constrain to M_PI/rotationsnapsperpi increments from vertical
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // and the original position.
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Inkscape::Preferences *prefs = Inkscape::Preferences::get();
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh int snaps = 2 * prefs->getIntLimited("/options/rotationsnapsperpi/value", 12, 1, 1000);
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // note: if snapping to the original position is only desired in the original
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // direction of the handle, change to Ray instead of Line
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Geom::Line perp_line(parent_pos, parent_pos + Geom::rot90(origin - parent_pos));
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Geom::Point snap_pos = parent_pos + Geom::constrain_angle(
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Geom::Point(0,0), new_pos - parent_pos, snaps, Geom::Point(1,0));
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Geom::Point orig_pos = original_line.pointAt(original_line.nearestPoint(new_pos));
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Geom::Point perp_pos = perp_line.pointAt(perp_line.nearestPoint(new_pos));
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh ctrl_constraint = Inkscape::Snapper::SnapConstraint(parent_pos, parent_pos - snap_pos);
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh if (Geom::distance(orig_pos, new_pos) < Geom::distance(result, new_pos)) {
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh ctrl_constraint = Inkscape::Snapper::SnapConstraint(parent_pos, parent_pos - orig_pos);
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh if (Geom::distance(perp_pos, new_pos) < Geom::distance(result, new_pos)) {
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh ctrl_constraint = Inkscape::Snapper::SnapConstraint(parent_pos, parent_pos - perp_pos);
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh std::vector<Inkscape::SnapCandidatePoint> unselected;
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh ControlPointSelection::Set &nodes = _parent->_selection.allPoints();
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh for (ControlPointSelection::Set::iterator i = nodes.begin(); i != nodes.end(); ++i) {
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh sm.setupIgnoreSelection(_desktop, true, &unselected);
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh if (_parent->type() == NODE_SMOOTH && Node::_is_line_segment(_parent, node_away)) {
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Inkscape::Snapper::SnapConstraint cl(_parent->position(),
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh p = sm.constrainedSnap(Inkscape::SnapCandidatePoint(new_pos, SNAPSOURCE_NODE_HANDLE), cl);
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // NOTE: this is subtly wrong.
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // We should get all possible constraints and snap along them using
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // multipleConstrainedSnaps, instead of first snapping to angle and then to objects
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh p = sm.constrainedSnap(Inkscape::SnapCandidatePoint(new_pos, SNAPSOURCE_NODE_HANDLE), *ctrl_constraint);
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh sm.freeSnapReturnByRef(new_pos, SNAPSOURCE_NODE_HANDLE);
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // with Shift, if the node is cusp, rotate the other handle as well
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Geom::Point other_relpos = _saved_other_pos - parent_pos;
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh other_relpos *= Geom::Rotate(Geom::angle_between(origin - parent_pos, new_pos - parent_pos));
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // restore the position
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh move(new_pos); // needed for correct update, even though it's redundant
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // hide the handle if it's less than dragtolerance away from the node
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // however, never do this for cancelled drag / broken grab
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // TODO is this actually a good idea?
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Inkscape::Preferences *prefs = Inkscape::Preferences::get();
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh int drag_tolerance = prefs->getIntLimited("/options/dragtolerance/value", 0, 0, 100);
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh Geom::Point dist = _desktop->d2w(_parent->position()) - _desktop->d2w(position());
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // HACK: If the handle was dragged out, call parent's ungrabbed handler,
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // so that transform handles reappear
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh return true;
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh if (this == &_parent->_front) return &_parent->_back;
7a7fa095a483e8b652af9f00e5169f62c84f09b9mikloshstatic double snap_increment_degrees() {
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Inkscape::Preferences *prefs = Inkscape::Preferences::get();
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh int snaps = prefs->getIntLimited("/options/rotationsnapsperpi/value", 12, 1, 1000);
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh char const *more;
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh bool can_shift_rotate = _parent->type() == NODE_CUSP && !other()->isDegenerate();
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh more = C_("Path handle tip", "more: Shift, Ctrl, Alt");
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh "<b>Shift+Ctrl+Alt</b>: preserve length and snap rotation angle to %g° "
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh "increments while rotating both handles"),
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh "<b>Ctrl+Alt</b>: preserve length and snap rotation angle to %g° increments"),
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh "<b>Shift+Alt</b>: preserve handle length and rotate both handles");
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh "<b>Alt</b>: preserve handle length while dragging");
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh "<b>Shift+Ctrl</b>: snap rotation angle to %g° increments and rotate both handles"),
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh "<b>Ctrl</b>: snap rotation angle to %g° increments, click to retract"),
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh } else if (state_held_shift(state) && can_shift_rotate) {
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh "<b>Shift</b>: rotate both handles by the same angle");
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh "<b>Auto node handle</b>: drag to convert to smooth node (%s)"), more);
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh "<b>%s</b>: drag to shape the segment (%s)"),
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh handle_type_to_localized_string(_parent->type()), more);
3686c32a570c3df738a09b34e85fc5d6bd50d020mikloshGlib::ustring Handle::_getDragTip(GdkEventMotion */*event*/)
3686c32a570c3df738a09b34e85fc5d6bd50d020miklosh Geom::Point dist = position() - _last_drag_origin();
3686c32a570c3df738a09b34e85fc5d6bd50d020miklosh // report angle in mathematical convention
3686c32a570c3df738a09b34e85fc5d6bd50d020miklosh double angle = Geom::angle_between(Geom::Point(-1,0), position() - _parent->position());
3686c32a570c3df738a09b34e85fc5d6bd50d020miklosh angle += M_PI; // angle is (-M_PI...M_PI] - offset by +pi and scale to 0...360
3686c32a570c3df738a09b34e85fc5d6bd50d020miklosh GString *x = SP_PX_TO_METRIC_STRING(dist[Geom::X], _desktop->namedview->getDefaultMetric());
3686c32a570c3df738a09b34e85fc5d6bd50d020miklosh GString *y = SP_PX_TO_METRIC_STRING(dist[Geom::Y], _desktop->namedview->getDefaultMetric());
3686c32a570c3df738a09b34e85fc5d6bd50d020miklosh GString *len = SP_PX_TO_METRIC_STRING(length(), _desktop->namedview->getDefaultMetric());
3686c32a570c3df738a09b34e85fc5d6bd50d020miklosh Glib::ustring ret = format_tip(C_("Path handle tip",
3686c32a570c3df738a09b34e85fc5d6bd50d020miklosh "Move handle by %s, %s; angle %.2f°, length %s"), x->str, y->str, angle, len->str);
3686c32a570c3df738a09b34e85fc5d6bd50d020miklosh * Curve endpoint in an editable path.
3686c32a570c3df738a09b34e85fc5d6bd50d020miklosh * The method move() keeps node type invariants during translations.
3686c32a570c3df738a09b34e85fc5d6bd50d020mikloshNode::Node(NodeSharedData const &data, Geom::Point const &initial_pos)
3686c32a570c3df738a09b34e85fc5d6bd50d020miklosh : SelectableControlPoint(data.desktop, initial_pos, Gtk::ANCHOR_CENTER,
3686c32a570c3df738a09b34e85fc5d6bd50d020miklosh SP_CTRL_SHAPE_DIAMOND, 9.0, *data.selection, &node_colors, data.node_group)
3686c32a570c3df738a09b34e85fc5d6bd50d020miklosh // NOTE we do not set type here, because the handles are still degenerate
1db439af43130c9695dbbb661e893d56006bb072miklosh// NOTE: not using iterators won't make this much quicker because iterators can be 100% inlined.
1db439af43130c9695dbbb661e893d56006bb072miklosh NodeList::iterator n = NodeList::get_iterator(this).next();
1db439af43130c9695dbbb661e893d56006bb072miklosh if (n) return n.ptr();
1db439af43130c9695dbbb661e893d56006bb072miklosh NodeList::iterator p = NodeList::get_iterator(this).prev();
1db439af43130c9695dbbb661e893d56006bb072miklosh if (p) return p.ptr();
1db439af43130c9695dbbb661e893d56006bb072miklosh // move handles when the node moves.
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh // if the node has a smooth handle after a line segment, it should be kept colinear
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh // with the segment
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh /* Affine transforms keep handle invariants for smooth and symmetric nodes,
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh * but smooth nodes at ends of linear segments and auto nodes need special treatment */
7a7fa095a483e8b652af9f00e5169f62c84f09b9mikloshvoid Node::_fixNeighbors(Geom::Point const &old_pos, Geom::Point const &new_pos)
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh /* This method restores handle invariants for neighboring nodes,
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh * and invariants that are based on positions of those nodes for this one. */
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh /* Fix auto handles */
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh if (_next() && _next()->_type == NODE_AUTO) _next()->_updateAutoHandles();
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh if (_prev() && _prev()->_type == NODE_AUTO) _prev()->_updateAutoHandles();
d37634d73670180f99a3e0ea583621373d90ec4fJohan Engelen /* Fix smooth handles at the ends of linear segments.
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh * Rotate the appropriate handle to be colinear with the segment.
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh * If there is a smooth node at the other end of the segment, rotate it too. */
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh } else return;
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh if (_type == NODE_SMOOTH && !handle->isDegenerate()) {
f9325af537ca5517eb50ef95f432a3204616f6b3apenner // also update the handle on the other end of the segment
f9325af537ca5517eb50ef95f432a3204616f6b3apenner if (other->_type == NODE_SMOOTH && !other_handle->isDegenerate()) {
f9325af537ca5517eb50ef95f432a3204616f6b3apenner other_handle->setDirection(new_pos, other->position());
f9325af537ca5517eb50ef95f432a3204616f6b3apenner // Recompute the position of automatic handles.
f9325af537ca5517eb50ef95f432a3204616f6b3apenner // For endnodes, retract both handles. (It's only possible to create an end auto node
f9325af537ca5517eb50ef95f432a3204616f6b3apenner // through the XML editor.)
dd6d813ffad339352c39dc0645a792bdd9d8315cmiklosh // Auto nodes automaticaly adjust their handles to give an appearance of smoothness,
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh // no matter what their surroundings are.
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh Geom::Point vec_next = _next()->position() - position();
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Geom::Point vec_prev = _prev()->position() - position();
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh double len_next = vec_next.length(), len_prev = vec_prev.length();
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // "dir" is an unit vector perpendicular to the bisector of the angle created
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // by the previous node, this auto node and the next node.
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Geom::Point dir = Geom::unit_vector((len_prev / len_next) * vec_next - vec_prev);
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // Handle lengths are equal to 1/3 of the distance from the adjacent node.
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // If any of the adjacent nodes coincides, retract both handles.
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh/** Sets the node type and optionally restores the invariants associated with the given type.
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh * @param type The type to set
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh * @param update_handles Whether to restore invariants associated with the given type.
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh * Passing false is useful e.g. wen initially creating the path,
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh * and when making cusp nodes during some node algorithms.
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh * Pass true when used in response to an UI node type button.
7a7fa095a483e8b652af9f00e5169f62c84f09b9mikloshvoid Node::setType(NodeType type, bool update_handles)
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh updateState(); // The size of the control might have changed
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh // if update_handles is true, adjust handle positions to match the node type
3686c32a570c3df738a09b34e85fc5d6bd50d020miklosh // handle degenerate handles appropriately
f9325af537ca5517eb50ef95f432a3204616f6b3apenner // nothing to do
f9325af537ca5517eb50ef95f432a3204616f6b3apenner // auto handles make no sense for endnodes
f9325af537ca5517eb50ef95f432a3204616f6b3apenner if (isEndNode()) return;
f9325af537ca5517eb50ef95f432a3204616f6b3apenner // ignore attempts to make smooth endnodes.
f9325af537ca5517eb50ef95f432a3204616f6b3apenner if (isEndNode()) return;
f9325af537ca5517eb50ef95f432a3204616f6b3apenner // rotate handles to be colinear
f9325af537ca5517eb50ef95f432a3204616f6b3apenner // for degenerate nodes set positions like auto handles
f9325af537ca5517eb50ef95f432a3204616f6b3apenner // For a node that is already smooth and has a degenerate handle,
f9325af537ca5517eb50ef95f432a3204616f6b3apenner // drag out the second handle without changing the direction of the first one.
f9325af537ca5517eb50ef95f432a3204616f6b3apenner double dist = Geom::distance(_next()->position(), position());
f9325af537ca5517eb50ef95f432a3204616f6b3apenner _front.setRelativePos(Geom::unit_vector(-_back.relativePos()) * dist / 3);
52df193b5d1e7bf4f7fbfbb457248c8d13f2007ebuliabyak double dist = Geom::distance(_prev()->position(), position());
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh _back.setRelativePos(Geom::unit_vector(-_front.relativePos()) * dist / 3);
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh } else if (isDegenerate()) {
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // if the front handle is degenerate and this...next is a line segment,
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // make back colinear; otherwise pull out the other handle
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // to 1/3 of distance to prev
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh } else if (_prev()) {
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh _front.setRelativePos(Geom::distance(_prev()->position(), position()) / 3 * dir);
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh } else if (_next()) {
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh _back.setRelativePos(Geom::distance(_next()->position(), position()) / 3 * dir);
d37634d73670180f99a3e0ea583621373d90ec4fJohan Engelen // both handles are extended. make colinear while keeping length
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh // first make back colinear with the vector front ---> back,
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh // then make front colinear with back ---> node
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh // (not back ---> front because back's position was changed in the first call)
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh if (isEndNode()) return; // symmetric handles make no sense for endnodes
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh // similar to auto handles but set the same length for both
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh Geom::Point vec_next = _next()->position() - position();
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh Geom::Point vec_prev = _prev()->position() - position();
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh double len_next = vec_next.length(), len_prev = vec_prev.length();
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh double len = (len_next + len_prev) / 6; // take 1/3 of average
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh if (len == 0) return;
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh Geom::Point dir = Geom::unit_vector((len_prev / len_next) * vec_next - vec_prev);
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh // Both handles are extended. Compute average length, use direction from
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh // back handle to front handle. This also works correctly for degenerates
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh double len = (_front.length() + _back.length()) / 2;
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh default: break;
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh/** Pick the best type for this node, based on the position of its handles.
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh * This is what assigns types to nodes created using the pen tool. */
dc4f69a188c203f2fdc65f22d0d57904a8c52dd7miklosh // if both handles are degenerate, do nothing
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // if neither are degenerate, check their respective positions
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Geom::Point front_delta = _front.position() - position();
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh Geom::Point back_delta = _back.position() - position();
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh // for now do not automatically make nodes symmetric, it can be annoying
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh /*if (Geom::are_near(front_delta, -back_delta)) {
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh _type = NODE_SYMMETRIC;
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // check whether the handle aligns with the previous line segment.
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // we know that if front is degenerate, back isn't, because
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // both_degen was false
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh if (front_degen && _next() && _next()->_back.isDegenerate()) {
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Geom::Point segment_delta = Geom::unit_vector(_next()->position() - position());
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Geom::Point handle_delta = Geom::unit_vector(_back.position() - position());
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh } else if (back_degen && _prev() && _prev()->_front.isDegenerate()) {
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh Geom::Point segment_delta = Geom::unit_vector(_prev()->position() - position());
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh Geom::Point handle_delta = Geom::unit_vector(_front.position() - position());
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh } while (false);
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh/** Move the node to the bottom of its canvas group. Useful for node break, to ensure that
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh * the selected nodes are above the unselected ones. */
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh switch (x) {
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh default: return NODE_PICK_BEST;
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh/** Customized event handler to catch scroll events needed for selection grow/shrink. */
d27f5758e12c3107ee69e66702043931e0756f6bmikloshbool Node::_eventHandler(SPEventContext *event_context, GdkEvent *event)
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh } else if (event->scroll.direction == GDK_SCROLL_DOWN) {
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh } else break;
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh return true;
0e14f9e966c4b6012538d30cd0db7a775b879760JucaBlues default: goto bail_out;
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh return true;
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh return ControlPoint::_eventHandler(event_context, event);
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh/** Select or deselect a node in this node's subpath based on its path distance from this node.
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh * @param dir If negative, shrink selection by one node; if positive, grow by one node */
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh // Interestingly, we do not need any help from PathManipulator when doing linear grow.
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh // First handle the trivial case of growing over an unselected node.
8ec52d39f409ecf67125cd4d878b844e9391e7e8miklosh NodeList::iterator this_iter = NodeList::get_iterator(this);
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh NodeList::iterator fwd = this_iter, rev = this_iter;
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh // Linear grow is simple. We find the first unselected nodes in each direction
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh // and compare the linear distances to them.
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh // find first unselected nodes on both sides
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh distance_front += Geom::bezier_length(*fwd, fwd->_front, n->_back, *n);
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // there is no unselected node in this cyclic subpath
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh // do the same for the second direction. Do not check for equality with
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh // this node, because there is at least one unselected node in the subpath,
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh // so we are guaranteed to stop.
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh distance_back += Geom::bezier_length(*rev, rev->_back, p->_front, *p);
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh // Linear shrink is more complicated. We need to find the farthest selected node.
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh // This means we have to check the entire subpath. We go in the direction in which
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh // the distance we traveled is lower. We do this until we run out of nodes (ends of path)
d27f5758e12c3107ee69e66702043931e0756f6bmiklosh // or the two iterators meet. On the way, we store the last selected node and its distance
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // in each direction (if any). At the end, we choose the one that is farther and deselect it.
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh // both iterators that store last selected nodes are initially empty
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh double last_distance_back = 0, last_distance_front = 0;
7a7fa095a483e8b652af9f00e5169f62c84f09b9miklosh if (fwd && (!rev || distance_front <= distance_back)) {
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh if (n) distance_front += Geom::bezier_length(*fwd, fwd->_front, n->_back, *n);
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh } else if (rev && (!fwd || distance_front > distance_back)) {
75b857d473541532819bd791105cb352c9a43214buliabyak if (p) distance_back += Geom::bezier_length(*rev, rev->_back, p->_front, *p);
75b857d473541532819bd791105cb352c9a43214buliabyak // Check whether we walked the entire cyclic subpath.
75b857d473541532819bd791105cb352c9a43214buliabyak // This is initially true because both iterators start from this node,
75b857d473541532819bd791105cb352c9a43214buliabyak // so this check cannot go in the while condition.
75b857d473541532819bd791105cb352c9a43214buliabyak // When this happens, we need to check the last node, pointed to by the iterators.
75b857d473541532819bd791105cb352c9a43214buliabyak NodeList::iterator fwdp = fwd.prev(), revn = rev.next();
75b857d473541532819bd791105cb352c9a43214buliabyak double df = distance_front + Geom::bezier_length(*fwdp, fwdp->_front, fwd->_back, *fwd);
75b857d473541532819bd791105cb352c9a43214buliabyak double db = distance_back + Geom::bezier_length(*revn, revn->_back, rev->_front, *rev);
75b857d473541532819bd791105cb352c9a43214buliabyak if (last_distance_front >= last_distance_back) t = last_fwd;
75b857d473541532819bd791105cb352c9a43214buliabyak // change node size to match type and selection state
75b857d473541532819bd791105cb352c9a43214buliabyak return true;
75b857d473541532819bd791105cb352c9a43214buliabyak // Dragging out handles with Shift + drag on a node.
c4723fe0caa2096d00cb31a7d1506351ba8102dbmiklosh Geom::Point rel_evp = evp - _last_click_event_point();
0e14f9e966c4b6012538d30cd0db7a775b879760JucaBlues // This should work even if dragtolerance is zero and evp coincides with node position.
0e14f9e966c4b6012538d30cd0db7a775b879760JucaBlues // determine which handle to drag out based on degeneration and the direction of drag
0e14f9e966c4b6012538d30cd0db7a775b879760JucaBlues Geom::Point next_relpos = _desktop->d2w(_next()->position())
0e14f9e966c4b6012538d30cd0db7a775b879760JucaBlues angle_next = fabs(Geom::angle_between(rel_evp, next_relpos));
0e14f9e966c4b6012538d30cd0db7a775b879760JucaBlues Geom::Point prev_relpos = _desktop->d2w(_prev()->position())
0e14f9e966c4b6012538d30cd0db7a775b879760JucaBlues angle_prev = fabs(Geom::angle_between(rel_evp, prev_relpos));
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh if (!has_degenerate) return false;
03e63790ef0fa2919fc5f9f3e0d018adf317919dmiklosh return true;
3711b3e25395437ee0a09dbbb2a76d999c4ef322mikloshvoid Node::dragged(Geom::Point &new_pos, GdkEventMotion *event)
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh // For a note on how snapping is implemented in Inkscape, see snap.h.
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh SnapManager &sm = _desktop->namedview->snap_manager;
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh // even if we won't really snap, we might still call the one of the
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh // constrainedSnap() methods to enforce the constraints, so we need
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh // to setup the snapmanager anyway; this is also required for someSnapperMightSnap()
082cac3fb4c7fc60e92bbd4de269550801dcea6bmiklosh // do not snap when Shift is pressed
0e14f9e966c4b6012538d30cd0db7a775b879760JucaBlues bool snap = !held_shift(*event) && sm.someSnapperMightSnap();
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh std::vector<Inkscape::SnapCandidatePoint> unselected;
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh * TODO We are doing this every time a snap happens. It should once be done only once
c4723fe0caa2096d00cb31a7d1506351ba8102dbmiklosh * per drag - maybe in the grabbed handler?
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh * TODO Unselected nodes vector must be valid during the snap run, because it is not
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh * copied. Fix this in snap.h and snap.cpp, then the above.
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh * TODO Snapping to unselected segments of selected paths doesn't work yet. */
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh // Build the list of unselected nodes.
77364929ced3ec0bc5c9f47440606615c559084emiklosh for (Set::iterator i = nodes.begin(); i != nodes.end(); ++i) {
77364929ced3ec0bc5c9f47440606615c559084emiklosh if (!(*i)->selected()) {
77364929ced3ec0bc5c9f47440606615c559084emiklosh Inkscape::SnapCandidatePoint p(n->position(), n->_snapSourceType(), n->_snapTargetType());
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh sm.setupIgnoreSelection(_desktop, true, &unselected);
75b857d473541532819bd791105cb352c9a43214buliabyak // Snap candidate point for free snapping; this will consider snapping tangentially
75b857d473541532819bd791105cb352c9a43214buliabyak // and perpendicularly and therefore the origin or direction vector must be set
75b857d473541532819bd791105cb352c9a43214buliabyak Inkscape::SnapCandidatePoint scp_free(new_pos, _snapSourceType());
75b857d473541532819bd791105cb352c9a43214buliabyak boost::optional<Geom::Point> front_point, back_point;
c4723fe0caa2096d00cb31a7d1506351ba8102dbmiklosh // We're about to consider a constrained snap, which is already limited to 1D
c4723fe0caa2096d00cb31a7d1506351ba8102dbmiklosh // Therefore tangential or perpendicular snapping will not be considered, and therefore
c4723fe0caa2096d00cb31a7d1506351ba8102dbmiklosh // all calls above to scp_free.addVector() and scp_free.addOrigin() can be neglected
c4723fe0caa2096d00cb31a7d1506351ba8102dbmiklosh std::vector<Inkscape::Snapper::SnapConstraint> constraints;
7ec85862d9730e449ed5c2a86201bc9ca1daa0aamiklosh // with Ctrl+Alt, constrain to handle lines
c4723fe0caa2096d00cb31a7d1506351ba8102dbmiklosh // project the new position onto a handle line that is closer;
c4723fe0caa2096d00cb31a7d1506351ba8102dbmiklosh // also snap to perpendiculars of handle lines
0e14f9e966c4b6012538d30cd0db7a775b879760JucaBlues Inkscape::Preferences *prefs = Inkscape::Preferences::get();
7ec85862d9730e449ed5c2a86201bc9ca1daa0aamiklosh int snaps = prefs->getIntLimited("/options/rotationsnapsperpi/value", 12, 1, 1000);
c4723fe0caa2096d00cb31a7d1506351ba8102dbmiklosh boost::optional<Geom::Point> fperp_point, bperp_point;
c4723fe0caa2096d00cb31a7d1506351ba8102dbmiklosh constraints.push_back(Inkscape::Snapper::SnapConstraint(origin, *front_point));
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh constraints.push_back(Inkscape::Snapper::SnapConstraint(origin, *back_point));
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh // perpendiculars only snap when they are further than snap increment away
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh // from the second handle constraint
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh (fabs(Geom::angle_between(*fperp_point, *back_point)) > min_angle &&
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh fabs(Geom::angle_between(*fperp_point, *back_point)) < M_PI - min_angle)))
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh constraints.push_back(Inkscape::Snapper::SnapConstraint(origin, *fperp_point));
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh (fabs(Geom::angle_between(*bperp_point, *front_point)) > min_angle &&
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh fabs(Geom::angle_between(*bperp_point, *front_point)) < M_PI - min_angle)))
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh constraints.push_back(Inkscape::Snapper::SnapConstraint(origin, *bperp_point));
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh sp = sm.multipleConstrainedSnaps(Inkscape::SnapCandidatePoint(new_pos, _snapSourceType()), constraints, held_shift(*event));
0e14f9e966c4b6012538d30cd0db7a775b879760JucaBlues // with Ctrl, constrain to axes
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh constraints.push_back(Inkscape::Snapper::SnapConstraint(origin, Geom::Point(1, 0)));
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh constraints.push_back(Inkscape::Snapper::SnapConstraint(origin, Geom::Point(0, 1)));
0e14f9e966c4b6012538d30cd0db7a775b879760JucaBlues sp = sm.multipleConstrainedSnaps(Inkscape::SnapCandidatePoint(new_pos, _snapSourceType()), constraints, held_shift(*event));
0e14f9e966c4b6012538d30cd0db7a775b879760JucaBlues } else if (snap) {
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh return true;
3711b3e25395437ee0a09dbbb2a76d999c4ef322mikloshInkscape::SnapCandidatePoint Node::snapCandidatePoint()
7ec85862d9730e449ed5c2a86201bc9ca1daa0aamiklosh return SnapCandidatePoint(position(), _snapSourceType(), _snapTargetType());
e45563a3c46261d8c32014f8e516857ba01bd7b7miklosh * Gets the handle that faces the given adjacent node.
e45563a3c46261d8c32014f8e516857ba01bd7b7miklosh * Will abort with error if the given node is not adjacent.
e45563a3c46261d8c32014f8e516857ba01bd7b7miklosh g_error("Node::handleToward(): second node is not adjacent!");
17d87f5698f5c2958d38c6a6207c7b322a7adaf9johanengelen * Gets the node in the direction of the given handle.
e45563a3c46261d8c32014f8e516857ba01bd7b7miklosh * Will abort with error if the handle doesn't belong to this node.
03e63790ef0fa2919fc5f9f3e0d018adf317919dmiklosh g_error("Node::nodeToward(): handle is not a child of this node!");
03e63790ef0fa2919fc5f9f3e0d018adf317919dmiklosh * Gets the handle that goes in the direction opposite to the given adjacent node.
03e63790ef0fa2919fc5f9f3e0d018adf317919dmiklosh * Will abort with error if the given node is not adjacent.
03e63790ef0fa2919fc5f9f3e0d018adf317919dmiklosh g_error("Node::handleAwayFrom(): second node is not adjacent!");
03e63790ef0fa2919fc5f9f3e0d018adf317919dmiklosh * Gets the node in the direction opposite to the given handle.
03e63790ef0fa2919fc5f9f3e0d018adf317919dmiklosh * Will abort with error if the handle doesn't belong to this node.
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh if (front() == h) {
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh if (back() == h) {
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh g_error("Node::nodeAwayFrom(): handle is not a child of this node!");
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh bool can_drag_out = (_next() && _front.isDegenerate()) || (_prev() && _back.isDegenerate());
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh /*if (state_held_control(state)) {
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh return format_tip(C_("Path node tip",
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh "<b>Shift+Ctrl:</b> drag out a handle and snap its angle "
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh "to %f° increments"), snap_increment_degrees());
d37634d73670180f99a3e0ea583621373d90ec4fJohan Engelen "<b>Shift</b>: drag out a handle, click to toggle selection");
7ec85862d9730e449ed5c2a86201bc9ca1daa0aamiklosh return C_("Path node tip", "<b>Shift</b>: click to toggle selection");
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh return C_("Path node tip", "<b>Ctrl+Alt</b>: move along handle lines, click to delete node");
7ec85862d9730e449ed5c2a86201bc9ca1daa0aamiklosh "<b>Ctrl</b>: move along axes, click to change node type");
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh return C_("Path node tip", "<b>Alt</b>: sculpt nodes");
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh // No modifiers: assemble tip from node type
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh char const *nodetype = node_type_to_localized_string(_type);
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh if (_selection.transformHandlesEnabled() && selected()) {
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh "<b>%s</b>: drag to shape the path (more: Shift, Ctrl, Alt)"), nodetype);
7ec85862d9730e449ed5c2a86201bc9ca1daa0aamiklosh "<b>%s</b>: drag to shape the path, click to toggle scale/rotation handles (more: Shift, Ctrl, Alt)"), nodetype);
e45563a3c46261d8c32014f8e516857ba01bd7b7miklosh "<b>%s</b>: drag to shape the path, click to select only this node (more: Shift, Ctrl, Alt)"), nodetype);
3711b3e25395437ee0a09dbbb2a76d999c4ef322mikloshGlib::ustring Node::_getDragTip(GdkEventMotion */*event*/)
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh Geom::Point dist = position() - _last_drag_origin();
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh GString *x = SP_PX_TO_METRIC_STRING(dist[Geom::X], _desktop->namedview->getDefaultMetric());
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh GString *y = SP_PX_TO_METRIC_STRING(dist[Geom::Y], _desktop->namedview->getDefaultMetric());
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh Glib::ustring ret = format_tip(C_("Path node tip", "Move node by %s, %s"),
522aa9b8f493ba0c8e8b0bb536a563c96f5430a8mikloshchar const *Node::node_type_to_localized_string(NodeType type)
7ec85862d9730e449ed5c2a86201bc9ca1daa0aamiklosh default: return "";
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh/** Determine whether two nodes are joined by a linear segment. */
3711b3e25395437ee0a09dbbb2a76d999c4ef322mikloshbool Node::_is_line_segment(Node *first, Node *second)
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh return first->_front.isDegenerate() && second->_back.isDegenerate();
7ec85862d9730e449ed5c2a86201bc9ca1daa0aamiklosh return second->_front.isDegenerate() && first->_back.isDegenerate();
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh return false;
3711b3e25395437ee0a09dbbb2a76d999c4ef322mikloshSPCtrlShapeType Node::_node_type_to_shape(NodeType type)
5834db43b21308e958a2fdbbec082b1a4f019a38bryce default: return SP_CTRL_SHAPE_DIAMOND;
e45563a3c46261d8c32014f8e516857ba01bd7b7miklosh * An editable list of nodes representing a subpath.
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh * It can optionally be cyclic to represent a closed path.
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh * The list has iterators that act like plain node iterators, but can also be used
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh * to obtain shared pointers to nodes.
522aa9b8f493ba0c8e8b0bb536a563c96f5430a8miklosh this->ln_list = this;
522aa9b8f493ba0c8e8b0bb536a563c96f5430a8miklosh this->ln_next = this;
522aa9b8f493ba0c8e8b0bb536a563c96f5430a8miklosh this->ln_prev = this;
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh return ln_next == this;
522aa9b8f493ba0c8e8b0bb536a563c96f5430a8miklosh for (ListNode *ln = ln_next; ln != this; ln = ln->ln_next) ++sz;
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh/** A subpath is degenerate if it has no segments - either one node in an open path
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh * or no nodes in a closed path */
c0d6314019bde0047778d2cabb7ec2bf4083f5fcJon A. CruzNodeList::iterator NodeList::before(double t, double *fracpart)
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh// insert a node before i
3711b3e25395437ee0a09dbbb2a76d999c4ef322mikloshNodeList::iterator NodeList::insert(iterator i, Node *x)
3711b3e25395437ee0a09dbbb2a76d999c4ef322mikloshvoid NodeList::splice(iterator pos, NodeList &list, iterator i)
3711b3e25395437ee0a09dbbb2a76d999c4ef322mikloshvoid NodeList::splice(iterator pos, NodeList &/*list*/, iterator first, iterator last)
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh ListNode *ins_beg = first._node, *ins_end = last._node, *at = pos._node;
17d87f5698f5c2958d38c6a6207c7b322a7adaf9johanengelen for (ListNode *ln = ins_beg; ln != ins_end; ln = ln->ln_next) {
e454b92b3d16b0909892cddef064b745898c924dJon A. Cruz // 1. make the list perfectly cyclic
e454b92b3d16b0909892cddef064b745898c924dJon A. Cruz // 2. find new begin
e454b92b3d16b0909892cddef064b745898c924dJon A. Cruz if (n > 0) {
e454b92b3d16b0909892cddef064b745898c924dJon A. Cruz for (; n > 0; --n) new_begin = new_begin->ln_next;
405079a6cf76f81a583a9b8556c1ca49840abc6eKris // 3. relink begin to list
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh for (ListNode *ln = ln_next; ln != this; ln = ln->ln_prev) {
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh node->front()->setPosition(node->back()->position());
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh for (iterator i = begin(); i != end();) erase (i++);
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh // some gymnastics are required to ensure that the node is valid when deleted;
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh // otherwise the code that updates handle visibility will break
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh ListNode *rmnext = rm->ln_next, *rmprev = rm->ln_prev;
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh// TODO this method is very ugly!
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh// converting SubpathList to an intrusive list might allow us to get rid of it
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh for (SubpathList::iterator i = _list.begin(); i != _list.end(); ++i) {
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh if (i->get() == this) {
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh return n->nodeList();
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh * @class SubpathList
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh * Editable path composed of one or more subpaths.
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh} // namespace UI
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh} // namespace Inkscape
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh Local Variables:
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh c-file-style:"stroustrup"
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh c-file-offsets:((innamespace . 0)(inline-open . 0)(case-label . +))
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh indent-tabs-mode:nil
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh fill-column:99
3711b3e25395437ee0a09dbbb2a76d999c4ef322miklosh// vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=8:softtabstop=4:fileencoding=utf-8:textwidth=99 :