/inkscape/src/util/ |
H A D | map-list.h | 2 * Inkscape::Util::map_list - apply a function over a list 16 #include "util/list.h" 41 inline MutableList<T1> map_list(UnaryFunction f, List<T2> list) { argument 42 return map_list(f, list, List<T2>());
|
H A D | reverse-list.h | 2 * Inkscape::Util::reverse_list - generate a reversed list from iterator range 15 #include "util/list.h" 16 #include "util/list-copy.h" 35 reverse_list(List<T> const &list) { argument 36 return reverse_list(list, List<T>());
|
H A D | filter-list.h | 2 * Inkscape::Util::filter_list - select a subset of the items in a list 15 #include "util/list.h" 16 #include "util/list-copy.h" 47 filter_list(UnaryPredicate p, List<T> const &list) { argument 48 return filter_list(p, list, List<T>());
|
H A D | list.h | 37 bool is_empty(List<T> const &list); 40 typename List<T>::reference first(List<T> const &list); 43 List<T> const &rest(List<T> const &list); 46 MutableList<T> &rest(MutableList<T> const &list); 49 MutableList<T> const &set_rest(MutableList<T> const &list, 98 * Generic linked list. 113 * If you need to create an empty list (which can, for example, be used 197 * Like a linked list, but one whose tail can be exchanged for 201 * As with List, you can create an empty list like so: 229 * Creates a (non-empty) linked list 297 is_empty(List<T> const &list) argument 322 first(List<T> const &list) argument 343 rest(List<T> const &list) argument 369 rest(MutableList<T> const &list) argument 391 set_rest(MutableList<T> const &list, MutableList<T> const &rest) argument [all...] |
H A D | list-container.h | 17 #include "util/list.h" 239 MutableList<T> list=_head; local 241 return list;
|
/inkscape/src/ |
H A D | composite-undo-stack-observer.cpp | 105 CompositeUndoStackObserver::_remove_one(UndoObserverRecordList& list, UndoStackObserver& o) argument 109 UndoObserverRecordList::iterator i = std::find_if(list.begin(), list.end(), std::bind1st(std::equal_to< UndoStackObserverRecord >(), eq_comp)); 111 if (i != list.end()) { 112 list.erase(i); 120 CompositeUndoStackObserver::_mark_one(UndoObserverRecordList& list, UndoStackObserver& o) argument 124 UndoObserverRecordList::iterator i = std::find_if(list.begin(), list.end(), std::bind1st(std::equal_to< UndoStackObserverRecord >(), eq_comp)); 126 if (i != list.end()) {
|
H A D | snapped-point.cpp | 133 bool getClosestSP(std::list<Inkscape::SnappedPoint> const &list, Inkscape::SnappedPoint &result) argument 137 for (std::list<Inkscape::SnappedPoint>::const_iterator i = list.begin(); i != list.end(); ++i) { 138 if ((i == list.begin()) || (*i).getSnapDistance() < result.getSnapDistance()) {
|
H A D | snapped-curve.cpp | 167 bool getClosestCurve(std::list<Inkscape::SnappedCurve> const &list, Inkscape::SnappedCurve &result, bool exclude_paths) argument 171 for (std::list<Inkscape::SnappedCurve>::const_iterator i = list.begin(); i != list.end(); ++i) { 175 if ((i == list.begin()) || (*i).getSnapDistance() < result.getSnapDistance()) { 185 bool getClosestIntersectionCS(std::list<Inkscape::SnappedCurve> const &list, Geom::Point const &p, Inkscape::SnappedPoint &result, Geom::Affine dt2doc) argument 189 for (std::list<Inkscape::SnappedCurve>::const_iterator i = list [all...] |
H A D | snapped-line.cpp | 175 bool getClosestSLS(std::list<Inkscape::SnappedLineSegment> const &list, Inkscape::SnappedLineSegment &result) argument 179 for (std::list<Inkscape::SnappedLineSegment>::const_iterator i = list.begin(); i != list.end(); ++i) { 180 if ((i == list.begin()) || (*i).getSnapDistance() < result.getSnapDistance()) { 190 bool getClosestIntersectionSLS(std::list<Inkscape::SnappedLineSegment> const &list, Inkscape::SnappedPoint &result) argument 194 for (std::list<Inkscape::SnappedLineSegment>::const_iterator i = list [all...] |
H A D | document.h | 164 void getPerspectivesInDefs(std::vector<Persp3D*> &list) const; 167 std::vector<Persp3D*> list; local 168 getPerspectivesInDefs(list); 169 return list.size(); 210 // A list of svg documents being used or shown within this document 235 * Returns the bottommost item from the list which is at the point, or NULL if none. 237 static SPItem *getItemFromListAtPointBottom(unsigned int dkey, SPGroup *group, const std::vector<SPItem*> &list, Geom::Point const &p, bool take_insensitive = false);
|
H A D | path-chemistry.cpp | 87 assert(!items.empty()); // cannot be NULL because of list length check at top of function 235 GSList *list = curve->split(); local 240 for (GSList *l = list; l != NULL; l = l->next) { 263 if (l == list) 272 g_slist_free(list);
|
H A D | sp-clippath.cpp | 40 static SPClipPathView* sp_clippath_view_new_prepend(SPClipPathView *list, unsigned int key, Inkscape::DrawingItem *arenaitem); 41 static SPClipPathView* sp_clippath_view_list_remove(SPClipPathView *list, SPClipPathView *view); 268 sp_clippath_view_new_prepend(SPClipPathView *list, unsigned int key, Inkscape::DrawingItem *arenaitem) argument 272 new_path_view->next = list; 281 sp_clippath_view_list_remove(SPClipPathView *list, SPClipPathView *view) argument 283 if (view == list) { 284 list = list->next; 287 prev = list; 295 return list; [all...] |
H A D | sp-mask.cpp | 37 SPMaskView *sp_mask_view_new_prepend (SPMaskView *list, unsigned int key, Inkscape::DrawingItem *arenaitem); 38 SPMaskView *sp_mask_view_list_remove (SPMaskView *list, SPMaskView *view); 289 sp_mask_view_new_prepend (SPMaskView *list, unsigned int key, Inkscape::DrawingItem *arenaitem) argument 293 new_mask_view->next = list; 302 sp_mask_view_list_remove (SPMaskView *list, SPMaskView *view) argument 304 if (view == list) { 305 list = list->next; 308 prev = list; 316 return list; [all...] |
/inkscape/src/widgets/ |
H A D | sp-xmlview-attr-list.h | 24 GtkTreeView list; member in struct:SPXMLViewAttrList 34 void (* row_changed) (SPXMLViewAttrList *list, gint row); 40 #define SP_XMLVIEW_ATTR_LIST_GET_REPR(list) (SP_XMLVIEW_ATTR_LIST (list)->repr) 42 void sp_xmlview_attr_list_set_repr (SPXMLViewAttrList * list, Inkscape::XML::Node * repr); 43 void sp_xmlview_attr_list_select_row_by_key(SPXMLViewAttrList * list, const gchar *name); 45 /* Attribute list store columns */
|
H A D | sp-xmlview-attr-list.cpp | 21 #include "sp-xmlview-attr-list.h" 70 sp_xmlview_attr_list_set_repr (SPXMLViewAttrList * list, Inkscape::XML::Node * repr) argument 72 if ( repr == list->repr ) return; 73 if (list->repr) { 74 gtk_list_store_clear(list->store); 75 sp_repr_remove_listener_by_data (list->repr, list); 76 Inkscape::GC::release(list->repr); 78 list->repr = repr; 81 sp_repr_add_listener (repr, &repr_events, list); 109 sp_xmlview_attr_list_init(SPXMLViewAttrList * list) argument 121 SPXMLViewAttrList * list; local 135 sp_xmlview_attr_list_select_row_by_key(SPXMLViewAttrList * list, const gchar *name) argument 169 SPXMLViewAttrList * list; local [all...] |
/inkscape/src/libcola/ |
H A D | cycle_detector.cpp | 1 /* Cycle detector that returns a list of 233 bool CycleDetector::find_node(std::vector<Node *> *& list, unsigned k) { argument 235 if ((*list)[i] != NULL) { 236 if ((*list)[i]->id == k) { return true; } 243 pair< bool, vector<unsigned>::iterator > CycleDetector::find_node(std::vector<unsigned>& list, unsigned k) { argument
|
/inkscape/src/libnrtype/ |
H A D | nr-type-primitives.cpp | 20 * An entry in a list of key->value pairs 39 * Calls the destructor for each item in list 42 nr_name_list_release (NRNameList *list) argument 44 if (list->destructor) { 45 list->destructor (list); 50 nr_style_list_release (NRStyleList *list) argument 52 if (list->destructor) { 53 list->destructor (list); [all...] |
/inkscape/src/ui/widget/ |
H A D | style-subject.h | 47 virtual std::vector<SPObject*> list(){return std::vector<SPObject*>();}; function in class:Inkscape::UI::Widget::StyleSubject 70 virtual std::vector<SPObject*> list(); 91 virtual std::vector<SPObject*> list();
|
H A D | style-subject.cpp | 58 std::vector<SPObject*> StyleSubject::Selection::list(){ function in class:Inkscape::UI::Widget::StyleSubject::Selection 61 return selection->list(); 135 std::vector<SPObject*> StyleSubject::CurrentLayer::list(){ function in class:Inkscape::UI::Widget::StyleSubject::CurrentLayer 136 std::vector<SPObject*> list; local 137 list.push_back(_element); 138 return list; 151 std::vector<SPItem*> list; local 154 list.push_back((SPItem*)i); 155 return sp_desktop_query_style_from_list(list, query, property);
|
/inkscape/src/libcroco/ |
H A D | cr-prop-list.c | 23 #include "cr-prop-list.h" 69 *@a_to_append: the property list to append 71 *Appends a property list to the current one. 73 *Returns the resulting prop list, or NULL if an error 86 /*go fetch the last element of the list */ 99 *the current prop list. 104 *Returns the resulting property list, or NULL in case 112 CRPropList *list = NULL, local 117 list = cr_prop_list_allocate (); 118 g_return_val_if_fail (list 167 CRPropList *list = NULL, local [all...] |
/inkscape/src/ui/tool/ |
H A D | manipulator.h | 101 void setItems(GSList const *list) { argument 106 for (GSList *i = const_cast<GSList*>(list); i; i = i->next) {
|
/inkscape/src/helper/ |
H A D | pixbuf-ops.cpp | 39 * Hide all items that are not listed in list, recursively, skipping groups and defs. 41 static void hide_other_items_recursively(SPObject *o, GSList *list, unsigned dkey) argument 49 && !g_slist_find(list, o) ) 55 if (!g_slist_find(list, o)) { 57 hide_other_items_recursively(child, list, dkey);
|
/inkscape/src/livarot/ |
H A D | sweep-tree.cpp | 2 #include "livarot/sweep-tree-list.h" 251 SweepTree::Remove(SweepTreeList &list, SweepEventQueue &queue, argument 255 AVLTree *tempR = static_cast<AVLTree *>(list.racine); 257 list.racine = static_cast<SweepTree *>(tempR); 259 if (list.nbTree <= 1) 261 list.nbTree = 0; 262 list.racine = NULL; 266 if (list.racine == list.trees + (list 274 Insert(SweepTreeList &list, SweepEventQueue &queue, Shape *iDst, int iAtPoint, bool rebalance, bool sweepSens) argument 315 InsertAt(SweepTreeList &list, SweepEventQueue &queue, Shape * , SweepTree *insNode, int fromPt, bool rebalance, bool sweepSens) argument [all...] |
/inkscape/src/extension/param/ |
H A D | notebook.cpp | 60 void paramString (std::list <std::string> &list); 94 for (GSList * list = parameters; list != NULL; list = g_slist_next(list)) { 95 Parameter * param = reinterpret_cast<Parameter *>(list->data); 102 void ParamNotebookPage::paramString(std::list <std::string> &list) argument 106 param->string(list); [all...] |
/inkscape/src/trace/ |
H A D | trace.cpp | 68 std::vector<SPItem*> const list = sel->itemList(); member in class:Inkscape::Trace::std 77 for (std::vector<SPItem*>::const_iterator i=list.begin() ; list.end()!=i ; ++i)
|