Home
last modified time | relevance | path

Searched refs:vids (Results 1 – 25 of 831) sorted by relevance

12345678910>>...34

/dports/databases/pgrouting/pgrouting-3.2.0/pgtap/astar/
H A Dastar_ManyToMany-compare-dijkstra.test.sql37 vids TEXT;
41 vids := ' ARRAY[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18] ';
50 || ',' || vids || ', true)';
52 astar_sql := 'SELECT ' || data || ' FROM pgr_astar($$' || inner_sql || '$$, ' || vids
53 || ',' || vids || ', true, heuristic := 0)';
58 || ',' || vids || ', false)';
61 || ', ' || vids || ', false, heuristic := 0)';
70 || ',' || vids || ', true)';
73 || ',' || vids || ', true, heuristic := 0)';
78 || ',' || vids || ', false)';
[all …]
H A Dastar_ManyToOne-compare-dijkstra.test.sql39 vids TEXT;
43 vids := ' ARRAY[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18] ';
52 dijkstra_sql := 'SELECT ' || data || ' FROM pgr_dijkstra($$' || inner_sql || '$$, ' || vids
55 astar_sql := 'SELECT ' || data || ' FROM pgr_astar($$' || inner_sql || '$$, ' || vids
60 dijkstra_sql := 'SELECT ' || data || ' FROM pgr_dijkstra($$' || inner_sql || '$$, ' || vids
63 astar_sql := 'SELECT ' || data || ' FROM pgr_astar($$' || inner_sql || '$$, ' || vids
72 dijkstra_sql := 'SELECT ' || data || ' FROM pgr_dijkstra($$' || inner_sql || '$$, ' || vids
75 astar_sql := 'SELECT ' || data || ' FROM pgr_astar($$' || inner_sql || '$$, ' || vids
80 dijkstra_sql := 'SELECT ' || data || ' FROM pgr_dijkstra($$' || inner_sql || '$$, ' || vids
83 astar_sql := 'SELECT ' || data || ' FROM pgr_astar($$' || inner_sql || '$$, ' || vids
H A Dastar_oneToMany-compare-dijkstra.test.sql39 vids TEXT;
43 vids = ' ARRAY[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18] ';
52 …ra_sql := 'SELECT ' || data || ' FROM pgr_dijkstra($$' || inner_sql || '$$, ' || i || ', ' || vids
55 … astar_sql := 'SELECT ' || data || ' FROM pgr_astar($$' || inner_sql || '$$, ' || i || ', ' || vids
60 …tra_sql := 'SELECT ' || data || ' FROM pgr_dijkstra($$' || inner_sql || '$$, ' || i || ', ' || vids
63 … astar_sql := 'SELECT ' || data || ' FROM pgr_astar($$' || inner_sql || '$$, ' || i || ', ' || vids
72 …tra_sql := 'SELECT ' || data || ' FROM pgr_dijkstra($$' || inner_sql || '$$, ' || i || ', ' || vids
75 … astar_sql := 'SELECT ' || data || ' FROM pgr_astar($$' || inner_sql || '$$, ' || i || ', ' || vids
80 …tra_sql := 'SELECT ' || data || ' FROM pgr_dijkstra($$' || inner_sql || '$$, ' || i || ', ' || vids
83 … astar_sql := 'SELECT ' || data || ' FROM pgr_astar($$' || inner_sql || '$$, ' || i || ', ' || vids
/dports/databases/pgrouting/pgrouting-3.2.0/src/spanningTree/
H A Ddetails.cpp33 clean_vids(std::vector<int64_t> vids) { in clean_vids() argument
34 std::sort(vids.begin(), vids.end()); in clean_vids()
35 vids.erase( in clean_vids()
36 std::unique(vids.begin(), vids.end()), in clean_vids()
37 vids.end()); in clean_vids()
38 vids.erase( in clean_vids()
39 std::remove(vids.begin(), vids.end(), 0), in clean_vids()
40 vids.end()); in clean_vids()
41 return vids; in clean_vids()
46 std::vector<int64_t> vids) { in get_no_edge_graph_result() argument
[all …]
/dports/graphics/aloadimage/arcan-0.6.1/data/scripts/builtin/
H A Ddecorator.lua40 for _,v in pairs(ctx.vids) do
53 local vid = ctx.vids[v]
62 for _, v in pairs(ctx.vids) do
199 vids = {},
231 order_image(res.vids.t, 1)
248 image_inherit_order(res.vids.l, true)
252 order_image(res.vids.l, 1)
267 image_inherit_order(res.vids.d, true)
271 order_image(res.vids.d, 1)
287 image_inherit_order(res.vids.r, true)
[all …]
/dports/sysutils/acfgfs/arcan-0.6.1/data/scripts/builtin/
H A Ddecorator.lua40 for _,v in pairs(ctx.vids) do
53 local vid = ctx.vids[v]
62 for _, v in pairs(ctx.vids) do
199 vids = {},
231 order_image(res.vids.t, 1)
248 image_inherit_order(res.vids.l, true)
252 order_image(res.vids.l, 1)
267 image_inherit_order(res.vids.d, true)
271 order_image(res.vids.d, 1)
287 image_inherit_order(res.vids.r, true)
[all …]
/dports/x11/arcan-trayicon/arcan-0.6.1/data/scripts/builtin/
H A Ddecorator.lua40 for _,v in pairs(ctx.vids) do
53 local vid = ctx.vids[v]
62 for _, v in pairs(ctx.vids) do
199 vids = {},
231 order_image(res.vids.t, 1)
248 image_inherit_order(res.vids.l, true)
252 order_image(res.vids.l, 1)
267 image_inherit_order(res.vids.d, true)
271 order_image(res.vids.d, 1)
287 image_inherit_order(res.vids.r, true)
[all …]
/dports/x11/aclip/arcan-0.6.1/data/scripts/builtin/
H A Ddecorator.lua40 for _,v in pairs(ctx.vids) do
53 local vid = ctx.vids[v]
62 for _, v in pairs(ctx.vids) do
199 vids = {},
231 order_image(res.vids.t, 1)
248 image_inherit_order(res.vids.l, true)
252 order_image(res.vids.l, 1)
267 image_inherit_order(res.vids.d, true)
271 order_image(res.vids.d, 1)
287 image_inherit_order(res.vids.r, true)
[all …]
/dports/math/igraph/igraph-0.9.5/tests/unit/
H A Disoclasses.c32 igraph_vector_t vids; in main() local
43 igraph_vector_init_int_end(&vids, -1, 1, 4, 6, -1); in main()
44 igraph_isoclass_subgraph(&g, &vids, &class); in main()
46 igraph_vector_destroy(&vids); in main()
48 igraph_vector_init_int_end(&vids, -1, 0, 1, 3, -1); in main()
49 igraph_isoclass_subgraph(&g, &vids, &class); in main()
51 igraph_vector_destroy(&vids); in main()
54 igraph_isoclass_subgraph(&g, &vids, &class); in main()
56 igraph_vector_destroy(&vids); in main()
59 igraph_isoclass_subgraph(&g, &vids, &class); in main()
[all …]
H A Digraph_neighborhood_size.c25 igraph_vs_t vids; in main() local
30 igraph_vs_all(&vids); in main()
36 IGRAPH_ASSERT(igraph_neighborhood_size(&g_empty, &result, vids, /*order*/ 1, in main()
41 IGRAPH_ASSERT(igraph_neighborhood_size(&g_lm, &result, vids, /*order*/ 0, in main()
46 IGRAPH_ASSERT(igraph_neighborhood_size(&g_lm, &result, vids, /*order*/ 1, in main()
51 IGRAPH_ASSERT(igraph_neighborhood_size(&g_lm, &result, vids, /*order*/ 1, in main()
56 IGRAPH_ASSERT(igraph_neighborhood_size(&g_lm, &result, vids, /*order*/ 10, in main()
61 IGRAPH_ASSERT(igraph_neighborhood_size(&g_lm, &result, vids, /*order*/ 2, in main()
66 IGRAPH_ASSERT(igraph_neighborhood_size(&g_lm, &result, vids, /*order*/ 4, in main()
74 IGRAPH_ASSERT(igraph_neighborhood_size(&g_lm, &result, vids, /*order*/ -4, in main()
[all …]
H A Digraph_neighborhood.c36 igraph_vs_t vids; in main() local
39 igraph_vs_all(&vids); in main()
45 IGRAPH_ASSERT(igraph_neighborhood(&g_empty, &result, vids, /*order*/ 1, in main()
50 IGRAPH_ASSERT(igraph_neighborhood(&g_lm, &result, vids, /*order*/ 0, in main()
55 IGRAPH_ASSERT(igraph_neighborhood(&g_lm, &result, vids, /*order*/ 1, in main()
60 IGRAPH_ASSERT(igraph_neighborhood(&g_lm, &result, vids, /*order*/ 1, in main()
65 IGRAPH_ASSERT(igraph_neighborhood(&g_lm, &result, vids, /*order*/ 10, in main()
70 IGRAPH_ASSERT(igraph_neighborhood(&g_lm, &result, vids, /*order*/ 2, in main()
75 IGRAPH_ASSERT(igraph_neighborhood(&g_lm, &result, vids, /*order*/ 4, in main()
83 IGRAPH_ASSERT(igraph_neighborhood(&g_lm, &result, vids, /*order*/ -4, in main()
[all …]
H A Digraph_neighborhood_graphs.c43 igraph_vs_t vids; in main() local
46 igraph_vs_all(&vids); in main()
52 IGRAPH_ASSERT(igraph_neighborhood_graphs(&g_empty, &result, vids, /*order*/ 1, in main()
57 IGRAPH_ASSERT(igraph_neighborhood_graphs(&g_lm, &result, vids, /*order*/ 0, in main()
62 IGRAPH_ASSERT(igraph_neighborhood_graphs(&g_lm, &result, vids, /*order*/ 1, in main()
67 IGRAPH_ASSERT(igraph_neighborhood_graphs(&g_lm, &result, vids, /*order*/ 1, in main()
72 IGRAPH_ASSERT(igraph_neighborhood_graphs(&g_lm, &result, vids, /*order*/ 10, in main()
77 IGRAPH_ASSERT(igraph_neighborhood_graphs(&g_lm, &result, vids, /*order*/ 2, in main()
82 IGRAPH_ASSERT(igraph_neighborhood_graphs(&g_lm, &result, vids, /*order*/ 4, in main()
90 IGRAPH_ASSERT(igraph_neighborhood_graphs(&g_lm, &result, vids, /*order*/ -4, in main()
[all …]
H A Digraph_shortest_paths_johnson.c25 igraph_vs_t vids; in main() local
29 igraph_vs_all(&vids); in main()
40 …IGRAPH_ASSERT(igraph_shortest_paths_johnson(&g_empty, &result, vids, vids, &weights_empty) == IGRA… in main()
44 …IGRAPH_ASSERT(igraph_shortest_paths_johnson(&g_empty_dir, &result, vids, vids, &weights_empty) == … in main()
48 …IGRAPH_ASSERT(igraph_shortest_paths_johnson(&g_lm, &result, vids, vids, &weights_lm_neg_loop) == I… in main()
51 …IGRAPH_ASSERT(igraph_shortest_paths_johnson(&g_lm, &result, vids, vids, &weights_lm) == IGRAPH_SUC… in main()
H A Dbfs_simple.c29 igraph_vector_t vids, layers, parents; in main() local
31 igraph_vector_init(&vids, 0); in main()
37 igraph_bfs_simple(&g, 0, IGRAPH_ALL, &vids, &layers, &parents); in main()
38 print_vector_round(&vids); in main()
45 igraph_bfs_simple(&g, 0, IGRAPH_ALL, &vids, &layers, &parents); in main()
46 print_vector_round(&vids); in main()
64 igraph_vector_destroy(&vids); in main()
/dports/databases/pgrouting/pgrouting-3.2.0/pgtap/spanningTree/
H A Dcompare-primBFS-kruskalBFS.sql38 vids TEXT;
45 vids := ' ARRAY[2, 5] ';
68 prim_sql := 'SELECT ' || data || ' FROM pgr_primBFS($$' || inner1_sql || '$$, ' || vids || ')';
69 …kruskal_sql := 'SELECT ' || data || ' FROM pgr_kruskalBFS($$' || inner1_sql || '$$, ' || vids || '…
76 prim_sql := 'SELECT ' || data || ' FROM pgr_primBFS($$' || inner2_sql || '$$, ' || vids || ')';
77 …kruskal_sql := 'SELECT ' || data || ' FROM pgr_kruskalBFS($$' || inner2_sql || '$$, ' || vids || '…
93 vids TEXT;
100 vids := ' ARRAY[2, 5] ';
123 …prim_sql := 'SELECT ' || data || ' FROM pgr_primBFS($$' || inner1_sql || '$$, ' || vids || ', ' ||…
124 …kruskal_sql := 'SELECT ' || data || ' FROM pgr_kruskalBFS($$' || inner1_sql || '$$, ' || vids || '…
[all …]
H A Dcompare-primDFS-kruskalDFS.sql38 vids TEXT;
45 vids := ' ARRAY[2, 5] ';
68 prim_sql := 'SELECT ' || data || ' FROM pgr_primDFS($$' || inner1_sql || '$$, ' || vids || ')';
69 …kruskal_sql := 'SELECT ' || data || ' FROM pgr_kruskalDFS($$' || inner1_sql || '$$, ' || vids || '…
76 prim_sql := 'SELECT ' || data || ' FROM pgr_primDFS($$' || inner2_sql || '$$, ' || vids || ')';
77 …kruskal_sql := 'SELECT ' || data || ' FROM pgr_kruskalDFS($$' || inner2_sql || '$$, ' || vids || '…
93 vids TEXT;
100 vids := ' ARRAY[2, 5] ';
123 …prim_sql := 'SELECT ' || data || ' FROM pgr_primDFS($$' || inner1_sql || '$$, ' || vids || ', ' ||…
124 …kruskal_sql := 'SELECT ' || data || ' FROM pgr_kruskalDFS($$' || inner1_sql || '$$, ' || vids || '…
[all …]
H A Dcompare-primDD-kruskalDD.sql38 vids TEXT;
45 vids := ' ARRAY[2, 5] ';
68 …prim_sql := 'SELECT ' || data || ' FROM pgr_primDD($$' || inner1_sql || '$$, ' || vids || ', ' || …
69 …kruskal_sql := 'SELECT ' || data || ' FROM pgr_kruskalDD($$' || inner1_sql || '$$, ' || vids || ',…
76 …prim_sql := 'SELECT ' || data || ' FROM pgr_primDD($$' || inner2_sql || '$$, ' || vids || ', ' || …
77 …kruskal_sql := 'SELECT ' || data || ' FROM pgr_kruskalDD($$' || inner2_sql || '$$, ' || vids || ',…
/dports/multimedia/avinfo/avinfo-1.0.a15/src/
H A Dmpeg.c130 vids_t vids[MAX_STREAMS]; in mpegparse() local
202 vids[vids_n].exist=1; in mpegparse()
203 vids[vids_n].exist=1; in mpegparse()
204 vids[vids_n].x=(buffer[pos++]<<4); in mpegparse()
206 vids[vids_n].y+=(buffer[pos++]); in mpegparse()
208 vids[vids_n].fps=(buffer[pos++]&0x0F); in mpegparse()
212 vids[vids_n].bitrate*=400; in mpegparse()
213 common_bitrate+=vids[vids_n].bitrate; in mpegparse()
252 if(vids[c].exist){ in mpegparse()
254 SetIdxNumericVar("v%d.x",c+1,vids[c].x); in mpegparse()
[all …]
/dports/math/fcl05/fcl-0.5.0/include/fcl/
H A Ddata_types.h57 std::size_t vids[3]; variable
72 vids[0] = p1; vids[1] = p2; vids[2] = p3; in set()
76 inline std::size_t operator[](int i) const { return vids[i]; }
78 inline std::size_t& operator[](int i) { return vids[i]; }
/dports/math/igraph/igraph-0.9.5/src/operators/
H A Dsubgraph.c38 const igraph_t *graph, igraph_t *res, const igraph_vs_t vids, in igraph_i_induced_subgraph_copy_and_delete() argument
47 IGRAPH_CHECK(igraph_vit_create(graph, vids, &vit)); in igraph_i_induced_subgraph_copy_and_delete()
98 const igraph_t *graph, igraph_t *res, const igraph_vs_t vids, in igraph_i_induced_subgraph_create_from_scratch() argument
137 IGRAPH_CHECK(igraph_vit_create(graph, vids, &vit)); in igraph_i_induced_subgraph_create_from_scratch()
308 return igraph_induced_subgraph_map(graph, res, vids, impl, /* map= */ 0, in igraph_induced_subgraph()
313 const igraph_t *graph, const igraph_vs_t vids, in igraph_i_induced_subgraph_suggest_implementation() argument
318 if (igraph_vs_is_all(&vids)) { in igraph_i_induced_subgraph_suggest_implementation()
321 IGRAPH_CHECK(igraph_vs_size(graph, &vids, &num_vs)); in igraph_i_induced_subgraph_suggest_implementation()
336 const igraph_vs_t vids, in igraph_i_induced_subgraph_map() argument
351 return igraph_i_induced_subgraph_create_from_scratch(graph, res, vids, map, in igraph_i_induced_subgraph_map()
[all …]
/dports/x11-wm/durden/durden-0.6.1/durden/uiprim/
H A Dbuttongrid.lua35 return ctx.vids[vid] ~= nil;
39 local tbl = ctx.vids[vid];
48 if (not ctx.vids[vid].cmd) then
51 ctx.vids[vid].cmd();
58 if (not ctx.vids[vid].cmd) then
62 ctx.vids[vid].cmd(true);
70 local tbl = ctx.vids[vid];
87 vids = {},
147 res.vids[btn] = buttons[ind];
/dports/math/igraph/igraph-0.9.5/include/
H A Digraph_centrality.h42 const igraph_vs_t vids, igraph_neimode_t mode,
46 const igraph_vs_t vids, igraph_neimode_t mode,
52 const igraph_vs_t vids, igraph_neimode_t mode,
56 const igraph_vs_t vids, igraph_neimode_t mode,
62 const igraph_vs_t vids, igraph_bool_t directed,
65 const igraph_vs_t vids, igraph_bool_t directed,
93 igraph_real_t *value, const igraph_vs_t vids,
98 igraph_real_t *value, const igraph_vs_t vids,
105 igraph_real_t *value, const igraph_vs_t vids,
126 igraph_vs_t vids, const igraph_vector_t *weights);
[all …]
/dports/math/plplot-ada/plplot-5.15.0/lib/nn/
H A Ddelaunay.c209 circle_build( c, &d->points[t->vids[0]], &d->points[t->vids[1]], &d->points[t->vids[2]] ); in tio2delaunay()
212 fprintf( stderr, " %d: (%d,%d,%d)\n", i, t->vids[0], t->vids[1], t->vids[2] ); in tio2delaunay()
239 int vid = t->vids[j]; in tio2delaunay()
485 t->vids[1] = t->vids[2];
486 t->vids[2] = tmp;
493 circle_build( c, &d->points[t->vids[0]], &d->points[t->vids[1]],
498 i, t->vids[0], t->vids[1], t->vids[2], n->tids[0],
530 int vid = t->vids[j];
564 point* pa = &d->points[t->vids[0]];
648 if ( on_right_side( p, &d->points[t->vids[i]], &d->points[t->vids[i1]] ) ) in delaunay_xytoi()
[all …]
/dports/math/plplot/plplot-5.15.0/lib/nn/
H A Ddelaunay.c209 circle_build( c, &d->points[t->vids[0]], &d->points[t->vids[1]], &d->points[t->vids[2]] ); in tio2delaunay()
212 fprintf( stderr, " %d: (%d,%d,%d)\n", i, t->vids[0], t->vids[1], t->vids[2] ); in tio2delaunay()
239 int vid = t->vids[j]; in tio2delaunay()
485 t->vids[1] = t->vids[2];
486 t->vids[2] = tmp;
493 circle_build( c, &d->points[t->vids[0]], &d->points[t->vids[1]],
498 i, t->vids[0], t->vids[1], t->vids[2], n->tids[0],
530 int vid = t->vids[j];
564 point* pa = &d->points[t->vids[0]];
648 if ( on_right_side( p, &d->points[t->vids[i]], &d->points[t->vids[i1]] ) ) in delaunay_xytoi()
[all …]
/dports/math/R-cran-igraph/igraph/src/include/
H A Digraph_centrality.h41 const igraph_vs_t vids, igraph_neimode_t mode,
44 const igraph_vs_t vids, igraph_neimode_t mode,
50 const igraph_vs_t vids, igraph_bool_t directed,
53 const igraph_vs_t vids, igraph_bool_t directed,
64 const igraph_vs_t vids, igraph_bool_t directed,
105 igraph_real_t *value, const igraph_vs_t vids,
110 igraph_real_t *value, const igraph_vs_t vids,
117 igraph_real_t *value, const igraph_vs_t vids,
138 igraph_vs_t vids, const igraph_vector_t *weights);
141 const igraph_vs_t vids, igraph_neimode_t mode,
[all …]

12345678910>>...34