Searched refs:Find (Results 1 - 5 of 5) sorted by relevance

/inkscape/src/ui/dialog/
H A Dfind.cpp69 Find::Find() function in class:Inkscape::UI::Dialog::Find
72 entry_find(_("F_ind:"), _("Find objects by their content or properties (exact or partial match)")),
108 C_("Find dialog", "Clones"), _("Search clones"), false),
219 expander_options.property_expanded().signal_changed().connect(sigc::mem_fun(*this, &Find::onExpander));
220 button_find.signal_clicked().connect(sigc::mem_fun(*this, &Find::onFind));
221 button_replace.signal_clicked().connect(sigc::mem_fun(*this, &Find::onReplace));
222 check_searchin_text.signal_clicked().connect(sigc::mem_fun(*this, &Find::onSearchinText));
223 check_searchin_property.signal_clicked().connect(sigc::mem_fun(*this, &Find::onSearchinProperty));
224 check_alltypes.signal_clicked().connect(sigc::mem_fun(*this, &Find
[all...]
H A Dfind.h2 * @brief Find dialog
41 * The Find class defines the Find and replace dialog.
43 * The Find and replace dialog allows you to search within the
50 class Find : public UI::Widget::Panel { class in namespace:Inkscape::UI::Dialog
52 Find();
53 virtual ~Find();
59 static Find &getInstance() { return *new Find(); }
157 * Find
[all...]
H A Ddialog-manager.cpp115 registerFactory("Find", &create<Find, FloatingBehavior>);
154 registerFactory("Find", &create<Find, DockBehavior>);
/inkscape/src/livarot/
H A Dsweep-tree.h45 int Find(Geom::Point const &iPt, SweepTree *newOne, SweepTree *&insertL,
47 int Find(Geom::Point const &iPt, SweepTree *&insertL, SweepTree *&insertR);
H A Dsweep-tree.cpp79 SweepTree::Find(Geom::Point const &px, SweepTree *newOne, SweepTree *&insertL, function in class:SweepTree
135 return (static_cast<SweepTree *>(child[LEFT]))->Find(px, newOne,
149 return (static_cast<SweepTree *>(child[RIGHT]))->Find(px, newOne,
167 SweepTree::Find(Geom::Point const &px, SweepTree * &insertL, function in class:SweepTree
194 return (static_cast<SweepTree *>(child[LEFT]))->Find(px, insertL,
215 return (static_cast<SweepTree *>(child[RIGHT]))->Find(px, insertL,
285 list.racine->Find(iDst->getPoint(iAtPoint).x, this,
311 // and then insert all the other in a doubly-linked list fashion. this avoids the Find() call, but is O(d^2) worst-case

Completed in 29 milliseconds