Cross Reference: /inkscape/src/ui/tool/node.cpp

Lines Matching defs:direction
98 /** Computes an unit vector of the direction from first to second control point */
99 static Geom::Point direction(Geom::Point const &first, Geom::Point const &second) {
139     Node *node_towards = _parent->nodeToward(this); // node in direction of this handle
140     Node *node_away = _parent->nodeAwayFrom(this); // node in the opposite direction
164         // in its direction becomes linear and there are smooth nodes
187         Geom::Point direction = _parent->position() - node_away->position();
189         // project the relative position on the direction line
190         Geom::Point new_delta = (Geom::dot(delta, direction)
191             / Geom::L2sq(direction)) * direction;
356         // direction of the handle, change to Ray instead of Line
833                 // drag out the second handle without changing the direction of the first one.
851                     Geom::Point dir = direction(_back, *this);
858                     Geom::Point dir = direction(_front, *this);
884                 // Both handles are extended. Compute average length, use direction from
887                 Geom::Point dir = direction(_back, _front);
987         if (event->scroll.direction == GDK_SCROLL_UP) {
989         } else if (event->scroll.direction == GDK_SCROLL_DOWN) {
1038     // Linear grow is simple. We find the first unselected nodes in each direction
1055         // do the same for the second direction. Do not check for equality with
1075     // This means we have to check the entire subpath. We go in the direction in which
1078     // in each direction (if any). At the end, we choose the one that is farther and deselect it.
1179     // determine which handle to drag out based on degeneration and the direction of drag
1246     // and perpendicularly and therefore the origin or direction vector must be set