Home
last modified time | relevance | path

Searched refs:arcs (Results 1 – 25 of 3562) sorted by relevance

12345678910>>...143

/dports/x11-toolkits/libXmu/libXmu-1.1.3/src/
H A DDrRndRect.c45 XArc arcs[8]; in XmuDrawRoundedRectangle() local
53 arcs[0].x = x; in XmuDrawRoundedRectangle()
54 arcs[0].y = y; in XmuDrawRoundedRectangle()
61 arcs[1].y = y; in XmuDrawRoundedRectangle()
68 arcs[2].y = y; in XmuDrawRoundedRectangle()
95 arcs[6].x = x; in XmuDrawRoundedRectangle()
102 arcs[7].x = x; in XmuDrawRoundedRectangle()
116 XArc arcs[4]; in XmuFillRoundedRectangle() local
130 arcs[0].x = x; in XmuFillRoundedRectangle()
131 arcs[0].y = y; in XmuFillRoundedRectangle()
[all …]
/dports/converters/wkhtmltopdf/qt-5db36ec/tests/auto/lancelot/scripts/
H A Darcs.qps10 path_moveTo arcs 300 200
12 path_closeSubpath arcs
14 path_moveTo arcs 300 200
16 path_closeSubpath arcs
18 path_moveTo arcs 300 200
20 path_closeSubpath arcs
24 path_closeSubpath arcs
28 path_closeSubpath arcs
32 path_closeSubpath arcs
56 drawPath arcs
[all …]
/dports/converters/wkhtmltopdf/qt-5db36ec/tests/arthur/data/qps/
H A Darcs.qps7 path_moveTo arcs 300 200
9 path_closeSubpath arcs
11 path_moveTo arcs 300 200
13 path_closeSubpath arcs
15 path_moveTo arcs 300 200
17 path_closeSubpath arcs
21 path_closeSubpath arcs
25 path_closeSubpath arcs
29 path_closeSubpath arcs
53 drawPath arcs
[all …]
/dports/x11-toolkits/open-motif/motif-2.3.8/demos/lib/Exm/
H A DTabB.c354 XArc arcs[4]; in FillOpenRoundedRectangle() local
388 arcs[0].x = x ; in FillOpenRoundedRectangle()
411 arcs[1].width = 0; in FillOpenRoundedRectangle()
421 arcs[3].x = x ; in FillOpenRoundedRectangle()
445 arcs[0].width = 0; in FillOpenRoundedRectangle()
478 arcs[1].width = 0; in FillOpenRoundedRectangle()
499 arcs[0].y = y ; in FillOpenRoundedRectangle()
500 arcs[0].width = 0; in FillOpenRoundedRectangle()
532 arcs[3].y = y ; in FillOpenRoundedRectangle()
533 arcs[3].width = 0; in FillOpenRoundedRectangle()
[all …]
/dports/editors/ted/Ted-2.23/appFrame/
H A DdrawRoundedRect.c57 arcs->a2diRect.drX1= arcs->a2diRect.drX0+ w- 1; in drawPrepareRoundRect()
58 arcs->a2diRect.drY1= arcs->a2diRect.drY0+ h- 1; in drawPrepareRoundRect()
61 arcs++; in drawPrepareRoundRect()
79 arcs->a2diRect.drX1= arcs->a2diRect.drX0+ w- 1; in drawPrepareRoundRect()
80 arcs->a2diRect.drY1= arcs->a2diRect.drY0+ h- 1; in drawPrepareRoundRect()
83 arcs++; in drawPrepareRoundRect()
101 arcs->a2diRect.drX1= arcs->a2diRect.drX0+ w- 1; in drawPrepareRoundRect()
102 arcs->a2diRect.drY1= arcs->a2diRect.drY0+ h- 1; in drawPrepareRoundRect()
105 arcs++; in drawPrepareRoundRect()
123 arcs->a2diRect.drX1= arcs->a2diRect.drX0+ w- 1; in drawPrepareRoundRect()
[all …]
/dports/devel/re2c/re2c-2.2/src/skeleton/
H A Dpath.h18 std::vector<size_t> arcs;
25 return arcs.size (); in length()
29 arcs.push_back(i); in push()
41 arcs.push_back(i); in path_t()
53 return skel.nodes[arcs[i]].arcs.find(arcs[i + 1])->second; in arc()
58 arcs.resize(1); in clear()
62 arcs.push_back(n); in push()
66 arcs.pop_back(); in pop()
70 arcs.insert(arcs.end(), suffix.arcs.rbegin(), suffix.arcs.rend()); in push_sfx()
74 arcs.resize(arcs.size() - suffix.arcs.size()); in pop_sfx()
[all …]
/dports/databases/postgis32/postgis-3.2.0/topology/test/regress/
H A Dtopojson_expected5 L1-vanilla|R1|{ "type": "MultiLineString", "arcs": [[9,-11]]}
6 L1-vanilla|R2|{ "type": "MultiLineString", "arcs": [[4,-6]]}
7 L1-vanilla|R3|{ "type": "MultiLineString", "arcs": [[25]]}
8 L1-vanilla|R4|{ "type": "MultiLineString", "arcs": [[3]]}
10 L2-vanilla|R4|{ "type": "MultiLineString", "arcs": [[3]]}
14 A1-vanilla|P4|{ "type": "MultiPolygon", "arcs": [[[-2]]]}
18 L1-edgemap|R1|{ "type": "MultiLineString", "arcs": [[0,-2]]}
20 L1-edgemap|R3|{ "type": "MultiLineString", "arcs": [[4]]}
21 L1-edgemap|R4|{ "type": "MultiLineString", "arcs": [[5]]}
23 L2-edgemap|R4|{ "type": "MultiLineString", "arcs": [[4]]}
[all …]
/dports/databases/postgis30/postgis-3.0.4/topology/test/regress/
H A Dtopojson_expected17 L1-vanilla|R1|{ "type": "MultiLineString", "arcs": [[9,-11]]}
18 L1-vanilla|R2|{ "type": "MultiLineString", "arcs": [[4,-6]]}
19 L1-vanilla|R3|{ "type": "MultiLineString", "arcs": [[25]]}
20 L1-vanilla|R4|{ "type": "MultiLineString", "arcs": [[3]]}
22 L2-vanilla|R4|{ "type": "MultiLineString", "arcs": [[3]]}
26 A1-vanilla|P4|{ "type": "MultiPolygon", "arcs": [[[-2]]]}
30 L1-edgemap|R1|{ "type": "MultiLineString", "arcs": [[0,-2]]}
32 L1-edgemap|R3|{ "type": "MultiLineString", "arcs": [[4]]}
33 L1-edgemap|R4|{ "type": "MultiLineString", "arcs": [[5]]}
35 L2-edgemap|R4|{ "type": "MultiLineString", "arcs": [[4]]}
[all …]
/dports/databases/postgis25/postgis-2.5.5/topology/test/regress/
H A Dtopojson_expected21 L1-vanilla|R1|{ "type": "MultiLineString", "arcs": [[9,-11]]}
22 L1-vanilla|R2|{ "type": "MultiLineString", "arcs": [[4,-6]]}
23 L1-vanilla|R3|{ "type": "MultiLineString", "arcs": [[25]]}
24 L1-vanilla|R4|{ "type": "MultiLineString", "arcs": [[3]]}
26 L2-vanilla|R4|{ "type": "MultiLineString", "arcs": [[3]]}
30 A1-vanilla|P4|{ "type": "MultiPolygon", "arcs": [[[-2]]]}
34 L1-edgemap|R1|{ "type": "MultiLineString", "arcs": [[0,-2]]}
36 L1-edgemap|R3|{ "type": "MultiLineString", "arcs": [[4]]}
37 L1-edgemap|R4|{ "type": "MultiLineString", "arcs": [[5]]}
39 L2-edgemap|R4|{ "type": "MultiLineString", "arcs": [[4]]}
[all …]
/dports/databases/postgis31/postgis-3.1.4/topology/test/regress/
H A Dtopojson_expected17 L1-vanilla|R1|{ "type": "MultiLineString", "arcs": [[9,-11]]}
18 L1-vanilla|R2|{ "type": "MultiLineString", "arcs": [[4,-6]]}
19 L1-vanilla|R3|{ "type": "MultiLineString", "arcs": [[25]]}
20 L1-vanilla|R4|{ "type": "MultiLineString", "arcs": [[3]]}
22 L2-vanilla|R4|{ "type": "MultiLineString", "arcs": [[3]]}
26 A1-vanilla|P4|{ "type": "MultiPolygon", "arcs": [[[-2]]]}
30 L1-edgemap|R1|{ "type": "MultiLineString", "arcs": [[0,-2]]}
32 L1-edgemap|R3|{ "type": "MultiLineString", "arcs": [[4]]}
33 L1-edgemap|R4|{ "type": "MultiLineString", "arcs": [[5]]}
35 L2-edgemap|R4|{ "type": "MultiLineString", "arcs": [[4]]}
[all …]
/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/lemon/
H A Dlist_graph.h246 arcs[arcs[n].next_in].prev_in = arcs[n].prev_in; in erase()
250 arcs[arcs[n].prev_in].next_in = arcs[n].next_in; in erase()
257 arcs[arcs[n].next_out].prev_out = arcs[n].prev_out; in erase()
261 arcs[arcs[n].prev_out].next_out = arcs[n].next_out; in erase()
281 arcs[arcs[e.id].next_in].prev_in = arcs[e.id].prev_in; in changeTarget()
283 arcs[arcs[e.id].prev_in].next_in = arcs[e.id].next_in; in changeTarget()
296 arcs[arcs[e.id].next_out].prev_out = arcs[e.id].prev_out; in changeSource()
298 arcs[arcs[e.id].prev_out].next_out = arcs[e.id].next_out; in changeSource()
1096 arcs[arcs[n].next_out].prev_out = arcs[n].prev_out; in erase()
1100 arcs[arcs[n].prev_out].next_out = arcs[n].next_out; in erase()
[all …]
H A Dedge_set.h120 arcs[arcs[n].prev_in].next_in = arcs[n].next_in; in erase()
122 (*_nodes)[arcs[n].target].first_in = arcs[n].next_in; in erase()
125 arcs[arcs[n].next_in].prev_in = arcs[n].prev_in; in erase()
129 arcs[arcs[n].prev_out].next_out = arcs[n].next_out; in erase()
131 (*_nodes)[arcs[n].source].first_out = arcs[n].next_out; in erase()
134 arcs[arcs[n].next_out].prev_out = arcs[n].prev_out; in erase()
145 arcs.clear(); in clear()
468 arcs[arcs[n].next_out].prev_out = arcs[n].prev_out; in erase()
472 arcs[arcs[n].prev_out].next_out = arcs[n].next_out; in erase()
478 arcs[arcs[n | 1].next_out].prev_out = arcs[n | 1].prev_out; in erase()
[all …]
H A Dsmart_graph.h51 std::vector<ArcT> arcs; variable
64 : nodes(_g.nodes), arcs(_g.arcs) { } in SmartDigraphBase()
96 arcs.clear(); in clear()
317 nodes[arcs.back().source].first_out=arcs.back().next_out; in restoreSnapshot()
318 nodes[arcs.back().target].first_in=arcs.back().next_in; in restoreSnapshot()
601 arcs.clear(); in clear()
739 nodes[arcs[n-1].target].first_out=arcs[n].next_out; in restoreSnapshot()
740 nodes[arcs[n].target].first_out=arcs[n-1].next_out; in restoreSnapshot()
1100 arcs.clear(); in clear()
1251 nodes[arcs[n-1].target].first_out=arcs[n].next_out; in restoreSnapshot()
[all …]
/dports/math/lemon/lemon-1.3.1/lemon/
H A Dlist_graph.h246 arcs[arcs[n].next_in].prev_in = arcs[n].prev_in; in erase()
250 arcs[arcs[n].prev_in].next_in = arcs[n].next_in; in erase()
257 arcs[arcs[n].next_out].prev_out = arcs[n].prev_out; in erase()
261 arcs[arcs[n].prev_out].next_out = arcs[n].next_out; in erase()
281 arcs[arcs[e.id].next_in].prev_in = arcs[e.id].prev_in; in changeTarget()
283 arcs[arcs[e.id].prev_in].next_in = arcs[e.id].next_in; in changeTarget()
296 arcs[arcs[e.id].next_out].prev_out = arcs[e.id].prev_out; in changeSource()
298 arcs[arcs[e.id].prev_out].next_out = arcs[e.id].next_out; in changeSource()
1096 arcs[arcs[n].next_out].prev_out = arcs[n].prev_out; in erase()
1100 arcs[arcs[n].prev_out].next_out = arcs[n].next_out; in erase()
[all …]
H A Dedge_set.h120 arcs[arcs[n].prev_in].next_in = arcs[n].next_in; in erase()
122 (*_nodes)[arcs[n].target].first_in = arcs[n].next_in; in erase()
125 arcs[arcs[n].next_in].prev_in = arcs[n].prev_in; in erase()
129 arcs[arcs[n].prev_out].next_out = arcs[n].next_out; in erase()
131 (*_nodes)[arcs[n].source].first_out = arcs[n].next_out; in erase()
134 arcs[arcs[n].next_out].prev_out = arcs[n].prev_out; in erase()
145 arcs.clear(); in clear()
468 arcs[arcs[n].next_out].prev_out = arcs[n].prev_out; in erase()
472 arcs[arcs[n].prev_out].next_out = arcs[n].next_out; in erase()
478 arcs[arcs[n | 1].next_out].prev_out = arcs[n | 1].prev_out; in erase()
[all …]
H A Dsmart_graph.h51 std::vector<ArcT> arcs; variable
64 : nodes(_g.nodes), arcs(_g.arcs) { } in SmartDigraphBase()
96 arcs.clear(); in clear()
317 nodes[arcs.back().source].first_out=arcs.back().next_out; in restoreSnapshot()
318 nodes[arcs.back().target].first_in=arcs.back().next_in; in restoreSnapshot()
601 arcs.clear(); in clear()
739 nodes[arcs[n-1].target].first_out=arcs[n].next_out; in restoreSnapshot()
740 nodes[arcs[n].target].first_out=arcs[n-1].next_out; in restoreSnapshot()
1100 arcs.clear(); in clear()
1251 nodes[arcs[n-1].target].first_out=arcs[n].next_out; in restoreSnapshot()
[all …]
/dports/misc/openmvg/openMVG-2.0/src/third_party/lemon/lemon/
H A Dlist_graph.h246 arcs[arcs[n].next_in].prev_in = arcs[n].prev_in; in erase()
250 arcs[arcs[n].prev_in].next_in = arcs[n].next_in; in erase()
257 arcs[arcs[n].next_out].prev_out = arcs[n].prev_out; in erase()
261 arcs[arcs[n].prev_out].next_out = arcs[n].next_out; in erase()
281 arcs[arcs[e.id].next_in].prev_in = arcs[e.id].prev_in; in changeTarget()
283 arcs[arcs[e.id].prev_in].next_in = arcs[e.id].next_in; in changeTarget()
296 arcs[arcs[e.id].next_out].prev_out = arcs[e.id].prev_out; in changeSource()
298 arcs[arcs[e.id].prev_out].next_out = arcs[e.id].next_out; in changeSource()
1096 arcs[arcs[n].next_out].prev_out = arcs[n].prev_out; in erase()
1100 arcs[arcs[n].prev_out].next_out = arcs[n].next_out; in erase()
[all …]
H A Dedge_set.h120 arcs[arcs[n].prev_in].next_in = arcs[n].next_in; in erase()
122 (*_nodes)[arcs[n].target].first_in = arcs[n].next_in; in erase()
125 arcs[arcs[n].next_in].prev_in = arcs[n].prev_in; in erase()
129 arcs[arcs[n].prev_out].next_out = arcs[n].next_out; in erase()
131 (*_nodes)[arcs[n].source].first_out = arcs[n].next_out; in erase()
134 arcs[arcs[n].next_out].prev_out = arcs[n].prev_out; in erase()
145 arcs.clear(); in clear()
468 arcs[arcs[n].next_out].prev_out = arcs[n].prev_out; in erase()
472 arcs[arcs[n].prev_out].next_out = arcs[n].next_out; in erase()
478 arcs[arcs[n | 1].next_out].prev_out = arcs[n | 1].prev_out; in erase()
[all …]
H A Dsmart_graph.h51 std::vector<ArcT> arcs; variable
64 : nodes(_g.nodes), arcs(_g.arcs) { } in SmartDigraphBase()
96 arcs.clear(); in clear()
317 nodes[arcs.back().source].first_out=arcs.back().next_out; in restoreSnapshot()
318 nodes[arcs.back().target].first_in=arcs.back().next_in; in restoreSnapshot()
601 arcs.clear(); in clear()
739 nodes[arcs[n-1].target].first_out=arcs[n].next_out; in restoreSnapshot()
740 nodes[arcs[n].target].first_out=arcs[n-1].next_out; in restoreSnapshot()
1100 arcs.clear(); in clear()
1251 nodes[arcs[n-1].target].first_out=arcs[n].next_out; in restoreSnapshot()
[all …]
/dports/devel/tcllib/tcllib-1.20/modules/struct/graph/tests/
H A Darcs.test2 # Graph tests - arcs
7 # Syntax: graph arcs
30 test graph-${impl}-${setimpl}-arcs-1.0 {arcs, bad switch} {
40 test graph-${impl}-${setimpl}-arcs-2.0 {arcs, empty graph} {
47 test graph-${impl}-${setimpl}-arcs-2.1 {arcs, nodes without arcs} {
55 test graph-${impl}-${setimpl}-arcs-2.2 {arcs} {
89 test graph-${impl}-${setimpl}-arcs-key-2.0 {arcs, multiple -key} {
113 test graph-${impl}-${setimpl}-arcs-key-3.0 {arcs, -key} {
126 test graph-${impl}-${setimpl}-arcs-key-3.1 {arcs, -key, -value} {
165 test graph-${impl}-${setimpl}-arcs-filter-3.0 {arcs, -filter} {
[all …]
/dports/devel/tcllibc/tcllib-1.20/modules/struct/graph/tests/
H A Darcs.test2 # Graph tests - arcs
7 # Syntax: graph arcs
30 test graph-${impl}-${setimpl}-arcs-1.0 {arcs, bad switch} {
40 test graph-${impl}-${setimpl}-arcs-2.0 {arcs, empty graph} {
47 test graph-${impl}-${setimpl}-arcs-2.1 {arcs, nodes without arcs} {
55 test graph-${impl}-${setimpl}-arcs-2.2 {arcs} {
89 test graph-${impl}-${setimpl}-arcs-key-2.0 {arcs, multiple -key} {
113 test graph-${impl}-${setimpl}-arcs-key-3.0 {arcs, -key} {
126 test graph-${impl}-${setimpl}-arcs-key-3.1 {arcs, -key, -value} {
165 test graph-${impl}-${setimpl}-arcs-filter-3.0 {arcs, -filter} {
[all …]
/dports/math/gravity/Gravity-da941e9/examples/Optimization/NonLinear/Power/SDPCUTS/
H A DSDPCUTS_main.cpp159 auto arcs = indices(grid.arcs); in main() local
239 SDP.add(Pf_from.in(arcs), Qf_from.in(arcs),Pf_to.in(arcs),Qf_to.in(arcs)); in main()
262 SDP.add(lij.in(arcs),lji.in(arcs)); in main()
329 …Flow_P_From = Pf_from - (g_ff*Wii.from(arcs) + g_ft*R_Wij.in_pairs(arcs) + b_ft*Im_Wij.in_pairs(ar… in main()
334 … Flow_P_To = Pf_to - (g_tt*Wii.to(arcs) + g_tf*R_Wij.in_pairs(arcs) - b_tf*Im_Wij.in_pairs(arcs)); in main()
339 …Flow_Q_From = Qf_from - (g_ft*Im_Wij.in_pairs(arcs) - b_ff*Wii.from(arcs) - b_ft*R_Wij.in_pairs(ar… in main()
344 Flow_Q_To = Qf_to + b_tt*Wii.to(arcs) + b_tf*R_Wij.in_pairs(arcs) + g_tf*Im_Wij.in_pairs(arcs); in main()
422 T.real_imag(cc.in(arcs), dd.in(arcs)); in main()
423 Y.real_imag(g.in(arcs), b.in(arcs)); in main()
430 Sij.real_imag(Pf_from.in(arcs), Qf_from.in(arcs)); in main()
[all …]
/dports/net/fort/FORT-validator-1.5.3/src/asn1/
H A Doid.c9 free_arcs(struct oid_arcs *arcs) in free_arcs() argument
11 free(arcs->arcs); in free_arcs()
30 result->arcs = malloc(MAX_ARCS * sizeof(asn_oid_arc_t)); in oid2arcs()
31 if (result->arcs == NULL) in oid2arcs()
37 free(result->arcs); in oid2arcs()
45 tmp = realloc(result->arcs, count * sizeof(asn_oid_arc_t)); in oid2arcs()
47 free(result->arcs); in oid2arcs()
50 result->arcs = tmp; in oid2arcs()
56 free(result->arcs); in oid2arcs()
88 return __arcs_equal(a->arcs, a->count, b->arcs, b->count); in arcs_equal()
[all …]
/dports/databases/postgis30/postgis-3.0.4/liblwgeom/
H A Dlwtin.c98 tin_arcs arcs; in lwtin_is_closed() local
131 if ( ( arcs[k].ax == pa.x && arcs[k].ay == pa.y && in lwtin_is_closed()
132 arcs[k].az == pa.z && arcs[k].bx == pb.x && in lwtin_is_closed()
133 arcs[k].by == pb.y && arcs[k].bz == pb.z && in lwtin_is_closed()
136 arcs[k].cnt++; in lwtin_is_closed()
143 lwfree(arcs); in lwtin_is_closed()
151 arcs[carc].cnt=1; in lwtin_is_closed()
152 arcs[carc].face=i; in lwtin_is_closed()
165 lwfree(arcs); in lwtin_is_closed()
178 lwfree(arcs); in lwtin_is_closed()
[all …]
/dports/databases/postgis32/postgis-3.2.0/liblwgeom/
H A Dlwtin.c98 tin_arcs arcs; in lwtin_is_closed() local
131 if ( ( arcs[k].ax == pa.x && arcs[k].ay == pa.y && in lwtin_is_closed()
132 arcs[k].az == pa.z && arcs[k].bx == pb.x && in lwtin_is_closed()
133 arcs[k].by == pb.y && arcs[k].bz == pb.z && in lwtin_is_closed()
136 arcs[k].cnt++; in lwtin_is_closed()
143 lwfree(arcs); in lwtin_is_closed()
151 arcs[carc].cnt=1; in lwtin_is_closed()
152 arcs[carc].face=i; in lwtin_is_closed()
165 lwfree(arcs); in lwtin_is_closed()
178 lwfree(arcs); in lwtin_is_closed()
[all …]

12345678910>>...143