/dports/science/code_saturne/code_saturne-7.1.0/src/fvm/ |
H A D | fvm_neighborhood.c | 404 n->neighbor_index[0] = 0; in _order_neighborhood() 422 n->neighbor_index[e_count+1] = ( n->neighbor_index[e_count] in _order_neighborhood() 490 send_meta[i*2+1] = n->neighbor_index[i+1] - n->neighbor_index[i]; in _sync_by_block() 540 n->neighbor_index[i] = 0; in _sync_by_block() 553 n->neighbor_index[0] = 0; in _sync_by_block() 555 n->neighbor_index[i+1] += n->neighbor_index[i]; in _sync_by_block() 636 n->neighbor_index = NULL; in fvm_neighborhood_create() 753 *neighbor_index = n->neighbor_index; in fvm_neighborhood_get_data() 795 *neighbor_index = n->neighbor_index; in fvm_neighborhood_transfer_data() 1201 int n_neighbors = (n->neighbor_index[i+1] - n->neighbor_index[i]); in fvm_neighborhood_dump() [all …]
|
H A D | fvm_neighborhood.h | 129 cs_lnum_t **const neighbor_index, 154 cs_lnum_t **neighbor_index,
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Shape_detection/Region_growing/ |
H A D | Region_growing.h | 247 for (const std::size_t neighbor_index : neighbors) { in propagate() local 250 if (neighbor_index == std::size_t(-1)) in propagate() 254 neighbor_index < m_input_range.size()); in propagate() 256 if (!m_visited[neighbor_index] && in propagate() 257 m_region_type.is_part_of_region(item_index, neighbor_index, region)) { in propagate() 260 m_visited[neighbor_index] = true; in propagate() 261 running_queue[!depth_index].push(neighbor_index); in propagate() 262 region.push_back(neighbor_index); in propagate()
|
/dports/graphics/py-scikit-image/scikit-image-0.19.0/skimage/segmentation/ |
H A D | _watershed_cy.pyx | 58 Py_ssize_t i, neighbor_index 67 neighbor_index = structure[i] + index 68 if mask[neighbor_index]: # neighbor not a watershed line 70 neighbor_label0 = output[neighbor_index] 72 neighbor_label1 = output[neighbor_index] 128 cdef Py_ssize_t neighbor_index = 0 166 neighbor_index = structure[i] + elem.index 168 if not mask[neighbor_index]: 173 if output[neighbor_index]: 178 new_elem.value = image[neighbor_index] [all …]
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/search/include/pcl/search/impl/ |
H A D | flann_search.hpp | 138 auto& neighbor_index = indices[i]; in nearestKSearch() local 139 neighbor_index = index_mapping_[neighbor_index]; in nearestKSearch() 224 for (auto &neighbor_index : k_index) in nearestKSearch() local 226 neighbor_index = index_mapping_[neighbor_index]; in nearestKSearch() 266 for (auto &neighbor_index : indices) in radiusSearch() local 268 neighbor_index = index_mapping_ [neighbor_index]; in radiusSearch() 356 for (auto &neighbor_index : k_index) in radiusSearch() local 358 neighbor_index = index_mapping_[neighbor_index]; in radiusSearch()
|
/dports/graphics/gimp-resynthesizer/resynthesizer-2.0.3/lib/ |
H A D | synthesize.h | 538 guint neighbor_index; in synthesize() local 541 for(neighbor_index=0; neighbor_index<countNeighbors && bestPatchDiff != 0; neighbor_index++) in synthesize() 543 if ( has_source_neighbor(neighbor_index, neighbors) ) { in synthesize() 551 Coordinates corpus_point = subtract_points(neighbors[neighbor_index].sourceOf, in synthesize() 552 neighbors[neighbor_index].offset); in synthesize()
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/kdtree/include/pcl/kdtree/impl/ |
H A D | kdtree_flann.hpp | 266 auto& neighbor_index = k_indices[i]; in nearestKSearch() local 267 neighbor_index = index_mapping_[neighbor_index]; in nearestKSearch() 402 auto& neighbor_index = k_indices[i]; in radiusSearch() local 403 neighbor_index = index_mapping_[neighbor_index]; in radiusSearch()
|
/dports/math/fcl/fcl-0.7.0/include/fcl/geometry/shape/ |
H A D | convex-inl.h | 282 const int neighbor_index = neighbors_[n_index]; in findExtremeVertex() local 283 if (visited[neighbor_index]) continue; in findExtremeVertex() 284 visited[neighbor_index] = 1; in findExtremeVertex() 285 const S neighbor_value = v_C.dot(vertices[neighbor_index]); in findExtremeVertex() 294 extreme_index = neighbor_index; in findExtremeVertex()
|
/dports/science/openbabel/openbabel-3.1.1/src/formats/libinchi/ |
H A D | ichiqueu.c | 643 nxt_at = atom[cur_at].neighbor[(int)BondPosTmp[j].neighbor_index]; in AddBondsPos() 647 BondPosTmp[j+1].neighbor_index = k; in AddBondsPos() 656 BondPos[i].neighbor_index == BondPosTmp[j].neighbor_index) || in AddBondsPos() 658 BondPos[i].neighbor_index == BondPosTmp[j+1].neighbor_index) ) { in AddBondsPos() 797 BondPosTmp[nNumBondPosTmp].neighbor_index = nStartAtomNeighborNeighbor; in Check7MembTautRing() 805 BondPosTmp[nNumBondPosTmp].neighbor_index = DfsPath[i].bond_pos; in Check7MembTautRing() 816 BondPosTmp[nNumBondPosTmp].neighbor_index = nStartAtomNeighbor2; in Check7MembTautRing() 999 BondPosTmp[nNumBondPosTmp].neighbor_index = i; /* marked as tautomeric */ in Check6MembTautRing() 1030 … BondPosTmp[nNumBondPosTmp].neighbor_index = DfsPath[k].bond_pos; /* marked as tautomeric */ in Check6MembTautRing() 1245 … BondPosTmp[nNumBondPosTmp].neighbor_index = DfsPath[k].bond_pos; /* marked as tautomeric */ in Check15TautPath() [all …]
|
/dports/science/afni/afni-AFNI_21.3.16/src/ |
H A D | 3dLFCD.c | 886 int neighbor_index; in main() local 980 for ( neighbor_index = 0; neighbor_index < num_neighbors; neighbor_index++ ) in main() 982 dx = neighborhood[3*neighbor_index+X]; in main() 983 dy = neighborhood[3*neighbor_index+Y]; in main() 984 dz = neighborhood[3*neighbor_index+Z]; in main()
|
/dports/lang/rust/rustc-1.58.1-src/compiler/rustc_incremental/src/ |
H A D | assert_dep_graph.rs | 350 let neighbor_index = edge.source_or_target(direction); in walk_nodes() localVariable 351 let neighbor = query.graph.node_data(neighbor_index); in walk_nodes() 353 stack.push(neighbor_index); in walk_nodes() 415 for neighbor_index in query.graph.successor_nodes(node) { in walk_between() 416 if recurse(query, node_states, neighbor_index) { in walk_between()
|
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libigl/igl/copyleft/cgal/ |
H A D | point_areas.cpp | 75 MatrixI neighbor_index = I.row(i); in point_areas() local 77 igl::slice(P,neighbor_index,1,neighbors); in point_areas() 80 igl::slice(N,neighbor_index,1,neighbor_normals); in point_areas()
|
/dports/graphics/wings/libigl-2.1.0/include/igl/copyleft/cgal/ |
H A D | point_areas.cpp | 75 MatrixI neighbor_index = I.row(i); in point_areas() local 77 igl::slice(P,neighbor_index,1,neighbors); in point_areas() 80 igl::slice(N,neighbor_index,1,neighbor_normals); in point_areas()
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/features/include/pcl/features/impl/ |
H A D | range_image_border_extractor.hpp | 301 int neighbor_index = neighbor_y*range_image_->width + neighbor_x; in checkIfMaximum() local 302 if (neighbor_index==shadow_border_idx) in checkIfMaximum() 305 float neighbor_border_score = border_scores[neighbor_index]; in checkIfMaximum()
|
/dports/www/ot-recorder/recorder-0.8.4/ |
H A D | geohash.c | 115 int neighbor_index = index_for_char(last_char, neighbor[direction]); in get_neighbor() local 116 last_char = char_map[neighbor_index]; in get_neighbor()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Shape_detection/deprecated/ |
H A D | Region_growing.h | 622 std::size_t neighbor_index = neighbors[nb]; variable 623 Input_iterator nbit = m_input_iterator_first + neighbor_index; 625 if (m_shape_index[neighbor_index] != -1) 638 m_shape_index[neighbor_index] = class_index; 640 index_container_current_ring.insert(neighbor_index);
|
/dports/games/mangband/mangband-1.5.3/src/server/ |
H A D | wilderness.c | 70 int neighbor_index(int Depth, char dir) in neighbor_index() function 134 neigh_idx = neighbor_index(depth, DIR_NORTH); in init_wild_info_aux() 142 neigh_idx = neighbor_index(depth, DIR_EAST); in init_wild_info_aux() 149 neigh_idx = neighbor_index(depth, DIR_SOUTH); in init_wild_info_aux() 155 neigh_idx = neighbor_index(depth, DIR_WEST); in init_wild_info_aux() 1405 neigh_idx = neighbor_index(cur_depth, (char)randint0(4)); in wild_clone_closed_loop_total() 1497 neighbor_idx = neighbor_index(Depth, (char)randint0(4)); in determine_wilderness_type() 2000 neigh_idx = neighbor_index(Depth, dir); in should_we_bleed() 2049 for (c = 0; c < 4; c++) neigh_idx[c] = neighbor_index(Depth,c); in bleed_with_neighbors()
|
/dports/math/cgal/CGAL-5.3/demo/Polyhedron/Plugins/Point_set/ |
H A D | Point_set_selection_plugin.cpp | 455 Point_set::Index neighbor_index = neighbors[nb]; in grow_region() local 457 if (index_container.find(neighbor_index) != index_container.end()) in grow_region() 460 const Kernel::Point_3& neighbor = points_item->point_set()->point(neighbor_index); in grow_region() 468 Kernel::Vector_3 normal = points_item->point_set()->normal (neighbor_index); in grow_region() 474 index_container.insert (neighbor_index); in grow_region() 476 index_container_current_ring.insert(neighbor_index); in grow_region()
|
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/test/kdtree/ |
H A D | test_kdtree.cpp | 324 int neighbor_index = tree.get ().get<int> (str); in TEST() local 325 EXPECT_EQ (neighbor_index, nn_indices_vector[vec_i][n_i]); in TEST()
|
/dports/games/nazghul/nazghul-0.7.1/src/ |
H A D | object.c | 1348 int neighbor_index; in putOnMap() local 1368 neighbor_index = INDEX(neighbor_x, neighbor_y); in putOnMap() 1369 assert(neighbor_index >= 0); in putOnMap() 1370 assert(neighbor_index < (q_size)); in putOnMap() 1372 if (queued[neighbor_index]) in putOnMap() 1384 queued[neighbor_index] = 1; in putOnMap()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | mst_orient_normals.h | 374 std::size_t neighbor_index = get(index_map,neighbor); in create_riemannian_graph() local 375 if (neighbor_index > it_index) // undirected graph in create_riemannian_graph() 381 vertex(neighbor_index, riemannian_graph), in create_riemannian_graph()
|
/dports/misc/ompl/ompl-1.5.2/src/ompl/geometric/planners/prm/src/ |
H A D | LazyPRM.cpp | 136 for (const unsigned int neighbor_index : neighbor_indices) in LazyPRM() local 138 Vertex n = getOrCreateVertex(neighbor_index); in LazyPRM() 140 data.getEdgeWeight(vertex_index, neighbor_index, &weight); in LazyPRM()
|
H A D | PRM.cpp | 133 for (const unsigned int neighbor_index : neighbor_indices) in PRM() local 135 Vertex n = getOrCreateVertex(neighbor_index); in PRM() 139 data.getEdgeWeight(vertex_index, neighbor_index, &weight); in PRM()
|
/dports/graphics/blender/blender-2.91.0/source/blender/blenkernel/intern/ |
H A D | multires_unsubdivide.c | 390 const int neighbor_index = BM_elem_index_get(neighbor_v); in unsubdivide_init_elem_ids() local 391 if (!visited_vertices[neighbor_index]) { in unsubdivide_init_elem_ids() 392 visited_vertices[neighbor_index] = true; in unsubdivide_init_elem_ids() 393 elem_id[neighbor_index] = current_id; in unsubdivide_init_elem_ids()
|
/dports/graphics/osg34/OpenSceneGraph-OpenSceneGraph-3.4.1/src/osgPlugins/bsp/ |
H A D | VBSPData.h | 119 unsigned short neighbor_index; member
|