From b1726d4b459d2d98e187b3f816439b64d305c749 Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Tue, 6 Jul 2021 01:58:55 +0000 Subject: [PATCH] clang-format and clang-tidy fixes for f6913b75 --- search/sublist_search.cpp | 214 +++++++++++++++++++++----------------- 1 file changed, 118 insertions(+), 96 deletions(-) diff --git a/search/sublist_search.cpp b/search/sublist_search.cpp index 96840dad4..11eb348dc 100644 --- a/search/sublist_search.cpp +++ b/search/sublist_search.cpp @@ -39,54 +39,55 @@ namespace search { * Search](https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list) * implementation */ - namespace sublist_search { +namespace sublist_search { /** * @brief A Node structure representing a single link Node in a linked list */ - struct Node { - uint32_t data = 0; ///< the key/value of the node - Node *next{}; ///< pointer to the next node - }; +struct Node { + uint32_t data = 0; ///< the key/value of the node + Node *next{}; ///< pointer to the next node +}; /** * @brief A simple function to print the linked list * @param start The head of the linked list * @returns void */ - void printLinkedList(Node *start) { - while (start != nullptr) { - std::cout << "->" << start->data; - start = start->next; - } - std::cout << std::endl; - } +void printLinkedList(Node *start) { + while (start != nullptr) { + std::cout << "->" << start->data; + start = start->next; + } + std::cout << std::endl; +} /** * @brief Give a vector of data, - * it adds each element of vector in the linked list and return the address of head pointer. + * it adds each element of vector in the linked list and return the address of + * head pointer. * @param data A vector of "int" containing the data that is supposed to be * stored in nodes of linked list. * @returns Node* A head pointer to the linked list. */ - Node *makeLinkedList(const std::vector &data) { - /// This is used in test cases for rapidly creating linked list with 100+ elements, instead of hard-coding - /// 100 elements in test cases. - Node *head = nullptr; - Node *tail = nullptr; - for (int i : data) { - Node *node = new Node; - node->data = i; - node->next = nullptr; - if (head == nullptr) { - head = node; - tail = node; - } else { - tail->next = node; - tail = tail->next; - } - } - return head; +Node *makeLinkedList(const std::vector &data) { + /// This is used in test cases for rapidly creating linked list with 100+ + /// elements, instead of hard-coding 100 elements in test cases. + Node *head = nullptr; + Node *tail = nullptr; + for (int i : data) { + Node *node = new Node; + node->data = i; + node->next = nullptr; + if (head == nullptr) { + head = node; + tail = node; + } else { + tail->next = node; + tail = tail->next; } + } + return head; +} /** * @brief Main searching function @@ -95,59 +96,61 @@ namespace search { * @returns true if the sublist is found * @returns false if the sublist is NOT found */ - bool sublistSearch(Node *sublist, Node *mainList) { - if (sublist == nullptr || mainList == nullptr) { +bool sublistSearch(Node *sublist, Node *mainList) { + if (sublist == nullptr || mainList == nullptr) { + return false; + } + + /// Initialize target pointer to the head node of sublist. + Node *target_ptr = sublist; + + while (mainList != nullptr) { + /// Initialize main pointer to the current node of main list. + Node *main_ptr = mainList; + + while (target_ptr != nullptr) { + if (main_ptr == nullptr) { return false; + + } else if (main_ptr->data == target_ptr->data) { + /// If the data of target node and main node is equal then move + /// to the next node of both lists. + target_ptr = target_ptr->next; + main_ptr = main_ptr->next; + + } else { + break; } - - /// Initialize target pointer to the head node of sublist. - Node *target_ptr = sublist; - - while (mainList != nullptr) { - /// Initialize main pointer to the current node of main list. - Node *main_ptr = mainList; - - while (target_ptr != nullptr) { - if (main_ptr == nullptr) { - return false; - - } else if (main_ptr->data == target_ptr->data) { - /// If the data of target node and main node is equal then move - /// to the next node of both lists. - target_ptr = target_ptr->next; - main_ptr = main_ptr->next; - - } else { - break; - } - } - - if (target_ptr == nullptr) { - /// Is target pointer becomes null that means the target list is been - /// traversed without returning false. Which means the sublist has - /// been found and return ture. - return true; - } - - /// set the target pointer again to stating point of target list. - target_ptr = sublist; - - /// set the main pointer to the next element of the main list and repeat the algo. - mainList = mainList->next; - } - - /// If the main list is exhausted, means sublist does not found, return false - return false; } - } // namespace sublist_search + if (target_ptr == nullptr) { + /// Is target pointer becomes null that means the target list is + /// been traversed without returning false. Which means the sublist + /// has been found and return ture. + return true; + } + + /// set the target pointer again to stating point of target list. + target_ptr = sublist; + + /// set the main pointer to the next element of the main list and repeat + /// the algo. + mainList = mainList->next; + } + + /// If the main list is exhausted, means sublist does not found, return + /// false + return false; +} + +} // namespace sublist_search } // namespace search /** * @brief class encapsulating the necessary test cases */ class TestCases { -private: + private: /** * @brief A function to print given message on console. * @tparam T Type of the given message. @@ -159,7 +162,7 @@ private: std::cout << "[TESTS] : ---> " << msg << std::endl; } -public: + public: /** * @brief Executes test cases * @returns void @@ -188,16 +191,22 @@ public: log("Description:"); log(" EDGE CASE : Only contains one element"); - std::vector sublistData = {6}; ///< Data to make linked list which will be the sublist - std::vector mainlistData = {2, 5, 6, 7, 8}; ///< Data to make linked list which will be the main list + std::vector sublistData = { + 6}; ///< Data to make linked list which will be the sublist + std::vector mainlistData = { + 2, 5, 6, 7, + 8}; ///< Data to make linked list which will be the main list search::sublist_search::Node *sublistLL = - search::sublist_search::makeLinkedList(sublistData); ///< Sublist to be searched + search::sublist_search::makeLinkedList( + sublistData); ///< Sublist to be searched search::sublist_search::Node *mainlistLL = - search::sublist_search::makeLinkedList(mainlistData); ///< Main list in which sublist is to be searched + search::sublist_search::makeLinkedList( + mainlistData); ///< Main list in which sublist is to be + ///< searched bool exists = search::sublist_search::sublistSearch( - sublistLL, mainlistLL); ///< boolean, if sublist exist or not + sublistLL, mainlistLL); ///< boolean, if sublist exist or not log("Checking assert expression..."); assert(exists == expectedOutput); @@ -219,13 +228,16 @@ public: void testCase_2() { const bool expectedOutput = true; /// Expected output of this test - log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"); + log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~" + "~"); log("This is test case 2 for sublist search Algorithm : "); log("Description:"); log(" contains main list of 100 elements and sublist of 20"); - std::vector sublistData(20); ///< Data to make linked list which will be the sublist - std::vector mainlistData(100); ///< Main list in which sublist is to be searched + std::vector sublistData( + 20); ///< Data to make linked list which will be the sublist + std::vector mainlistData( + 100); ///< Main list in which sublist is to be searched for (int i = 0; i < 100; i++) { /// Inserts 100 elements in main list @@ -240,19 +252,23 @@ public: } search::sublist_search::Node *sublistLL = - search::sublist_search::makeLinkedList(sublistData); ///< Sublist to be searched + search::sublist_search::makeLinkedList( + sublistData); ///< Sublist to be searched search::sublist_search::Node *mainlistLL = - search::sublist_search::makeLinkedList(mainlistData); ///< Main list in which sublist is to be searched + search::sublist_search::makeLinkedList( + mainlistData); ///< Main list in which sublist is to be + ///< searched bool exists = search::sublist_search::sublistSearch( - sublistLL, mainlistLL); ///< boolean, if sublist exist or not + sublistLL, mainlistLL); ///< boolean, if sublist exist or not log("Checking assert expression..."); assert(exists == expectedOutput); log("Assertion check passed!"); log("[PASS] : TEST CASE 2 PASS!"); - log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"); + log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~" + "~"); } /** @@ -263,13 +279,15 @@ public: void testCase_3() { const bool expectedOutput = false; ///< Expected output of this test - log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"); + log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~" + "~"); log("This is test case 3 for sublist search Algorithm : "); log("Description:"); log(" contains main list of 50 elements and sublist of 20"); std::vector sublistData(20); ///< Sublist to be searched - std::vector mainlistData(50); ///< Main list in which sublist is to be searched + std::vector mainlistData( + 50); ///< Main list in which sublist is to be searched for (int i = 0; i < 50; i++) { /// Inserts 100 elements in main list @@ -282,19 +300,23 @@ public: } search::sublist_search::Node *sublistLL = - search::sublist_search::makeLinkedList(sublistData); ///< Sublist to be searched + search::sublist_search::makeLinkedList( + sublistData); ///< Sublist to be searched search::sublist_search::Node *mainlistLL = - search::sublist_search::makeLinkedList(mainlistData); ///< Main list in which sublist is to be searched + search::sublist_search::makeLinkedList( + mainlistData); ///< Main list in which sublist is to be + ///< searched bool exists = search::sublist_search::sublistSearch( - sublistLL, mainlistLL); ///< boolean, if sublist exist or not + sublistLL, mainlistLL); ///< boolean, if sublist exist or not log("Checking assert expression..."); assert(exists == expectedOutput); log("Assertion check passed!"); log("[PASS] : TEST CASE 3 PASS!"); - log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"); + log("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~" + "~"); } }; @@ -320,12 +342,12 @@ int main(int argc, char *argv[]) { std::vector sublistData = {6, 8}; search::sublist_search::Node *mainlistLL = - search::sublist_search::makeLinkedList(mainlistData); + search::sublist_search::makeLinkedList(mainlistData); search::sublist_search::Node *sublistLL = - search::sublist_search::makeLinkedList(sublistData); + search::sublist_search::makeLinkedList(sublistData); bool exists = search::sublist_search::sublistSearch( - sublistLL, mainlistLL); // boolean, if sublist exist or not + sublistLL, mainlistLL); // boolean, if sublist exist or not std::cout << "Sublist :" << std::endl; search::sublist_search::printLinkedList(sublistLL);