| /dports/net-mgmt/openlldp/openlldp-0.4alpha/src/ |
| H A D | lldp_neighbor.c | 106 int neighbor_count = 0; in lldp_neighbor_information() local
122 neighbor_count = 0; in lldp_neighbor_information()
134 neighbor_count++; in lldp_neighbor_information()
138 sprintf(tmp_buffer, "Neighbor %d:\n", neighbor_count); in lldp_neighbor_information()
193 sprintf(buffer, "%d LLDP Neighbors: \n\n", neighbor_count); in lldp_neighbor_information()
|
| /dports/science/hypre/hypre-2.23.0/src/struct_mv/ |
| H A D | communication_info.c | 339 HYPRE_Int neighbor_count; in hypre_CreateCommInfoFromStencil() local
513 neighbor_count = 0; in hypre_CreateCommInfoFromStencil()
531 if (neighbor_count + num_entries > neighbor_alloc) in hypre_CreateCommInfoFromStencil()
567 neighbor_procs[neighbor_count] = proc_id; in hypre_CreateCommInfoFromStencil()
568 neighbor_ids[neighbor_count] = id; in hypre_CreateCommInfoFromStencil()
569 neighbor_shifts[neighbor_count] = k; in hypre_CreateCommInfoFromStencil()
570 neighbor_count++; in hypre_CreateCommInfoFromStencil()
593 if (neighbor_count > cbox_alloc) in hypre_CreateCommInfoFromStencil()
595 cbox_alloc = neighbor_count; in hypre_CreateCommInfoFromStencil()
609 for (k = 0; k < neighbor_count; k++) in hypre_CreateCommInfoFromStencil()
[all …]
|
| /dports/math/igraph/igraph-0.9.5/src/paths/ |
| H A D | shortest_paths.c | 455 neighbor_count = 0; in igraph_i_local_efficiency_unweighted()
460 neighbor_count++; in igraph_i_local_efficiency_unweighted()
467 if (neighbor_count < 2) { in igraph_i_local_efficiency_unweighted()
497 if (reached == neighbor_count) { in igraph_i_local_efficiency_unweighted()
518 *res /= neighbor_count * (neighbor_count - 1.0); in igraph_i_local_efficiency_unweighted()
552 …long int neighbor_count; /* unlike 'inc_edges_size', 'neighbor_count' does not count self-loops or… in igraph_i_local_efficiency_dijkstra() local
558 neighbor_count = 0; in igraph_i_local_efficiency_dijkstra()
563 neighbor_count++; in igraph_i_local_efficiency_dijkstra()
570 if (neighbor_count < 2) { in igraph_i_local_efficiency_dijkstra()
600 if (reached == neighbor_count) { in igraph_i_local_efficiency_dijkstra()
[all …]
|
| /dports/devel/cppurses/CPPurses-0.3-5-g342a389/demos/game_of_life/ |
| H A D | game_of_life_engine.cpp | 38 const auto neighbor_count = this->alive_neighbor_count(position); in get_next_generation() local
40 if (!contains(neighbor_count, survival_rule_)) { in get_next_generation()
44 if (contains(neighbor_count, birth_rule_)) { in get_next_generation()
|
| /dports/science/py-pymol/pymol-open-source-2.4.0/layer2/ |
| H A D | Mol2Typing.cpp | 19 int atm_neighbor, tmp, neighbor_count = 0; in isGuanidiniumCarbon() local
27 ++neighbor_count; in isGuanidiniumCarbon()
31 return neighbor_count == 3 && charge > 0; in isGuanidiniumCarbon()
|
| /dports/multimedia/intel-media-sdk/MediaSDK-intel-mediasdk-22.1.0/_studio/shared/asc/src/ |
| H A D | motion_estimation_engine.cpp | 175 neighbor_count = 0; in ME_simple() local
196 neighbor_count++; in ME_simple()
201 neighbor_count++; in ME_simple()
206 neighbor_count++; in ME_simple()
210 if (neighbor_count) { in ME_simple()
211 Nmv.x /= neighbor_count; in ME_simple()
212 Nmv.y /= neighbor_count; in ME_simple()
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/ui/events/ozone/evdev/touch_filter/ |
| H A D | neural_stylus_palm_detection_filter.cc | 44 int neighbor_count, in FindBiggestNeighborsWithin() argument
49 if (neighbor_count <= 0) { in FindBiggestNeighborsWithin()
71 for (int i = 0; i < neighbor_count && !biggest_strokes_queue.empty(); ++i) { in FindBiggestNeighborsWithin()
80 int neighbor_count, in FindNearestNeighborsWithin() argument
90 if (neighbor_count <= 0) { in FindNearestNeighborsWithin()
107 for (int i = 0; i < neighbor_count && !queue.empty(); ++i) { in FindNearestNeighborsWithin()
|
| H A D | neural_stylus_palm_detection_filter.h | 56 int neighbor_count, in COMPONENT_EXPORT()
61 int neighbor_count, in COMPONENT_EXPORT()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/ui/events/ozone/evdev/touch_filter/ |
| H A D | neural_stylus_palm_detection_filter.cc | 50 int neighbor_count, in FindBiggestNeighborsWithin() argument
55 if (neighbor_count <= 0) { in FindBiggestNeighborsWithin()
77 for (int i = 0; i < neighbor_count && !biggest_strokes_queue.empty(); ++i) { in FindBiggestNeighborsWithin()
86 int neighbor_count, in FindNearestNeighborsWithin() argument
96 if (neighbor_count <= 0) { in FindNearestNeighborsWithin()
113 for (int i = 0; i < neighbor_count && !queue.empty(); ++i) { in FindNearestNeighborsWithin()
|
| H A D | neural_stylus_palm_detection_filter.h | 60 int neighbor_count, in COMPONENT_EXPORT()
65 int neighbor_count, in COMPONENT_EXPORT()
|
| /dports/games/cataclysm-dda/Cataclysm-DDA-0.F/src/ |
| H A D | cellular_automata.h | 21 inline int neighbor_count( const std::vector<std::vector<int>> &cells, const int width, in neighbor_count() function
83 const int neighbors = neighbor_count( current, width, height, point( i, j ) ); in generate_cellular_automaton()
|
| /dports/games/cataclysm-dda-tiles/Cataclysm-DDA-0.F/src/ |
| H A D | cellular_automata.h | 21 inline int neighbor_count( const std::vector<std::vector<int>> &cells, const int width, in neighbor_count() function
83 const int neighbors = neighbor_count( current, width, height, point( i, j ) ); in generate_cellular_automaton()
|
| /dports/math/fcl/fcl-0.7.0/include/fcl/geometry/shape/ |
| H A D | convex-inl.h | 279 const int neighbor_count = neighbors_[neighbor_start]; in findExtremeVertex() local
281 n_index <= neighbor_start + neighbor_count; ++n_index) { in findExtremeVertex()
343 const int neighbor_count = neighbors_[neighbor_start]; in ValidateTopology() local
344 if (neighbor_count == 0) { in ValidateTopology()
352 n_index <= neighbor_start + neighbor_count; ++n_index) { in ValidateTopology()
|
| /dports/science/mol2ps/mol2ps-0.4b_9/ |
| H A D | mol2ps.pas | 1648 neighbor_count := 0;
1770 neighbor_count := 0;
2938 if (atom^[ra2].neighbor_count > 1) and (atom^[ra1].neighbor_count > 1) then
4474 if (atom^[ba1].neighbor_count = 1) and (atom^[ba2].neighbor_count > 1) then
4496 if (atom^[ba1].neighbor_count > 1) and (atom^[ba2].neighbor_count = 1) then
4518 if (atom^[ba1].neighbor_count = 2) and (atom^[ba2].neighbor_count = 2) then
4528 if (atom^[ba1].neighbor_count = 2) and (atom^[ba2].neighbor_count = 3) then
4534 if (atom^[ba1].neighbor_count = 3) and (atom^[ba2].neighbor_count = 2) then
4540 if (atom^[ba1].neighbor_count = 3) and (atom^[ba2].neighbor_count = 3) then
4598 if ((atom^[ba1].neighbor_count = 1) and (atom^[ba2].neighbor_count = 2)) then
[all …]
|
| /dports/science/checkmol/checkmol-0.5_11/ |
| H A D | checkmol | 2919 neighbor_count := 0;
3073 neighbor_count := 0;
3373 neighbor_count := 0;
4421 if (atom^[ra2].neighbor_count > 1) and (atom^[ra1].neighbor_count > 1) then
8361 (atom^[a1].neighbor_count = 2) and (atom^[a2].neighbor_count = 2)
9000 if (atom^[a_view].neighbor_count = 2) and (atom^[a_ref].neighbor_count = 2) then
10489 ndl_atom^[i].neighbor_count := atom^[i].neighbor_count;
10642 tmp_atom^[i].neighbor_count := atom^[i].neighbor_count;
10793 atom^[i].neighbor_count := tmp_atom^[i].neighbor_count;
12362 if (atom^[hst_a].neighbor_count = 0) and (ndl_atom^[ndl_a].neighbor_count = 0) then
[all …]
|
| /dports/games/alephone/alephone-release-20190331/Source_Files/GameWorld/ |
| H A D | items.cpp | 344 neighbor_indexes= get_map_indexes(polygon->first_neighbor_index, polygon->neighbor_count); in a1_swipe_nearby_items()
349 for (i=0;i<polygon->neighbor_count;++i) in a1_swipe_nearby_items()
425 neighbor_indexes= get_map_indexes(polygon->first_neighbor_index, polygon->neighbor_count); in m2_swipe_nearby_items()
430 for (i=0;i<polygon->neighbor_count;++i) in m2_swipe_nearby_items()
|
| /dports/net/wireshark-lite/wireshark-3.6.1/epan/dissectors/ |
| H A D | packet-dvmrp.c | 439 guint8 neighbor_count; in dissect_dvmrp_v3() local
477 neighbor_count = tvb_get_guint8(tvb, offset); in dissect_dvmrp_v3()
483 && (neighbor_count>0)) { in dissect_dvmrp_v3()
487 neighbor_count--; in dissect_dvmrp_v3()
|
| /dports/net/wireshark/wireshark-3.6.1/epan/dissectors/ |
| H A D | packet-dvmrp.c | 439 guint8 neighbor_count; in dissect_dvmrp_v3() local
477 neighbor_count = tvb_get_guint8(tvb, offset); in dissect_dvmrp_v3()
483 && (neighbor_count>0)) { in dissect_dvmrp_v3()
487 neighbor_count--; in dissect_dvmrp_v3()
|
| /dports/net/tshark-lite/wireshark-3.6.1/epan/dissectors/ |
| H A D | packet-dvmrp.c | 439 guint8 neighbor_count; in dissect_dvmrp_v3() local
477 neighbor_count = tvb_get_guint8(tvb, offset); in dissect_dvmrp_v3()
483 && (neighbor_count>0)) { in dissect_dvmrp_v3()
487 neighbor_count--; in dissect_dvmrp_v3()
|
| /dports/net/tshark/wireshark-3.6.1/epan/dissectors/ |
| H A D | packet-dvmrp.c | 439 guint8 neighbor_count;
477 neighbor_count = tvb_get_guint8(tvb, offset);
483 && (neighbor_count>0)) {
487 neighbor_count--;
|
| /dports/graphics/blender/blender-2.91.0/source/blender/editors/sculpt_paint/ |
| H A D | sculpt_smooth.c | 69 int neighbor_count = 0; in SCULPT_neighbor_coords_average_interior() local
74 neighbor_count++; in SCULPT_neighbor_coords_average_interior()
91 if (neighbor_count <= 2) { in SCULPT_neighbor_coords_average_interior()
|
| /dports/net-mgmt/py-junos-eznc/junos-eznc-2.5.4/lib/jnpr/junos/op/ |
| H A D | ospf.yml | 34 neighbor_count: neighbor-count
|
| /dports/math/igraph/igraph-0.9.5/src/misc/ |
| H A D | conversion.c | 959 igraph_integer_t neighbor_count = 0; in igraph_to_prufer() local
966 neighbor_count = igraph_vector_size(&neighbors); in igraph_to_prufer()
967 for (i = 0; i < neighbor_count; i++) { in igraph_to_prufer()
|
| /dports/math/R-cran-igraph/igraph/src/ |
| H A D | conversion.c | 917 igraph_integer_t neighbor_count = 0; in igraph_to_prufer() local
924 neighbor_count = igraph_vector_size(&neighbors); in igraph_to_prufer()
925 for (i = 0; i < neighbor_count; i++) { in igraph_to_prufer()
|
| /dports/graphics/osg34/OpenSceneGraph-OpenSceneGraph-3.4.1/src/osgPlugins/bsp/ |
| H A D | VBSPData.h | 135 unsigned char neighbor_count; member
|