/dports/science/rdkit/rdkit-Release_2021_03_5/Code/DataStructs/ |
H A D | testMultiFPB.cpp | 78 TEST_ASSERT(nbrs.size() == 2); in test2MultiFPBReaderTanimoto() 92 TEST_ASSERT(nbrs.size() == 10); in test2MultiFPBReaderTanimoto() 109 TEST_ASSERT(nbrs.size() == 4); in test2MultiFPBReaderTanimoto() 146 TEST_ASSERT(nbrs.size() == 2); in test3MultiFPBReaderTversky() 160 TEST_ASSERT(nbrs.size() == 10); in test3MultiFPBReaderTversky() 177 TEST_ASSERT(nbrs.size() == 10); in test3MultiFPBReaderTversky() 213 TEST_ASSERT(nbrs.size() == 2); in test4MultiFPBReaderContains() 225 TEST_ASSERT(nbrs.size() == 8); in test4MultiFPBReaderContains() 272 TEST_ASSERT(nbrs.size() == 6); in test5MultiFPBReaderThreaded() 301 TEST_ASSERT(nbrs.size() == 6); in test5MultiFPBReaderThreaded() [all …]
|
H A D | testFPB.cpp | 426 TEST_ASSERT(nbrs[0] == 0); in test8FPBReaderContains() 433 TEST_ASSERT(nbrs[0] == 1); in test8FPBReaderContains() 434 TEST_ASSERT(nbrs[1] == 2); in test8FPBReaderContains() 435 TEST_ASSERT(nbrs[2] == 3); in test8FPBReaderContains() 436 TEST_ASSERT(nbrs[3] == 4); in test8FPBReaderContains() 443 TEST_ASSERT(nbrs[0] == 16); in test8FPBReaderContains() 444 TEST_ASSERT(nbrs[1] == 17); in test8FPBReaderContains() 451 TEST_ASSERT(nbrs[0] == 85); in test8FPBReaderContains() 452 TEST_ASSERT(nbrs[1] == 86); in test8FPBReaderContains() 453 TEST_ASSERT(nbrs[2] == 87); in test8FPBReaderContains() [all …]
|
/dports/science/rdkit/rdkit-Release_2021_03_5/Code/DataStructs/Wrap/ |
H A D | testFPB.py | 69 self.assertEqual(len(nbrs), 1) 70 self.assertEqual(nbrs[0], 0) 74 self.assertEqual(len(nbrs), 4) 85 self.assertEqual(len(nbrs), 9) 113 self.assertEqual(len(nbrs), 6) 115 self.assertEqual(nbrs[0][1], 0) 116 self.assertEqual(nbrs[0][2], 3) 118 self.assertEqual(nbrs[1][1], 1) 135 self.assertEqual(len(nbrs), 6) 177 self.assertEqual(len(nbrs), 9) [all …]
|
H A D | wrap_FPB.cpp | 23 std::vector<std::pair<double, unsigned int>> nbrs = in taniNbrHelper() local 26 for (auto &nbr : nbrs) { in taniNbrHelper() 34 std::vector<std::pair<double, unsigned int>> nbrs = in tverskyNbrHelper() local 37 for (auto &nbr : nbrs) { in tverskyNbrHelper() 47 for (auto &nbr : nbrs) { in containingNbrHelper() 57 std::vector<MultiFPBReader::ResultTuple> nbrs = in multiTaniNbrHelper() local 60 for (auto &nbr : nbrs) { in multiTaniNbrHelper() 70 std::vector<MultiFPBReader::ResultTuple> nbrs = in multiTverskyNbrHelper() local 73 for (auto &nbr : nbrs) { in multiTverskyNbrHelper() 82 std::vector<std::pair<unsigned int, unsigned int>> nbrs = in multiContainingNbrHelper() local [all …]
|
/dports/misc/ompl/ompl-1.5.2/tests/datastructures/ |
H A D | adjacency_list.cpp | 107 std::vector<int> nbrs; in BOOST_AUTO_TEST_CASE() local 113 BOOST_REQUIRE(nbrs[j] != nbrs[k]); in BOOST_AUTO_TEST_CASE() 118 BOOST_CHECK(nbrs[0] == nbr1 || nbrs[0] == nbr2); in BOOST_AUTO_TEST_CASE() 119 BOOST_CHECK(nbrs[1] == nbr1 || nbrs[1] == nbr2); in BOOST_AUTO_TEST_CASE() 209 std::vector<int> nbrs; in BOOST_AUTO_TEST_CASE() local 216 BOOST_REQUIRE(nbrs[j] != nbrs[k]); in BOOST_AUTO_TEST_CASE() 232 BOOST_CHECK(nbrs[j] == nbr1 || nbrs[j] == nbr2); in BOOST_AUTO_TEST_CASE() 242 BOOST_CHECK(nbrs[j] == nbr1 || nbrs[j] == nbr2 || nbrs[j] == nbr3); in BOOST_AUTO_TEST_CASE() 291 std::vector<int> nbrs; in BOOST_AUTO_TEST_CASE() local 301 BOOST_REQUIRE(nbrs[j] != nbrs[k]); in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/science/rdkit/rdkit-Release_2021_03_5/rdkit/Chem/Features/ |
H A D | FeatDirUtilsRD.py | 37 nbrs = [] 40 nbrs.append(i) 41 return nbrs 49 for nbr in nbrs: 140 while len(nbrs): 141 nbr = nbrs.pop() 146 nbrs = tmp 226 for nid in nbrs: 274 for nbr in nbrs: 345 for nbr in nbrs: [all …]
|
/dports/math/py-networkx/networkx-2.6.3/networkx/classes/ |
H A D | reportviews.py | 458 nbrs = self._succ[n] 460 return len(nbrs) + (n in nbrs) 462 n in nbrs and nbrs[n].get(weight, 1) 470 yield (n, len(nbrs) + (n in nbrs)) 475 n in nbrs and nbrs[n].get(weight, 1) 534 n in nbrs and len(nbrs[n]) 540 if n in nbrs: 550 n in nbrs and len(nbrs[n]) 723 return sum(len(nbrs) for n, nbrs in self._nodes_nbrs()) 1010 return sum(len(nbrs) for n, nbrs in self._nodes_nbrs()) [all …]
|
H A D | function.py | 1116 return (n for n, nbrs in G.adj.items() if n in nbrs) 1167 if n in nbrs 1174 if n in nbrs 1178 return ((n, n, nbrs[n]) for n, nbrs in G.adj.items() if n in nbrs) 1185 if n in nbrs 1192 if n in nbrs 1198 for n, nbrs in G.adj.items() 1199 if n in nbrs 1205 (n, n, k) for n, nbrs in G.adj.items() if n in nbrs for k in nbrs[n] 1211 if n in nbrs [all …]
|
/dports/graphics/opendx/dx-4.4.4/src/exec/libdx/ |
H A D | gather.c | 556 if (nbrs[0]<0 || nbrs[0]<i) in _dxfField_Gather() 558 if (nbrs[1]<0 || nbrs[1]<i) in _dxfField_Gather() 560 if (nbrs[2]<0 || nbrs[2]<i) in _dxfField_Gather() 562 if (nbrs[3]<0 || nbrs[3]<i) in _dxfField_Gather() 564 if (nbrs[4]<0 || nbrs[4]<i) in _dxfField_Gather() 566 if (nbrs[5]<0 || nbrs[5]<i) in _dxfField_Gather() 571 if (nbrs[0]<0 || nbrs[0]<i) in _dxfField_Gather() 574 if (nbrs[1]<0 || nbrs[1]<i) in _dxfField_Gather() 577 if (nbrs[2]<0 || nbrs[2]<i) in _dxfField_Gather() 580 if (nbrs[3]<0 || nbrs[3]<i) in _dxfField_Gather() [all …]
|
/dports/graphics/graphviz/graphviz-2.44.1/cmd/gvpr/lib/ |
H A D | binduce | 13 node_t nbrs[int]; 24 nbrs[cnt++] = opp(e,$); 26 if ((e = isEdge(nbrs[i],nbrs[i+1],"")) != NULL) { 29 else if ($G.directed && (e = isEdge(nbrs[i+1],nbrs[i],""))) { 32 else if (nbrs[i] != nbrs[i+1]) { // avoid loops 33 e = edge(nbrs[i],nbrs[i+1],""); 37 unset(nbrs);
|
/dports/math/parmetis/parmetis-4.0.3/metis/libmetis/ |
H A D | mesh.c | 168 idx_t *marker, *nbrs; in CreateGraphDual() local 224 adjncy[xadj[i]++] = nbrs[j]; in CreateGraphDual() 249 nbrs[k++] = jj; in FindCommonElements() 257 nbrs[k++] = qid; in FindCommonElements() 262 overlap = marker[l = nbrs[i]]; in FindCommonElements() 266 nbrs[j++] = l; in FindCommonElements() 283 idx_t *marker, *nbrs; in CreateGraphNodal() local 333 eind, marker, nbrs); in CreateGraphNodal() 335 adjncy[xadj[i]++] = nbrs[j]; in CreateGraphNodal() 360 nbrs[k++] = jj; in FindCommonNodes() [all …]
|
/dports/math/py-PyMetis/PyMetis-2020.1/src/metis/libmetis/ |
H A D | mesh.c | 168 idx_t *marker, *nbrs; in CreateGraphDual() local 224 adjncy[xadj[i]++] = nbrs[j]; in CreateGraphDual() 249 nbrs[k++] = jj; in FindCommonElements() 257 nbrs[k++] = qid; in FindCommonElements() 262 overlap = marker[l = nbrs[i]]; in FindCommonElements() 266 nbrs[j++] = l; in FindCommonElements() 283 idx_t *marker, *nbrs; in CreateGraphNodal() local 333 eind, marker, nbrs); in CreateGraphNodal() 335 adjncy[xadj[i]++] = nbrs[j]; in CreateGraphNodal() 360 nbrs[k++] = jj; in FindCommonNodes() [all …]
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/metis/libmetis/ |
H A D | mesh.c | 168 idx_t *marker, *nbrs; in CreateGraphDual() local 224 adjncy[xadj[i]++] = nbrs[j]; in CreateGraphDual() 249 nbrs[k++] = jj; in FindCommonElements() 257 nbrs[k++] = qid; in FindCommonElements() 262 overlap = marker[l = nbrs[i]]; in FindCommonElements() 266 nbrs[j++] = l; in FindCommonElements() 283 idx_t *marker, *nbrs; in CreateGraphNodal() local 333 eind, marker, nbrs); in CreateGraphNodal() 335 adjncy[xadj[i]++] = nbrs[j]; in CreateGraphNodal() 360 nbrs[k++] = jj; in FindCommonNodes() [all …]
|
/dports/math/libmesh/libmesh-1.6.2/contrib/metis/libmetis/ |
H A D | mesh.c | 168 idx_t *marker, *nbrs; in CreateGraphDual() local 224 adjncy[xadj[i]++] = nbrs[j]; in CreateGraphDual() 249 nbrs[k++] = jj; in FindCommonElements() 257 nbrs[k++] = qid; in FindCommonElements() 262 overlap = marker[l = nbrs[i]]; in FindCommonElements() 266 nbrs[j++] = l; in FindCommonElements() 283 idx_t *marker, *nbrs; in CreateGraphNodal() local 333 eind, marker, nbrs); in CreateGraphNodal() 335 adjncy[xadj[i]++] = nbrs[j]; in CreateGraphNodal() 360 nbrs[k++] = jj; in FindCommonNodes() [all …]
|
/dports/science/octopus/octopus-10.5/external_libs/metis-5.1/libmetis/ |
H A D | mesh.c | 167 idx_t *marker, *nbrs; in CreateGraphDual() local 223 adjncy[xadj[i]++] = nbrs[j]; in CreateGraphDual() 248 nbrs[k++] = jj; in FindCommonElements() 256 nbrs[k++] = qid; in FindCommonElements() 261 overlap = marker[l = nbrs[i]]; in FindCommonElements() 265 nbrs[j++] = l; in FindCommonElements() 282 idx_t *marker, *nbrs; in CreateGraphNodal() local 332 eind, marker, nbrs); in CreateGraphNodal() 334 adjncy[xadj[i]++] = nbrs[j]; in CreateGraphNodal() 359 nbrs[k++] = jj; in FindCommonNodes() [all …]
|
/dports/math/metis/metis-5.1.0/libmetis/ |
H A D | mesh.c | 168 idx_t *marker, *nbrs; in CreateGraphDual() local 224 adjncy[xadj[i]++] = nbrs[j]; in CreateGraphDual() 249 nbrs[k++] = jj; in FindCommonElements() 257 nbrs[k++] = qid; in FindCommonElements() 262 overlap = marker[l = nbrs[i]]; in FindCommonElements() 266 nbrs[j++] = l; in FindCommonElements() 283 idx_t *marker, *nbrs; in CreateGraphNodal() local 333 eind, marker, nbrs); in CreateGraphNodal() 335 adjncy[xadj[i]++] = nbrs[j]; in CreateGraphNodal() 360 nbrs[k++] = jj; in FindCommonNodes() [all …]
|
/dports/science/rdkit/rdkit-Release_2021_03_5/Code/GraphMol/Subgraphs/ |
H A D | Subgraphs.cpp | 27 nbrs.clear(); in getNbrsList() 51 if (nbrs.find(bid1) == nbrs.end()) { in getNbrsList() 53 nbrs[bid1] = nlst; in getNbrsList() 303 INT_INT_VECT_MAP nbrs; in findAllSubgraphsOfLengthN() local 310 for (auto nbi = nbrs.begin(); nbi != nbrs.end(); ++nbi) { in findAllSubgraphsOfLengthN() 335 INT_VECT cands = nbrs[i]; in findAllSubgraphsOfLengthN() 343 nbrs.clear(); in findAllSubgraphsOfLengthN() 354 INT_INT_VECT_MAP nbrs; in findAllSubgraphsOfLengthsMtoN() local 365 for (auto nbi = nbrs.begin(); nbi != nbrs.end(); nbi++) { in findAllSubgraphsOfLengthsMtoN() 390 INT_VECT cands = nbrs[i]; in findAllSubgraphsOfLengthsMtoN() [all …]
|
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/approximation/ |
H A D | treewidth.py | 159 nbrs = graph[node] 160 for nbr in nbrs: 163 num_fill_in += len(nbrs - graph[nbr]) - 1 202 nbrs = graph[elim_node] 203 for u, v in itertools.permutations(nbrs, 2): 208 node_stack.append((elim_node, nbrs)) 226 (curr_node, nbrs) = node_stack.pop() 231 if nbrs <= bag: 240 nbrs.add(curr_node) 241 new_bag = frozenset(nbrs)
|
/dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/cluster/ |
H A D | _mean_shift.py | 75 nbrs = NearestNeighbors(n_neighbors=n_neighbors, n_jobs=n_jobs) 76 nbrs.fit(X) 80 d, _ = nbrs.kneighbors(X[batch, :], return_distance=True) 87 def _mean_shift_single_seed(my_mean, X, nbrs, max_iter): argument 89 bandwidth = nbrs.get_params()["radius"] 94 i_nbrs = nbrs.radius_neighbors([my_mean], bandwidth, return_distance=False)[0] 438 nbrs = NearestNeighbors(radius=bandwidth, n_jobs=1).fit(X) 442 delayed(_mean_shift_single_seed)(seed, X, nbrs, self.max_iter) 472 nbrs = NearestNeighbors(radius=bandwidth, n_jobs=self.n_jobs).fit( 477 neighbor_idxs = nbrs.radius_neighbors([center], return_distance=False)[ [all …]
|
/dports/math/py-networkx/networkx-2.6.3/examples/subclass/ |
H A D | plot_antigraph.py | 117 nbrs = set(self.nodes()) - set(self.adj[nbunch]) - {nbunch} 118 return len(nbrs) 132 return ((n, len(nbrs)) for n, nbrs in nodes_nbrs) 136 (n, sum((nbrs[nbr].get(weight, 1)) for nbr in nbrs)) 137 for n, nbrs in nodes_nbrs 154 for n, nbrs in self.adj.items(): 155 yield (n, nodes - set(nbrs) - {n})
|
/dports/net/frr7/frr-frr-7.5.1/ospfd/ |
H A D | ospf_neighbor.c | 161 rn = route_node_lookup(oi->nbrs, &p); in ospf_nbr_delete() 194 rn = route_node_lookup(oi->nbrs, &p); in ospf_nbr_delete() 271 rn = route_node_get(oi->nbrs, &p); in ospf_nbr_add_self() 334 rn = route_node_lookup(nbrs, &p); in ospf_nbr_lookup_by_addr() 358 for (rn = route_top(nbrs); rn; rn = route_next(rn)) in ospf_nbr_lookup_by_routerid() 372 struct route_table *nbrs; in ospf_renegotiate_optional_capabilities() local 381 if ((nbrs = oi->nbrs) == NULL) in ospf_renegotiate_optional_capabilities() 384 for (rn = route_top(nbrs); rn; rn = route_next(rn)) { in ospf_renegotiate_optional_capabilities() 411 return (ospf_nbr_lookup_by_routerid(oi->nbrs, in ospf_nbr_lookup() 414 return (ospf_nbr_lookup_by_addr(oi->nbrs, &srcaddr)); in ospf_nbr_lookup() [all …]
|
/dports/net/frr7-pythontools/frr-frr-7.5.1/ospfd/ |
H A D | ospf_neighbor.c | 161 rn = route_node_lookup(oi->nbrs, &p); in ospf_nbr_delete() 194 rn = route_node_lookup(oi->nbrs, &p); in ospf_nbr_delete() 271 rn = route_node_get(oi->nbrs, &p); in ospf_nbr_add_self() 334 rn = route_node_lookup(nbrs, &p); in ospf_nbr_lookup_by_addr() 358 for (rn = route_top(nbrs); rn; rn = route_next(rn)) in ospf_nbr_lookup_by_routerid() 372 struct route_table *nbrs; in ospf_renegotiate_optional_capabilities() local 381 if ((nbrs = oi->nbrs) == NULL) in ospf_renegotiate_optional_capabilities() 384 for (rn = route_top(nbrs); rn; rn = route_next(rn)) { in ospf_renegotiate_optional_capabilities() 411 return (ospf_nbr_lookup_by_routerid(oi->nbrs, in ospf_nbr_lookup() 414 return (ospf_nbr_lookup_by_addr(oi->nbrs, &srcaddr)); in ospf_nbr_lookup() [all …]
|
/dports/net/quagga/quagga-1.2.4/ospfd/ |
H A D | ospf_neighbor.c | 161 rn = route_node_lookup (oi->nbrs, &p); in ospf_nbr_delete() 199 rn = route_node_lookup (oi->nbrs, &p); in ospf_nbr_delete() 277 rn = route_node_get (oi->nbrs, &p); in ospf_nbr_add_self() 297 for (rn = route_top (oi->nbrs); rn; rn = route_next (rn)) in ospf_nbr_count() 328 ospf_nbr_lookup_by_addr (struct route_table *nbrs, in ospf_nbr_lookup_by_addr() argument 339 rn = route_node_lookup (nbrs, &p); in ospf_nbr_lookup_by_addr() 359 ospf_nbr_lookup_by_routerid (struct route_table *nbrs, in ospf_nbr_lookup_by_routerid() argument 365 for (rn = route_top (nbrs); rn; rn = route_next (rn)) in ospf_nbr_lookup_by_routerid() 381 struct route_table *nbrs; in ospf_renegotiate_optional_capabilities() local 391 if ((nbrs = oi->nbrs) == NULL) in ospf_renegotiate_optional_capabilities() [all …]
|
/dports/math/py-networkx/networkx-2.6.3/networkx/ |
H A D | convert.py | 401 for u, nbrs in d.items() 402 for v, datadict in nbrs.items() 408 for u, nbrs in d.items() 409 for v, datadict in nbrs.items() 415 for u, nbrs in d.items(): 416 for v, datadict in nbrs.items(): 424 for u, nbrs in d.items(): 425 for v, datadict in nbrs.items(): 438 for u, nbrs in d.items(): 439 for v, data in nbrs.items(): [all …]
|
/dports/graphics/s2/s2geometry-0.9.0/src/s2/ |
H A D | s2builderutil_snap_functions_test.cc | 145 vector<S2CellId> nbrs; in UpdateS2CellIdMinVertexSeparation() local 147 for (S2CellId id1 : nbrs) { in UpdateS2CellIdMinVertexSeparation() 249 vector<S2CellId> nbrs; in GetNeighbors() local 250 nbrs.push_back(id); in GetNeighbors() 253 for (S2CellId nbr : nbrs) { in GetNeighbors() 256 nbrs.insert(nbrs.end(), new_nbrs.begin(), new_nbrs.end()); in GetNeighbors() 257 nbrs.erase(std::remove(nbrs.begin(), nbrs.end(), id), nbrs.end()); in GetNeighbors() 258 std::sort(nbrs.begin(), nbrs.end()); in GetNeighbors() 259 nbrs.erase(std::unique(nbrs.begin(), nbrs.end()), nbrs.end()); in GetNeighbors() 261 return nbrs; in GetNeighbors() [all …]
|