| /dports/dns/dsc/dsc-2.11.1/src/ |
| H A D | rcode_index.c | 45 static int next_idx = 0; variable
52 for (i = 0; i < next_idx; i++) { in rcode_indexer()
57 idx_to_rcode[next_idx] = m->rcode; in rcode_indexer()
58 assert(next_idx < MAX_RCODE_IDX); in rcode_indexer()
59 return next_idx++; in rcode_indexer()
67 if (0 == next_idx) in rcode_iterator()
71 return next_idx; in rcode_iterator()
73 if (next_iter == next_idx) { in rcode_iterator()
83 next_idx = 0; in rcode_reset()
|
| H A D | qclass_index.c | 42 static int next_idx = 0; variable
49 for (i = 0; i < next_idx; i++) { in qclass_indexer()
54 idx_to_qclass[next_idx] = m->qclass; in qclass_indexer()
55 return next_idx++; in qclass_indexer()
63 if (0 == next_idx) in qclass_iterator()
67 return next_idx; in qclass_iterator()
69 if (next_iter == next_idx) { in qclass_iterator()
79 next_idx = 0; in qclass_reset()
|
| H A D | qtype_index.c | 42 static int next_idx = 0; variable
49 for (i = 0; i < next_idx; i++) { in qtype_indexer()
54 idx_to_qtype[next_idx] = m->qtype; in qtype_indexer()
55 return next_idx++; in qtype_indexer()
63 if (0 == next_idx) in qtype_iterator()
67 return next_idx; in qtype_iterator()
69 if (next_iter == next_idx) { in qtype_iterator()
79 next_idx = 0; in qtype_reset()
|
| H A D | server_ip_addr_index.c | 46 static int next_idx = 0; variable
72 obj->index = next_idx; in sip_indexer()
77 next_idx++; in sip_indexer()
85 if (0 == next_idx) in sip_iterator()
89 return next_idx; in sip_iterator()
101 next_idx = 0; in sip_reset()
|
| H A D | client_index.c | 46 static int next_idx = 0; variable
72 obj->index = next_idx; in client_indexer()
77 next_idx++; in client_indexer()
85 if (0 == next_idx) in client_iterator()
89 return next_idx; in client_iterator()
101 next_idx = 0; in client_reset()
|
| H A D | tld_index.c | 50 static int next_idx = 0; variable
80 obj->index = next_idx; in tld_indexer()
86 next_idx++; in tld_indexer()
94 if (0 == next_idx) in tld_iterator()
99 return next_idx; in tld_iterator()
111 next_idx = 0; in tld_reset()
|
| H A D | client_subnet_index.c | 51 static int next_idx = 0; variable
82 obj->index = next_idx; in client_subnet_indexer()
87 next_idx++; in client_subnet_indexer()
95 if (0 == next_idx) in client_subnet_iterator()
99 return next_idx; in client_subnet_iterator()
111 next_idx = 0; in client_subnet_reset()
|
| H A D | qname_index.c | 47 int next_idx; member
147 obj->index = theLevel->next_idx; in name_indexer()
153 theLevel->next_idx++; in name_indexer()
162 if (0 == theLevel->next_idx) in name_iterator()
166 return theLevel->next_idx; in name_iterator()
179 theLevel->next_idx = 0; in name_reset()
|
| /dports/math/octave-forge-image/image-2.12.0/inst/ |
| H A D | bwpropfilt.m | 55 next_idx = 2; variable
60 next_idx = 3; variable
65 if (isscalar (varargin{next_idx}))
68 n_keep = varargin{next_idx};
69 next_idx++;
71 if (valid_nargin (next_idx) && ischar (varargin{next_idx}))
76 next_idx++;
83 range = varargin{next_idx};
84 next_idx++;
89 if (valid_nargin (next_idx))
[all …]
|
| /dports/math/igraph/igraph-0.9.5/src/misc/ |
| H A D | other.c | 125 long int i, pivot_idx = 0, last_idx, before_last_idx, next_idx, j; in igraph_convex_hull() local
182 next_idx = (long int) VECTOR(order)[i]; in igraph_convex_hull()
183 if (VECTOR(angles)[last_idx] == VECTOR(angles)[next_idx]) { in igraph_convex_hull()
188 py = pow(MATRIX(*data, next_idx, 0) - MATRIX(*data, pivot_idx, 0), 2) + in igraph_convex_hull()
189 pow(MATRIX(*data, next_idx, 1) - MATRIX(*data, pivot_idx, 1), 2); in igraph_convex_hull()
194 last_idx = next_idx; in igraph_convex_hull()
198 last_idx = next_idx; in igraph_convex_hull()
207 next_idx = (long int)VECTOR(order)[igraph_vector_size(&order) - 1]; in igraph_convex_hull()
208 if (next_idx < 0) { in igraph_convex_hull()
232 IGRAPH_CHECK(igraph_vector_push_back(&stack, next_idx)); in igraph_convex_hull()
[all …]
|
| /dports/math/R-cran-igraph/igraph/src/ |
| H A D | other.c | 121 long int i, pivot_idx = 0, last_idx, before_last_idx, next_idx, j; in igraph_convex_hull() local
178 next_idx = (long int) VECTOR(order)[i]; in igraph_convex_hull()
179 if (VECTOR(angles)[last_idx] == VECTOR(angles)[next_idx]) { in igraph_convex_hull()
184 py = pow(MATRIX(*data, next_idx, 0) - MATRIX(*data, pivot_idx, 0), 2) + in igraph_convex_hull()
185 pow(MATRIX(*data, next_idx, 1) - MATRIX(*data, pivot_idx, 1), 2); in igraph_convex_hull()
190 last_idx = next_idx; in igraph_convex_hull()
194 last_idx = next_idx; in igraph_convex_hull()
203 next_idx = (long int)VECTOR(order)[igraph_vector_size(&order) - 1]; in igraph_convex_hull()
204 if (next_idx < 0) { in igraph_convex_hull()
228 IGRAPH_CHECK(igraph_vector_push_back(&stack, next_idx)); in igraph_convex_hull()
[all …]
|
| /dports/devel/sentry-cli/sentry-cli-1.71.0/cargo-crates/sourcemap-5.0.0/src/ |
| H A D | types.rs | 259 next_idx: u32, field
289 next_idx: u32, field
306 next_idx: u32, field
326 next_idx: u32, field
343 next_idx: usize, field
392 next_idx: u32, field
563 next_idx: 0, in tokens()
630 next_idx: 0, in sources()
661 next_idx: 0, in source_contents()
669 next_idx: 0, in names()
[all …]
|
| /dports/games/abstreet/earcutr-e029a11b66fd27f2ca2fd457dd37c403485ebba1/src/ |
| H A D | lib.rs | 32 next_idx: NULL, in new()
127 p.next_idx = noderef!(self, last).next_idx; in insert_node()
163 next_idx: 0, in new()
304 let mut next_idx = node!(ll, ear_idx).next_idx; in earcut_linked_hashed() localVariable
307 next_idx = node!(ll, ear_idx).next_idx; in earcut_linked_hashed()
314 ear_idx = node!(ll, next_idx).next_idx; in earcut_linked_hashed()
349 let mut next_idx = node!(ll, ear_idx).next_idx; in earcut_linked_unhashed() localVariable
352 next_idx = node!(ll, ear_idx).next_idx; in earcut_linked_unhashed()
359 ear_idx = node!(ll, next_idx).next_idx; in earcut_linked_unhashed()
492 next_idx: NodeIdx, in is_ear_hashed()
[all …]
|
| /dports/math/geogram/geogram-1.7.7/src/tests/test_nn_search/third_party/ANN/ |
| H A D | kd_dump.cpp | 67 …int &next_idx); // next index (mod…
327 … int next_idx = 0; // number of indices filled in annReadDump() local
329 the_root = annReadTree(in, tree_type, the_pidx, next_idx); in annReadDump()
330 if (next_idx != the_n_pts) { // didn't see all the points? in annReadDump()
372 …int &next_idx) // next index (mod… in annReadTree() argument
394 int old_idx = next_idx; // save next_idx in annReadTree()
400 in >> the_pidx[next_idx++]; // store in array of indices in annReadTree()
413 ANNkd_ptr lc = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
414 ANNkd_ptr hc = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
435 ANNkd_ptr ic = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
[all …]
|
| /dports/graphics/autopano-sift-c/autopano-sift-C-2.5.1/APSCpp/ANN/ |
| H A D | kd_dump.cpp | 67 int &next_idx); // next index (modified)
327 int next_idx = 0; // number of indices filled in annReadDump() local
329 the_root = annReadTree(in, tree_type, the_pidx, next_idx); in annReadDump()
330 if (next_idx != the_n_pts) { // didn't see all the points? in annReadDump()
372 int &next_idx) // next index (modified) in annReadTree() argument
394 int old_idx = next_idx; // save next_idx in annReadTree()
400 in >> the_pidx[next_idx++]; // store in array of indices in annReadTree()
413 ANNkd_ptr lc = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
414 ANNkd_ptr hc = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
435 ANNkd_ptr ic = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
[all …]
|
| /dports/math/ann/ann_1.1.2/src/ |
| H A D | kd_dump.cpp | 67 int &next_idx); // next index (modified)
327 int next_idx = 0; // number of indices filled in annReadDump() local
329 the_root = annReadTree(in, tree_type, the_pidx, next_idx); in annReadDump()
330 if (next_idx != the_n_pts) { // didn't see all the points? in annReadDump()
372 int &next_idx) // next index (modified) in annReadTree() argument
394 int old_idx = next_idx; // save next_idx in annReadTree()
400 in >> the_pidx[next_idx++]; // store in array of indices in annReadTree()
413 ANNkd_ptr lc = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
414 ANNkd_ptr hc = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
435 ANNkd_ptr ic = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
[all …]
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/ANN/src/ |
| H A D | kd_dump.cpp | 69 int &next_idx); // next index (modified)
329 int next_idx = 0; // number of indices filled in annReadDump() local
331 the_root = annReadTree(in, tree_type, the_pidx, next_idx); in annReadDump()
332 if (next_idx != the_n_pts) { // didn't see all the points? in annReadDump()
374 int &next_idx) // next index (modified) in annReadTree() argument
396 int old_idx = next_idx; // save next_idx in annReadTree()
402 in >> the_pidx[next_idx++]; // store in array of indices in annReadTree()
415 ANNkd_ptr lc = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
416 ANNkd_ptr hc = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
437 ANNkd_ptr ic = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
[all …]
|
| /dports/cad/meshlab/meshlab-Meshlab-2020.05/src/plugins_unsupported/external/ann_1.1.1/src/ |
| H A D | kd_dump.cpp | 67 int &next_idx); // next index (modified)
327 int next_idx = 0; // number of indices filled in annReadDump() local
329 the_root = annReadTree(in, tree_type, the_pidx, next_idx); in annReadDump()
330 if (next_idx != the_n_pts) { // didn't see all the points? in annReadDump()
372 int &next_idx) // next index (modified) in annReadTree() argument
394 int old_idx = next_idx; // save next_idx in annReadTree()
400 in >> the_pidx[next_idx++]; // store in array of indices in annReadTree()
413 ANNkd_ptr lc = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
414 ANNkd_ptr hc = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
435 ANNkd_ptr ic = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
[all …]
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/queso/src/contrib/ANN/src/ |
| H A D | kd_dump.cpp | 67 int &next_idx); // next index (modified)
327 int next_idx = 0; // number of indices filled in annReadDump() local
329 the_root = annReadTree(in, tree_type, the_pidx, next_idx); in annReadDump()
330 if (next_idx != the_n_pts) { // didn't see all the points? in annReadDump()
372 int &next_idx) // next index (modified) in annReadTree() argument
394 int old_idx = next_idx; // save next_idx in annReadTree()
400 in >> the_pidx[next_idx++]; // store in array of indices in annReadTree()
413 ANNkd_ptr lc = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
414 ANNkd_ptr hc = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
435 ANNkd_ptr ic = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
[all …]
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/approxnn/src/ |
| H A D | kd_dump.cpp | 67 int &next_idx); // next index (modified)
327 int next_idx = 0; // number of indices filled in annReadDump() local
329 the_root = annReadTree(in, tree_type, the_pidx, next_idx); in annReadDump()
330 if (next_idx != the_n_pts) { // didn't see all the points? in annReadDump()
372 int &next_idx) // next index (modified) in annReadTree() argument
394 int old_idx = next_idx; // save next_idx in annReadTree()
400 in >> the_pidx[next_idx++]; // store in array of indices in annReadTree()
413 ANNkd_ptr lc = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
414 ANNkd_ptr hc = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
435 ANNkd_ptr ic = annReadTree(in, tree_type, the_pidx, next_idx); in annReadTree()
[all …]
|
| /dports/databases/p5-DBIx-Class-DeploymentHandler/DBIx-Class-DeploymentHandler-0.002230/lib/DBIx/Class/DeploymentHandler/VersionHandler/ |
| H A D | ExplicitVersions.pm | 86 my $next_idx = $self->_inc_version_idx;
88 $self->ordered_versions->[$next_idx - 1],
89 $self->ordered_versions->[$next_idx ],
106 my $next_idx = $self->_dec_version_idx;
108 $self->ordered_versions->[$next_idx + 1],
109 $self->ordered_versions->[$next_idx ],
|
| /dports/devel/love/love-11.3/src/modules/math/ |
| H A D | MathModule.cpp | 99 std::vector<size_t> next_idx(polygon.size()), prev_idx(polygon.size()); in triangulate() local
106 next_idx[i] = i+1; in triangulate()
109 next_idx[next_idx.size()-1] = 0; in triangulate()
113 if (!is_oriented_ccw(polygon[prev_idx[idx_lm]], polygon[idx_lm], polygon[next_idx[idx_lm]])) in triangulate()
114 next_idx.swap(prev_idx); in triangulate()
120 if (!is_oriented_ccw(polygon[prev_idx[i]], polygon[i], polygon[next_idx[i]])) in triangulate()
130 next = next_idx[current]; in triangulate()
136 next_idx[prev] = next; in triangulate()
148 next = next_idx[current]; in triangulate()
|
| /dports/net-mgmt/net-snmp/net-snmp-5.9/agent/ |
| H A D | agent_index.c | 66 struct snmp_index *next_idx; member
430 new_index->next_idx = prev_idx_ptr->next_idx; in register_index()
432 prev_idx_ptr->next_idx = new_index; in register_index()
435 new_index->next_idx = idxptr; in register_index()
438 new_index->next_idx = NULL; in register_index()
485 idxptr2 = idxptr2->next_idx) in unregister_index_by_session()
579 prev_idx_ptr->next_idx = idxptr2->next_idx; in unregister_index()
582 prev_idx_ptr = idxptr2->next_idx; in unregister_index()
590 if (idxptr2->next_idx) in unregister_index()
591 snmp_index_head = idxptr2->next_idx; in unregister_index()
[all …]
|
| /dports/science/v_sim/v_sim-3.8.0/src/dumpModules/ |
| H A D | dumpToPsAndPdf.c | 185 int idx, next_idx, last_code; in OutputData() local
200 next_idx = LZWEod + 1; in OutputData()
226 suffix[next_idx] = image[i]; in OutputData()
228 next[last_code] = next_idx; in OutputData()
229 next_idx = next_idx + 1; in OutputData()
240 next_idx = LZWEod + 1; in OutputData()
262 int idx, next_idx, last_code; in OutputDataPS256() local
277 next_idx = LZWEod + 1; in OutputDataPS256()
305 next[last_code] = next_idx; in OutputDataPS256()
306 next_idx = next_idx + 1; in OutputDataPS256()
[all …]
|
| /dports/emulators/qemu60/qemu-6.0.0/pc-bios/s390-ccw/ |
| H A D | virtio.c | 129 vr->next_idx = 0; in vring_init()
145 vr->avail->ring[vr->avail->idx % vr->num] = vr->next_idx; in vring_send_buf()
148 vr->desc[vr->next_idx].addr = (ulong)p; in vring_send_buf()
149 vr->desc[vr->next_idx].len = len; in vring_send_buf()
150 vr->desc[vr->next_idx].flags = flags & ~VRING_HIDDEN_IS_CHAIN; in vring_send_buf()
151 vr->desc[vr->next_idx].next = vr->next_idx; in vring_send_buf()
152 vr->desc[vr->next_idx].next++; in vring_send_buf()
153 vr->next_idx++; in vring_send_buf()
170 vr->next_idx = 0; in vr_poll()
|