Searched defs:to (Results 1 - 25 of 30) sorted by relevance

12

/inkscape/src/2geom/
H A Dcoord.cpp18 * in the file COPYING-LGPL-2.1; if not, write to the Free Software
23 * The contents of this file are subject to the Mozilla Public License
49 // contributors may be used to endorse or promote products derived
122 Vector<T> SubVector(int from, int to) { argument
123 ASSERT(to <= length_);
124 ASSERT(from < to);
126 return Vector<T>(start() + from, to - from);
194 // By adding 1U << 31 to tmp we round the final result.
333 // We consider denormals not to be special.
572 // Requires this to hav
[all...]
H A Dpath.cpp20 * in the file COPYING-LGPL-2.1; if not, write to the Free Software
25 * The contents of this file are subject to the Mozilla Public License
60 PathInterval::PathInterval(PathTime const &from, PathTime const &to, bool cross_start, size_type path_size) argument
62 , _to(to)
65 , _reverse(cross_start ? to >= from : to < from)
206 PathInterval PathInterval::from_direction(PathTime const &from, PathTime const &to, bool reversed, size_type path_size)
210 result._to = to;
231 result._cross_start = from < to;
233 result._cross_start = to < fro
[all...]
H A Dcrossing.cpp15 double wrap_dist(double from, double to, double size, bool rev) { argument
17 if(to > from) {
18 return from + (size - to);
20 return from - to;
23 if(to < from) {
24 return to + (size - from);
26 return to - from;
80 // list of sets of edges, each set corresponding to those emanating from the path
184 // A crossing is considered to be a duplicate when it has both t_a and t_b near to anothe
[all...]
H A Dnearest-time.cpp18 * in the file COPYING-LGPL-2.1; if not, write to the Free Software
23 * The contents of this file are subject to the Mozilla Public License
40 Coord nearest_time(Point const &p, D2<Bezier> const &input, Coord from, Coord to) argument
42 Interval domain(from, to);
46 THROW_RANGEERROR("[from,to] interval out of bounds");
98 * related to the interval [from, to], to the point "p".
100 * The function return the first nearest time value to "p" that is found.
106 double from, double to )
142 all_nearest_times(Point const &p, D2<SBasis> const &c, D2<SBasis> const &dc, double from, double to) argument
192 nearest_time(Point const &p, Piecewise< D2<SBasis> > const &c, double from, double to) argument
242 all_nearest_times(Point const &p, Piecewise< D2<SBasis> > const &c, double from, double to) argument
[all...]
H A Dbezier.cpp22 * in the file COPYING-LGPL-2.1; if not, write to the Free Software
27 * The contents of this file are subject to the Mozilla Public License
45 /* This is inelegant, as it uses several extra stores. I think there might be a way to
48 // initialize return vector with zeroes, such that we only need to replace the non-zero derivs
232 Bezier portion(Bezier const &a, double from, double to) argument
237 if (from > to) {
238 std::swap(from, to);
244 if (to == 1) {
247 casteljau_subdivision<double>(to, &ret.c_[0], &ret.c_[0], NULL, ret.order());
251 if (to
[all...]
H A Dpiecewise.h15 * in the file COPYING-LGPL-2.1; if not, output to the Free Software
20 * The contents of this file are subject to the Mozilla Public License
51 * SBasis to properly invert the original.
77 //segs[i] stretches from cuts[i] to cuts[i+1].
127 //TODO: maybe it is not a good idea to have this?
138 /**Convenience/implementation hiding function to add segment/cut pairs.
141 inline void push(const T &s, double to) { argument
144 push_cut(to);
147 inline void push(T &&s, double to) { argument
150 push_cut(to);
345 elem_portion(const Piecewise<T> &a, unsigned i, double from, double to) argument
[all...]
H A Dsbasis.cpp19 * in the file COPYING-LGPL-2.1; if not, write to the Free Software
24 * The contents of this file are subject to the Mozilla Public License
42 \param tail first term to chop
61 \param t position to evaluate
65 There is an elegant way to compute the value and n derivatives for a polynomial using a variant of horner's rule. Someone will someday work out how for sbasis.
81 \returns sbasis equal to a+b
103 \returns sbasis equal to a-b
125 \returns sbasis equal to a+b
144 \returns sbasis equal to a-b
163 \returns sbasis equal to
471 portion(const SBasis &t, double from, double to) argument
[all...]
/inkscape/src/
H A Dpersp3d-reference.cpp2 * The reference corresponding to the inkscape:perspectiveID attribute
24 _changed_connection = changedSignal().connect(sigc::bind(sigc::ptr_fun(persp3dreference_href_changed), this)); // listening to myself, this should be virtual instead
29 _changed_connection.disconnect(); // to do before unlinking
53 Persp3DReference::start_listening(Persp3D* to) argument
55 if ( to == NULL ) {
58 persp = to;
59 persp_repr = to->getRepr();
60 _delete_connection = to->connectDelete(sigc::bind(sigc::ptr_fun(&persp3dreference_delete_self), this));
61 _modified_connection = to->connectModified(sigc::bind<2>(sigc::ptr_fun(&persp3dreference_source_modified), this));
H A Dsp-tag-use-reference.cpp2 * The reference corresponding to href of <inkscape:tagref> element.
45 _changed_connection = changedSignal().connect(sigc::bind(sigc::ptr_fun(sp_usepath_href_changed), this)); // listening to myself, this should be virtual instead
55 _changed_connection.disconnect(); // to do before unlinking
62 SPTagUsePath::link(char *to) argument
64 if ( to == NULL ) {
68 if ( !sourceHref || ( strcmp(to, sourceHref) != 0 ) ) {
70 sourceHref = g_strdup(to);
72 attach(Inkscape::URI(to));
93 SPTagUsePath::start_listening(SPObject* to) argument
95 if ( to
[all...]
H A Dsp-use-reference.cpp2 * The reference corresponding to href of <use> element.
45 _changed_connection = changedSignal().connect(sigc::bind(sigc::ptr_fun(sp_usepath_href_changed), this)); // listening to myself, this should be virtual instead
55 _changed_connection.disconnect(); // to do before unlinking
62 SPUsePath::link(char *to) argument
64 if ( to == NULL ) {
68 if ( !sourceHref || ( strcmp(to, sourceHref) != 0 ) ) {
70 sourceHref = g_strdup(to);
72 attach(Inkscape::URI(to));
93 SPUsePath::start_listening(SPObject* to) argument
95 if ( to
[all...]
H A Dselection.h61 * UI elements can listen to.
70 * Constructs an selection object, bound to a particular
80 * Returns the layer model the selection is bound to (works in console or GUI mode)
82 * @return the layer model the selection is bound to, which is the same as the desktop
88 * Returns the desktop the selection is bound to
90 * @return the desktop the selection is bound to, or NULL if in console mode
97 * @return layer item the selection is bound to
102 * Add an SPObject to the set of selected objects.
104 * @param obj the SPObject to add
109 * Add an XML node's SPObject to th
180 add(InputIterator from, InputIterator to) argument
[all...]
H A Dunclump.cpp22 // Taking bbox of an item is an expensive operation, and we need to do it many times, so here we
72 Distance between "edges" of item1 and item2. An item is considered to be an ellipse inscribed into its w/h,
73 so its radius (distance from center to edge) depends on the w/h and the angle towards the other item.
85 // angle from each item's center to the other's, unsqueezed by its w/h, normalized to 0..pi/2
169 Average unclump_dist from item to others
192 Closest to item among others
240 i.e. those on the other side of the line through \a closest perpendicular to the direction from \a
241 item to \a closest. Returns a newly created list which must be freed.
249 // perpendicular through closest to th
308 unclump_pull(SPItem *to, SPItem *what, double dist) argument
[all...]
H A Dsp-offset.cpp50 * The goal is to have a source shape (= originalPath), an offset (= radius)
51 * and compute the offset of the source by the radius. To get it to work,
52 * one needs to know what the source is and what the radius is, and how it's
54 * to get lots of shape functionality for free. The source is the easy part:
58 * When built, the object will attach a listener vector to that object and
60 * is of course grossly inefficient, and also does not react to changes
61 * to the href'd during context stuff (like changing the shape of a star by
63 * the context (seems to be the case for SPEllipse). The computation of the
65 * a change occurs to the offset (change of source or change of radius).
67 * points, or more precisely one control point, that's enough to defin
991 sp_offset_start_listening(SPOffset *offset,SPObject* to) argument
[all...]
/inkscape/src/live_effects/
H A Dlpeobject-reference.cpp2 * The reference corresponding to the inkscape:live-effect attribute
30 _changed_connection = changedSignal().connect(sigc::bind(sigc::ptr_fun(lpeobjectreference_href_changed), this)); // listening to myself, this should be virtual instead
37 _changed_connection.disconnect(); // to do before unlinking
53 LPEObjectReference::link(const char *to) argument
55 if ( to == NULL ) {
59 if ( !lpeobject_href || ( strcmp(to, lpeobject_href) != 0 ) ) {
61 lpeobject_href = g_strdup(to);
63 attach(Inkscape::URI(to));
84 LPEObjectReference::start_listening(LivePathEffectObject* to) argument
86 if ( to
[all...]
/inkscape/src/display/
H A Dsp-canvas-util.cpp52 Geom::Affine sp_canvas_item_i2i_affine (SPCanvasItem * from, SPCanvasItem * to) argument
55 g_assert (to != NULL);
57 return sp_canvas_item_i2w_affine(from) * sp_canvas_item_i2w_affine(to).inverse();
H A Ddrawing-context.cpp44 // TODO: it might be better to treat this occurence as a bug
105 double to = angle.finalAngle(); local
106 if (to > from) {
107 cairo_arc(_ct, center[X], center[Y], radius, from, to);
109 cairo_arc_negative(_ct, center[X], center[Y], radius, to, from);
/inkscape/src/livarot/
H A Dsweep-event.cpp110 int to = inds[n]; local
112 relocate(&events[--nbEvt], to);
119 to = inds[moveInd];
121 events[to].ind = n;
122 inds[n] = to;
125 Geom::Point const px = events[to].posx;
133 events[to].ind = half;
135 inds[half] = to;
162 events[to].ind = child1;
164 inds[child1] = to;
207 relocate(SweepEvent *e, int to) argument
[all...]
H A DAVL.cpp12 * the algorithm explanation for this code comes from purists.org, which seems to have disappeared since
909 AVLTree::Relocate (AVLTree * to) argument
912 elem[LEFT]->elem[RIGHT] = to;
914 elem[RIGHT]->elem[LEFT] = to;
915 to->elem[LEFT] = elem[LEFT];
916 to->elem[RIGHT] = elem[RIGHT];
921 parent->child[LEFT] = to;
923 parent->child[RIGHT] = to;
927 child[RIGHT]->parent = to;
931 child[LEFT]->parent = to;
[all...]
H A Dsweep-tree.cpp10 * that structure is very sensitive to anything
75 // we want to order with respect to the order of intersections with the sweepline, currently
90 // rotate to get the normal to the edge
96 // compute (px-orig)^dir to know on which side of this edge the point px lies
105 // that damn point px lies on me, so i need to consider to direction of the edge in
106 // newOne to know if it goes toward my left side or my right side
310 // get a set of edge that are to b
470 Relocate(SweepTree * to) argument
[all...]
H A DShapeRaster.cpp21 * nothing unusual in this implementation, so nothing special to say
117 // 2 versions of the Scan() series to move the scanline to a given position withou actually computing coverages
118 void Shape::Scan(float &pos, int &curP, float to, float step) argument
124 if ( pos == to ) {
133 Direction const d = (pos < to) ? DOWNWARDS : UPWARDS;
136 // until we reach the wanted position to.
137 // don't forget to update curP and pos when we're done
139 while ( ( d == DOWNWARDS && curPt < numberOfPoints() && getPoint(curPt).x[1] <= to) ||
140 ( d == UPWARDS && curPt > 0 && getPoint(curPt - 1).x[1] >= to) )
275 QuickScan(float &pos,int &curP, float to, bool , float step) argument
609 DirectScan(float &pos, int &curP, float to, float step) argument
708 DirectQuickScan(float &pos, int &curP, float to, bool , float step) argument
801 Scan(float &pos, int &curP, float to, FloatLigne *line, bool exact, float step) argument
949 Scan(float &pos, int &curP, float to, FillRule directed, BitLigne *line, bool exact, float step) argument
1122 Scan(float &pos, int &curP, float to, AlphaLigne *line, bool exact, float step) argument
1232 QuickScan(float &pos, int &curP, float to, FloatLigne* line, float step) argument
1371 QuickScan(float &pos, int &curP, float to, FillRule directed, BitLigne* line, float step) argument
1521 QuickScan(float &pos, int &curP, float to, AlphaLigne* line, float step) argument
1619 CreateEdge(int no, float to, float step) argument
1653 AvanceEdge(int no, float to, bool exact, float step) argument
1685 DestroyEdge(int no, float to, FloatLigne* line) argument
1733 AvanceEdge(int no, float to, FloatLigne *line, bool exact, float step) argument
1810 AvanceEdge(int no, float to, BitLigne *line, bool exact, float step) argument
1882 AvanceEdge(int no, float to, AlphaLigne *line, bool exact, float step) argument
[all...]
/inkscape/src/live_effects/parameter/
H A Doriginalpatharray.cpp130 _("Link path parameter to path"));
146 { // Paste path to link button
155 pButton->set_tooltip_text(_("Link to path"));
293 // add '#' at start to make it an uri.
315 _("Link path parameter to path"));
318 void OriginalPathArrayParam::unlink(PathAndDirection* to) argument
320 to->linked_modified_connection.disconnect();
321 to->linked_delete_connection.disconnect();
322 to->ref.detach();
323 to
330 remove_link(PathAndDirection* to) argument
363 linked_changed(SPObject * , SPObject *new_obj, PathAndDirection* to) argument
382 setPathVector(SPObject *linked_obj, guint , PathAndDirection* to) argument
404 linked_modified(SPObject *linked_obj, guint flags, PathAndDirection* to) argument
[all...]
H A Dpath.cpp15 #include <2geom/sbasis-to-bezier.h>
37 // required for linking to other paths
200 pButton->set_tooltip_text(_("Link to path on clipboard"));
246 * Only applies transform when not referring to other path!
251 // only apply transform when not referring to other path
271 // After the whole "writing to svg avalanche of function calling": force value upon pwd2 and don't recalculate.
283 * If this PathParam refers to another path, this link is removed (and replaced with explicit path data).
286 * The new path data is written to SVG. In this case the signal_path_changed signal
287 * is not directly emited in this method, because writing to SVG
288 * triggers the LPEObject to whic
335 start_listening(SPObject * to) argument
[all...]
/inkscape/src/extension/internal/filter/
H A Dfilter.cpp71 Filter::merge_filters( Inkscape::XML::Node * to, Inkscape::XML::Node * from, argument
83 to->setAttribute(attr, from->attribute(attr));
87 to->setAttribute(attr, srcGraphic);
91 to->setAttribute(attr, srcGraphicAlpha);
103 to->appendChild(to_child);
127 // TODO need to properly refcount the items, at least
/inkscape/src/libnrtype/
H A DFontInstance.cpp113 // Note: Freetype 2.2.1 redefined function signatures for functions to be placed in an
114 // FT_Outline_Funcs structure. This is needed to keep backwards compatibility with the
126 static int ft2_move_to(FREETYPE_VECTOR *to, void * i_user) argument
129 Geom::Point p(to->x, to->y);
136 static int ft2_line_to(FREETYPE_VECTOR *to, void *i_user) argument
139 Geom::Point p(to->x, to->y);
146 static int ft2_conic_to(FREETYPE_VECTOR *control, FREETYPE_VECTOR *to, void *i_user) argument
149 Geom::Point p(to
156 ft2_cubic_to(FREETYPE_VECTOR *control1, FREETYPE_VECTOR *control2, FREETYPE_VECTOR *to, void *i_user) argument
[all...]
/inkscape/src/util/
H A Dunits.cpp56 // TODO: convert to constexpr in C++11, so that the above constants can be eliminated
86 // maps unit codes obtained from their abbreviations to their SVGLength unit indexes
234 double Unit::convert(double from_dist, Unit const *to) const
237 if (to->type == UNIT_TYPE_DIMENSIONLESS) {
238 return from_dist * to->factor;
242 if (type != to->type) {
247 return from_dist * factor / to->factor;
249 double Unit::convert(double from_dist, Glib::ustring const &to) const
251 return convert(from_dist, unit_table.getUnit(to));
253 double Unit::convert(double from_dist, char const *to) cons
530 convert(double from_dist, Unit const *from, Unit const *to) argument
534 convert(double from_dist, Glib::ustring const &from, Unit const *to) argument
538 convert(double from_dist, Unit const *from, Glib::ustring const &to) argument
542 convert(double from_dist, Glib::ustring const &from, Glib::ustring const &to) argument
546 convert(double from_dist, char const *from, char const *to) argument
[all...]

Completed in 77 milliseconds

12