Ttykuu

Do I need to be arrogant to get ahead?

Why does a Star of David appear at a rally with Francisco Franco?

What exactly is this small puffer fish doing and how did it manage to accomplish such a feat?

Non-trivial topology where only open sets are closed

Different outputs for `w`, `who`, `whoami` and `id`

Why did it take so long to abandon sail after steamships were demonstrated?

About the actual radiative impact of greenhouse gas emission over time

Does .bashrc contain syntax errors?

I got the following comment from a reputed math journal. What does it mean?

Four married couples attend a party. Each person shakes hands with every other person, except their own spouse, exactly once. How many handshakes?

Why is there is so much iron?

How difficult is it to simply disable/disengage the MCAS on Boeing 737 Max 8 & 9 Aircraft?

Is there a symmetric-key algorithm which we can use for creating a signature?

How can we have a quark condensate without a quark potential?

How do you talk to someone whose loved one is dying?

Recruiter wants very extensive technical details about all of my previous work

Should Stotras and Mantras be recited aloud?

What is the meaning of まっちろけ?

A single argument pattern definition applies to multiple-argument patterns?

Does multi-classing into Fighter give you heavy armor proficiency?

"of which" is correct here?

Are all passive ability checks floors for active ability checks?

How are passwords stolen from companies if they only store hashes?

How could a scammer know the apps on my phone / iTunes account?

How to write this unit-test with more standard testing libraries

Do I need to create more functions? And also, is this code difficult to unit test?How to unit test this method?Test Driven Development, Mocking & Unit-testingIs this good practice with unit-testing?Unit testing - test class inheritance vs single test classHow to write unit test cases for any real time Java app?Unit testing with a singly linked listMethod injection into TestClass local namespace for automatic generation of Python unittest “test_xxx” methodsUnit test with check testing frameworkPrepare a cross-platform QT C-wrapper class for unit testing and mocking

1

$begingroup$

Here is a simple unit-test I wrote for a binary-search-tree class (I removed a lot of tests to focus on the main question):

#include <iostream>
using std::cout, std::endl;
#include "Tree.hpp"
#include "badkan.hpp"

int main() 
 Tree tree;

 badkan::TestCase tc("Binary tree");
 tc
 .CHECK_EQUAL (tree.size(), 0)
 .CHECK_EQUAL (tree.contains(5), false)
 .CHECK_OK (tree.insert(5))
 .CHECK_EQUAL (tree.size(), 1)
 .CHECK_EQUAL (tree.contains(5), true)
 .CHECK_OK (tree.remove(5))
 .CHECK_EQUAL (tree.contains(5), false)
 .CHECK_THROWS(tree.remove(5))
 .CHECK_EQUAL (tree.size() ,0)
 ;

 cout << "You have " << tc.right() << " right answers " 
 << " and " << tc.wrong() << " wrong answers " 
 << " so your grade is " << tc.grade() << ". Great!" << endl;

The "badkan.hpp" is a simple library that I wrote for unit-testing: https://github.com/erelsgl/ariel-cpp-5779/blob/master/02-classes-constructors-destructors/homework/badkan.hpp

The program defines a TestCase variable tc, then runs one of the methods:

• CHECK_EQUAL to check that the outcome of a function equals a certain value;


• CHECK_OK to check that the given function runs without exceptions;


• CHECK_THROWS to check that the given function throws an exception.

Finally, it prints the number of right and wrong answers and calculates the grade (right/(right+wrong)).

There are many things to improve here, but the main thing I am interested in is: how to write this code using a more standard library for unitesting, such as: GoogleTest, catch2, doctest, etc.?

From what I know, these libraries can print nice-looking reports, however, they do not give me the ability to actually read the number of right and wrong answers in the code (like tc.right() and tc.wrong()) and do calculations with them (like tc.grade()).

c++ unit-testing

share|improve this question

asked 14 mins ago

Erel Segal-HaleviErel Segal-Halevi

2771212

$endgroup$

add a comment | 

1

$begingroup$

Here is a simple unit-test I wrote for a binary-search-tree class (I removed a lot of tests to focus on the main question):

#include <iostream>
using std::cout, std::endl;
#include "Tree.hpp"
#include "badkan.hpp"

int main() 
 Tree tree;

 badkan::TestCase tc("Binary tree");
 tc
 .CHECK_EQUAL (tree.size(), 0)
 .CHECK_EQUAL (tree.contains(5), false)
 .CHECK_OK (tree.insert(5))
 .CHECK_EQUAL (tree.size(), 1)
 .CHECK_EQUAL (tree.contains(5), true)
 .CHECK_OK (tree.remove(5))
 .CHECK_EQUAL (tree.contains(5), false)
 .CHECK_THROWS(tree.remove(5))
 .CHECK_EQUAL (tree.size() ,0)
 ;

 cout << "You have " << tc.right() << " right answers " 
 << " and " << tc.wrong() << " wrong answers " 
 << " so your grade is " << tc.grade() << ". Great!" << endl;

