allemang.d/toddcox-visualize
1
0
Fork 0
mirror of https://github.com/allemangD/toddcox-visualize.git synced 2025-11-10 03:52:48 -05:00
Code Issues Packages Projects Releases Wiki Activity

remove invalid benchmarks

Browse Source
This commit is contained in:
David Allemang
2022-09-16 13:09:49 -04:00
parent f3617d7d35
commit 6d1bb807f3
2 changed files with 12 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
tc/src/groups.cpp
View File

@@ -25,6 +25,10 @@ namespace tc {
} }
Group D(const int dim) { Group D(const int dim) {
if (dim <= 2) {
throw std::runtime_error("tc::group::D requires dim > 2.");
}
std::vector<int> mults(dim - 1, 3); std::vector<int> mults(dim - 1, 3);
mults[dim - 2] = 2; mults[dim - 2] = 2;
@@ -35,6 +39,10 @@ namespace tc {
} }
Group E(const int dim) { Group E(const int dim) {
if (dim <= 3) {
throw std::runtime_error("tc::group::E requires dim > 3.");
}
std::vector<int> mults(dim - 1, 3); std::vector<int> mults(dim - 1, 3);
mults[dim - 2] = 2; mults[dim - 2] = 2;

8
tc/test/test_solve.cpp
View File

@@ -25,7 +25,8 @@ testing::AssertionResult AssertSolveOrder(
auto cosets_per_sec = (double) actual_order / total_sec; auto cosets_per_sec = (double) actual_order / total_sec;
bool order_good = actual_order == expected_order; bool order_good = actual_order == expected_order;
bool speed_good = cosets_per_sec >= MIN_COS_PER_SEC; bool speed_good = cosets_per_sec >= MIN_COS_PER_SEC || total_sec < 0.0001;
// extremely short times cause false negatives. ex. A2 can be solved in only 3 clocks.
if (order_good && speed_good) { if (order_good && speed_good) {
return testing::AssertionSuccess(); return testing::AssertionSuccess();
@@ -38,7 +39,8 @@ testing::AssertionResult AssertSolveOrder(
} }
if (!speed_good) { if (!speed_good) {
res << " Solution too slow (" << cosets_per_sec res << " Solution too slow (" << cosets_per_sec
<< " cos/s < " << MIN_COS_PER_SEC << ")."; << " cos/s < " << MIN_COS_PER_SEC << ")."
<< " " << std::fixed << total_sec << " s.";
} }
return res; return res;
@@ -87,7 +89,6 @@ TEST(solve, B) {
} }
TEST(solve, D) { TEST(solve, D) {
EXPECT_SOLVE_ORDER(D(2), v({}), 4);
EXPECT_SOLVE_ORDER(D(3), v({}), 24); EXPECT_SOLVE_ORDER(D(3), v({}), 24);
EXPECT_SOLVE_ORDER(D(4), v({}), 192); EXPECT_SOLVE_ORDER(D(4), v({}), 192);
EXPECT_SOLVE_ORDER(D(4), v({0, 1}), 32); EXPECT_SOLVE_ORDER(D(4), v({0, 1}), 32);
@@ -103,7 +104,6 @@ TEST(solve, D) {
} }
TEST(solve, E) { TEST(solve, E) {
EXPECT_SOLVE_ORDER(E(3), v({}), 12);
EXPECT_SOLVE_ORDER(E(4), v({}), 120); EXPECT_SOLVE_ORDER(E(4), v({}), 120);
EXPECT_SOLVE_ORDER(E(4), v({2}), 60); EXPECT_SOLVE_ORDER(E(4), v({2}), 60);
EXPECT_SOLVE_ORDER(E(4), v({2, 1}), 20); EXPECT_SOLVE_ORDER(E(4), v({2, 1}), 20);