Algorithms_in_C++ 1.0.0
Set of algorithms implemented in C++.
|
class encapsulating the necessary test cases More...
Public Member Functions | |
void | runTests () |
Executes test cases. | |
void | testCase_1 () |
A test case contains edge case, printing inorder successor of last node. | |
void | testCase_2 () |
A test case which contains main list of 100 elements and sublist of 20. | |
void | testCase_3 () |
A test case which contains main list of 50 elements and sublist of 20. | |
void | runTests () |
Executes test cases. | |
void | testCase_1 () |
A test case contains edge case, Only contains one element. | |
void | testCase_2 () |
A test case which contains main list of 100 elements and sublist of 20. | |
void | testCase_3 () |
A test case which contains main list of 50 elements and sublist of 20. | |
void | runTests () |
Executes test cases. | |
void | testCase_1 () |
A test case with single input. | |
void | testCase_2 () |
A test case with input array of length 500. | |
void | testCase_3 () |
A test case with array of length 1000. | |
Private Member Functions | |
template<typename T > | |
void | log (T msg) |
A function to print given message on console. | |
template<typename T > | |
void | log (T msg) |
A function to print given message on console. | |
template<typename T > | |
void | log (T msg) |
A function to print64_t given message on console. | |
class encapsulating the necessary test cases
a class containing the necessary test cases
|
inlineprivate |
A function to print given message on console.
T | Type of the given message. |
|
inlineprivate |
|
inlineprivate |
|
inline |
Executes test cases.
|
inline |
Executes test cases.
|
inline |
Executes test cases.
|
inline |
A test case contains edge case, printing inorder successor of last node.
< Expected output of this test
< Data to make nodes in BST
< Adding nodes to BST
< Printing inorder to cross-verify.
< The inorder successor node for given data
memory cleanup!
|
inline |
A test case contains edge case, Only contains one element.
< Expected output of this test
< Data to make linked list which will be the sublist
< Data to make linked list which will be the main list
< Sublist to be searched
< Main list in which sublist is to be searched
< boolean, if sublist exist or not
|
inline |
A test case with single input.
|
inline |
A test case which contains main list of 100 elements and sublist of 20.
< Expected output of this test
< Data to make nodes in BST
< Adding nodes to BST
< Printing inorder to cross-verify.
< The inorder successor node for given data
memory cleanup!
|
inline |
A test case which contains main list of 100 elements and sublist of 20.
Expected output of this test
< Data to make linked list which will be the sublist
< Main list in which sublist is to be searched
Inserts 100 elements in main list
Inserts 20 elements in sublist
< Sublist to be searched
< Main list in which sublist is to be searched
< boolean, if sublist exist or not
|
inline |
A test case with input array of length 500.
|
inline |
A test case which contains main list of 50 elements and sublist of 20.
< Expected output of this test
< Data to make nodes in BST
< Adding nodes to BST
< Printing inorder to cross-verify.
< The inorder successor node for given data
memory cleanup!
|
inline |
A test case which contains main list of 50 elements and sublist of 20.
< Expected output of this test
< Sublist to be searched
< Main list in which sublist is to be searched
Inserts 100 elements in main list
Inserts 20 elements in sublist
< Sublist to be searched
< Main list in which sublist is to be searched
< boolean, if sublist exist or not
|
inline |
A test case with array of length 1000.