Skip to content

Utilize dwave::optimization namespace in C++ number tests. #472

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
fastbodin wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Utilize dwave::optimization namespace in C++ number tests. #472

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
29 changes: 13 additions & 16 deletions tests/cpp/nodes/test_numbers.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -296,8 +296,8 @@ TEST_CASE("BinaryNode") {
}

GIVEN("Binary node with index-wise bounds") {
auto bnode_ptr = graph.emplace_node<dwave::optimization::BinaryNode>(
3, std::vector<double>{-1, 0, 1}, std::vector<double>{2, 1, 1});
auto bnode_ptr = graph.emplace_node<BinaryNode>(3, std::vector<double>{-1, 0, 1},
std::vector<double>{2, 1, 1});

THEN("The shape, max, min, and bounds are correct") {
CHECK(bnode_ptr->size() == 3);
Expand Down Expand Up @@ -394,8 +394,7 @@ TEST_CASE("BinaryNode") {
}

GIVEN("Binary node with index-wise upper bound and general lower bound") {
auto bnode_ptr = graph.emplace_node<dwave::optimization::BinaryNode>(
2, -2.0, std::vector<double>{0.0, 1.1});
auto bnode_ptr = graph.emplace_node<BinaryNode>(2, -2.0, std::vector<double>{0.0, 1.1});

THEN("The max, min, and bounds are correct") {
CHECK(bnode_ptr->max() == 1.0);
Expand All @@ -411,8 +410,7 @@ TEST_CASE("BinaryNode") {
}

GIVEN("Binary node with index-wise lower bound and general upper bound") {
auto bnode_ptr = graph.emplace_node<dwave::optimization::BinaryNode>(
2, std::vector<double>{-1.0, 1.0}, 100.0);
auto bnode_ptr = graph.emplace_node<BinaryNode>(2, std::vector<double>{-1.0, 1.0}, 100.0);

THEN("The max, min, and bounds are correct") {
CHECK(bnode_ptr->max() == 1.0);
Expand All @@ -428,13 +426,13 @@ TEST_CASE("BinaryNode") {
}

GIVEN("Binary node with invalid index-wise lower bounds at index 0") {
REQUIRE_THROWS(graph.emplace_node<dwave::optimization::BinaryNode>(
2, std::vector<double>{2, 0}, std::vector<double>{1, 1}));
REQUIRE_THROWS(graph.emplace_node<BinaryNode>(2, std::vector<double>{2, 0},
std::vector<double>{1, 1}));
}

GIVEN("Binary node with invalid index-wise upper bounds at index 1") {
REQUIRE_THROWS(graph.emplace_node<dwave::optimization::BinaryNode>(
2, std::vector<double>{0, 0}, std::vector<double>{1, -1}));
REQUIRE_THROWS(graph.emplace_node<BinaryNode>(2, std::vector<double>{0, 0},
std::vector<double>{1, -1}));
}

GIVEN("Invalid dynamically sized BinaryNode") {
Expand Down Expand Up @@ -534,8 +532,8 @@ TEST_CASE("IntegerNode") {
}

GIVEN("Integer node with index-wise bounds") {
auto inode_ptr = graph.emplace_node<dwave::optimization::IntegerNode>(
3, std::vector<double>{-1, 3, 5}, std::vector<double>{1, 7, 7});
auto inode_ptr = graph.emplace_node<IntegerNode>(3, std::vector<double>{-1, 3, 5},
std::vector<double>{1, 7, 7});

THEN("The shape, max, min, and bounds are correct") {
CHECK(inode_ptr->size() == 3);
Expand Down Expand Up @@ -596,8 +594,7 @@ TEST_CASE("IntegerNode") {
}

GIVEN("Integer node with index-wise upper bound and general integer lower bound") {
auto inode_ptr = graph.emplace_node<dwave::optimization::IntegerNode>(
2, 10, std::vector<double>{20, 10});
auto inode_ptr = graph.emplace_node<IntegerNode>(2, 10, std::vector<double>{20, 10});

THEN("The max, min, and bounds are correct") {
CHECK(inode_ptr->max() == 20.0);
Expand All @@ -613,8 +610,8 @@ TEST_CASE("IntegerNode") {
}

GIVEN("Integer node with invalid index-wise bounds at index 0") {
REQUIRE_THROWS(graph.emplace_node<dwave::optimization::IntegerNode>(
2, std::vector<double>{19, 12}, std::vector<double>{20, 11}));
REQUIRE_THROWS(graph.emplace_node<IntegerNode>(2, std::vector<double>{19, 12},
std::vector<double>{20, 11}));
}

GIVEN("An Integer Node representing an 1d array of 10 elements with lower bound -10") {
Expand Down