Searched refs:s2 (Results 1 - 18 of 18) sorted by relevance

/inkscape/cxxtest/cxxtest/
H A DValueTraits.cpp39 bool stringsEqual( const char *s1, const char *s2 )
42 while ( (c = *s1++) == *s2++ )
H A DValueTraits.h56 bool stringsEqual( const char *s1, const char *s2 );
/inkscape/src/extension/
H A Ddb.h38 bool operator()(const char* s1, const char* s2) const {
39 if ( (s1 == NULL) && (s2 != NULL) ) {
41 } else if (s1 == NULL || s2 == NULL) {
44 return strcmp(s1, s2) < 0;
/inkscape/src/xml/
H A Dquote-test.h51 char const * s2; member in struct:XmlQuoteTest::__anon561
64 TS_ASSERT_RELATION( streq_rel, cases[i].s2, str );
/inkscape/share/extensions/
H A Dffgeom.py81 s2 = Segment(self[0],p)
82 c1 = dot(s2,self)
114 def intersectSegments(s1, s2):
117 x3 = s2[0]['x']
118 x4 = s2[1]['x']
122 y3 = s2[0]['y']
123 y4 = s2[1]['y']
137 def dot(s1, s2):
138 return s1.delta_x() * s2.delta_x() + s1.delta_y() * s2
[all...]
H A Dvoronoi.py143 def outTriple(self,s1,s2,s3):
144 self.triangles.append((s1.sitenum, s2.sitenum, s3.sitenum))
146 print "circle through left=%d right=%d bottom=%d" % (s1.sitenum, s2.sitenum, s3.sitenum)
148 print "%d %d %d" % (s1.sitenum, s2.sitenum, s3.sitenum)
374 def bisect(s1,s2):
377 newedge.reg[1] = s2
383 dx = float(s2.x - s1.x)
384 dy = float(s2.y - s1.y)
H A Dvoronoi2svg.py95 s2 = self.dot(line,v2) - line[2]
96 if s1*s2 > 0:
H A Dgcodetools.py1207 def concat(s1,s2) :
1208 if s1 == [] : return s2
1209 if s2 == [] : return s1
1210 if (s1[-1][1][0]-s2[0][1][0])**2 + (s1[-1][1][1]-s2[0][1][1])**2 > 0.00001 :
1211 return s1[:-1]+[ [s1[-1][0],s1[-1][1],s1[-1][1]], [s2[0][1],s2[0][1],s2[0][2]] ] + s2[1:]
1213 return s1[:-1]+[ [s1[-1][0],s2[
[all...]
/inkscape/src/libavoid/
H A Dgeometry.cpp117 // segment s1-s2, blocking visibility.
120 const Point& s2, bool& seenIntersectionAtEndpoint)
122 if (segmentIntersect(e1, e2, s1, s2))
127 else if ( (((s2 == e1) || pointOnLine(s1, s2, e1)) &&
128 (vecDir(s1, s2, e2) != 0))
130 (((s2 == e2) || pointOnLine(s1, s2, e2)) &&
131 (vecDir(s1, s2, e1) != 0)) )
207 // e.g. /|s2
119 segmentShapeIntersect(const Point& e1, const Point& e2, const Point& s1, const Point& s2, bool& seenIntersectionAtEndpoint) argument
[all...]
H A Dgeometry.h52 const Point& s1, const Point& s2, bool& seenIntersectionAtEndpoint);
/inkscape/src/
H A Dverbs.h401 bool operator()(const char* s1, const char* s2) const {
402 if ( (s1 == NULL) && (s2 != NULL) ) {
404 } else if (s1 == NULL || s2 == NULL) {
407 return strcmp(s1, s2) < 0;
H A Dsp-filter.h38 bool operator()(const char* s1, const char* s2) const;
H A Dsp-filter.cpp539 bool ltstr::operator()(const char* s1, const char* s2) const
541 return strcmp(s1, s2) < 0;
/inkscape/po/
H A Dcheck-markup236 my ($s1, $s2, $rest) = ($1, $2, $3);
237 my @strs = ($s1, $s2);
/inkscape/src/livarot/
H A DPathStroke.cpp506 double s2 = cross(nnor, biss); local
507 double dec = (l - emiter) * c2 / s2;
617 double s2 = cross(nnor, biss); local
618 double dec = (l - emiter) * c2 / s2;
/inkscape/src/helper/
H A Dgeom-pathstroke.cpp315 double s2 = 0; local
321 s2 = -s1;
325 s2 = (-B - sqrt(B*B - 4*A*C))/(2*A);
328 double dr = (fabs(s1)<=fabs(s2)?s1:s2);
333 // std::cout << " s1: " << s1 << " s2: " << s2 << " dr: " << dr << std::endl;
/inkscape/src/util/
H A Dziptool.cpp80 unsigned long s2 = (value >> 16) & 0xffff; local
82 s2 += s1;
83 value = ((s2 % ADLER32_BASE) << 16) | (s1 % ADLER32_BASE);
/inkscape/
H A Dbuildtool.cpp5351 String s1, s2, s3;
5368 s2 = version.substr(pos, version.size()-pos);
5372 s2 = version.substr(pos, pos2-pos);
5382 minorVersion = getint(s2);

Completed in 224 milliseconds