Cross Reference: /inkscape/src/selection-chemistry.cpp

Lines Matching refs:items
2  * Miscellanous operations on selected items.
283     std::vector<SPItem*> items ;
293             items.push_back(item);
297     selection->setList(items);
326 static void sp_selection_copy_impl(std::vector<SPItem*> const &items, std::vector<Inkscape::XML::Node*> &clip, Inkscape::XML::Document* xml_doc)
328     // Sort items:
329     std::vector<SPItem*> sorted_items(items);
344 // TODO check if parent parameter should be changed to SPItem, of if the code should handle non-items.
379 static void sp_selection_delete_impl(std::vector<SPItem*> const &items, bool propagate = true, bool propagate_descendants = true)
381     for (std::vector<SPItem*>::const_iterator i = items.begin(); i != items.end(); ++i) {
384     for (std::vector<SPItem*>::const_iterator i = items.begin(); i != items.end(); ++i) {
418      * that depends on desktop items.  I think the only sane way to deal with
466     // sorting items from different parents sorts each parent's subset without possibly mixing
567     std::vector<SPItem*> items = sp_item_group_item_list(group);
569     for(unsigned int i = 0; i < items.size(); i++){
570         items[i]->deleteObject();
580  * list - source list of items to search in
582  * exclude - list of items to exclude from result
583  * onlyvisible - TRUE includes only items visible on canvas
584  * onlysensitive - TRUE includes only non-locked items
585  * ingroups - TRUE to recursively get grouped items children
623     std::vector<SPItem*> items ;
648                             items.push_back(item); // leave it in the list
659             items = get_all_items(x, dt->currentLayer(), dt, onlyvisible, onlysensitive, FALSE, exclude);
664             items = get_all_items(x, dt->currentRoot(), dt, onlyvisible, onlysensitive, FALSE, exclude);
669     selection->setList(items);
709             topmost --; // only reduce count for those items deleted from topmost_parent
751     // Move to the position of the topmost, reduced by the number of items deleted from topmost_parent
850     std::vector<SPItem*> items(old_select);
854     // in the items list.
856     for (std::vector<SPItem*>::const_iterator item = items.begin(); item != items.end(); ++item) {
871     // and the items in the list remain valid
876         std::vector<SPItem*>::iterator items_node = std::find(items.begin(),items.end(), item->data);
882     for (std::vector<SPItem*>::iterator item = items.begin(); item != items.end(); ++item) {
889             // add the items resulting from ungrouping to the selection
906 sp_degroup_list(std::vector<SPItem*> &items)
910     for (std::vector<SPItem*>::const_iterator item=items.begin();item!=items.end();++item) {
932 /** If items in the list have a common parent, return it, otherwise return NULL */
934 sp_item_list_common_parent_group(std::vector<SPItem*> const &items)
936     if (items.empty()) {
939     SPObject *parent = items[0]->parent;
944     for (std::vector<SPItem*>::const_iterator item=items.begin();item!=items.end();++item) {
945         if((*item)==items[0])continue;
954 /** Finds out the minimum common bbox of the selected items. */
956 enclose_items(std::vector<SPItem*> const &items)
958     g_assert(!items.empty());
961     for (std::vector<SPItem*>::const_iterator i = items.begin();i!=items.end();++i) {
986     std::vector<SPItem*> items= selection->itemList();
987     if (items.empty()) {
992     SPGroup const *group = sp_item_list_common_parent_group(items);
1001     std::vector<SPItem*> rev(items);
1004     // Determine the common bbox of the selected items.
1005     Geom::OptRect selected = enclose_items(items);
1019                         if ( std::find(items.begin(),items.end(),newref)==items.end()) {
1043     std::vector<SPItem*> items = selection->itemList();
1045     SPGroup const *group = sp_item_list_common_parent_group(items);
1065     std::vector<SPItem*> items = selection->itemList();
1066     if (items.empty()) {
1071     SPGroup const *group = sp_item_list_common_parent_group(items);
1079     // Determine the common bbox of the selected items.
1080     Geom::OptRect selected = enclose_items(items);
1083     std::vector<SPItem*> rev(items);
1098                         if (items.end()==std::find(items.begin(),items.end(),newref)) {
1127     std::vector<SPItem*> items =selection->itemList();
1129     SPGroup const *group = sp_item_list_common_parent_group(items);
1346 void sp_selection_change_layer_maintain_clones(std::vector<SPItem*> const &items,SPObject *where)
1348     for (std::vector<SPItem*>::const_iterator i = items.begin(); i != items.end(); ++i) {
1371     std::vector<SPItem*> items(selection->itemList());
1377         sp_selection_change_layer_maintain_clones(items,next);
1379         sp_selection_copy_impl(items, temp_clip, dt->doc()->getReprDoc());
1380         sp_selection_delete_impl(items, false, false);
1415     const std::vector<SPItem*> items(selection->itemList());
1421         sp_selection_change_layer_maintain_clones(items,next);
1423         sp_selection_copy_impl(items, temp_clip, dt->doc()->getReprDoc()); // we're in the same doc, so no need to copy defs
1424         sp_selection_delete_impl(items, false, false);
1458     std::vector<SPItem*> items(selection->itemList());
1462         sp_selection_change_layer_maintain_clones(items,moveto);
1464         sp_selection_copy_impl(items, temp_clip, dt->doc()->getReprDoc()); // we're in the same doc, so no need to copy defs
1465         sp_selection_delete_impl(items, false, false);
1509     std::vector<SPItem*> items = selection->itemList();
1510     for (std::vector<SPItem*>::const_iterator l=items.begin();l!=items.end() ;++l) {
1524 that case, items are already in the new position, but the repr is in the old, and this function
1554     std::vector<SPItem*> items = selection->itemList();
1555     for (std::vector<SPItem*>::const_iterator l=items.begin();l!=items.end() ;++l) {
1725     std::vector<Inkscape::XML::Node*> items = selection->reprList();
1726     for (std::vector<Inkscape::XML::Node*>::const_iterator l=items.begin();l!=items.end() ;++l) {
1825     std::vector<SPItem*> items = selection->itemList();
1827     for (std::vector<SPItem*>::const_iterator l=items.begin();l!=items.end() ;++l) {
1863  * Selects all the visible items with the same fill and/or stroke color/style as the items in the current selection
1889     std::vector<SPItem*> items = selection->itemList();
1899     for (std::vector<SPItem*>::const_iterator sel_iter=items.begin();sel_iter!=items.end();++sel_iter) {
1924  * Selects all the visible items with the same object type as the items in the current selection
1946     std::vector<SPItem*> items=selection->itemList();
1947     for (std::vector<SPItem*>::const_iterator sel_iter=items.begin();sel_iter!=items.end();++sel_iter) {
1964  * Find all items in src list that have the same fill or stroke style as sel
1965  * Return the list of matching items
2062  * Find all items in src list that have the same object type as sel by type
2063  * Return the list of matching items
2081  * Find all items in src list that have the same stroke style as sel by type
2082  * Return the list of matching items
2409 SPItem *next_item_from_list(SPDesktop *desktop, std::vector<SPItem*> const &items,
2413     for(std::vector<SPItem*>::const_iterator i = items.begin();i!=items.end();++i) {
2539     GSList const *items = selection->itemList();
2541     for (GSList *i = const_cast<GSList*>(items); i; i= i->next) {
2610     // sorting items from different parents sorts each parent's subset without possibly mixing them, just what we need
2665     std::vector<SPItem*> items=selection->itemList();
2666     for (std::vector<SPItem*>::const_iterator i=items.begin();i!=items.end();++i){
2703     std::vector<SPItem*> items=selection->itemList();
2704     for (std::vector<SPItem*>::const_reverse_iterator i=items.rbegin();i!=items.rend();++i){
2740         // Add ungrouped items to the new selection.
2770     std::vector<SPItem*> items=selection->itemList();
2771     if (items.size() != 1 || !item) {
2868     std::vector<SPItem*> items=selection->itemList();
2869     for (std::vector<SPItem*>::const_iterator i=items.begin();i!=items.end();++i){
2953     std::vector<SPItem*> items(selection->itemList());
2955     //items = g_slist_sort(items, (GCompareFunc) sp_object_compare_position);  // Why needed?
2958     SPObject *parent = items[0]->parent;
2972     for (std::vector<SPItem*>::const_reverse_iterator i=items.rbegin();i!=items.rend();++i){
2982         for (std::vector<SPItem*>::const_iterator i=items.begin();i!=items.end();++i){
3010         std::vector<SPItem*> items=sp_item_group_item_list(group);
3011         for (std::vector<SPItem*>::const_iterator i=items.begin();i!=items.end();++i){
3027     std::vector<SPItem*> items(selection->itemList());
3029     if (items.empty()) {
3042     for (std::vector<SPItem*>::const_iterator i=items.begin();i!=items.end();++i){
3048         sp_selection_delete_impl(items);
3093     std::vector<SPObject*> items(selection->list());
3094     sort(items.begin(),items.end(),sp_object_compare_position_bool);
3097     Inkscape::XML::Node *the_first_repr = items[0]->getRepr();
3104     if( items.size() == 1 ) {
3105         SPObject *object = items[0];
3116                 items = object->childList(false);
3159     // Move selected items to new <symbol>
3160     for (std::vector<SPObject*>::const_reverse_iterator i=items.rbegin();i!=items.rend();++i){
3305     std::vector<SPItem*> items (selection->itemList());
3307     sort(items.begin(),items.end(),sp_object_compare_position_bool);
3310     SPObject *parent = items[0]->parent;
3324     gint pos = items[0]->getRepr()->position();
3328     for (std::vector<SPItem*>::const_iterator i=items.begin();i!=items.end();++i){
3337         for (std::vector<SPItem*>::const_iterator i=items.begin();i!=items.end();++i){
3410     std::vector<SPItem*> items(selection->itemList());
3411     for (std::vector<SPItem*>::const_reverse_iterator i=items.rbegin();i!=items.rend();++i){
3566     // List of the items to show; all others will be hidden
3567     std::vector<SPItem*> items(selection->itemList());
3569     // Sort items so that the topmost comes last
3570     sort(items.begin(),items.end(),sp_item_repr_compare_position_bool);
3581                                             items[0]->getRepr()->attribute("id"),
3601     gint pos = items.back()->getRepr()->position();
3602     SPObject *parent_object = items.back()->parent;
3692                        items);
3788             topmost --; // only reduce count for those items deleted from topmost_parent
3893     std::vector<SPItem*> items(selection->itemList());
3895     sort(items.begin(),items.end(),sp_object_compare_position_bool);
3912         // all selected items are used for mask, which is applied to a layer
3916     for (std::vector<SPItem*>::const_iterator i=items.begin();i!=items.end();++i) {
3917         if((!topmost && !apply_to_layer && *i == items.front())
3918                 || (topmost && !apply_to_layer && *i == items.back())
3940     items.clear();
4055     std::vector<SPItem*> items(selection->itemList());
4059     std::vector<SPItem*> items_to_select(items);
4064     for (std::vector<SPItem*>::const_iterator i=items.begin();i!=items.end();++i){