Home
last modified time | relevance | path

Searched refs:num_neighbours (Results 1 – 11 of 11) sorted by relevance

/dports/science/plumed/plumed2-2.7.2/src/gridtools/
H A DFindContour.cpp172 unsigned num_neighbours; std::vector<unsigned> neighbours; in prepareForAveraging() local
179 ingrid->getNeighbors( ind, ones, num_neighbours, neighbours ); in prepareForAveraging()
181 for(unsigned j=0; j<num_neighbours; ++j) { in prepareForAveraging()
223 std::vector<unsigned> neighbours; unsigned num_neighbours; in finishAveraging() local
233 ingrid->getNeighbors( ugrid_indices, gbuffer_vec, num_neighbours, neighbours ); in finishAveraging()
234 for(unsigned n=0; n<num_neighbours; ++n) active[ neighbours[n] ]=true; in finishAveraging()
H A DFindContourSurface.cpp191 std::vector<unsigned> neighbours; unsigned num_neighbours; in finishAveraging() local
203 ingrid->getNeighbors( ugrid_indices, gbuffer_vec, num_neighbours, neighbours ); in finishAveraging()
204 for(unsigned n=0; n<num_neighbours; ++n) active[ neighbours[n] ]=true; in finishAveraging()
212 std::vector<unsigned> neighbours; unsigned num_neighbours; unsigned nfound=0; double minp=0; in compute() local
233 ingrid->getNeighbors( ind, ones, num_neighbours, neighbours ); in compute()
235 for(unsigned j=0; j<num_neighbours; ++j) { in compute()
H A DGridVessel.h159 unsigned& num_neighbours, std::vector<unsigned>& neighbors ) const ;
/dports/lang/micropython/micropython-1.17/examples/
H A Dconwaylife.py12 num_neighbours = (
27 if self and not (2 <= num_neighbours <= 3):
29 elif not self and num_neighbours == 3:
/dports/games/scummvm/scummvm-2.5.1/engines/icb/common/
H A Dpx_floor_map.h77 uint32 num_neighbours; member
/dports/games/openttd/openttd-12.1/src/pathfinder/npf/
H A Daystar.h145 byte num_neighbours; member
H A Daystar.cpp186 for (i = 0; i < this->num_neighbours; i++) { in Loop()
H A Dnpf.cpp901 aystar->num_neighbours = 0; in NPFFollowTrack()
986 aystar->num_neighbours = i; in NPFFollowTrack()
/dports/games/openttd/openttd-12.1/src/
H A Dlandscape.cpp1121 aystar->num_neighbours = 0; in River_GetNeighbours()
1125 aystar->neighbours[aystar->num_neighbours].tile = t2; in River_GetNeighbours()
1126 aystar->neighbours[aystar->num_neighbours].direction = INVALID_TRACKDIR; in River_GetNeighbours()
1127 aystar->num_neighbours++; in River_GetNeighbours()
/dports/graphics/scantailor/scantailor-advanced-1.0.16/dewarping/
H A DTopBottomEdgeTracer.cpp475 …const int num_neighbours = initNeighbours(next_nbh_offsets, prev_nbh_indexes, grid.stride(), direc… in propagateShortestPaths() local
484 for (int i = 0; i < num_neighbours; ++i) { in propagateShortestPaths()
/dports/games/scummvm/scummvm-2.5.1/engines/icb/
H A Dfunction.cpp2546 if (!our_floor->num_neighbours) { in fn_is_object_adjacent()
2564 for (j = 0; j < our_floor->num_neighbours; j++) { in fn_is_object_adjacent()