The "badkan.hpp" is a simple library that I wrote for unit-testing: https://github.com/erelsgl/ariel-cpp-5779/blob/master/02-classes-constructors-destructors/homework/badkan.hpp

The program defines a TestCase variable tc, then runs one of the methods:

• CHECK_EQUAL to check that the outcome of a function equals a certain value;


• CHECK_OK to check that the given function runs without exceptions;


• CHECK_THROWS to check that the given function throws an exception.

Finally, it prints the number of right and wrong answers and calculates the grade (right/(right+wrong)).

There are many things to improve here, but the main thing I am interested in is: how to write this code using a more standard library for unitesting, such as: GoogleTest, catch2, doctest, etc.?

From what I know, these libraries can print nice-looking reports, however, they do not give me the ability to actually read the number of right and wrong answers in the code (like tc.right() and tc.wrong()) and do calculations with them (like tc.grade()).

c++ unit-testing

share|improve this question

asked 14 mins ago

Erel Segal-HaleviErel Segal-Halevi

2771212

$endgroup$

add a comment | 

$begingroup$

Here is a simple unit-test I wrote for a binary-search-tree class (I removed a lot of tests to focus on the main question):

#include <iostream>
using std::cout, std::endl;
#include "Tree.hpp"
#include "badkan.hpp"

int main() 
 Tree tree;

 badkan::TestCase tc("Binary tree");
 tc
 .CHECK_EQUAL (tree.size(), 0)
 .CHECK_EQUAL (tree.contains(5), false)
 .CHECK_OK (tree.insert(5))
 .CHECK_EQUAL (tree.size(), 1)
 .CHECK_EQUAL (tree.contains(5), true)
 .CHECK_OK (tree.remove(5))
 .CHECK_EQUAL (tree.contains(5), false)
 .CHECK_THROWS(tree.remove(5))
 .CHECK_EQUAL (tree.size() ,0)
 ;

 cout << "You have " << tc.right() << " right answers " 
 << " and " << tc.wrong() << " wrong answers " 
 << " so your grade is " << tc.grade() << ". Great!" << endl;

The "badkan.hpp" is a simple library that I wrote for unit-testing: https://github.com/erelsgl/ariel-cpp-5779/blob/master/02-classes-constructors-destructors/homework/badkan.hpp

The program defines a TestCase variable tc, then runs one of the methods:

• CHECK_EQUAL to check that the outcome of a function equals a certain value;


• CHECK_OK to check that the given function runs without exceptions;


• CHECK_THROWS to check that the given function throws an exception.

Finally, it prints the number of right and wrong answers and calculates the grade (right/(right+wrong)).

There are many things to improve here, but the main thing I am interested in is: how to write this code using a more standard library for unitesting, such as: GoogleTest, catch2, doctest, etc.?

From what I know, these libraries can print nice-looking reports, however, they do not give me the ability to actually read the number of right and wrong answers in the code (like tc.right() and tc.wrong()) and do calculations with them (like tc.grade()).

c++ unit-testing

share|improve this question

asked 14 mins ago

Erel Segal-HaleviErel Segal-Halevi

2771212

$endgroup$

#include <iostream>
using std::cout, std::endl;
#include "Tree.hpp"
#include "badkan.hpp"

int main() 
 Tree tree;

 badkan::TestCase tc("Binary tree");
 tc
 .CHECK_EQUAL (tree.size(), 0)
 .CHECK_EQUAL (tree.contains(5), false)
 .CHECK_OK (tree.insert(5))
 .CHECK_EQUAL (tree.size(), 1)
 .CHECK_EQUAL (tree.contains(5), true)
 .CHECK_OK (tree.remove(5))
 .CHECK_EQUAL (tree.contains(5), false)
 .CHECK_THROWS(tree.remove(5))
 .CHECK_EQUAL (tree.size() ,0)
 ;

 cout << "You have " << tc.right() << " right answers " 
 << " and " << tc.wrong() << " wrong answers " 
 << " so your grade is " << tc.grade() << ". Great!" << endl;

share|improve this question

asked 14 mins ago

Erel Segal-HaleviErel Segal-Halevi

2771212

share|improve this question

asked 14 mins ago

Erel Segal-HaleviErel Segal-Halevi

2771212

asked 14 mins ago

Erel Segal-HaleviErel Segal-Halevi

2771212

asked 14 mins ago

Erel Segal-HaleviErel Segal-Halevi

2771212