Lines Matching defs:items

60     std::vector<SPItem*> items(selection->itemList());
62 if (items.size() < 1) {
71 items = sp_degroup_list (items); // descend into any groups in selection
74 for (std::vector<SPItem*>::const_reverse_iterator i = items.rbegin(); i != items.rend(); ++i) {
80 bool did = sp_item_list_to_curves(to_paths, items, converted);
82 items.push_back((SPItem*)doc->getObjectByRepr(*i));
84 items = sp_degroup_list (items); // converting to path may have added more groups, descend again
86 sort(items.begin(),items.end(),less_than_items);
87 assert(!items.empty()); // cannot be NULL because of list length check at top of function
104 for (std::vector<SPItem*>::const_reverse_iterator i = items.rbegin(); i != items.rend(); ++i){
173 // move to the position of the topmost, reduced by the number of deleted items
309 std::vector<SPItem*> items(selected);
311 did = sp_item_list_to_curves(items, selected, to_select);
328 /** Converts the selected items to LPEItems if they are not already so; e.g. SPRects) */
340 std::vector<SPItem*> items(selected);
343 sp_item_list_to_curves(items, selected, to_select, true);
350 sp_item_list_to_curves(const std::vector<SPItem*> &items, std::vector<SPItem*>& selected, std::vector<Inkscape::XML::Node*> &to_select, bool skip_all_lpeitems)
353 for (std::vector<SPItem*>::const_iterator i = items.begin(); i != items.end(); ++i){
606 std::vector<SPItem*> items = selection->itemList();
608 if (items.empty()) {
620 for (std::vector<SPItem*>::const_iterator i = items.begin(); i != items.end(); ++i){