def point_on_180_is_included_in_lower_bound(con, kernel):
sample_cube = make_square_NxM_2d_cube_with_time(start_lon=-135, end_lon=135, lon_point_count=4)
data_point = make_dummy_ungridded_data_single_point(0, 180.0, 1.2)
col = GeneralGriddedCollocator(fill_value=-999.9)
out_cube = col.collocate(points=sample_cube, data=data_point, constraint=con, kernel=kernel)[0]
expected_result = numpy.array([[-999.9, -999.9, -999.9, -999.9],
[-999.9, -999.9, -999.9, -999.9],
[1.2, -999.9, -999.9, -999.9],
[-999.9, -999.9, -999.9, -999.9],
[-999.9, -999.9, -999.9, -999.9]])
assert_arrays_almost_equal(out_cube.data.filled(), expected_result)
def point_on_a_lat_lon_boundary_appears_in_highest_cell(con, kernel):
sample_cube = make_mock_cube()
data_point = make_dummy_ungridded_data_single_point(2.5, 2.5, 1.2)
col = GeneralGriddedCollocator(fill_value=-999.9)
out_cube = col.collocate(points=sample_cube, data=data_point, constraint=con, kernel=kernel)[0]
expected_result = numpy.array([[-999.9, -999.9, -999.9],
[-999.9, -999.9, -999.9],
[-999.9, -999.9, -999.9],
[-999.9, -999.9, 1.2],
[-999.9, -999.9, -999.9]])
assert_arrays_almost_equal(out_cube.data.filled(), expected_result)
def two_points_in_a_cell_results_in_mean_value_in_cell(con, kernel):
sample_cube = make_mock_cube()
data_point = make_dummy_ungridded_data_two_points_with_different_values(0.5, 0.5, 1.2, 1.4)
col = GeneralGriddedCollocator(fill_value=-999.9)
out_cube = col.collocate(points=sample_cube, data=data_point, constraint=con, kernel=kernel)[0]
expected_result = numpy.array([[-999.9, -999.9, -999.9],
[-999.9, -999.9, -999.9],
[-999.9, 1.3, -999.9],
[-999.9, -999.9, -999.9],
[-999.9, -999.9, -999.9]])
assert_arrays_almost_equal(out_cube.data.filled(), expected_result)
