/dports/net/frr7/frr-frr-7.5.1/tests/topotests/bgp_l3vpn_to_bgp_direct/r4/ |
H A D | bgpd.conf | 11 neighbor 192.168.1.2 remote-as 5226 12 neighbor 192.168.1.2 update-source 192.168.1.1 13 neighbor 192.168.1.2 route-reflector-client 14 neighbor 192.168.1.2 timers 3 10 15 neighbor 2.2.2.2 remote-as 5226 16 neighbor 2.2.2.2 update-source 4.4.4.4 17 neighbor 2.2.2.2 timers 3 10 21 neighbor 192.168.1.2 activate 22 neighbor 192.168.1.2 next-hop-self 23 no neighbor 2.2.2.2 activate [all …]
|
/dports/net/frr7/frr-frr-7.5.1/tests/topotests/bgp_l3vpn_to_bgp_direct/r1/ |
H A D | bgpd.conf | 11 neighbor 192.168.1.2 remote-as 5226 12 neighbor 192.168.1.2 update-source 192.168.1.1 13 neighbor 192.168.1.2 route-reflector-client 14 neighbor 192.168.1.2 timers 3 10 15 neighbor 2.2.2.2 remote-as 5226 16 neighbor 2.2.2.2 update-source 1.1.1.1 17 neighbor 2.2.2.2 timers 3 10 21 neighbor 192.168.1.2 activate 22 neighbor 192.168.1.2 next-hop-self 23 no neighbor 2.2.2.2 activate [all …]
|
/dports/net/openmpi3/openmpi-3.1.6/ompi/mca/coll/basic/ |
H A D | coll_basic_neighbor_allgatherv.c | 119 int rc = MPI_SUCCESS, neighbor, degree; in mca_coll_basic_neighbor_allgatherv_graph() local 135 for (neighbor = 0; neighbor < degree ; ++neighbor) { in mca_coll_basic_neighbor_allgatherv_graph() 136 rc = MCA_PML_CALL(irecv((char *) rbuf + disps[neighbor] * extent, rcounts[neighbor], in mca_coll_basic_neighbor_allgatherv_graph() 142 rc = MCA_PML_CALL(isend((void *) sbuf, scount, sdtype, edges[neighbor], in mca_coll_basic_neighbor_allgatherv_graph() 149 ompi_coll_base_free_reqs( reqs, 2 * (neighbor + 1) ); in mca_coll_basic_neighbor_allgatherv_graph() 171 int rc = MPI_SUCCESS, neighbor; in mca_coll_basic_neighbor_allgatherv_dist_graph() local 184 for (neighbor = 0; neighbor < indegree ; ++neighbor) { in mca_coll_basic_neighbor_allgatherv_dist_graph() 185 rc = MCA_PML_CALL(irecv((char *) rbuf + disps[neighbor] * extent, rcounts[neighbor], rdtype, in mca_coll_basic_neighbor_allgatherv_dist_graph() 191 ompi_coll_base_free_reqs(reqs, neighbor + 1); in mca_coll_basic_neighbor_allgatherv_dist_graph() 195 for (neighbor = 0 ; neighbor < outdegree ; ++neighbor) { in mca_coll_basic_neighbor_allgatherv_dist_graph() [all …]
|
/dports/net/openmpi/openmpi-4.1.1/ompi/mca/coll/basic/ |
H A D | coll_basic_neighbor_allgatherv.c | 119 int rc = MPI_SUCCESS, neighbor, degree; in mca_coll_basic_neighbor_allgatherv_graph() local 135 for (neighbor = 0; neighbor < degree ; ++neighbor) { in mca_coll_basic_neighbor_allgatherv_graph() 136 rc = MCA_PML_CALL(irecv((char *) rbuf + disps[neighbor] * extent, rcounts[neighbor], in mca_coll_basic_neighbor_allgatherv_graph() 142 rc = MCA_PML_CALL(isend((void *) sbuf, scount, sdtype, edges[neighbor], in mca_coll_basic_neighbor_allgatherv_graph() 149 ompi_coll_base_free_reqs( reqs, 2 * (neighbor + 1) ); in mca_coll_basic_neighbor_allgatherv_graph() 171 int rc = MPI_SUCCESS, neighbor; in mca_coll_basic_neighbor_allgatherv_dist_graph() local 184 for (neighbor = 0; neighbor < indegree ; ++neighbor) { in mca_coll_basic_neighbor_allgatherv_dist_graph() 185 rc = MCA_PML_CALL(irecv((char *) rbuf + disps[neighbor] * extent, rcounts[neighbor], rdtype, in mca_coll_basic_neighbor_allgatherv_dist_graph() 191 ompi_coll_base_free_reqs(reqs, neighbor + 1); in mca_coll_basic_neighbor_allgatherv_dist_graph() 195 for (neighbor = 0 ; neighbor < outdegree ; ++neighbor) { in mca_coll_basic_neighbor_allgatherv_dist_graph() [all …]
|
/dports/math/chaco/Chaco-2.2/code/input/ |
H A D | input_graph_normal.c | 229 if (neighbor <= 0) { 232 vertex, neighbor); 237 vertex, neighbor); 265 vertex, neighbor); 269 vertex, neighbor); 296 vertex, neighbor); 300 vertex, neighbor); 316 for (j = (*start)[neighbor - 1]; !found_flag && j < (*start)[neighbor]; j++) { 323 vertex, neighbor, neighbor, vertex); 328 vertex, neighbor, neighbor, vertex); [all …]
|
H A D | input_graph_vis.c | 233 if (neighbor <= 0) { 236 vertex, neighbor); 241 vertex, neighbor); 269 vertex, neighbor); 273 vertex, neighbor); 300 vertex, neighbor); 304 vertex, neighbor); 320 for (j = (*start)[neighbor - 1]; !found_flag && j < (*start)[neighbor]; j++) { 327 vertex, neighbor, neighbor, vertex); 332 vertex, neighbor, neighbor, vertex); [all …]
|
H A D | input_graph.c | 229 if (neighbor <= 0) { 232 vertex, neighbor); 237 vertex, neighbor); 265 vertex, neighbor); 269 vertex, neighbor); 296 vertex, neighbor); 300 vertex, neighbor); 316 for (j = (*start)[neighbor - 1]; !found_flag && j < (*start)[neighbor]; j++) { 323 vertex, neighbor, neighbor, vertex); 328 vertex, neighbor, neighbor, vertex); [all …]
|
/dports/cad/admesh/admesh-0.98.4/src/ |
H A D | normals.c | 38 int neighbor[3]; in stl_reverse_facet() local 43 neighbor[0] = stl->neighbors_start[facet_num].neighbor[0]; in stl_reverse_facet() 44 neighbor[1] = stl->neighbors_start[facet_num].neighbor[1]; in stl_reverse_facet() 45 neighbor[2] = stl->neighbors_start[facet_num].neighbor[2]; in stl_reverse_facet() 57 if(neighbor[0] != -1) in stl_reverse_facet() 59 (stl->neighbors_start[neighbor[0]]. in stl_reverse_facet() 61 if(neighbor[1] != -1) in stl_reverse_facet() 63 (stl->neighbors_start[neighbor[1]]. in stl_reverse_facet() 65 if(neighbor[2] != -1) in stl_reverse_facet() 71 stl->neighbors_start[facet_num].neighbor[1] = neighbor[2]; in stl_reverse_facet() [all …]
|
/dports/sysutils/ansible/ansible-4.7.0/ansible_collections/cisco/nxos/tests/integration/targets/nxos_bgp_global/tests/common/fixtures/ |
H A D | parsed.cfg | 8 neighbor-down fib-accelerate 10 log-neighbor-changes 11 neighbor 198.51.100.20 16 neighbor 198.51.100.21 20 log-neighbor-changes 21 neighbor 192.0.2.10 24 neighbor 192.0.2.11 29 neighbor-down fib-accelerate 30 log-neighbor-changes 31 neighbor 203.0.113.2
|
/dports/science/berkeleygw/BGW-2.0.0/Common/qhull/ |
H A D | merge.c | 330 merge->facet2= neighbor; in qh_appendmergeset() 517 horizon= neighbor; in qh_checkzero() 721 if (neighbor == facet) in qh_degen_redundant_neighbors() 733 if (neighbor == facet) in qh_degen_redundant_neighbors() 736 qh_appendmergeset(neighbor, neighbor, MRGdegen, NULL); in qh_degen_redundant_neighbors() 879 *bestfacet= neighbor; in qh_findbest_test() 1541 qh_appendmergeset(neighbor, neighbor, MRGdegen, &angledegen); in qh_maydropneighbor() 2133 if (neighbor->visitid != samevisitid && neighbor->simplicial) { in qh_mergecycle_ridges() 3316 neighbor->center= qh_getcentrum(neighbor); in qh_test_appendmerge() 3388 if (neighbor->seen || neighbor->visitid == qh visit_id) in qh_test_vneighbors() [all …]
|
/dports/science/afni/afni-AFNI_21.3.16/src/qhulldir/ |
H A D | merge.c | 330 merge->facet2= neighbor; in qh_appendmergeset() 517 horizon= neighbor; in qh_checkzero() 721 if (neighbor == facet) in qh_degen_redundant_neighbors() 733 if (neighbor == facet) in qh_degen_redundant_neighbors() 736 qh_appendmergeset(neighbor, neighbor, MRGdegen, NULL); in qh_degen_redundant_neighbors() 879 *bestfacet= neighbor; in qh_findbest_test() 1541 qh_appendmergeset(neighbor, neighbor, MRGdegen, &angledegen); in qh_maydropneighbor() 2133 if (neighbor->visitid != samevisitid && neighbor->simplicial) { in qh_mergecycle_ridges() 3316 neighbor->center= qh_getcentrum(neighbor); in qh_test_appendmerge() 3388 if (neighbor->seen || neighbor->visitid == qh visit_id) in qh_test_vneighbors() [all …]
|
/dports/math/py-matplotlib2/matplotlib-2.2.4/extern/libqhull/ |
H A D | merge.c | 330 merge->facet2= neighbor; in qh_appendmergeset() 517 horizon= neighbor; in qh_checkzero() 721 if (neighbor == facet) in qh_degen_redundant_neighbors() 733 if (neighbor == facet) in qh_degen_redundant_neighbors() 736 qh_appendmergeset(neighbor, neighbor, MRGdegen, NULL); in qh_degen_redundant_neighbors() 879 *bestfacet= neighbor; in qh_findbest_test() 1546 qh_appendmergeset(neighbor, neighbor, MRGdegen, &angledegen); in qh_maydropneighbor() 2138 if (neighbor->visitid != samevisitid && neighbor->simplicial) { in qh_mergecycle_ridges() 3321 neighbor->center= qh_getcentrum(neighbor); in qh_test_appendmerge() 3393 if (neighbor->seen || neighbor->visitid == qh visit_id) in qh_test_vneighbors() [all …]
|
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/external/qhull-2003.1/src/ |
H A D | merge.c | 328 merge->facet2= neighbor; in qh_appendmergeset() 515 horizon= neighbor; in qh_checkzero() 719 if (neighbor == facet) in qh_degen_redundant_neighbors() 734 qh_appendmergeset (neighbor, neighbor, MRGdegen, NULL); in qh_degen_redundant_neighbors() 875 *bestfacet= neighbor; in qh_findbest_test() 1537 qh_appendmergeset (neighbor, neighbor, MRGdegen, &angledegen); in qh_maydropneighbor() 2101 neighbor= ridge->top; in qh_mergecycle_ridges() 2129 if (neighbor->visitid != samevisitid && neighbor->simplicial) { in qh_mergecycle_ridges() 3312 neighbor->center= qh_getcentrum (neighbor); in qh_test_appendmerge() 3384 if (neighbor->seen || neighbor->visitid == qh visit_id) in qh_test_vneighbors() [all …]
|
/dports/math/libmesh/libmesh-1.6.2/contrib/qhull/2012.1/src/libqhull/ |
H A D | merge.c | 330 merge->facet2= neighbor; in qh_appendmergeset() 517 horizon= neighbor; in qh_checkzero() 721 if (neighbor == facet) in qh_degen_redundant_neighbors() 733 if (neighbor == facet) in qh_degen_redundant_neighbors() 736 qh_appendmergeset(neighbor, neighbor, MRGdegen, NULL); in qh_degen_redundant_neighbors() 879 *bestfacet= neighbor; in qh_findbest_test() 1541 qh_appendmergeset(neighbor, neighbor, MRGdegen, &angledegen); in qh_maydropneighbor() 2133 if (neighbor->visitid != samevisitid && neighbor->simplicial) { in qh_mergecycle_ridges() 3316 neighbor->center= qh_getcentrum(neighbor); in qh_test_appendmerge() 3388 if (neighbor->seen || neighbor->visitid == qh visit_id) in qh_test_vneighbors() [all …]
|
/dports/graphics/py-gdal/gdal-3.3.3/alg/internal_libqhull/ |
H A D | merge.c | 330 merge->facet2= neighbor; in qh_appendmergeset() 517 horizon= neighbor; in qh_checkzero() 721 if (neighbor == facet) in qh_degen_redundant_neighbors() 733 if (neighbor == facet) in qh_degen_redundant_neighbors() 736 qh_appendmergeset(neighbor, neighbor, MRGdegen, NULL); in qh_degen_redundant_neighbors() 879 *bestfacet= neighbor; in qh_findbest_test() 1541 qh_appendmergeset(neighbor, neighbor, MRGdegen, &angledegen); in qh_maydropneighbor() 2133 if (neighbor->visitid != samevisitid && neighbor->simplicial) { in qh_mergecycle_ridges() 3316 neighbor->center= qh_getcentrum(neighbor); in qh_test_appendmerge() 3388 if (neighbor->seen || neighbor->visitid == qh visit_id) in qh_test_vneighbors() [all …]
|
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/qhull/src/libqhull/ |
H A D | merge.c | 330 merge->facet2= neighbor; in qh_appendmergeset() 517 horizon= neighbor; in qh_checkzero() 721 if (neighbor == facet) in qh_degen_redundant_neighbors() 733 if (neighbor == facet) in qh_degen_redundant_neighbors() 736 qh_appendmergeset(neighbor, neighbor, MRGdegen, NULL); in qh_degen_redundant_neighbors() 879 *bestfacet= neighbor; in qh_findbest_test() 1546 qh_appendmergeset(neighbor, neighbor, MRGdegen, &angledegen); in qh_maydropneighbor() 2138 if (neighbor->visitid != samevisitid && neighbor->simplicial) { in qh_mergecycle_ridges() 3321 neighbor->center= qh_getcentrum(neighbor); in qh_test_appendmerge() 3393 if (neighbor->seen || neighbor->visitid == qh visit_id) in qh_test_vneighbors() [all …]
|
/dports/math/py-pyhull/pyhull-2015.2.1/src/libqhull/ |
H A D | merge.c | 330 merge->facet2= neighbor; in qh_appendmergeset() 517 horizon= neighbor; in qh_checkzero() 721 if (neighbor == facet) in qh_degen_redundant_neighbors() 733 if (neighbor == facet) in qh_degen_redundant_neighbors() 736 qh_appendmergeset(neighbor, neighbor, MRGdegen, NULL); in qh_degen_redundant_neighbors() 879 *bestfacet= neighbor; in qh_findbest_test() 1546 qh_appendmergeset(neighbor, neighbor, MRGdegen, &angledegen); in qh_maydropneighbor() 2138 if (neighbor->visitid != samevisitid && neighbor->simplicial) { in qh_mergecycle_ridges() 3321 neighbor->center= qh_getcentrum(neighbor); in qh_test_appendmerge() 3393 if (neighbor->seen || neighbor->visitid == qh visit_id) in qh_test_vneighbors() [all …]
|
/dports/graphics/p5-Geo-GDAL/gdal-3.3.3/alg/internal_libqhull/ |
H A D | merge.c | 330 merge->facet2= neighbor; in qh_appendmergeset() 517 horizon= neighbor; in qh_checkzero() 721 if (neighbor == facet) in qh_degen_redundant_neighbors() 733 if (neighbor == facet) in qh_degen_redundant_neighbors() 736 qh_appendmergeset(neighbor, neighbor, MRGdegen, NULL); in qh_degen_redundant_neighbors() 879 *bestfacet= neighbor; in qh_findbest_test() 1541 qh_appendmergeset(neighbor, neighbor, MRGdegen, &angledegen); in qh_maydropneighbor() 2133 if (neighbor->visitid != samevisitid && neighbor->simplicial) { in qh_mergecycle_ridges() 3316 neighbor->center= qh_getcentrum(neighbor); in qh_test_appendmerge() 3388 if (neighbor->seen || neighbor->visitid == qh visit_id) in qh_test_vneighbors() [all …]
|
/dports/net/frr7-pythontools/frr-frr-7.5.1/tests/topotests/bgp_features/r1/ |
H A D | bgpd.conf | 9 bgp log-neighbor-changes 11 neighbor 192.168.0.2 remote-as 65000 12 neighbor 192.168.0.2 description Router R2 (iBGP) 13 neighbor 192.168.0.2 update-source lo 14 neighbor 192.168.0.2 timers connect 5 15 neighbor 192.168.101.2 remote-as 65100 16 neighbor 192.168.101.2 description Router R4 (eBGP AS 65100) 17 neighbor 192.168.101.2 timers connect 5 26 neighbor 192.168.101.2 route-map testmap-in in 27 neighbor 192.168.101.2 route-map testmap-out out
|
/dports/net/frr7-pythontools/frr-frr-7.5.1/tests/topotests/bgp_features/r2/ |
H A D | bgpd.conf | 9 bgp log-neighbor-changes 11 neighbor 192.168.0.1 remote-as 65000 12 neighbor 192.168.0.1 description Router R1 (iBGP) 13 neighbor 192.168.0.1 update-source lo 14 neighbor 192.168.0.1 timers connect 5 15 neighbor 192.168.201.2 remote-as 65200 16 neighbor 192.168.201.2 description Router R5 (eBGP AS 65200) 17 neighbor 192.168.201.2 timers connect 5 26 neighbor 192.168.201.2 route-map testmap-in in 27 neighbor 192.168.201.2 route-map testmap-out out
|
/dports/net/frr7/frr-frr-7.5.1/tests/topotests/bgp_features/r1/ |
H A D | bgpd.conf | 9 bgp log-neighbor-changes 11 neighbor 192.168.0.2 remote-as 65000 12 neighbor 192.168.0.2 description Router R2 (iBGP) 13 neighbor 192.168.0.2 update-source lo 14 neighbor 192.168.0.2 timers connect 5 15 neighbor 192.168.101.2 remote-as 65100 16 neighbor 192.168.101.2 description Router R4 (eBGP AS 65100) 17 neighbor 192.168.101.2 timers connect 5 26 neighbor 192.168.101.2 route-map testmap-in in 27 neighbor 192.168.101.2 route-map testmap-out out
|
/dports/net/frr7/frr-frr-7.5.1/tests/topotests/bgp_features/r2/ |
H A D | bgpd.conf | 9 bgp log-neighbor-changes 11 neighbor 192.168.0.1 remote-as 65000 12 neighbor 192.168.0.1 description Router R1 (iBGP) 13 neighbor 192.168.0.1 update-source lo 14 neighbor 192.168.0.1 timers connect 5 15 neighbor 192.168.201.2 remote-as 65200 16 neighbor 192.168.201.2 description Router R5 (eBGP AS 65200) 17 neighbor 192.168.201.2 timers connect 5 26 neighbor 192.168.201.2 route-map testmap-in in 27 neighbor 192.168.201.2 route-map testmap-out out
|
/dports/math/chaco/Chaco-2.2/code/klvspiff/ |
H A D | matching.c | 176 neighbor = indices[j]; 177 if (!touched[neighbor]) { 178 touched[neighbor] = TRUE; 181 matching[neighbor] = node; 182 matching[node] = neighbor; 235 neighbor = indices[j]; 236 if (!touched[neighbor]) { 237 touched[neighbor] = TRUE; 263 int neighbor; local 282 neighbor = indices[j]; [all …]
|
/dports/science/lammps/lammps-stable_29Sep2021/doc/src/ |
H A D | Python_neighbor.rst | 4 Access to neighbor lists is handled through a couple of wrapper classes 7 of the "find" functions to look up the index of the neighbor list in the 8 global table of neighbor lists and then get access to the neighbor list 9 data. The code sample below demonstrates reading the neighbor list data 28 # look up the neighbor list 32 print("half neighbor list with {} entries".format(nl.size)) 33 # print neighbor list contents 43 * :py:meth:`lammps.get_neighlist() <lammps.lammps.get_neighlist()>`: Get neighbor list for given in… 44 * :py:meth:`lammps.get_neighlist_size()`: Get number of elements in neighbor list 45 * :py:meth:`lammps.get_neighlist_element_neighbors()`: Get element in neighbor list and its neighbo… [all …]
|
/dports/audio/libmysofa/libmysofa-1.2.1-16-g52590e1/src/hrtf/ |
H A D | neighbors.c | 37 struct MYSOFA_NEIGHBORHOOD *neighbor = in mysofa_neighborhood_init_withstepdefine() local 39 if (!neighbor) in mysofa_neighborhood_init_withstepdefine() 42 neighbor->elements = hrtf->M; in mysofa_neighborhood_init_withstepdefine() 43 neighbor->index = malloc(sizeof(int) * neighbor->elements * 6); in mysofa_neighborhood_init_withstepdefine() 44 if (!neighbor->index) { in mysofa_neighborhood_init_withstepdefine() 45 free(neighbor); in mysofa_neighborhood_init_withstepdefine() 48 for (i = 0; i < neighbor->elements * 6; i++) in mysofa_neighborhood_init_withstepdefine() 49 neighbor->index[i] = -1; in mysofa_neighborhood_init_withstepdefine() 68 neighbor->index[i * 6 + 0] = index; in mysofa_neighborhood_init_withstepdefine() 82 neighbor->index[i * 6 + 1] = index; in mysofa_neighborhood_init_withstepdefine() [all …]
|