Format tests

Author: danngreen

tests/filtered_interp_array_tests.cc

@@ -34,16 +34,20 @@ TEST_CASE("basic interpolation") {
 	auto output_fn = [&](unsigned, float v) { out = v; };
 	auto read_fn = [](unsigned) { return 8.f; };
 
-	arr.add_new_readings(read_fn); arr.get_interp_values(output_fn);
+	arr.add_new_readings(read_fn);
+	arr.get_interp_values(output_fn);
 	CHECK(out == doctest::Approx(2.f));
 
-	arr.add_new_readings(read_fn); arr.get_interp_values(output_fn);
+	arr.add_new_readings(read_fn);
+	arr.get_interp_values(output_fn);
 	CHECK(out == doctest::Approx(4.f));
 
-	arr.add_new_readings(read_fn); arr.get_interp_values(output_fn);
+	arr.add_new_readings(read_fn);
+	arr.get_interp_values(output_fn);
 	CHECK(out == doctest::Approx(6.f));
 
-	arr.add_new_readings(read_fn); arr.get_interp_values(output_fn);
+	arr.add_new_readings(read_fn);
+	arr.get_interp_values(output_fn);
 	CHECK(out == 8.f); // snap: exact match, no floating-point accumulation
 }
 
@@ -88,25 +92,31 @@ TEST_CASE("multi channel interpolates independently") {
 	arr.mark_new_data_ready();
 	float out0 = 0.f, out1 = 0.f;
 	auto output_fn = [&](unsigned i, float v) {
-		if (i == 0) out0 = v;
-		else out1 = v;
+		if (i == 0)
+			out0 = v;
+		else
+			out1 = v;
 	};
 	// ch0 target=4 (step=1), ch1 target=8 (step=2)
 	auto read_fn = [](unsigned i) { return i == 0 ? 4.f : 8.f; };
 
-	arr.add_new_readings(read_fn); arr.get_interp_values(output_fn);
+	arr.add_new_readings(read_fn);
+	arr.get_interp_values(output_fn);
 	CHECK(out0 == doctest::Approx(1.f));
 	CHECK(out1 == doctest::Approx(2.f));
 
-	arr.add_new_readings(read_fn); arr.get_interp_values(output_fn);
+	arr.add_new_readings(read_fn);
+	arr.get_interp_values(output_fn);
 	CHECK(out0 == doctest::Approx(2.f));
 	CHECK(out1 == doctest::Approx(4.f));
 
-	arr.add_new_readings(read_fn); arr.get_interp_values(output_fn);
+	arr.add_new_readings(read_fn);
+	arr.get_interp_values(output_fn);
 	CHECK(out0 == doctest::Approx(3.f));
 	CHECK(out1 == doctest::Approx(6.f));
 
-	arr.add_new_readings(read_fn); arr.get_interp_values(output_fn);
+	arr.add_new_readings(read_fn);
+	arr.get_interp_values(output_fn);
 	CHECK(out0 == 4.f); // snap
 	CHECK(out1 == 8.f); // snap
 }
