Searched refs:second (Results 1 - 25 of 130) sorted by relevance

123456

/inkscape/src/libdepixelize/priv/
H A Dbranchless.h39 T first_if(T first, T second, bool cond) argument
41 return cond ? first : second;
/inkscape/src/2geom/
H A Dintersection.h56 , second(tb)
63 , second(tb)
79 swap(a.second, b.second);
85 if (second != other.second) return false;
90 if (first == other.first && second < other.second) return true;
98 TimeB second; member in class:Geom::Intersection
120 result.push_back(Intersection<A, B>(in[i].second, i
[all...]
/inkscape/src/ui/tool/
H A Dcurve-drag-point.cpp50 NodeList::iterator second = first.next(); local
53 if (first->front()->isDegenerate() && second->back()->isDegenerate()) {
56 // delta is a vector equal 1/3 of distance from first to second
57 Geom::Point delta = (second->position() - first->position()) / 3.0;
61 second->back()->move(second->back()->position() - delta);
72 NodeList::iterator second = first.next(); local
77 second->back()->retract();
108 second->back()->move(second
[all...]
H A Dmulti-path-manipulator.cpp84 join_iters.erase(closest_pair.second);
88 /** After this function, first should be at the end of path and second at the beginnning.
92 if (&NodeList::get(join_iters.first) == &NodeList::get(join_iters.second)) {
94 std::swap(join_iters.first, join_iters.second);
99 NodeList &sp_second = NodeList::get(join_iters.second);
101 if (join_iters.second.next()) { // second is begin
103 } else { // second is end
104 std::swap(join_iters.first, join_iters.second);
107 if (join_iters.second
[all...]
H A Dmulti-path-manipulator.h86 ((i->second.get())->*method)();
92 ((i->second.get())->*method)(a);
98 ((i->second.get())->*method)(a);
104 ((i->second.get())->*method)(a, b);
H A Dmanipulator.h126 ((i->second.get())->*method)();
132 ((i->second.get())->*method)(a);
138 ((i->second.get())->*method)(a);
144 ((i->second.get())->*method)(a, b);
150 if ((*i).second->event(event_context, event)) return true;
/inkscape/src/libvpsc/pairingheap/
H A DPairingHeap.cpp204 * Links first and second together to satisfy heap order.
207 * second is root of tree 2, which may be NULL.
213 PairNode<T> *second ) const
215 if( second == NULL )
217 if( lessThan(second->element,first->element) )
219 // Attach first as leftmost child of second
220 second->prev = first->prev;
221 first->prev = second;
222 first->nextSibling = second->leftChild;
225 second
[all...]
/inkscape/src/libdepixelize/
H A Dkopftracer2011.cpp55 * From (first) the top left corner to (second) the bottom right.
59 * From (first) the top right to (second) the bottom left.
405 PixelGraph::iterator b = it->second.first;
406 PixelGraph::iterator c = it->second.second;
407 PixelGraph::iterator d = it->first.second;
446 PixelGraph::iterator b = edges[i].second.first;
447 PixelGraph::iterator c = edges[i].second.second;
448 PixelGraph::iterator d = edges[i].first.second;
[all...]
/inkscape/src/svg/
H A Dtest-stubs.cpp33 long long int ret = it==int_prefs.end() ? def : it->second;
/inkscape/src/libcola/
H A Dconnected_components.cpp81 vs[ei->first].neighbours.push_back(&vs[ei->second]);
82 vs[ei->second].neighbours.push_back(&vs[ei->first]);
93 v=cmap[ei->second];
95 u.first->edges.push_back(make_pair(u.second,v.second));
103 new SimpleConstraint(u.second,v.second,c->gap));
111 new SimpleConstraint(u.second,v.second,c->gap));
H A Dcycle_detector.cpp59 // the second vertex of the edge is pushed onto another
63 cout << "vertex1: " << anEdge.first << ", vertex2: " << anEdge.second << endl;
71 newNode->dests.push_back(anEdge.second);
75 (*nodes)[anEdge.first]->dests.push_back(anEdge.second);
79 if (!find_node(nodes, anEdge.second)) {
81 cerr << "Making a new vector indexed at: " << anEdge.second << endl;
84 newNode = new Node(anEdge.second);
85 (*nodes)[anEdge.second] = newNode;
176 traverse.erase(haveSeen.second);
H A Dgradient_projection.h58 cs.push_back(new vpsc::Constraint(vl, vs[o->first], o->second));
59 cs.push_back(new vpsc::Constraint(vs[o->first], vr, o->second));
126 cs.push_back(new vpsc::Constraint(left,v,(*cit).second));
131 cs.push_back(new vpsc::Constraint(v,right,(*cit).second));
226 gcs.push_back(new vpsc::Constraint(v,vars[o->first],o->second,true));
/inkscape/src/
H A Dcolor-rgba.h128 * value are multiplied by 1.0 - weight and the second object by weight.
131 * @param second The second RGBA, with this being the first
133 * this while one is all the second. Default is
136 ColorRGBA average (const ColorRGBA &second, const float weight = 0.5) const { argument
140 returnval[i] = _c[i] * (1.0 - weight) + second[i] * weight;
H A Dline-snapper.cpp38 Geom::Point const p1 = i->second; // point at guide/grid line
40 // std::cout << " line through " << i->second << " with normal " << i->first;
47 _addSnappedLine(isr, p_proj, dist, p.getSourceType(), p.getSourceNum(), i->first, i->second);
63 if ((*it_origin_or_vector).second) { // if "second" is true then "first" is a vector, otherwise it's a point
110 Geom::Line gridguide_line(i->second, i->second + Geom::rot90(i->first));
H A Ddeptool.cpp403 FileRec *frec = iter->second;
409 FileRec *frec = iter->second;
415 FileRec *frec = iter->second;
764 FileRec *other = iter->second;
782 FileRec *other = iter->second;
896 FileRec *child = iter->second;
920 FileRec *frec = iter->second;
931 FileRec *child = iter->second;
952 FileRec *frec = iter->second;
962 FileRec *include = iter->second;
[all...]
H A Dtext-tag-attributes.h78 first section (0..index-1) stay in this object, the second section
79 (index..end) go in \a second. This function is generally used when
81 void split(unsigned index, TextTagAttributes *second);
85 contents of \a second after \a second_index. */
86 void join(TextTagAttributes const &first, TextTagAttributes const &second, unsigned second_index);
H A Dcolor.cpp33 static bool profileMatches( SVGICCColor const* first, SVGICCColor const* second );
120 static bool profileMatches( SVGICCColor const* first, SVGICCColor const* second ) {
122 if ( !first && !second ) {
125 match = first && second
126 && (first->colorProfile == second->colorProfile)
127 && (first->colors.size() == second->colors.size());
130 match &= (fabs(first->colors[i] - second->colors[i]) < PROFILE_EPSILON);
H A Dsp-marker.cpp221 for (unsigned i = 0 ; i < it->second.items.size() ; ++i) {
222 if (it->second.items[i]) {
223 Inkscape::DrawingGroup *g = dynamic_cast<Inkscape::DrawingGroup *>(it->second.items[i]);
334 if (it->second.items.size() != size ) {
337 it->second.items.clear();
339 it->second.items.push_back(NULL);
372 SPMarkerView *view = &(it->second);
/inkscape/src/ui/cache/
H A Dsvg_preview_cache.cpp81 g_object_unref(i->second);
82 i->second = NULL;
99 return found->second;
127 g_object_unref(found->second);
128 found->second = NULL;
/inkscape/src/debug/
H A Ddemangle.cpp58 result = (*found).second;
/inkscape/src/util/
H A Dunits.cpp229 return u->second;
273 delete iter->second;
289 return &(*f->second);
306 return &(*f->second);
317 if (cit->second->type == type) {
318 if (Geom::are_near(cit->second->factor, factor, eps)) {
327 return cit->second;
369 delete (*iter).second;
388 if (iter->second->type == type) {
389 submap.insert(UnitMap::value_type(iter->second
[all...]
/inkscape/src/display/
H A Dnr-filter-morphology.cpp93 while(!vals[p].empty() && !comp(vals[p].back().second, *in_p)) vals[p].pop_back(); // useless
97 while(!vals[p].empty() && !comp(vals[p].back().second, 0)) vals[p].pop_back();
102 *out_p = vals[p].front().second;
113 while(!vals[p].empty() && !comp(vals[p].back().second, *in_p)) vals[p].pop_back(); // useless
125 while(!vals[p].empty() && !comp(vals[p].back().second, *in_p)) vals[p].pop_back(); // useless
129 *out_p = vals[p].front().second;
140 while(!vals[p].empty() && !comp(vals[p].back().second, 0)) vals[p].pop_back();
149 *out_p = vals[p].front().second;
H A Dnr-filter-slot.cpp62 cairo_surface_destroy(i->second);
127 return s->second;
218 cairo_surface_destroy(s->second);
253 return s->second;
/inkscape/src/live_effects/parameter/
H A Dfilletchamferpointarray.cpp416 if(positions.second != 0){
452 Geom::Curve * B = subpaths[positions.first][positions.second].duplicate();
454 if(positions.second != 0){
455 A = subpaths[positions.first][positions.second-1].duplicate();
491 curve_it1 = subpaths[positions.first][positions.second].duplicate();
507 time_it2 = modf(to_time(index - positions.second , _vector[index - positions.second ][X]), &intpart);
508 resultLenght = it1_length + to_len(index - positions.second, _vector[index - positions.second ][X]);
526 if ((subpaths[positions.first].closed() && last && _vector[index - positions.second][
544 std::size_t second = 0; local
[all...]
/inkscape/src/xml/
H A Dnode-fns.cpp35 return found->second;

Completed in 51 milliseconds

123456