diff --git a/autolens/point/solver/point_solver.py b/autolens/point/solver/point_solver.py index 2d52f656f..87ae46de0 100644 --- a/autolens/point/solver/point_solver.py +++ b/autolens/point/solver/point_solver.py @@ -23,7 +23,7 @@ def solve( tracer: OperateDeflections, source_plane_coordinate: Tuple[float, float], source_plane_redshift: Optional[float] = None, - neighbor_order: int = 0, + neighbor_degree: int = 0, ) -> aa.Grid2DIrregular: """ Solve for the image plane coordinates that are traced to the source plane coordinate. @@ -37,7 +37,7 @@ def solve( Parameters ---------- - neighbor_order + neighbor_degree The number of times recursively add neighbors for the triangles that contain the source plane coordinate. source_plane_coordinate @@ -57,7 +57,7 @@ def solve( source_plane_redshift=source_plane_redshift, ) - for _ in range(neighbor_order): + for _ in range(neighbor_degree): kept_triangles = kept_triangles.neighborhood() filtered_means = self._filter_low_magnification( diff --git a/test_autolens/point/triangles/test_solver.py b/test_autolens/point/triangles/test_solver.py index a2fefa97f..fa093080f 100644 --- a/test_autolens/point/triangles/test_solver.py +++ b/test_autolens/point/triangles/test_solver.py @@ -82,7 +82,7 @@ def test_real_example(grid, tracer): @pytest.mark.parametrize( - "neighbor_order, expected", + "neighbor_degree, expected", [ (0, 1), (1, 4), @@ -91,7 +91,7 @@ def test_real_example(grid, tracer): ) def test_neighbor_order( solver, - neighbor_order, + neighbor_degree, expected, ): assert ( @@ -99,7 +99,7 @@ def test_neighbor_order( solver.solve( NullTracer(), source_plane_coordinate=(0.0, 0.0), - neighbor_order=neighbor_order, + neighbor_order=neighbor_degree, ) ) == expected