@@ -124,7 +134,7 @@ TEST_CASE("adapts num updates to measured period") {
 	// --- Cycle 1: ISR fires, target=8, num_updates=4 ---
 	arr.mark_new_data_ready();
 	arr.add_new_readings([](unsigned) { return 8.f; }); // count=0 -> skip set_num_updates
-	arr.get_interp_values(output_fn);                   // count=1, step=8/4=2, out=2
+	arr.get_interp_values(output_fn);					// count=1, step=8/4=2, out=2
 	CHECK(out == doctest::Approx(2.f));
 	arr.add_new_readings([](unsigned) { return 8.f; });
 	arr.get_interp_values(output_fn); // count=2, out=4
@@ -134,17 +144,17 @@ TEST_CASE("adapts num updates to measured period") {
 	// --- Cycle 2: ISR fires, target=16, immediately adapted ---
 	arr.mark_new_data_ready();
 	arr.add_new_readings([](unsigned) { return 16.f; }); // count=2 -> set_num_updates(2), step=(16-4)/2=6
-	arr.get_interp_values(output_fn);                    // count=1, out=4+6=10
-	CHECK(out == doctest::Approx(10.f)); // correctly at the midpoint
+	arr.get_interp_values(output_fn);					 // count=1, out=4+6=10
+	CHECK(out == doctest::Approx(10.f));				 // correctly at the midpoint
 	arr.add_new_readings([](unsigned) { return 16.f; });
 	arr.get_interp_values(output_fn); // count=2 >= num_updates=2: snap=16
 	CHECK(out == 16.f);
 
 	// --- Cycle 3: ISR fires, target=0 ---
 	arr.mark_new_data_ready();
 	arr.add_new_readings([](unsigned) { return 0.f; }); // count=2 -> set_num_updates(2), step=(0-16)/2=-8
-	arr.get_interp_values(output_fn);                   // count=1, out=16-8=8
-	CHECK(out == doctest::Approx(8.f)); // correctly at the midpoint
+	arr.get_interp_values(output_fn);					// count=1, out=16-8=8
+	CHECK(out == doctest::Approx(8.f));					// correctly at the midpoint
 	arr.add_new_readings([](unsigned) { return 0.f; });
 	arr.get_interp_values(output_fn); // count=2 >= num_updates=2: snap=0
 	CHECK(out == 0.f);
@@ -159,9 +169,12 @@ TEST_CASE("mark multiple times is processed once") {
 	int call_count = 0;
 	float out = 0.f;
 	arr.add_new_readings([](unsigned) { return 8.f; });
-	arr.get_interp_values([&](unsigned, float v) { out = v; call_count++; });
+	arr.get_interp_values([&](unsigned, float v) {
+		out = v;
+		call_count++;
+	});
 
-	CHECK(call_count == 1);             // output_fn called exactly once (1 channel)
+	CHECK(call_count == 1);				// output_fn called exactly once (1 channel)
 	CHECK(out == doctest::Approx(2.f)); // normal step, not doubled
 }
 
@@ -172,7 +185,10 @@ TEST_CASE("second mark before add uses latest reading") {
 	arr.set_num_updates(4);
 	float out = 0.f;
 	int call_count = 0;
-	auto output_fn = [&](unsigned, float v) { out = v; call_count++; };
+	auto output_fn = [&](unsigned, float v) {
+		out = v;
+		call_count++;
+	};
 
 	arr.mark_new_data_ready();
 	arr.add_new_readings([](unsigned) { return 4.f; });
@@ -187,7 +203,7 @@ TEST_CASE("second mark before add uses latest reading") {
 	arr.add_new_readings([](unsigned) { return 8.f; });
 	arr.get_interp_values(output_fn);
 	CHECK(call_count == 1); // flag processed exactly once (1 channel, 1 call)
-	CHECK(out == 8.f);      // snapped to 8.f (num_updates adapted to 1)
+	CHECK(out == 8.f);		// snapped to 8.f (num_updates adapted to 1)
 }
 
 TEST_CASE("size returns N") {
@@ -198,19 +214,22 @@ TEST_CASE("size returns N") {
 
 TEST_CASE("filter concept is enforced") {
 	struct ValidFilter {
-		float add_val(float v) { return v; }
+		float add_val(float v) {
+			return v;
+		}
 	};
 	struct NoAddVal {
-		float process(float v) { return v; } // wrong method name
+		float process(float v) {
+			return v;
+		} // wrong method name
 	};
 	struct WrongReturnType {
-		void add_val(float) {} // void is not convertible to float
+		void add_val(float) {
+		} // void is not convertible to float
 	};
 
 	// Test the requires expression directly (same constraint as on the class template)
-	auto satisfies = []<typename F>() {
-		return IsSimpleFilter<F, float>;
-	};
+	auto satisfies = []<typename F>() { return IsSimpleFilter<F, float>; };
 	static_assert(satisfies.template operator()<ValidFilter>());
 	static_assert(!satisfies.template operator()<NoAddVal>());
 	static_assert(!satisfies.template operator()<WrongReturnType>());