Lines Matching defs:subpath
235 // if at least one of the nodes from this subpath is selected,
236 // select all nodes from this subpath
251 // found selected node - invert selection in this subpath
256 // next subpath
403 /** Replace contiguous selections of nodes in each subpath with one node. */
419 // if all nodes in a subpath are selected, the operation doesn't make much sense
497 // if all nodes in a closed subpath are selected, the operation doesn't make much sense
540 /** Break the subpath at selected nodes. It also works for single node closed paths. */
596 // If there are less than 2 unselected nodes in an open subpath or no unselected nodes
597 // in a closed one, delete entire subpath.
639 * The given range can cross the beginning of the subpath in closed subpaths.
688 // crosses the beginning of a closed subpath
795 break; // continue with the next subpath
1169 // prepare new subpath
1170 SubpathPtr subpath(new NodeList(_subpaths));
1171 _subpaths.push_back(subpath);
1174 subpath->push_back(previous_node);
1184 current_node = subpath->begin().get_pointer();
1190 subpath->push_back(current_node);
1205 if (pit->closed()) subpath->setClosed(true);
1345 SubpathPtr subpath = *spi;
1346 if (subpath->empty()) {
1350 NodeList::iterator prev = subpath->begin();
1352 for (NodeList::iterator i = ++subpath->begin(); i != subpath->end(); ++i) {
1356 if (subpath->closed()) {
1359 if (!prev->front()->isDegenerate() || !subpath->begin()->back()->isDegenerate()) {
1360 build_segment(builder, prev.ptr(), subpath->begin().ptr());