Home
last modified time | relevance | path

Searched refs:arc1 (Results 26 – 50 of 354) sorted by relevance

12345678910>>...15

/dports/math/openfst/openfst-1.8.1/src/include/fst/extensions/mpdt/
H A Dcompose.h107 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
108 const auto fs1 = filter_.FilterArc(arc1, arc2); in FilterArc()
111 if (arc1->olabel == kNoLabel && arc2->ilabel) { // arc2 parentheses. in FilterArc()
113 arc1->ilabel = arc2->ilabel; in FilterArc()
115 arc2->olabel = arc1->ilabel; in FilterArc()
118 } else if (arc2->ilabel == kNoLabel && arc1->olabel) { // arc1 parentheses in FilterArc()
120 arc2->olabel = arc1->olabel; in FilterArc()
122 arc1->ilabel = arc2->olabel; in FilterArc()
124 return FilterParen(arc1->olabel, fs1, fs2); in FilterArc()
/dports/graphics/py-pyx/PyX-0.15/manual/
H A Dradii2.py9 arc1, arc2 = circle.split(isects_circle) variable
11 arc = arc1.arclen()<arc2.arclen() and arc1 or arc2
/dports/lang/asn1c/asn1c-0.9.27/skeletons/
H A DOBJECT_IDENTIFIER.c498 unsigned int arc1; in OBJECT_IDENTIFIER_set_arcs() local
512 arc1 = ((const unsigned char *)arcs)[1]; in OBJECT_IDENTIFIER_set_arcs()
516 arc1 = ((const unsigned short *)arcs)[1]; in OBJECT_IDENTIFIER_set_arcs()
520 arc1 = ((const unsigned int *)arcs)[1]; in OBJECT_IDENTIFIER_set_arcs()
523 arc1 = arc0 = 0; in OBJECT_IDENTIFIER_set_arcs()
530 arc0 |= *ps, arc1 |= *(ps + arc_type_size); in OBJECT_IDENTIFIER_set_arcs()
531 arc0 <<= CHAR_BIT, arc1 <<= CHAR_BIT; in OBJECT_IDENTIFIER_set_arcs()
533 arc1 = *((const unsigned char *)arcs + arc_type_size); in OBJECT_IDENTIFIER_set_arcs()
539 arc0 |= *ps, arc1 |= *(ps + arc_type_size); in OBJECT_IDENTIFIER_set_arcs()
541 arc1 = *((const unsigned char *)arcs +(arc_type_size<< 1)-1); in OBJECT_IDENTIFIER_set_arcs()
[all …]
/dports/cad/opencascade/opencascade-7.6.0/src/QABugs/
H A DQABugs_12.cxx72 Handle(Geom_TrimmedCurve) arc1 = makeArc1.Value(); in OCC895()
75 BRepBuilderAPI_MakeEdge makeEdge1(arc1, arc1->StartPoint(), arc1->EndPoint()); in OCC895()
/dports/x11/inputplug/inputplug-0.4.0/cargo-crates/x11rb-0.8.1/examples/
H A Dxeyes.rs25 let mut arc1 = Arc { in draw_eyes() localVariable
33 let mut arc2 = arc1; in draw_eyes()
35 conn.poly_fill_arc(win_id, black, &[arc1, arc2])?; in draw_eyes()
38 for mut arc in [&mut arc1, &mut arc2].iter_mut() { in draw_eyes()
44 conn.poly_fill_arc(win_id, white, &[arc1, arc2])?; in draw_eyes()
60 let arc1 = Arc { in draw_pupils() localVariable
68 let mut arc2 = arc1; in draw_pupils()
73 conn.poly_fill_arc(win_id, gc, &[arc1, arc2])?; in draw_pupils()
/dports/audio/spotify-tui/spotify-tui-0.25.0/cargo-crates/x11rb-0.8.1/examples/
H A Dxeyes.rs25 let mut arc1 = Arc {
33 let mut arc2 = arc1;
35 conn.poly_fill_arc(win_id, black, &[arc1, arc2])?;
38 for mut arc in [&mut arc1, &mut arc2].iter_mut() {
44 conn.poly_fill_arc(win_id, white, &[arc1, arc2])?;
60 let arc1 = Arc {
68 let mut arc2 = arc1;
73 conn.poly_fill_arc(win_id, gc, &[arc1, arc2])?;
/dports/misc/valentina/valentina-5b7e98bf48a86e3c444423a9f03533440a39aad9/src/libs/vtools/dialogs/tools/
H A Ddialogcutarc.cpp214 VArc arc1; in ValidateAlias() local
215 arc1.SetAliasSuffix(GetAliasSuffix1()); in ValidateAlias()
221 (not rx.match(arc1.GetAlias()).hasMatch() || in ValidateAlias()
222 (originAliasSuffix1 != GetAliasSuffix1() && not data->IsUnique(arc1.GetAlias())) || in ValidateAlias()
223 arc1.GetAlias() == arc2.GetAlias())) in ValidateAlias()
237 arc1.GetAlias() == arc2.GetAlias())) in ValidateAlias()
/dports/textproc/regex2dfa/regex2dfa-0.1.6/third_party/openfst/src/include/fst/
H A Dlookahead-filter.h249 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
252 const FilterState &f = filter_.FilterArc(arc1, arc2); in FilterArc()
256 return LookAheadOutput() ? LookAheadFilterArc(arc1, arc2, f) : in FilterArc()
257 LookAheadFilterArc(arc2, arc1, f); in FilterArc()
366 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
367 const FilterState1 &f1 = filter_.FilterArc(arc1, arc2); in FilterArc()
495 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
497 return FilterState(filter_.FilterArc(arc1, arc2), in FilterArc()
504 PushedLabelFilterArc(arc2, arc1, flabel); in FilterArc()
506 const FilterState1 &f1 = filter_.FilterArc(arc1, arc2); in FilterArc()
[all …]
H A Ddisambiguate.h254 bool operator() (Arc arc1, Arc arc2) const { in operator()
255 return arc1.ilabel < arc2.ilabel || in operator()
256 (arc1.ilabel == arc2.ilabel && arc1.nextstate < arc2.nextstate); in operator()
473 const Arc &arc1 = aiter.Value(); in FindAmbiguousPairs() local
475 if (matcher.Find(arc1.ilabel)) { in FindAmbiguousPairs()
483 if (s1 != s2 && arc1.nextstate == arc2.nextstate) { in FindAmbiguousPairs()
494 if (arc1.nextstate <= arc2.nextstate) { in FindAmbiguousPairs()
495 spr = make_pair(arc1.nextstate, arc2.nextstate); in FindAmbiguousPairs()
497 spr = make_pair(arc2.nextstate, arc1.nextstate); in FindAmbiguousPairs()
/dports/math/openfst/openfst-1.8.1/src/include/fst/
H A Dlookahead-filter.h213 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
215 const FilterState &fs = filter_.FilterArc(arc1, arc2); in FilterArc()
217 return LookAheadOutput() ? LookAheadFilterArc(arc1, arc2, fs) in FilterArc()
218 : LookAheadFilterArc(arc2, arc1, fs); in FilterArc()
320 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
321 const auto &fs1 = filter_.FilterArc(arc1, arc2); in FilterArc()
444 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
451 return LookAheadOutput() ? PushedLabelFilterArc(arc1, arc2, flabel) in FilterArc()
454 const auto &fs1 = filter_.FilterArc(arc1, arc2); in FilterArc()
457 return LookAheadOutput() ? PushLabelFilterArc(arc1, arc2, fs1) in FilterArc()
[all …]
H A Ddisambiguate.h232 bool operator()(const Arc &arc1, const Arc &arc2) const { in operator()
233 return arc1.ilabel < arc2.ilabel || in operator()
234 (arc1.ilabel == arc2.ilabel && arc1.nextstate < arc2.nextstate); in operator()
451 const auto &arc1 = aiter.Value(); in FindAmbiguousPairs() local
453 if (matcher.Find(arc1.ilabel)) { in FindAmbiguousPairs()
460 if (s1 != s2 && arc1.nextstate == arc2.nextstate) { in FindAmbiguousPairs()
463 const auto spr = arc1.nextstate <= arc2.nextstate in FindAmbiguousPairs()
464 ? std::make_pair(arc1.nextstate, arc2.nextstate) in FindAmbiguousPairs()
465 : std::make_pair(arc2.nextstate, arc1.nextstate); in FindAmbiguousPairs()
/dports/net/ooni-probe-cli/probe-cli-3.10.1/vendor/github.com/ooni/psiphon/oopsi/github.com/redjack/marionette/third_party/openfst/src/include/fst/
H A Dlookahead-filter.h249 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
252 const FilterState &f = filter_.FilterArc(arc1, arc2); in FilterArc()
256 return LookAheadOutput() ? LookAheadFilterArc(arc1, arc2, f) : in FilterArc()
257 LookAheadFilterArc(arc2, arc1, f); in FilterArc()
366 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
367 const FilterState1 &f1 = filter_.FilterArc(arc1, arc2); in FilterArc()
495 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
497 return FilterState(filter_.FilterArc(arc1, arc2), in FilterArc()
504 PushedLabelFilterArc(arc2, arc1, flabel); in FilterArc()
506 const FilterState1 &f1 = filter_.FilterArc(arc1, arc2); in FilterArc()
[all …]
H A Ddisambiguate.h254 bool operator() (Arc arc1, Arc arc2) const { in operator()
255 return arc1.ilabel < arc2.ilabel || in operator()
256 (arc1.ilabel == arc2.ilabel && arc1.nextstate < arc2.nextstate); in operator()
473 const Arc &arc1 = aiter.Value(); in FindAmbiguousPairs() local
475 if (matcher.Find(arc1.ilabel)) { in FindAmbiguousPairs()
483 if (s1 != s2 && arc1.nextstate == arc2.nextstate) { in FindAmbiguousPairs()
494 if (arc1.nextstate <= arc2.nextstate) { in FindAmbiguousPairs()
495 spr = make_pair(arc1.nextstate, arc2.nextstate); in FindAmbiguousPairs()
497 spr = make_pair(arc2.nextstate, arc1.nextstate); in FindAmbiguousPairs()
/dports/net/ooni-mini/probe-engine-0.23.0/vendor/github.com/ooni/psiphon/oopsi/github.com/redjack/marionette/third_party/openfst/src/include/fst/
H A Dlookahead-filter.h249 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
252 const FilterState &f = filter_.FilterArc(arc1, arc2); in FilterArc()
256 return LookAheadOutput() ? LookAheadFilterArc(arc1, arc2, f) : in FilterArc()
257 LookAheadFilterArc(arc2, arc1, f); in FilterArc()
366 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
367 const FilterState1 &f1 = filter_.FilterArc(arc1, arc2); in FilterArc()
495 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
497 return FilterState(filter_.FilterArc(arc1, arc2), in FilterArc()
504 PushedLabelFilterArc(arc2, arc1, flabel); in FilterArc()
506 const FilterState1 &f1 = filter_.FilterArc(arc1, arc2); in FilterArc()
[all …]
H A Ddisambiguate.h254 bool operator() (Arc arc1, Arc arc2) const { in operator()
255 return arc1.ilabel < arc2.ilabel || in operator()
256 (arc1.ilabel == arc2.ilabel && arc1.nextstate < arc2.nextstate); in operator()
473 const Arc &arc1 = aiter.Value(); in FindAmbiguousPairs() local
475 if (matcher.Find(arc1.ilabel)) { in FindAmbiguousPairs()
483 if (s1 != s2 && arc1.nextstate == arc2.nextstate) { in FindAmbiguousPairs()
494 if (arc1.nextstate <= arc2.nextstate) { in FindAmbiguousPairs()
495 spr = make_pair(arc1.nextstate, arc2.nextstate); in FindAmbiguousPairs()
497 spr = make_pair(arc2.nextstate, arc1.nextstate); in FindAmbiguousPairs()
/dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/constraints/netflow/
H A DPruning.java307 Arc arc1 = node.adjacencyList[0]; in pruneNodesWithSmallDegree() local
310 ArcCompanion companion1 = arc1.companion; in pruneNodesWithSmallDegree()
317 if (arc1.head == node) { in pruneNodesWithSmallDegree()
376 Arc arc1 = companion.arc; in analyze() local
377 Arc arc2 = arc1.sister; in analyze()
378 int residual1 = arc1.capacity; in analyze()
384 analyzeArcHelper(arc1, costLimit); in analyze()
386 analyzeArcHelper(arc1, costLimit); in analyze()
390 analyzeArcHelper(arc1, costLimit); in analyze()
/dports/textproc/regex2dfa/regex2dfa-0.1.6/third_party/openfst/src/include/fst/extensions/pdt/
H A Dcompose.h354 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
355 FilterState1 f1 = filter_.FilterArc(arc1, arc2); in FilterArc()
360 if (arc1->olabel == kNoLabel && arc2->ilabel) { // arc2 parentheses in FilterArc()
362 arc1->ilabel = arc2->ilabel; in FilterArc()
364 arc2->olabel = arc1->ilabel; in FilterArc()
367 } else if (arc2->ilabel == kNoLabel && arc1->olabel) { // arc1 parentheses in FilterArc()
369 arc2->olabel = arc1->olabel; in FilterArc()
371 arc1->ilabel = arc2->olabel; in FilterArc()
373 return FilterParen(arc1->olabel, f1, f2); in FilterArc()
/dports/net/ooni-probe-cli/probe-cli-3.10.1/vendor/github.com/ooni/psiphon/oopsi/github.com/redjack/marionette/third_party/openfst/src/include/fst/extensions/pdt/
H A Dcompose.h354 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
355 FilterState1 f1 = filter_.FilterArc(arc1, arc2); in FilterArc()
360 if (arc1->olabel == kNoLabel && arc2->ilabel) { // arc2 parentheses in FilterArc()
362 arc1->ilabel = arc2->ilabel; in FilterArc()
364 arc2->olabel = arc1->ilabel; in FilterArc()
367 } else if (arc2->ilabel == kNoLabel && arc1->olabel) { // arc1 parentheses in FilterArc()
369 arc2->olabel = arc1->olabel; in FilterArc()
371 arc1->ilabel = arc2->olabel; in FilterArc()
373 return FilterParen(arc1->olabel, f1, f2); in FilterArc()
/dports/net/ooni-mini/probe-engine-0.23.0/vendor/github.com/ooni/psiphon/oopsi/github.com/redjack/marionette/third_party/openfst/src/include/fst/extensions/pdt/
H A Dcompose.h354 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
355 FilterState1 f1 = filter_.FilterArc(arc1, arc2); in FilterArc()
360 if (arc1->olabel == kNoLabel && arc2->ilabel) { // arc2 parentheses in FilterArc()
362 arc1->ilabel = arc2->ilabel; in FilterArc()
364 arc2->olabel = arc1->ilabel; in FilterArc()
367 } else if (arc2->ilabel == kNoLabel && arc1->olabel) { // arc1 parentheses in FilterArc()
369 arc2->olabel = arc1->olabel; in FilterArc()
371 arc1->ilabel = arc2->olabel; in FilterArc()
373 return FilterParen(arc1->olabel, f1, f2); in FilterArc()
/dports/cad/gmsh/gmsh-4.9.2-source/demos/simple_geo/
H A Dmachine.i232 arc1 = newreg ; Circle(arc1) = {p4, p5, p10} ;
38 reg1 = newreg ; Curve Loop(reg1) = {lin1,arc1,arc2,lin6,lin7} ;
/dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/src/3rdparty/2geom/tests/
H A Dellipse-test.cpp53 std::unique_ptr<EllipticalArc> arc1(e.arc(Point(5,0), Point(0,0), Point(0,10))); in TEST() local
55 EXPECT_EQ(arc1->initialPoint(), Point(5,0)); in TEST()
56 EXPECT_EQ(arc1->finalPoint(), Point(0,10)); in TEST()
57 EXPECT_EQ(arc1->boundsExact(), Rect::from_xywh(0,0,5,10)); in TEST()
58 EXPECT_EQ(arc1->center(), e.center()); in TEST()
59 EXPECT_EQ(arc1->largeArc(), false); in TEST()
60 EXPECT_EQ(arc1->sweep(), false); in TEST()
64 EXPECT_EQ(arc1r->boundsExact(), arc1->boundsExact()); in TEST()
/dports/math/lib2geom/lib2geom-1.1/tests/
H A Dellipse-test.cpp53 std::unique_ptr<EllipticalArc> arc1(e.arc(Point(5,0), Point(0,0), Point(0,10))); in TEST() local
55 EXPECT_EQ(arc1->initialPoint(), Point(5,0)); in TEST()
56 EXPECT_EQ(arc1->finalPoint(), Point(0,10)); in TEST()
57 EXPECT_EQ(arc1->boundsExact(), Rect::from_xywh(0,0,5,10)); in TEST()
58 EXPECT_EQ(arc1->center(), e.center()); in TEST()
59 EXPECT_EQ(arc1->largeArc(), false); in TEST()
60 EXPECT_EQ(arc1->sweep(), false); in TEST()
64 EXPECT_EQ(arc1r->boundsExact(), arc1->boundsExact()); in TEST()
/dports/devel/qtcreator/qt-creator-opensource-src-5.0.3/src/plugins/studiowelcome/qml/downloaddialog/
H A DArcItem.qml105 …arc1.x = root.polarToCartesianX(path.__Xcenter, path.__Ycenter, path.__xRadius, root.sortedEnd() -…
106 …arc1.y = root.polarToCartesianY(path.__Xcenter, path.__Ycenter, path.__yRadius, root.sortedEnd() …
108 … arc1.radiusX = path.__xRadius - root.__endOff / 2 -root.__beginOff / 2 + root.radiusOuterAdjust
109 … arc1.radiusY = path.__yRadius - root.__endOff / 2 -root.__beginOff / 2 + root.radiusOuterAdjust
111 arc1.useLargeArc = root.alpha > 180
167 id: arc1
194 useLargeArc: arc1.useLargeArc
/dports/misc/valentina/valentina-5b7e98bf48a86e3c444423a9f03533440a39aad9/src/libs/vtools/tools/drawTools/toolpoint/toolsinglepoint/
H A Dvtoolpointofintersectionarcs.cpp160 bool VToolPointOfIntersectionArcs::FindPoint(const VArc *arc1, const VArc *arc2, const CrossCircles… in FindPoint() argument
166 const QPointF centerArc1 = static_cast<QPointF>(arc1->GetCenter()); in FindPoint()
168 …const int res = VGObject::IntersectionCircles(centerArc1, arc1->GetRadius(), centerArc2, arc2->Get… in FindPoint()
189 if (arc1->IsIntersectLine(r1Arc1) && arc2->IsIntersectLine(r1Arc2)) in FindPoint()
195 if (arc1->IsIntersectLine(r2Arc1) && arc2->IsIntersectLine(r2Arc2)) in FindPoint()
232 if (arc1->IsIntersectLine(r1Arc1) && arc2->IsIntersectLine(r1Arc2)) in FindPoint()
/dports/cad/openroad/OpenROAD-2.0/src/sta/liberty/
H A DTimingArc.cc305 TimingArc *&arc1, in arcsFrom() argument
309 arc1 = from_arc1_[tr_index]; in arcsFrom()
389 TimingArc *arc1 = arc_iter1.next(); in timingArcsEquiv() local
391 if (!TimingArc::equiv(arc1, arc2)) in timingArcsEquiv()
471 TimingArc *arc1 = arc_iter1.next(); in timingArcsLess() local
473 int from_index1 = arc1->fromTrans()->index(); in timingArcsLess()
480 int to_index1 = arc1->toTrans()->index(); in timingArcsLess()
569 TimingArc::equiv(const TimingArc *arc1, in equiv() argument
572 return arc1->fromTrans() == arc2->fromTrans() in equiv()
573 && arc1->toTrans() == arc2->toTrans(); in equiv()

12345678910>>...15