Home
last modified time | relevance | path

Searched refs:gr (Results 1 – 25 of 8812) sorted by relevance

12345678910>>...353

/dports/math/mathgl/mathgl-2.5/examples/
H A Dsamples.cpp80 gr->Axis(); gr->Box(); gr->Plot(x,y,"o "); in smgl_refill()
85 gr->Axis(); gr->Box(); gr->Plot(x,y,"o "); in smgl_refill()
95 gr->Axis(); gr->Box(); gr->Mesh(x,y,z,"k"); in smgl_refill()
164 gr->Plot(a); gr->Plot(b); gr->Axis(); gr->Box(); in smgl_correl()
168 gr->Plot(r,"r"); gr->Axis(); gr->Box(); in smgl_correl()
430 …gr->SubPlot(4,3,8); gr->Rotate(40,60); gr->Box(); gr->DensX(c,"",0); gr->DensY(c,"",0); gr->DensZ(… in smgl_param3()
431 …gr->SubPlot(4,3,9); gr->Rotate(40,60); gr->Box(); gr->ContX(c,"",0); gr->ContY(c,"",0); gr->ContZ(… in smgl_param3()
1597 gr->Light(true); gr->Alpha(true); gr->Rotate(50,60); gr->Box(); gr->Axial(a); in smgl_axial()
2605 gr->Axis(); gr->Grid(); gr->Box(); in smgl_ternary()
2619 gr->Axis(); gr->Grid(); gr->Box(); in smgl_ternary()
[all …]
H A Dwnd_samples.cpp113 gr->Box(); gr->Axis("xy"); gr->Label('x',"x"); gr->Label('y',"y"); in sample_1()
119 gr->Box(); gr->Axis("xy"); gr->Label('x',"x"); gr->Label('y',"y"); in sample_1()
128 gr->Box(); gr->Axis("xy"); gr->Label('x',"x"); gr->Label('y',"y"); in sample_1()
136 gr->Box(); gr->Axis("xy"); gr->Label('x',"x"); gr->Label('y',"y"); in sample_1()
142 gr->Box(); gr->Axis("xy"); gr->Label('x',"x"); gr->Label('y',"y"); in sample_1()
151 gr->Box(); gr->Axis(); gr->Label('x',"x"); gr->Label('y',"y"); gr->Label('z',"z"); in sample_1()
157 gr->Box(); gr->Axis("xy"); gr->Label('x',"x"); gr->Label('y',"y"); in sample_1()
178 gr->Box(); gr->Axis(); gr->Label('x',"x"); gr->Label('y',"y"); in sample_1()
183 gr->Box(); gr->Axis(); gr->Label('x',"x"); gr->Label('y',"y"); in sample_1()
188 gr->Box(); gr->Axis(); gr->Label('x',"x"); gr->Label('y',"y"); in sample_1()
[all …]
/dports/sysutils/tmux/tmux-3.2a/
H A Dgrid-reader.c58 if (wrap && gr->cx >= px && gr->cy < gr->gd->hsize + gr->gd->sy - 1) { in grid_reader_cursor_right()
64 grid_get_cell(gr->gd, gr->cx, gr->cy, &gc); in grid_reader_cursor_right()
79 grid_get_cell(gr->gd, gr->cx, gr->cy, &gc); in grid_reader_cursor_left()
84 if (gr->cx == 0 && gr->cy > 0 && in grid_reader_cursor_left()
99 if (gr->cy < gr->gd->hsize + gr->gd->sy - 1) in grid_reader_cursor_down()
102 grid_get_cell(gr->gd, gr->cx, gr->cy, &gc); in grid_reader_cursor_down()
118 grid_get_cell(gr->gd, gr->cx, gr->cy, &gc); in grid_reader_cursor_up()
146 while (gr->cy < yy && grid_get_line(gr->gd, gr->cy)->flags & in grid_reader_cursor_end_of_line()
151 gr->cx = gr->gd->sx; in grid_reader_cursor_end_of_line()
162 grid_get_cell(gr->gd, gr->cx, gr->cy, &gc); in grid_reader_in_set()
[all …]
/dports/science/quantum-espresso/q-e-qe-6.7.0/GWW/gww/
H A Dgreen_function.f9047 if(associated(gr%gf)) deallocate(gr%gf)
49 if(associated(gr%gf_p)) deallocate(gr%gf_p)
110 allocate(gr%gf(gr%nums,gr%nums,gr%nspin))
229 allocate(gr%gf_p(gr%nums,gr%nums,gr%nspin))
304 if(gr%label > 0 .or. (gr%label == 0 .and. .not.gr%zero_time_neg)) then
306 …& gr%label/10000,mod(gr%label,10000)/1000,mod(gr%label,1000)/100,mod(gr%label,100)/10,mod(gr%label…
315 …& -gr%label/10000,mod(-gr%label,10000)/1000,mod(-gr%label,1000)/100,mod(-gr%label,100)/10,mod(-gr%…
420 allocate(gr%gf(gr%nums,gr%nums,gr%nspin))
423 allocate(gr%gf_p(gr%nums,gr%nums,gr%nspin))
450 allocate(gr%gf(gr%nums,gr%nums,gr%nspin))
[all …]
/dports/www/squid/squid-4.15/src/acl/external/kerberos_ldap_group/
H A Dsupport_member.cc56 struct gdstruct *gr; in check_memberof() local
61 gr = margs->groups; in check_memberof()
62 while (gr && domain) { in check_memberof()
64 if (gr->domain && !strcasecmp(gr->domain, domain)) { in check_memberof()
81 gr = gr->next; in check_memberof()
89 gr = margs->groups; in check_memberof()
92 if (gr->domain && !strcasecmp(gr->domain, "")) { in check_memberof()
109 gr = gr->next; in check_memberof()
117 gr = margs->groups; in check_memberof()
118 while (gr) { in check_memberof()
[all …]
/dports/comms/gnuradio/gnuradio-3.8.4.0/gr-blocks/lib/
H A Dqa_gr_flowgraph.cc100 gr::flowgraph_sptr fg = gr::make_flowgraph(); in BOOST_AUTO_TEST_CASE()
107 gr::flowgraph_sptr fg = gr::make_flowgraph(); in BOOST_AUTO_TEST_CASE()
117 gr::flowgraph_sptr fg = gr::make_flowgraph(); in BOOST_AUTO_TEST_CASE()
127 gr::flowgraph_sptr fg = gr::make_flowgraph(); in BOOST_AUTO_TEST_CASE()
137 gr::flowgraph_sptr fg = gr::make_flowgraph(); in BOOST_AUTO_TEST_CASE()
147 gr::flowgraph_sptr fg = gr::make_flowgraph(); in BOOST_AUTO_TEST_CASE()
157 gr::flowgraph_sptr fg = gr::make_flowgraph(); in BOOST_AUTO_TEST_CASE()
169 gr::flowgraph_sptr fg = gr::make_flowgraph(); in BOOST_AUTO_TEST_CASE()
181 gr::flowgraph_sptr fg = gr::make_flowgraph(); in BOOST_AUTO_TEST_CASE()
191 gr::flowgraph_sptr fg = gr::make_flowgraph(); in BOOST_AUTO_TEST_CASE()
[all …]
/dports/science/octopus/octopus-10.5/src/grid/
H A Dgrid.F90226 call mesh_init_stage_1(gr%mesh, gr%sb, gr%cv, grid_spacing, enlarge)
231 call stencil_union(gr%sb%dim, cube, gr%der%lapl%stencil, gr%stencil)
234 call mesh_init_stage_2(gr%mesh, gr%sb, geo, gr%cv, gr%stencil, namespace)
272 call multigrid_mesh_double(geo, gr%cv, gr%mesh, gr%fine%mesh, gr%stencil, namespace)
279 call multigrid_get_transfer_tables(gr%fine%tt, gr%fine%mesh, gr%mesh)
285 gr%fine%der%coarser => gr%der
286 gr%der%finer => gr%fine%der
288 gr%der%to_finer => gr%fine%tt
291 gr%fine%mesh => gr%mesh
292 gr%fine%der => gr%der
[all …]
/dports/devel/ppl/ppl-1.2/tests/Grid/
H A Drelations2.cc34 Grid gr(2, EMPTY); in test01() local
49 Grid gr(1, EMPTY); in test02() local
66 Grid gr(3, EMPTY); in test03() local
84 Grid gr(2, EMPTY); in test04() local
104 Grid gr(2, EMPTY); in test05() local
134 Grid gr; in test07() local
191 Grid gr(4); in test09() local
278 Grid gr(1); in test14() local
299 Grid gr(2); in test15() local
371 Grid gr(1); in test19() local
[all …]
H A Dgeneralizedaffineimage2.cc37 Grid gr(2); in test01() local
63 Grid gr(2); in test02() local
90 Grid gr(2); in test03() local
116 Grid gr(2); in test04() local
142 Grid gr(2); in test05() local
168 Grid gr(2); in test06() local
194 Grid gr(2); in test07() local
220 Grid gr(2); in test08() local
247 Grid gr(3); in test09() local
277 Grid gr(3); in test10() local
[all …]
H A Drelations3.cc34 Grid gr(2, EMPTY); in test01() local
49 Grid gr(2, EMPTY); in test02() local
80 Grid gr(2, EMPTY); in test03() local
97 Grid gr(2, EMPTY); in test04() local
115 Grid gr; in test05() local
147 Grid gr(2, EMPTY); in test06() local
167 Grid gr(3, EMPTY); in test07() local
190 Grid gr(1, EMPTY); in test08() local
248 Grid gr(1); in test11() local
269 Grid gr(2); in test12() local
[all …]
/dports/math/abs/abs-src-0.908/Database/
H A Dgraph.c151 newgraph1 (gr) in newgraph1() argument
152 Graph *gr; in newgraph1()
163 Graph *gr;
166 if (graph == NULL || gr == NULL || (gr == graph))
210 freegraph (gr) in freegraph() argument
226 worksheet_delgraph (gr->worksheet, gr);
253 … Worksheets(\"%s\").ChartObjects.Add(%d,%d,%d,%d)\n", gr->worksheet->Name, gr->x, gr->y, gr->w, gr… in graph_write()
258 numtoalpha (i1j1, (gr->range[0]).i1, (gr->range[0]).j1); in graph_write()
259 numtoalpha (i2j2, (gr->range[0]).i2, (gr->range[0]).j2); in graph_write()
286 if (gr->Axes[xlCategory].HasTitle && gr->type != 1) in graph_write()
[all …]
/dports/games/pioneers/pioneers-15.6/common/gtk/
H A Dgame-rules.c17 GameRules *gr = user_data; in dice_deck_toggled_callback() local
88 gr->radio_sevens[1] = in game_rules_init()
90 (gr->radio_sevens in game_rules_init()
95 gr->radio_sevens[2] = in game_rules_init()
97 (gr->radio_sevens in game_rules_init()
132 &gr->use_pirate); in game_rules_init()
138 &gr->domestic_trade); in game_rules_init()
149 gr); in game_rules_init()
157 gr->num_dice_decks = in game_rules_init()
227 (gpointer) gr); in game_rules_init()
[all …]
/dports/multimedia/libv4l/linux-5.13-rc2/drivers/gpu/drm/nouveau/nvkm/engine/gr/
H A Dbase.c31 struct nvkm_gr *gr = device->gr; in nvkm_gr_ctxsw_inst() local
32 if (gr && gr->func->ctxsw.inst) in nvkm_gr_ctxsw_inst()
33 return gr->func->ctxsw.inst(gr); in nvkm_gr_ctxsw_inst()
40 struct nvkm_gr *gr = device->gr; in nvkm_gr_ctxsw_resume() local
49 struct nvkm_gr *gr = device->gr; in nvkm_gr_ctxsw_pause() local
50 if (gr && gr->func->ctxsw.pause) in nvkm_gr_ctxsw_pause()
60 return gr->func->chsw_load(gr); in nvkm_gr_chsw_load()
76 return gr->func->units(gr); in nvkm_gr_units()
126 gr->func->intr(gr); in nvkm_gr_intr()
142 return gr->func->init(gr); in nvkm_gr_init()
[all …]
/dports/multimedia/v4l_compat/linux-5.13-rc2/drivers/gpu/drm/nouveau/nvkm/engine/gr/
H A Dbase.c31 struct nvkm_gr *gr = device->gr; in nvkm_gr_ctxsw_inst() local
32 if (gr && gr->func->ctxsw.inst) in nvkm_gr_ctxsw_inst()
33 return gr->func->ctxsw.inst(gr); in nvkm_gr_ctxsw_inst()
40 struct nvkm_gr *gr = device->gr; in nvkm_gr_ctxsw_resume() local
49 struct nvkm_gr *gr = device->gr; in nvkm_gr_ctxsw_pause() local
50 if (gr && gr->func->ctxsw.pause) in nvkm_gr_ctxsw_pause()
60 return gr->func->chsw_load(gr); in nvkm_gr_chsw_load()
76 return gr->func->units(gr); in nvkm_gr_units()
126 gr->func->intr(gr); in nvkm_gr_intr()
142 return gr->func->init(gr); in nvkm_gr_init()
[all …]
/dports/multimedia/v4l-utils/linux-5.13-rc2/drivers/gpu/drm/nouveau/nvkm/engine/gr/
H A Dbase.c31 struct nvkm_gr *gr = device->gr; in nvkm_gr_ctxsw_inst() local
32 if (gr && gr->func->ctxsw.inst) in nvkm_gr_ctxsw_inst()
33 return gr->func->ctxsw.inst(gr); in nvkm_gr_ctxsw_inst()
40 struct nvkm_gr *gr = device->gr; in nvkm_gr_ctxsw_resume() local
49 struct nvkm_gr *gr = device->gr; in nvkm_gr_ctxsw_pause() local
50 if (gr && gr->func->ctxsw.pause) in nvkm_gr_ctxsw_pause()
60 return gr->func->chsw_load(gr); in nvkm_gr_chsw_load()
76 return gr->func->units(gr); in nvkm_gr_units()
126 gr->func->intr(gr); in nvkm_gr_intr()
142 return gr->func->init(gr); in nvkm_gr_init()
[all …]
/dports/devel/rust-analyzer/rust-analyzer-2021-12-20/cargo-crates/petgraph-0.5.1/tests/
H A Dgraph.rs90 assert_eq!(Dfs::new(&gr, h).iter(&gr).count(), 4); in dfs()
91 assert_eq!(Dfs::new(&gr, h).iter(&gr).clone().count(), 4); in dfs()
97 assert_eq!(Dfs::new(&gr, i).iter(&gr).count(), 3); in dfs()
122 for node in Dfs::new(&gr, h).iter(&gr) { in dfs_order()
143 assert_eq!(Bfs::new(&gr, h).iter(&gr).count(), 4); in bfs()
150 assert_eq!(Bfs::new(&gr, i).iter(&gr).count(), 3); in bfs()
1025 let gr = gr.into_edge_type::<Undirected>(); in connected_comp() localVariable
1036 gr[b]; in oob_index()
1152 gr[edge] = gr[target] - gr[source]; in walk_edges()
1250 gr in make_edge_iterator_graph()
[all …]
/dports/net-im/libsignal-client/libsignal-client-0.9.6/cargo-crates/petgraph-0.5.1/tests/
H A Dgraph.rs90 assert_eq!(Dfs::new(&gr, h).iter(&gr).count(), 4); in dfs()
91 assert_eq!(Dfs::new(&gr, h).iter(&gr).clone().count(), 4); in dfs()
97 assert_eq!(Dfs::new(&gr, i).iter(&gr).count(), 3); in dfs()
122 for node in Dfs::new(&gr, h).iter(&gr) { in dfs_order()
143 assert_eq!(Bfs::new(&gr, h).iter(&gr).count(), 4); in bfs()
150 assert_eq!(Bfs::new(&gr, i).iter(&gr).count(), 3); in bfs()
1025 let gr = gr.into_edge_type::<Undirected>(); in connected_comp() localVariable
1036 gr[b]; in oob_index()
1152 gr[edge] = gr[target] - gr[source]; in walk_edges()
1250 gr in make_edge_iterator_graph()
[all …]
/dports/sysutils/vector/vector-0.10.0/cargo-crates/petgraph-0.5.1/tests/
H A Dgraph.rs90 assert_eq!(Dfs::new(&gr, h).iter(&gr).count(), 4); in dfs()
91 assert_eq!(Dfs::new(&gr, h).iter(&gr).clone().count(), 4); in dfs()
97 assert_eq!(Dfs::new(&gr, i).iter(&gr).count(), 3); in dfs()
122 for node in Dfs::new(&gr, h).iter(&gr) { in dfs_order()
143 assert_eq!(Bfs::new(&gr, h).iter(&gr).count(), 4); in bfs()
150 assert_eq!(Bfs::new(&gr, i).iter(&gr).count(), 3); in bfs()
1025 let gr = gr.into_edge_type::<Undirected>(); in connected_comp() localVariable
1036 gr[b]; in oob_index()
1152 gr[edge] = gr[target] - gr[source]; in walk_edges()
1250 gr in make_edge_iterator_graph()
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/petgraph/tests/
H A Dgraph.rs90 assert_eq!(Dfs::new(&gr, h).iter(&gr).count(), 4); in dfs()
91 assert_eq!(Dfs::new(&gr, h).iter(&gr).clone().count(), 4); in dfs()
97 assert_eq!(Dfs::new(&gr, i).iter(&gr).count(), 3); in dfs()
122 for node in Dfs::new(&gr, h).iter(&gr) { in dfs_order()
143 assert_eq!(Bfs::new(&gr, h).iter(&gr).count(), 4); in bfs()
150 assert_eq!(Bfs::new(&gr, i).iter(&gr).count(), 3); in bfs()
1025 let gr = gr.into_edge_type::<Undirected>(); in connected_comp() localVariable
1036 gr[b]; in oob_index()
1152 gr[edge] = gr[target] - gr[source]; in walk_edges()
1250 gr in make_edge_iterator_graph()
[all …]
/dports/net/krill/krill-0.9.4/cargo-crates/petgraph-0.5.1/tests/
H A Dgraph.rs90 assert_eq!(Dfs::new(&gr, h).iter(&gr).count(), 4); in dfs()
91 assert_eq!(Dfs::new(&gr, h).iter(&gr).clone().count(), 4); in dfs()
97 assert_eq!(Dfs::new(&gr, i).iter(&gr).count(), 3); in dfs()
122 for node in Dfs::new(&gr, h).iter(&gr) { in dfs_order()
143 assert_eq!(Bfs::new(&gr, h).iter(&gr).count(), 4); in bfs()
150 assert_eq!(Bfs::new(&gr, i).iter(&gr).count(), 3); in bfs()
1025 let gr = gr.into_edge_type::<Undirected>(); in connected_comp() localVariable
1036 gr[b]; in oob_index()
1152 gr[edge] = gr[target] - gr[source]; in walk_edges()
1250 gr in make_edge_iterator_graph()
[all …]
/dports/devel/texlab/texlab-3.3.0/cargo-crates/petgraph-0.5.1/tests/
H A Dgraph.rs90 assert_eq!(Dfs::new(&gr, h).iter(&gr).count(), 4); in dfs()
91 assert_eq!(Dfs::new(&gr, h).iter(&gr).clone().count(), 4); in dfs()
97 assert_eq!(Dfs::new(&gr, i).iter(&gr).count(), 3); in dfs()
122 for node in Dfs::new(&gr, h).iter(&gr) { in dfs_order()
143 assert_eq!(Bfs::new(&gr, h).iter(&gr).count(), 4); in bfs()
150 assert_eq!(Bfs::new(&gr, i).iter(&gr).count(), 3); in bfs()
1025 let gr = gr.into_edge_type::<Undirected>(); in connected_comp() localVariable
1036 gr[b]; in oob_index()
1152 gr[edge] = gr[target] - gr[source]; in walk_edges()
1250 gr in make_edge_iterator_graph()
[all …]
/dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/petgraph-0.5.1/tests/
H A Dgraph.rs90 assert_eq!(Dfs::new(&gr, h).iter(&gr).count(), 4); in dfs()
91 assert_eq!(Dfs::new(&gr, h).iter(&gr).clone().count(), 4); in dfs()
97 assert_eq!(Dfs::new(&gr, i).iter(&gr).count(), 3); in dfs()
122 for node in Dfs::new(&gr, h).iter(&gr) { in dfs_order()
143 assert_eq!(Bfs::new(&gr, h).iter(&gr).count(), 4); in bfs()
150 assert_eq!(Bfs::new(&gr, i).iter(&gr).count(), 3); in bfs()
1025 let gr = gr.into_edge_type::<Undirected>(); in connected_comp() localVariable
1036 gr[b]; in oob_index()
1152 gr[edge] = gr[target] - gr[source]; in walk_edges()
1250 gr in make_edge_iterator_graph()
[all …]
/dports/lang/rust/rustc-1.58.1-src/vendor/petgraph/tests/
H A Dgraph.rs90 assert_eq!(Dfs::new(&gr, h).iter(&gr).count(), 4); in dfs()
91 assert_eq!(Dfs::new(&gr, h).iter(&gr).clone().count(), 4); in dfs()
97 assert_eq!(Dfs::new(&gr, i).iter(&gr).count(), 3); in dfs()
122 for node in Dfs::new(&gr, h).iter(&gr) { in dfs_order()
143 assert_eq!(Bfs::new(&gr, h).iter(&gr).count(), 4); in bfs()
150 assert_eq!(Bfs::new(&gr, i).iter(&gr).count(), 3); in bfs()
1025 let gr = gr.into_edge_type::<Undirected>(); in connected_comp() localVariable
1036 gr[b]; in oob_index()
1152 gr[edge] = gr[target] - gr[source]; in walk_edges()
1250 gr in make_edge_iterator_graph()
[all …]
/dports/www/firefox-esr/firefox-91.8.0/third_party/rust/petgraph/tests/
H A Dgraph.rs90 assert_eq!(Dfs::new(&gr, h).iter(&gr).count(), 4); in dfs()
91 assert_eq!(Dfs::new(&gr, h).iter(&gr).clone().count(), 4); in dfs()
97 assert_eq!(Dfs::new(&gr, i).iter(&gr).count(), 3); in dfs()
122 for node in Dfs::new(&gr, h).iter(&gr) { in dfs_order()
143 assert_eq!(Bfs::new(&gr, h).iter(&gr).count(), 4); in bfs()
150 assert_eq!(Bfs::new(&gr, i).iter(&gr).count(), 3); in bfs()
1025 let gr = gr.into_edge_type::<Undirected>(); in connected_comp() localVariable
1036 gr[b]; in oob_index()
1152 gr[edge] = gr[target] - gr[source]; in walk_edges()
1250 gr in make_edge_iterator_graph()
[all …]
/dports/audio/ncspot/ncspot-0.9.3/cargo-crates/petgraph-0.5.1/tests/
H A Dgraph.rs90 assert_eq!(Dfs::new(&gr, h).iter(&gr).count(), 4); in dfs()
91 assert_eq!(Dfs::new(&gr, h).iter(&gr).clone().count(), 4); in dfs()
97 assert_eq!(Dfs::new(&gr, i).iter(&gr).count(), 3); in dfs()
122 for node in Dfs::new(&gr, h).iter(&gr) { in dfs_order()
143 assert_eq!(Bfs::new(&gr, h).iter(&gr).count(), 4); in bfs()
150 assert_eq!(Bfs::new(&gr, i).iter(&gr).count(), 3); in bfs()
1025 let gr = gr.into_edge_type::<Undirected>(); in connected_comp() localVariable
1036 gr[b]; in oob_index()
1152 gr[edge] = gr[target] - gr[source]; in walk_edges()
1250 gr in make_edge_iterator_graph()
[all …]

12345678910>>...353