| /dports/math/igraph/igraph-0.9.5/include/ |
| H A D | igraph_motifs.h | 63 igraph_vector_t *vids,
90 const igraph_vs_t vids);
|
| /dports/math/R-cran-igraph/igraph/src/include/ |
| H A D | igraph_motifs.h | 63 igraph_vector_t *vids,
90 const igraph_vs_t vids);
|
| /dports/math/plplot-ada/plplot-5.15.0/lib/nn/ |
| H A D | nnpi.c | 170 double x0 = d->points[t->vids[0]].x; in triangle_scale_get()
171 double x1 = d->points[t->vids[1]].x; in triangle_scale_get()
172 double x2 = d->points[t->vids[2]].x; in triangle_scale_get()
173 double y0 = d->points[t->vids[0]].y; in triangle_scale_get()
174 double y1 = d->points[t->vids[1]].y; in triangle_scale_get()
175 double y2 = d->points[t->vids[2]].y; in triangle_scale_get()
214 int v1 = t->vids[j1]; in nnpi_triangle_process()
215 int v2 = t->vids[j2]; in nnpi_triangle_process()
236 nnpi_add_weight( nn, t->vids[j], det ); in nnpi_triangle_process()
245 int vid = t->vids[i]; in nnpi_triangle_process()
|
| /dports/math/plplot/plplot-5.15.0/lib/nn/ |
| H A D | nnpi.c | 170 double x0 = d->points[t->vids[0]].x; in triangle_scale_get()
171 double x1 = d->points[t->vids[1]].x; in triangle_scale_get()
172 double x2 = d->points[t->vids[2]].x; in triangle_scale_get()
173 double y0 = d->points[t->vids[0]].y; in triangle_scale_get()
174 double y1 = d->points[t->vids[1]].y; in triangle_scale_get()
175 double y2 = d->points[t->vids[2]].y; in triangle_scale_get()
214 int v1 = t->vids[j1]; in nnpi_triangle_process()
215 int v2 = t->vids[j2]; in nnpi_triangle_process()
236 nnpi_add_weight( nn, t->vids[j], det ); in nnpi_triangle_process()
245 int vid = t->vids[i]; in nnpi_triangle_process()
|
| /dports/devel/arduino-core/Arduino-b439a77/arduino-core/src/processing/app/ |
| H A D | Platform.java | 236 List<String> vids = new LinkedList<>(board.getPreferences().subTree("vid", 1).values()); in resolveDeviceByVendorIdProductId() local
237 if (!vids.isEmpty()) { in resolveDeviceByVendorIdProductId()
240 for (int i = 0; i < vids.size(); i++) { in resolveDeviceByVendorIdProductId()
241 String vidPid = vids.get(i) + "_" + pids.get(i); in resolveDeviceByVendorIdProductId()
257 boardData.put("vid", vids.get(i)); in resolveDeviceByVendorIdProductId()
|
| /dports/lang/rust/rustc-1.58.1-src/src/test/ui/nll/ty-outlives/ |
| H A D | projection-one-region-trait-bound-closure.stderr | 13 = note: number of external vids: 4
54 = note: number of external vids: 4
95 = note: number of external vids: 4
123 = note: number of external vids: 4
151 = note: number of external vids: 3
|
| H A D | projection-no-regions-closure.stderr | 12 = note: number of external vids: 3
48 = note: number of external vids: 3
75 = note: number of external vids: 4
111 = note: number of external vids: 4
|
| H A D | ty-param-closure-outlives-from-where-clause.stderr | 20 = note: number of external vids: 3
70 = note: number of external vids: 3
104 = note: number of external vids: 4
149 = note: number of external vids: 4
|
| /dports/math/R-cran-igraph/igraph/man/ |
| H A D | transitivity.Rd | 11 vids = NULL,
25 calculated for each vertex given in the \code{vids} argument. The local
40 \item{vids}{The vertex ids for the local transitivity will be calculated.
62 vertex in \sQuote{\code{vids}}.
102 transitivity(gw, vids="A", type="local")
103 transitivity(gw, vids="A", type="weighted")
|
| /dports/math/R-cran-igraph/igraph/src/ |
| H A D | prpack.cpp | 38 igraph_real_t *value, const igraph_vs_t vids, in igraph_personalized_pagerank_prpack() argument
84 IGRAPH_CHECK(igraph_vit_create(graph, vids, &vit)); in igraph_personalized_pagerank_prpack()
|
| /dports/math/igraph/igraph-0.9.5/src/centrality/ |
| H A D | prpack.cpp | 36 igraph_real_t *value, const igraph_vs_t vids, in igraph_i_personalized_pagerank_prpack() argument
106 IGRAPH_CHECK(igraph_vit_create(graph, vids, &vit)); in igraph_i_personalized_pagerank_prpack()
|
| /dports/math/igraph/igraph-0.9.5/src/properties/ |
| H A D | basic_properties.c | 124 igraph_vector_t *res, const igraph_vs_t vids) { in igraph_diversity() argument
153 if (igraph_vs_is_all(&vids)) { in igraph_diversity()
167 IGRAPH_CHECK(igraph_vit_create(graph, vids, &vit)); in igraph_diversity()
|
| /dports/www/drupal8/drupal-8.9.20/core/modules/taxonomy/tests/src/Kernel/Migrate/d6/ |
| H A D | MigrateTaxonomyTermTest.php | 78 $vids = array_unique(array_column($expected_results, 'vid'));
80 foreach ($vids as $vid) {
|
| /dports/www/drupal9/drupal-9.2.10/core/modules/taxonomy/tests/src/Kernel/Migrate/d6/ |
| H A D | MigrateTaxonomyTermTest.php | 78 $vids = array_unique(array_column($expected_results, 'vid'));
80 foreach ($vids as $vid) {
|
| /dports/www/drupal8/drupal-8.9.20/core/modules/quickedit/tests/src/FunctionalJavascript/ |
| H A D | QuickEditLoadingTest.php | 146 $vids = \Drupal::entityTypeManager()->getStorage('node')->revisionIds($node);
147 $this->assertCount(1, $vids, 'The node has only one revision.');
172 $vids = \Drupal::entityTypeManager()->getStorage('node')->revisionIds($node);
173 $this->assertCount(1, $vids, 'The node has only one revision.');
|
| /dports/www/drupal9/drupal-9.2.10/core/modules/quickedit/tests/src/FunctionalJavascript/ |
| H A D | QuickEditLoadingTest.php | 146 $vids = \Drupal::entityTypeManager()->getStorage('node')->revisionIds($node);
147 $this->assertCount(1, $vids, 'The node has only one revision.');
179 $vids = \Drupal::entityTypeManager()->getStorage('node')->revisionIds($node);
180 $this->assertCount(1, $vids, 'The node has only one revision.');
|
| /dports/www/drupal8/drupal-8.9.20/core/modules/taxonomy/tests/modules/taxonomy_test_views/test_views/ |
| H A D | views.view.test_taxonomy_node_term_data.yml | 63 vids: {}
70 vids: {}
|
| /dports/www/drupal9/drupal-9.2.10/core/modules/taxonomy/tests/modules/taxonomy_test_views/test_views/ |
| H A D | views.view.test_taxonomy_node_term_data.yml | 63 vids: {}
70 vids: {}
|
| /dports/devel/pijul/pijul-1.0.0.a55/cargo-crates/libpijul-1.0.0-alpha.49/src/ |
| H A D | missing_context.rs | 81 if let Some((graph, vids)) = ws.graphs.0.get(&inode) { in repair_missing_up_context()
84 vids, in repair_missing_up_context()
133 if let Some((graph, vids)) = ws.graphs.0.get(&inode) { in repair_missing_down_context()
134 crate::alive::remove_redundant_children(graph, vids, &mut alive, c); in repair_missing_down_context()
379 if let Some((_, vids)) = self.0.get_mut(&inode) { in split()
380 if let Some(vid) = vids.remove(&vertex) { in split()
381 vids.insert(Vertex { end: mid, ..vertex }, vid); in split()
382 vids.insert( in split()
|
| /dports/cad/ngspice_rework/ngspice-35/tests/mes/ |
| H A D | subth.out | 9 Index v-sweep vids#branch
67 Index v-sweep vids#branch
|
| /dports/cad/ngspice_rework/ngspice-35/tests/mesa/ |
| H A D | mesa15.out | 9 Index v-sweep vids#branch
67 Index v-sweep vids#branch
|
| /dports/databases/phpmyadmin/phpMyAdmin-4.9.7-all-languages/libraries/classes/Config/ |
| H A D | Validator.php | 101 $vids = array();
105 $vids[] = $vid;
108 if (empty($vids)) {
126 foreach ($vids as $vid) {
|
| /dports/databases/phpmyadmin5/phpMyAdmin-5.1.2-all-languages/libraries/classes/Config/ |
| H A D | Validator.php | 130 $vids = [];
137 $vids[] = $vid;
139 if (empty($vids)) {
157 foreach ($vids as $vid) {
|
| /dports/databases/pgrouting/pgrouting-3.2.0/sql/legacy/ |
| H A D | legacy-developers.sql | 279 CREATE OR REPLACE FUNCTION pgr_vidsToDMatrix(sql TEXT, vids INTEGER[], dir BOOLEAN, has_rcost BOOL…
289 ids := ARRAY(SELECT DISTINCT UNNEST(vids) ORDER BY 1);
325 IN vids integer[],
340 ids := array(SELECT DISTINCT unnest(vids::integer[]) ORDER BY 1);
|
| /dports/print/py-fonttools3/fonttools-3.44.0/Lib/fontTools/ttLib/tables/ |
| H A D | V_O_R_G_.py | 21 vids = []
28 vids.append(vOrigin)
38 for name, vid in zip(names, vids):
|