/dports/games/scummvm/scummvm-2.5.1/engines/pegasus/ |
H A D | module.mk | 50 neighborhood/door.o \ 51 neighborhood/exit.o \ 52 neighborhood/extra.o \ 53 neighborhood/hotspotinfo.o \ 54 neighborhood/neighborhood.o \ 55 neighborhood/spot.o \ 56 neighborhood/turn.o \ 57 neighborhood/view.o \ 58 neighborhood/zoom.o \ 68 neighborhood/mars/mars.o \ [all …]
|
H A D | console.cpp | 79 NeighborhoodID neighborhood = (NeighborhoodID)atoi(argv[1]); in Cmd_Jump() local 83 if ((neighborhood < kCaldoriaID || neighborhood > kNoradDeltaID || neighborhood == kFinalTSAID) && in Cmd_Jump() 84 neighborhood != kNoradSubChaseID) { in Cmd_Jump() 85 debugPrintf("Invalid neighborhood %d", neighborhood); in Cmd_Jump() 98 _vm->jumpToNewEnvironment(neighborhood, room, direction); in Cmd_Jump()
|
/dports/games/libretro-scummvm/scummvm-7b1e929/engines/pegasus/ |
H A D | module.mk | 48 neighborhood/door.o \ 49 neighborhood/exit.o \ 50 neighborhood/extra.o \ 51 neighborhood/hotspotinfo.o \ 52 neighborhood/neighborhood.o \ 53 neighborhood/spot.o \ 54 neighborhood/turn.o \ 55 neighborhood/view.o \ 56 neighborhood/zoom.o \ 65 neighborhood/mars/mars.o \ [all …]
|
H A D | console.cpp | 79 NeighborhoodID neighborhood = (NeighborhoodID)atoi(argv[1]); in Cmd_Jump() local 83 if ((neighborhood < kCaldoriaID || neighborhood > kNoradDeltaID || neighborhood == kFinalTSAID) && in Cmd_Jump() 84 neighborhood != kNoradSubChaseID) { in Cmd_Jump() 85 debugPrintf("Invalid neighborhood %d", neighborhood); in Cmd_Jump() 98 _vm->jumpToNewEnvironment(neighborhood, room, direction); in Cmd_Jump()
|
/dports/audio/libmysofa/libmysofa-1.2.1-16-g52590e1/src/hrtf/ |
H A D | interpolate.c | 19 int *neighborhood, float *fir, in mysofa_interpolate() argument 45 if (neighborhood[0] >= 0 && neighborhood[1] >= 0) { in mysofa_interpolate() 57 } else if (neighborhood[0] >= 0) { in mysofa_interpolate() 61 } else if (neighborhood[1] >= 0) { in mysofa_interpolate() 67 if (neighborhood[2] >= 0 && neighborhood[3] >= 0) { in mysofa_interpolate() 78 } else if (neighborhood[2] >= 0) { in mysofa_interpolate() 82 } else if (neighborhood[3] >= 0) { in mysofa_interpolate() 88 if (neighborhood[4] >= 0 && neighborhood[5] >= 0) { in mysofa_interpolate() 99 } else if (neighborhood[4] >= 0) { in mysofa_interpolate() 103 } else if (neighborhood[5] >= 0) { in mysofa_interpolate() [all …]
|
/dports/graphics/vigra/vigra-8acd73a/vigranumpy/src/core/ |
H A D | segmentation.cxx | 78 vigra_precondition(neighborhood == 4 || neighborhood == 8, 116 vigra_precondition(neighborhood == 4 || neighborhood == 8, in VIGRA_PYTHON_MULTITYPE_FUNCTOR() 154 vigra_precondition(neighborhood == 6 || neighborhood == 26, in VIGRA_PYTHON_MULTITYPE_FUNCTOR() 193 vigra_precondition(neighborhood == 6 || neighborhood == 26, in VIGRA_PYTHON_MULTITYPE_FUNCTOR() 362 vigra_precondition(neighborhood == 4 || neighborhood == 8, in VIGRA_PYTHON_MULTITYPE_FUNCTOR_NDIM() 375 .neighborhood(neighborhood) in VIGRA_PYTHON_MULTITYPE_FUNCTOR_NDIM() 406 .neighborhood(neighborhood) 512 .neighborhood(neighborhood) in VIGRA_PYTHON_MULTITYPE_FUNCTOR() 543 .neighborhood(neighborhood) 807 neighborhood = (neighborhood == 4) [all …]
|
/dports/science/libgeodecomp/libgeodecomp-0.4.0/src/examples/cars/ |
H A D | main.cpp | 40 void update(const CoordMap<Cell>& neighborhood, const unsigned& nanoStep) in update() argument 42 *this = neighborhood[Coord<2>(0, 0)]; in update() 52 && (neighborhood[Coord<2>(-1, 0)].direction == SOUTH) in update() 53 && (neighborhood[Coord<2>(0, 1)].direction == FREE)) { in update() 56 if ((neighborhood[Coord<2>(1, 0)].direction == FREE) && in update() 57 (neighborhood[Coord<2>(1, 1)].direction == FREE)) { in update() 63 && (neighborhood[Coord<2>(0, 1)].direction != SOUTH)) { in update() 66 && (neighborhood[Coord<2>(1, 1)].direction != SOUTH)) { in update() 71 && (neighborhood[Coord<2>(0, 1)].direction == EAST) in update() 75 if ((neighborhood[Coord<2>(0, -1)].direction == FREE) && in update() [all …]
|
/dports/math/vtk6/VTK-6.2.0/Filters/HyperTree/ |
H A D | vtkHyperOctreeDualGridContourFilter.cxx | 200 if ( ! neighborhood[0].GetIsLeaf()) in TraverseNeighborhoodRecursively() 210 if (! neighborhood[1].GetIsLeaf() ) in TraverseNeighborhoodRecursively() 216 if (! neighborhood[2].GetIsLeaf() ) in TraverseNeighborhoodRecursively() 222 if (! neighborhood[4].GetIsLeaf() ) in TraverseNeighborhoodRecursively() 228 if (! neighborhood[3].GetIsLeaf() ) in TraverseNeighborhoodRecursively() 233 if (! neighborhood[5].GetIsLeaf() ) in TraverseNeighborhoodRecursively() 238 if (! neighborhood[6].GetIsLeaf() ) in TraverseNeighborhoodRecursively() 325 if (!neighborhood[1].GetTree() || in EvaluatePoint() 326 !neighborhood[2].GetTree() || !neighborhood[3].GetTree() || in EvaluatePoint() 327 !neighborhood[4].GetTree() || !neighborhood[5].GetTree() || in EvaluatePoint() [all …]
|
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Filtering/FastMarching/include/ |
H A D | itkFastMarchingImageFilterBase.hxx | 755 return ( !neighborhood[0] && neighborhood[1] && in IsCriticalC1Configuration2D() 756 neighborhood[3] && !neighborhood[4] && in IsCriticalC1Configuration2D() 765 return ( !neighborhood[0] && neighborhood[1] && in IsCriticalC2Configuration2D() 766 neighborhood[3] && !neighborhood[4] && in IsCriticalC2Configuration2D() 776 return ( !neighborhood[0] && neighborhood[1] && in IsCriticalC3Configuration2D() 777 neighborhood[3] && !neighborhood[4] && in IsCriticalC3Configuration2D() 778 !neighborhood[5] && neighborhood[6] && in IsCriticalC3Configuration2D() 779 !neighborhood[7] && neighborhood[8] ); in IsCriticalC3Configuration2D() 787 return ( !neighborhood[0] && neighborhood[1] && in IsCriticalC4Configuration2D() 788 neighborhood[3] && !neighborhood[4] && in IsCriticalC4Configuration2D() [all …]
|
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Registration/Metricsv4/include/ |
H A D | itkExpectationBasedPointSetToPointSetMetricv4.hxx | 61 NeighborsIdentifierType neighborhood; in GetLocalNeighborhoodValue() local 62 …ansformedPointsLocator->FindClosestNPoints( point, this->m_EvaluationKNeighborhood, neighborhood ); in GetLocalNeighborhoodValue() 64 for( NeighborsIterator it = neighborhood.begin(); it != neighborhood.end(); ++it ) in GetLocalNeighborhoodValue() 91 NeighborsIdentifierType neighborhood; in GetLocalNeighborhoodValueAndDerivative() local 93 …ansformedPointsLocator->FindClosestNPoints( point, this->m_EvaluationKNeighborhood, neighborhood ); in GetLocalNeighborhoodValueAndDerivative() 95 for( NeighborsIterator it = neighborhood.begin(); it != neighborhood.end(); ++it ) in GetLocalNeighborhoodValueAndDerivative() 99 …measureValues[it - neighborhood.begin()] = -this->m_PreFactor * std::exp( -distance / this->m_Deno… in GetLocalNeighborhoodValueAndDerivative() 100 measureSum += measureValues[it - neighborhood.begin()]; in GetLocalNeighborhoodValueAndDerivative() 109 for( NeighborsIterator it = neighborhood.begin(); it != neighborhood.end(); ++it ) in GetLocalNeighborhoodValueAndDerivative() 113 weightedPoint += ( neighborVector * measureValues[it - neighborhood.begin()] / measure ); in GetLocalNeighborhoodValueAndDerivative()
|
/dports/graphics/py-scikit-image/scikit-image-0.19.0/skimage/morphology/ |
H A D | _skeletonize_3d_cy.pyx.in | 55 3x3x3 neighborhood of a point. 140 pixel_type neighborhood[27] 196 """Get the neighborhood of a pixel. 209 neighborhood[ 3] = img[p-1, r-1, c] 210 neighborhood[ 4] = img[p-1, r, c] 211 neighborhood[ 5] = img[p-1, r+1, c] 217 neighborhood[ 9] = img[p, r-1, c-1] 218 neighborhood[10] = img[p, r, c-1] 221 neighborhood[12] = img[p, r-1, c] 222 neighborhood[13] = img[p, r, c] [all …]
|
/dports/graphics/vigra/vigra-8acd73a/include/vigra/ |
H A D | localminmax.hxx | 882 NeighborCode3DSix neighborhood) in localMinima3D() argument 908 marker, neighborhood); in localMinima3D() 920 marker, neighborhood); in localMinima3D() 931 Neighborhood neighborhood) in localMinima3D() argument 934 marker, neighborhood); in localMinima3D() 1261 marker, neighborhood); in localMaxima3D() 1284 marker, neighborhood); in localMaxima3D() 1295 Neighborhood neighborhood) in localMaxima3D() argument 1298 marker, neighborhood); in localMaxima3D() 1518 Neighborhood neighborhood) in extendedLocalMinima() argument [all …]
|
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Registration/Common/test/ |
H A D | itkPointsLocatorTest.cxx | 73 typename PointsLocatorType::NeighborsIdentifierType neighborhood; in testPointsLocatorTest() local 77 pointsLocator->FindClosestNPoints( coords, 10u, neighborhood ); in testPointsLocatorTest() 78 if( neighborhood.size() != 10 ) in testPointsLocatorTest() 86 pointsLocator->Search( coords, 10u, neighborhood ); in testPointsLocatorTest() 87 if( neighborhood.size() != 10 ) in testPointsLocatorTest() 97 pointsLocator->FindPointsWithinRadius( coords, radius, neighborhood ); in testPointsLocatorTest() 98 if( neighborhood.size() != 11 ) in testPointsLocatorTest() 106 pointsLocator->Search( coords, radius, neighborhood ); in testPointsLocatorTest() 107 if( neighborhood.size() != 11 ) in testPointsLocatorTest()
|
/dports/math/py-or-tools/or-tools-9.2/ortools/sat/ |
H A D | cp_model_lns.cc | 331 Neighborhood neighborhood; in FullNeighborhood() local 339 return neighborhood; in FullNeighborhood() 345 return neighborhood; in NoNeighborhood() 577 return neighborhood; in FixGivenVariables() 605 return neighborhood; in RemoveMarkedConstraints() 1086 return neighborhood; in GenerateSchedulingNeighborhoodForRelaxation() 1308 return neighborhood; in Generate() 1338 return neighborhood; in Generate() 1352 return neighborhood; in Generate() 1373 return neighborhood; in Generate() [all …]
|
/dports/graphics/vigra/vigra-8acd73a/test/blockwisealgorithms/ |
H A D | test_watersheds.cxx | 74 NeighborhoodType neighborhood = DirectNeighborhood; in oneDimensionalTest() local 82 … BlockwiseLabelOptions().neighborhood(neighborhood) in oneDimensionalTest() 86 size_t correct_label_number = watershedsMultiArray(data, correct_labels, neighborhood, in oneDimensionalTest() 137 NeighborhoodType neighborhood = neighborhoods[k]; in fourDimensionalRandomTest() local 141 … BlockwiseLabelOptions().neighborhood(neighborhood) in fourDimensionalRandomTest() 145 … size_t correct_label_number = watershedsMultiArray(data, correct_labels, neighborhood, in fourDimensionalRandomTest() 155 oss << "neighborhood: " << neighborhood << endl; in fourDimensionalRandomTest() 186 NeighborhoodType neighborhood = IndirectNeighborhood; in chunkedTest() local 192 … size_t correct_label_number = watershedsMultiArray(oldschool_data, correct_labels, neighborhood, in chunkedTest() 199 … BlockwiseLabelOptions().neighborhood(neighborhood)); in chunkedTest()
|
/dports/math/SCIP/scip-7.0.3/src/scip/ |
H A D | heur_alns.c | 788 assert(neighborhood != NULL); in alnsIncludeNeighborhood() 836 assert(neighborhood != NULL); in alnsFreeNeighborhood() 838 nhptr = *neighborhood; in alnsFreeNeighborhood() 853 *neighborhood = NULL; in alnsFreeNeighborhood() 866 assert(neighborhood != NULL); in neighborhoodInit() 871 SCIP_CALL( neighborhood->nhinit(scip, neighborhood) ); in neighborhoodInit() 885 assert(neighborhood != NULL); in neighborhoodExit() 889 SCIP_CALL( neighborhood->nhexit(scip, neighborhood) ); in neighborhoodExit() 1079 NH* neighborhood; in printNeighborhoodStatistics() local 1366 SCIP_CALL( neighborhood->nhrefsol(scip, neighborhood, solptr, &result) ); in neighborhoodGetRefsol() [all …]
|
/dports/graphics/panomatic/panomatic-0.9.4/vigra/include/vigra/ |
H A D | localminmax.hxx | 68 DestValue marker, Neighborhood neighborhood, in inverse() 191 DestValue marker, Neighborhood neighborhood) in inverse() 224 DestValue marker, Neighborhood neighborhood) 339 DestValue marker, Neighborhood neighborhood) in linearSolve() 372 DestValue marker, Neighborhood neighborhood) 603 marker, neighborhood, 613 Neighborhood neighborhood) 649 DestValue marker, Neighborhood neighborhood, 662 DestValue marker, Neighborhood neighborhood) 820 marker, neighborhood, [all …]
|
/dports/science/libgeodecomp/libgeodecomp-0.4.0/src/misc/test/parallel_openmp_1/ |
H A D | simulationfactorytest.h | 24 void update(const COORD_MAP& neighborhood, const unsigned& nanoStep) in update() argument 26 temp = (neighborhood[FixedCoord< 0, 0, -1>()].temp + in update() 27 neighborhood[FixedCoord< 0, -1, 0>()].temp + in update() 28 neighborhood[FixedCoord<-1, 0, 0>()].temp + in update() 29 neighborhood[FixedCoord< 1, 0, 0>()].temp + in update() 30 neighborhood[FixedCoord< 0, 1, 0>()].temp + in update() 31 neighborhood[FixedCoord< 0, 0, 1>()].temp) * (1.0 / 6.0); in update()
|
/dports/science/libgeodecomp/libgeodecomp-0.4.0/src/examples/redblackgaussseidel/ |
H A D | main.cpp | 45 void update(const COORD_MAP& neighborhood, const unsigned& nanoStep) in update() argument 47 *this = neighborhood[Coord<2>( 0, 0 )]; in update() 51 temp = (neighborhood[Coord<2>( 0, -1 )].temp + in update() 52 neighborhood[Coord<2>( 0, +1 )].temp + in update() 53 neighborhood[Coord<2>(-1, 0 )].temp + in update() 54 neighborhood[Coord<2>(+1, 0 )].temp in update() 59 temp = (neighborhood[Coord<2>( 0, -1 )].temp + in update() 60 neighborhood[Coord<2>( 0, +1 )].temp + in update() 61 neighborhood[Coord<2>(-1, 0 )].temp + in update() 62 neighborhood[Coord<2>(+1, 0 )].temp in update()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Classification/ |
H A D | Mesh_neighborhood.h | 89 const Mesh_neighborhood& neighborhood; 97 One_ring_neighbor_query (const Mesh_neighborhood& neighborhood) in One_ring_neighbor_query() argument 98 : neighborhood (neighborhood) { } in One_ring_neighbor_query() 104 neighborhood.one_ring_neighbors (query, output); in operator() 122 const Mesh_neighborhood& neighborhood; 132 N_ring_neighbor_query (const Mesh_neighborhood& neighborhood, const std::size_t n) in N_ring_neighbor_query() argument 133 : neighborhood (neighborhood), n(n) { } in N_ring_neighbor_query() 139 neighborhood.n_ring_neighbors (query, output, n); in operator()
|
/dports/math/R-cran-prodlim/prodlim/man/ |
H A D | neighborhood.Rd | 2 % Please edit documentation in R/neighborhood.R 3 \name{neighborhood} 4 \alias{neighborhood} 7 neighborhood(x, bandwidth = NULL, kernel = "box") 13 \item{bandwidth}{Controls the distance between neighbors in a neighborhood. 22 An object of class 'neighborhood'. The value is a list that 23 includes the unique values of `x' (\code{values}) for which a neighborhood, 26 size of the neighborhood (\code{size.nbh}). 39 neighborhood(d$X2)
|
/dports/science/libgeodecomp/libgeodecomp-0.4.0/src/examples/jacobi2d/ |
H A D | main.cpp | 25 void update(const COORD_MAP& neighborhood, const unsigned& nanoStep) in update() argument 27 temp = (neighborhood[Coord<2>( 0, -1)].temp + in update() 28 neighborhood[Coord<2>(-1, 0)].temp + in update() 29 neighborhood[Coord<2>( 0, 0)].temp + in update() 30 neighborhood[Coord<2>( 1, 0)].temp + in update() 31 neighborhood[Coord<2>( 0, 1)].temp) * (1.0 / 5.0); in update()
|
/dports/biology/avida/avida-2.12.4-src/avida-core/source/main/ |
H A D | cBirthNeighborhoodHandler.cc | 48 tArray<int> neighborhood; in SelectOffspring() local 49 parent->GetOrgInterface().GetNeighborhoodCellIDs(neighborhood); in SelectOffspring() 52 tArray<int> valid(neighborhood.GetSize()); in SelectOffspring() 54 for (int i = 0; i < neighborhood.GetSize(); i++) { in SelectOffspring() 56 if (m_bc->ValidBirthEntry(m_entries[neighborhood[i]])) valid[valid_count++] = neighborhood[i]; in SelectOffspring()
|
/dports/devel/grpc130/grpc-1.30.2/src/core/lib/iomgr/ |
H A D | ev_epoll1_linux.cc | 212 pollset_neighborhood* neighborhood; member 568 pollset_neighborhood* neighborhood = pollset->neighborhood; in pollset_destroy() local 571 gpr_mu_lock(&neighborhood->mu); in pollset_destroy() 574 if (pollset->neighborhood != neighborhood) { in pollset_destroy() 576 neighborhood = pollset->neighborhood; in pollset_destroy() 773 pollset_neighborhood* neighborhood = pollset->neighborhood; in begin_worker() local 777 gpr_mu_lock(&neighborhood->mu); in begin_worker() 785 if (neighborhood != pollset->neighborhood) { in begin_worker() 787 neighborhood = pollset->neighborhood; in begin_worker() 821 gpr_mu_unlock(&neighborhood->mu); in begin_worker() [all …]
|
/dports/devel/grpc134/grpc-1.34.1/src/core/lib/iomgr/ |
H A D | ev_epoll1_linux.cc | 213 pollset_neighborhood* neighborhood; member 567 pollset_neighborhood* neighborhood = pollset->neighborhood; in pollset_destroy() local 570 gpr_mu_lock(&neighborhood->mu); in pollset_destroy() 573 if (pollset->neighborhood != neighborhood) { in pollset_destroy() 575 neighborhood = pollset->neighborhood; in pollset_destroy() 772 pollset_neighborhood* neighborhood = pollset->neighborhood; in begin_worker() local 776 gpr_mu_lock(&neighborhood->mu); in begin_worker() 784 if (neighborhood != pollset->neighborhood) { in begin_worker() 786 neighborhood = pollset->neighborhood; in begin_worker() 820 gpr_mu_unlock(&neighborhood->mu); in begin_worker() [all …]
|