Home
last modified time | relevance | path

Searched refs:segs1 (Results 1 – 25 of 28) sorted by relevance

12

/dports/math/cgal/CGAL-5.3/examples/Arrangement_on_surface_2/
H A Dpolycurves_basic.cpp29 std::vector<X_monotone_subcurve_2> segs1; in main() local
30 segs1.push_back(X_monotone_subcurve_2(Point_2(0, 0), Point_2(1, 1))); in main()
31 segs1.push_back(X_monotone_subcurve_2(Point_2(1, 1), Point_2(2, 2))); in main()
32 segs1.push_back(X_monotone_subcurve_2(Point_2(2, 2), Point_2(3, 1))); in main()
33 segs1.push_back(X_monotone_subcurve_2(Point_2(3, 1), Point_2(4, 0))); in main()
34 X_monotone_curve_2 pc1 = ctr(segs1.begin(), segs1.end()); in main()
/dports/graphics/epix/epix-1.2.19/
H A Dcurves.h152 unsigned int segs1, unsigned int segs2,
156 unsigned int segs1, unsigned int segs2,
160 unsigned int segs1, unsigned int segs2,
163 void log_grid(unsigned int segs1, unsigned int segs2,
166 void log1_grid(unsigned int segs1, unsigned int segs2,
169 void log2_grid(unsigned int segs1, unsigned int segs2,
H A Dcurves.cc509 unsigned int segs1, unsigned int segs2, in log_grid() argument
514 segs1, base1); in log_grid()
522 unsigned int segs1, unsigned int segs2, in log1_grid() argument
527 segs1, base1); in log1_grid()
535 unsigned int segs1, unsigned int segs2, in log2_grid() argument
542 segs1, 2); in log2_grid()
553 void log_grid(unsigned int segs1, unsigned int segs2, in log_grid() argument
558 segs1, base1); in log_grid()
565 void log1_grid(unsigned int segs1, unsigned int segs2, in log1_grid() argument
570 segs1, base1); in log1_grid()
[all …]
/dports/graphics/geos/geos-3.9.1/src/operation/union/
H A DOverlapUnion.cpp159 OverlapUnion::isEqual(std::vector<LineSegment>& segs0, std::vector<LineSegment>& segs1) in isEqual() argument
161 if (segs0.size() != segs1.size()) in isEqual()
165 std::sort(segs1.begin(), segs1.end(), lineSegmentPtrCmp); in isEqual()
169 if (segs0[i].p0.x != segs1[i].p0.x || in isEqual()
170 segs0[i].p0.y != segs1[i].p0.y || in isEqual()
171 segs0[i].p1.x != segs1[i].p1.x || in isEqual()
172 segs0[i].p1.y != segs1[i].p1.y) in isEqual()
/dports/graphics/p5-Image-MetaData-JPEG/Image-MetaData-JPEG-0.153/t/
H A DJPEG_2_JPEG_class.t13 $status, @desc, @desc_2, $h1, $h2, $num, $num2, @segs1, @segs2);
182 @segs1 = $image->get_segments();
188 is_deeply( \ @segs1, \ @segs2, "... but segments are not changed" );
201 is_deeply( \ @segs1, \ @segs2, "... segments still unchanged" );
205 @segs1 = $image->get_segments();
207 is_deeply( \ @segs1, \ @segs2, "inserting a segment with pos=3" );
212 @segs1 = $image->get_segments();
217 @segs1 = $image->get_segments();
219 is_deeply( \ @segs1, \ @segs2, "inserting more than one segment" );
223 @segs1 = $image->get_segments();
[all …]
/dports/net-im/uTox/uTox/third-party/qrcodegen/cpp/
H A DQrCodeGeneratorDemo.cpp171 std::vector<QrSegment> segs1 = QrSegment::makeSegments( in doMaskDemo() local
179 …printQr(QrCode::encodeSegments(segs1, QrCode::Ecc::MEDIUM, QrCode::MIN_VERSION, QrCode::MAX_VERSIO… in doMaskDemo()
180 …printQr(QrCode::encodeSegments(segs1, QrCode::Ecc::MEDIUM, QrCode::MIN_VERSION, QrCode::MAX_VERSIO… in doMaskDemo()
181 …printQr(QrCode::encodeSegments(segs1, QrCode::Ecc::MEDIUM, QrCode::MIN_VERSION, QrCode::MAX_VERSIO… in doMaskDemo()
182 …printQr(QrCode::encodeSegments(segs1, QrCode::Ecc::MEDIUM, QrCode::MIN_VERSION, QrCode::MAX_VERSIO… in doMaskDemo()
/dports/net-im/telegram-desktop/tdesktop-3.2.5-full/Telegram/ThirdParty/QR/cpp/
H A DQrCodeGeneratorDemo.cpp172 std::vector<QrSegment> segs1 = QrSegment::makeSegments( in doMaskDemo() local
180 …printQr(QrCode::encodeSegments(segs1, QrCode::Ecc::MEDIUM, QrCode::MIN_VERSION, QrCode::MAX_VERSIO… in doMaskDemo()
181 …printQr(QrCode::encodeSegments(segs1, QrCode::Ecc::MEDIUM, QrCode::MIN_VERSION, QrCode::MAX_VERSIO… in doMaskDemo()
182 …printQr(QrCode::encodeSegments(segs1, QrCode::Ecc::MEDIUM, QrCode::MIN_VERSION, QrCode::MAX_VERSIO… in doMaskDemo()
183 …printQr(QrCode::encodeSegments(segs1, QrCode::Ecc::MEDIUM, QrCode::MIN_VERSION, QrCode::MAX_VERSIO… in doMaskDemo()
/dports/graphics/qr-code-generator/QR-Code-generator-67c6246/cpp/
H A DQrCodeGeneratorDemo.cpp172 std::vector<QrSegment> segs1 = QrSegment::makeSegments( in doMaskDemo() local
180 …printQr(QrCode::encodeSegments(segs1, QrCode::Ecc::MEDIUM, QrCode::MIN_VERSION, QrCode::MAX_VERSIO… in doMaskDemo()
181 …printQr(QrCode::encodeSegments(segs1, QrCode::Ecc::MEDIUM, QrCode::MIN_VERSION, QrCode::MAX_VERSIO… in doMaskDemo()
182 …printQr(QrCode::encodeSegments(segs1, QrCode::Ecc::MEDIUM, QrCode::MIN_VERSION, QrCode::MAX_VERSIO… in doMaskDemo()
183 …printQr(QrCode::encodeSegments(segs1, QrCode::Ecc::MEDIUM, QrCode::MIN_VERSION, QrCode::MAX_VERSIO… in doMaskDemo()
/dports/www/thundersnarf/thundersnarf/protected/yii114/framework/cli/commands/
H A DWebAppCommand.php109 $segs1=explode(DIRECTORY_SEPARATOR,$path1);
111 $n1=count($segs1);
116 if($segs1[$i]!==$segs2[$i])
126 $up.='/'.$segs1[$i];
/dports/www/limesurvey/limesurvey/framework/cli/commands/
H A DWebAppCommand.php192 $segs1=explode(DIRECTORY_SEPARATOR,$path1);
194 $n1=count($segs1);
199 if($segs1[$i]!==$segs2[$i])
209 $up.='/'.$segs1[$i];
/dports/audio/festival/festival/lib/multisyn/
H A Dtarget_cost.scm400 (let ((segs1 (utt.relation.items utt1 'Segment))
403 (while (and segs1 segs2)
404 (set! tc (Default_Target_Cost (car segs1) (car segs2)))
405 (format t "targ: %l cand: %l cost: %l\n" (item.name (car segs1)) (item.name (car segs2)) tc)
406 (set! segs1 (cdr segs1))
/dports/misc/xiphos/xiphos-4.2.1/win32/extras/festival/lib/multisyn/
H A Dtarget_cost.scm400 (let ((segs1 (utt.relation.items utt1 'Segment))
403 (while (and segs1 segs2)
404 (set! tc (Default_Target_Cost (car segs1) (car segs2)))
405 (format t "targ: %l cand: %l cost: %l\n" (item.name (car segs1)) (item.name (car segs2)) tc)
406 (set! segs1 (cdr segs1))
/dports/graphics/py-beziers/beziers-0.4.0/beziers/path/
H A D__init__.py380 segs1 = self.asSegments()
382 if len(segs1) < 1:
386 self.activeRepresentation = SegmentRepresentation(self, segs1)
390 dist1 = segs1[-1].end.distanceFrom(segs2[0].start)
391 dist2 = segs1[-1].end.distanceFrom(segs2[-1].end)
396 if segs1[-1].end != segs2[0].start:
397 segs1.append(Line(segs1[-1].end,segs2[0].start))
401 segs1.extend(segs2)
402 self.activeRepresentation = SegmentRepresentation(self, segs1)
670 segs1 = self.asSegments()
[all …]
/dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/operation/union/
H A DOverlapUnion.java255 private boolean isEqual(List<LineSegment> segs0, List<LineSegment> segs1) { in isEqual() argument
256 if (segs0.size() != segs1.size()) in isEqual()
261 for (LineSegment seg : segs1) { in isEqual()
/dports/graphics/py-beziers/beziers-0.4.0/beziers/utils/
H A Dbooleanoperationsmixin.py115 segs1 = []
129 segs1.extend(flats)
138 subj = [(s[0].x*precision, s[0].y*precision) for s in segs1]
/dports/science/fasthenry/fasthenry-3.0wr/src/fasthenry/
H A DfillM.c381 SEGMENT ***segs1 = plane->segs1; local
389 if (segs1[j][i] != NULL && segs2[j + 1][i] != NULL
390 && segs1[j][i + 1] != NULL && segs2[j][i]!= NULL) {
396 seg = plane->segs1[j][i];
404 seg = plane->segs1[j][i + 1];
668 if(j != dir1 - 1 && p->segs1[j][i] != NULL) {
669 out1[i][j] = Ib[p->segs1[j][i]->filaments[0].filnumber];
670 if (p->segs1[j][i]->node[0] != p->pnodes[j][i]) {
H A Daddgroundplane.c233 seg = plane->segs1[j - 1][i];
384 tempseg = plane->segs1[counter1][b1];
503 seg = plane->segs1[j][i];
511 seg = plane->segs1[j][i + 1];
633 SEGMENT ***segs1 = plane->segs1; local
652 nchoices += add_choice(&choices[nchoices], nodes_so_far, segs1[s1-1][s2],
657 nchoices += add_choice(&choices[nchoices], nodes_so_far, segs1[s1][s2],
H A Dwritefastcap.c252 width = gp->segs1[0][0]->height;
366 if (gp->segs1[j][i] != NULL) /* it's not part of a hole */
367 gp->segs1[j][i]->is_deleted = greylev;
H A Dfindpaths.c1423 if (s1 < plane->num_nodes1 - 1 && plane->segs1[s1][s2] != NULL)
1424 return plane->segs1[s1][s2];
1439 if (s1 > 0 && plane->segs1[s1-1][s2] != NULL)
1440 return plane->segs1[s1-1][s2];
H A Dinduct.h347 SEGMENT ***segs1; /* segments from mid to o1 */ member
/dports/textproc/sigil/Sigil-1.8.0/src/Resource_Files/plugin_launchers/python/
H A Dhrefutils.py258 segs1 = fpaths[0].split('/')
261 for s1, s2 in zip(segs1, segs2):
/dports/textproc/pageedit/PageEdit-1.2.0/
H A DUtility.cpp656 const QStringList segs1 = fpaths.first().split(sep); in longestCommonPath() local
660 while((i < segs1.length()) && (i < segs2.length()) && (segs1.at(i) == segs2.at(i))) { in longestCommonPath()
661 res.append(segs1.at(i)); in longestCommonPath()
/dports/graphics/geos/geos-3.9.1/include/geos/operation/union/
H A DOverlapUnion.h132 bool isEqual(std::vector<geom::LineSegment>& segs0, std::vector<geom::LineSegment>& segs1);
/dports/textproc/sigil/Sigil-1.8.0/src/Misc/
H A DUtility.cpp1020 const QStringList segs1 = fpaths.first().split(sep); in longestCommonPath() local
1024 while((i < segs1.length()) && (i < segs2.length()) && (segs1.at(i) == segs2.at(i))) { in longestCommonPath()
1025 res.append(segs1.at(i)); in longestCommonPath()
/dports/devel/kde-dev-scripts/kde-dev-scripts-21.12.3/kf5/
H A Dresolve_kuit.py1710 segs1 = []
1726 segs1.append(s[p2:p3])
1728 js1 = "".join(segs1)

12