Support using any array-like type for points

1 files changed, 6 insertions, 6 deletions

diff --git a/test/test_hilbert.cpp b/test/test_hilbert.cpp
index 1d32668..5d1f52a 100644
--- a/test/test_hilbert.cpp
+++ b/test/test_hilbert.cpp
@@ -92,12 +92,12 @@ test_standard(Context& ctx)
 
 	H ha = make_zero_bitvec<H, D * M>();
 	assert(ha.size() >= D * M);
-	chilbert::coords_to_index(pa.data(), M, D, ha);
+	chilbert::coords_to_index(pa, M, D, ha);
 
 	{
 		// Ensure unmapping results in the original point
 		auto pa_out = make_random_point<M, D>(ctx);
-		chilbert::index_to_coords(pa_out.data(), M, D, ha);
+		chilbert::index_to_coords(pa_out, M, D, ha);
 		assert(pa_out == pa);
 	}
 
@@ -110,7 +110,7 @@ test_standard(Context& ctx)
 
 	// Unmap next hilbert index to a point
 	auto pb = make_random_point<M, D>(ctx);
-	chilbert::index_to_coords(pb.data(), M, D, hb);
+	chilbert::index_to_coords(pb, M, D, hb);
 
 	// Ensure next point is 1 unit of distance away from first
 	assert(squared_distance(pa, pb) == 1);
@@ -128,12 +128,12 @@ test_compact(Context& ctx)
 
 	T ha = make_zero_bitvec<T, D * M>();
 	assert(ha.size() >= D * M);
-	chilbert::coords_to_compact_index(pa.data(), ms.data(), D, ha);
+	chilbert::coords_to_compact_index(pa, ms.data(), D, ha);
 
 	{
 		// Ensure unmapping results in the original point
 		auto pa_out = make_random_point<M, D>(ctx);
-		chilbert::compact_index_to_coords(pa_out.data(), ms.data(), D, ha);
+		chilbert::compact_index_to_coords(pa_out, ms.data(), D, ha);
 		assert(pa_out == pa);
 	}
 
@@ -146,7 +146,7 @@ test_compact(Context& ctx)
 
 	// Unmap next hilbert index to a point
 	auto pb = make_random_point<M, D>(ctx);
-	chilbert::compact_index_to_coords(pb.data(), ms.data(), D, hb);
+	chilbert::compact_index_to_coords(pb, ms.data(), D, hb);
 
 	// Ensure next point is 1 unit of distance away from first
 	assert(squared_distance(pa, pb) == 1);