def METHOD_NAME(self):
    """Test all fixed radius neighbor search.
    Test all fixed radius neighbor search using the KD tree C
    module, and compare the results to those of a simple but
    slow algorithm.
    """
    bucket_size = self.bucket_size
    nr_points = self.nr_points
    radius = self.radius
    for i in range(0, 10):
        # KD tree search
        coords = random((nr_points, 3))
        kdt = kdtrees.KDTree(coords, bucket_size)
        neighbors1 = kdt.neighbor_search(radius)
        # same search, using a simple but slow algorithm
        neighbors2 = kdt.neighbor_simple_search(radius)
        # compare results
        self.assertEqual(len(neighbors1), len(neighbors2))
        key = lambda neighbor: (neighbor.index1, neighbor.index2)  # noqa: E731
        neighbors1.sort(key=key)
        neighbors2.sort(key=key)
        for neighbor1, neighbor2 in zip(neighbors1, neighbors2):
            self.assertEqual(neighbor1.index1, neighbor2.index1)
            self.assertEqual(neighbor1.index2, neighbor2.index2)
            self.assertAlmostEqual(neighbor1.radius, neighbor2.radius)