Lines Matching defs:selected

228 /** Select all nodes in subpaths that have something selected. */
234 if (j->selected()) {
235 // if at least one of the nodes from this subpath is selected,
245 /** Invert selection in the selected subpaths. */
250 if (j->selected()) {
251 // found selected node - invert selection in this subpath
253 if (k->selected()) _selection.erase(k.ptr());
263 /** Insert a new node in the middle of each selected segment. */
271 if (k && j->selected() && k->selected()) {
315 /** Insert a new node at the extremum of the selected segments. */
329 if (second && first->selected() && second->selected()) {
361 /** Insert new nodes exactly at the positions of selected nodes while preserving shape.
369 if (j->selected()) {
375 // nodes that were selected before this operation without deselecting
388 // This call changes num_selected, but we call this once for a selected node
414 if (j->selected()) ++num_selected;
419 // if all nodes in a subpath are selected, the operation doesn't make much sense
427 while (sel_beg->selected()) ++sel_beg;
432 // Find selected node
433 while (sel_beg && !sel_beg->selected()) sel_beg = sel_beg.next();
444 for (sel_end = sel_beg; sel_end && sel_end->selected(); sel_end = sel_end.next()) {
474 --num_selected; // for the joined node or single selected node
479 /** Remove nodes in the middle of selected segments. */
489 if (j->selected()) ++num_selected;
493 // if 2 or fewer nodes are selected, there can't be any middle points to remove.
497 // if all nodes in a closed subpath are selected, the operation doesn't make much sense
505 while (sel_beg->selected()) ++sel_beg;
510 // Find selected node
511 while (sel_beg && !sel_beg->selected()) sel_beg = sel_beg.next();
519 // find the end of selected segment
520 for (sel_end = sel_beg; sel_end && sel_end->selected(); sel_end = sel_end.next()) {
540 /** Break the subpath at selected nodes. It also works for single node closed paths. */
553 if (!cur->selected()) continue;
586 /** Delete selected nodes in the path, optionally substituting deleted segments with bezier curves
600 if (j->selected()) ++num_selected;
613 // of a selected stretch and the resulting bezier fit would be suboptimal
616 while (sel_beg->selected()) ++sel_beg;
621 while (sel_beg && !sel_beg->selected()) {
626 while (sel_end && sel_end->selected()) {
710 /** Removes selected segments */
721 if (j->selected()) {
734 while (sel_beg && sel_beg->selected()) ++sel_beg;
737 if (!sel_beg->selected()) {
743 while (sel_end && sel_end->selected()) {
754 // In closed paths, relocate the beginning of the path to the last selected
755 // node and then unclose it. Remove the nodes from the first selected node
786 * @param selected_only If true, only paths that have at least one selected node
793 if (j->selected()) {
804 /** Make selected segments curves / lines. */
811 if (!(k && j->selected() && k->selected())) continue;
921 if (!j->selected()) continue;
1067 * @param search_selected Consider selected nodes
1081 if(j->selected()) {
1106 // ugly: stored offsets of selected nodes in a vector
1111 selpos.push_back(j->selected());
1593 void PathManipulator::_selectionChangedM(std::vector<SelectableControlPoint *> pvec, bool selected) {
1595 _selectionChanged(pvec[n], selected);
1599 void PathManipulator::_selectionChanged(SelectableControlPoint *p, bool selected)
1601 if (selected) ++_num_selected;
1616 if (selected) {
1630 nodesel[i] = iters[i] && iters[i]->selected();