Skip to content

Commit

Permalink
add EXPECT_CALL to suppress warnings
Browse files Browse the repository at this point in the history
  • Loading branch information
zigen committed Dec 4, 2021
1 parent 09af996 commit 04e2fc8
Show file tree
Hide file tree
Showing 2 changed files with 19 additions and 0 deletions.
3 changes: 3 additions & 0 deletions quisp/modules/QRSA/RuleEngine/RuleEngine_test.cc
Original file line number Diff line number Diff line change
Expand Up @@ -172,6 +172,8 @@ TEST(RuleEngineTest, resourceAllocation) {
rs->addRule(std::move(rule));
rule_engine->rp.insert(rs);

EXPECT_CALL(*mockQubit1, Allocate()).WillRepeatedly(Return());
EXPECT_CALL(*mockQubit1, isAllocated()).WillRepeatedly(Return(false));
rule_engine->ResourceAllocation(QNIC_E, 3);

// resource allocation assigns a corresponding qubit to action's resource
Expand All @@ -183,6 +185,7 @@ TEST(RuleEngineTest, resourceAllocation) {
EXPECT_EQ(_rule->resources.size(), 1);
delete mockHardwareMonitor;
delete routingdaemon;
delete mockQubit1;
}

TEST(RuleEngineTest, trackerUpdate) {
Expand Down
16 changes: 16 additions & 0 deletions quisp/rules/actions/SwappingAction_test.cc
Original file line number Diff line number Diff line change
Expand Up @@ -167,6 +167,10 @@ TEST(SwappingActionTest, runWithNoError) {
left_qubit->entangled_partner = right_qubit;

EXPECT_CALL(*right_qubit, measure_Z()).WillOnce(Return(quisp::types::MeasureZResult::NO_X_ERROR));
EXPECT_CALL(*right_qubit, CNOT_gate(left_qubit)).WillOnce(Return());
EXPECT_CALL(*right_qubit, setEntangledPartnerInfo(left_qubit)).WillOnce(Return());
EXPECT_CALL(*left_qubit, setEntangledPartnerInfo(right_qubit)).WillOnce(Return());
EXPECT_CALL(*left_qubit, Hadamard_gate()).WillOnce(Return());
EXPECT_CALL(*left_qubit, measure_Z()).WillOnce(Return(quisp::types::MeasureZResult::NO_X_ERROR));

EXPECT_CALL(*action, getResource(21, 22)).WillOnce(Return(right_qubit));
Expand Down Expand Up @@ -206,6 +210,10 @@ TEST(SwappingActionTest, runWithRightHasError) {
left_qubit->entangled_partner = right_qubit;

EXPECT_CALL(*right_qubit, measure_Z()).WillOnce(Return(quisp::types::MeasureZResult::HAS_X_ERROR));
EXPECT_CALL(*right_qubit, CNOT_gate(left_qubit)).WillOnce(Return());
EXPECT_CALL(*right_qubit, setEntangledPartnerInfo(left_qubit)).WillOnce(Return());
EXPECT_CALL(*left_qubit, setEntangledPartnerInfo(right_qubit)).WillOnce(Return());
EXPECT_CALL(*left_qubit, Hadamard_gate()).WillOnce(Return());
EXPECT_CALL(*left_qubit, measure_Z()).WillOnce(Return(quisp::types::MeasureZResult::NO_X_ERROR));

EXPECT_CALL(*action, getResource(21, 22)).WillOnce(Return(right_qubit));
Expand Down Expand Up @@ -245,6 +253,10 @@ TEST(SwappingActionTest, runWithLeftHasError) {
left_qubit->entangled_partner = right_qubit;

EXPECT_CALL(*right_qubit, measure_Z()).WillOnce(Return(quisp::types::MeasureZResult::NO_X_ERROR));
EXPECT_CALL(*right_qubit, CNOT_gate(left_qubit)).WillOnce(Return());
EXPECT_CALL(*right_qubit, setEntangledPartnerInfo(left_qubit)).WillOnce(Return());
EXPECT_CALL(*left_qubit, setEntangledPartnerInfo(right_qubit)).WillOnce(Return());
EXPECT_CALL(*left_qubit, Hadamard_gate()).WillOnce(Return());
EXPECT_CALL(*left_qubit, measure_Z()).WillOnce(Return(quisp::types::MeasureZResult::HAS_X_ERROR));

EXPECT_CALL(*action, getResource(21, 22)).WillOnce(Return(right_qubit));
Expand Down Expand Up @@ -284,6 +296,10 @@ TEST(SwappingActionTest, runWithBothErrors) {
left_qubit->entangled_partner = right_qubit;

EXPECT_CALL(*right_qubit, measure_Z()).WillOnce(Return(quisp::types::MeasureZResult::HAS_X_ERROR));
EXPECT_CALL(*right_qubit, CNOT_gate(left_qubit)).WillOnce(Return());
EXPECT_CALL(*right_qubit, setEntangledPartnerInfo(left_qubit)).WillOnce(Return());
EXPECT_CALL(*left_qubit, setEntangledPartnerInfo(right_qubit)).WillOnce(Return());
EXPECT_CALL(*left_qubit, Hadamard_gate()).WillOnce(Return());
EXPECT_CALL(*left_qubit, measure_Z()).WillOnce(Return(quisp::types::MeasureZResult::HAS_X_ERROR));

EXPECT_CALL(*action, getResource(21, 22)).WillOnce(Return(right_qubit));
Expand Down

0 comments on commit 04e2fc8

Please sign in to comment.