Searched refs:pairs (Results 1 - 3 of 3) sorted by relevance

/inkscape/src/2geom/
H A Dsweep-bounds.cpp26 * \brief Make a list of pairs of self intersections in a list of Rects.
31 * [(A = rs[i], B = rs[j]) for i,J in enumerate(pairs) for j in J]
37 std::vector<std::vector<unsigned> > pairs(rs.size());
56 pairs[jx].push_back(ix);
62 return pairs;
66 * \brief Make a list of pairs of red-blue intersections between two lists of Rects.
72 * [(A = rs[i], B = rs[j]) for i,J in enumerate(pairs) for j in J]
76 std::vector<std::vector<unsigned> > pairs(a.size());
77 if(a.empty() || b.empty()) return pairs;
110 pairs[j
[all...]
/inkscape/src/ui/dialog/
H A Ddocument-properties.cpp434 std::vector<std::pair<Glib::ustring, Glib::ustring> > pairs = ColorProfile::getProfileFilesWithNames(); local
435 for ( std::vector<std::pair<Glib::ustring, Glib::ustring> >::const_iterator it = pairs.begin(); it != pairs.end(); ++it ) {
492 std::vector<std::pair<Glib::ustring, Glib::ustring> > pairs = ColorProfile::getProfileFilesWithNames(); local
493 Glib::ustring file = pairs[row].first;
494 Glib::ustring name = pairs[row].second;
/inkscape/src/ui/tool/
H A Dmulti-path-manipulator.cpp52 /** Find pairs of selected endnodes suitable for joining. */
53 void find_join_iterators(ControlPointSelection &sel, IterPairList &pairs) argument
67 // Below we find the closest pairs. The algorithm is O(N^3).
68 // We can go down to O(N^2 log N) by using O(N^2) memory, by putting all pairs
82 pairs.push_back(closest_pair);

Completed in 23 milliseconds