From bc43643715d0a0f51b3afca82650a0197f5ccc1c Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Sat, 11 Sep 2021 04:49:30 +0000 Subject: [PATCH 1/7] clang-format and clang-tidy fixes for 3b2e68c2 --- data_structures/reverse_a_linked_list.cpp | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-) diff --git a/data_structures/reverse_a_linked_list.cpp b/data_structures/reverse_a_linked_list.cpp index ab40f83fd..29c9ec7f6 100644 --- a/data_structures/reverse_a_linked_list.cpp +++ b/data_structures/reverse_a_linked_list.cpp @@ -17,8 +17,9 @@ * happens. And then we move the prev and current pointers one step forward. * Then the head node is made to point to the last node (prev pointer) after * completion of an iteration. - * Graphic Explanation:https://drive.google.com/file/d/1pM5COF0wx-wermnNy_svtyZquaCUP2xS/view?usp=sharing - * + * Graphic + * Explanation:https://drive.google.com/file/d/1pM5COF0wx-wermnNy_svtyZquaCUP2xS/view?usp=sharing + * */ #include /// for assert #include /// for I/O operations @@ -39,8 +40,8 @@ namespace linked_list { */ class Node { public: - int32_t val; /// value of the current link - Node *next; /// pointer to the next value on the list + int32_t val; /// value of the current link + Node *next; /// pointer to the next value on the list }; /** From 8740c411e4f5dba64ce0f4e4855a47095c2350cd Mon Sep 17 00:00:00 2001 From: Tisha Soumya Date: Sun, 12 Sep 2021 22:33:14 +0530 Subject: [PATCH 2/7] docs : documentation fixes Co-authored-by: David Leal --- data_structures/reverse_a_linked_list.cpp | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/data_structures/reverse_a_linked_list.cpp b/data_structures/reverse_a_linked_list.cpp index 29c9ec7f6..c8cc0a327 100644 --- a/data_structures/reverse_a_linked_list.cpp +++ b/data_structures/reverse_a_linked_list.cpp @@ -4,7 +4,8 @@ * a single linked list](https://simple.wikipedia.org/wiki/Linked_list) * @details * The linked list is a data structure used for holding a sequence of - * values, which can be added, displayed,reversed, or removed. + * values, which can be added, displayed, reversed, or removed. + * ### Algorithm * Values can be added by iterating to the end of a list (by following * the pointers) starting from the first link. Whichever link points to null From 57953be14880dd5bed71fdea0d5652490de6812a Mon Sep 17 00:00:00 2001 From: Tisha Soumya Date: Sun, 12 Sep 2021 22:33:52 +0530 Subject: [PATCH 3/7] docs : documentation changes Co-authored-by: David Leal --- data_structures/reverse_a_linked_list.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/data_structures/reverse_a_linked_list.cpp b/data_structures/reverse_a_linked_list.cpp index c8cc0a327..fe16a0ec9 100644 --- a/data_structures/reverse_a_linked_list.cpp +++ b/data_structures/reverse_a_linked_list.cpp @@ -1,6 +1,6 @@ /** * @file - * @brief Implementation of [Reversing + * @brief Implementation of [Reversing * a single linked list](https://simple.wikipedia.org/wiki/Linked_list) * @details * The linked list is a data structure used for holding a sequence of From 58a7387ff4d8c958abbd5fd98f8781b8a8289ae1 Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Sun, 12 Sep 2021 17:04:34 +0000 Subject: [PATCH 4/7] clang-format and clang-tidy fixes for 57953be1 --- data_structures/reverse_a_linked_list.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/data_structures/reverse_a_linked_list.cpp b/data_structures/reverse_a_linked_list.cpp index fe16a0ec9..b433b76dd 100644 --- a/data_structures/reverse_a_linked_list.cpp +++ b/data_structures/reverse_a_linked_list.cpp @@ -5,7 +5,7 @@ * @details * The linked list is a data structure used for holding a sequence of * values, which can be added, displayed, reversed, or removed. - + * ### Algorithm * Values can be added by iterating to the end of a list (by following * the pointers) starting from the first link. Whichever link points to null From db8e74a9045ca098be79bec78f976fdadb4ddff2 Mon Sep 17 00:00:00 2001 From: Tisha Soumya Date: Sun, 12 Sep 2021 23:11:39 +0530 Subject: [PATCH 5/7] docs: fix changes Co-authored-by: David Leal --- data_structures/reverse_a_linked_list.cpp | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/data_structures/reverse_a_linked_list.cpp b/data_structures/reverse_a_linked_list.cpp index b433b76dd..0ed7ba3e1 100644 --- a/data_structures/reverse_a_linked_list.cpp +++ b/data_structures/reverse_a_linked_list.cpp @@ -18,8 +18,7 @@ * happens. And then we move the prev and current pointers one step forward. * Then the head node is made to point to the last node (prev pointer) after * completion of an iteration. - * Graphic - * Explanation:https://drive.google.com/file/d/1pM5COF0wx-wermnNy_svtyZquaCUP2xS/view?usp=sharing + * [A graphic explanation and view of what's happening behind the scenes](https://drive.google.com/file/d/1pM5COF0wx-wermnNy_svtyZquaCUP2xS/view?usp=sharing) * */ #include /// for assert From 59d2691d5bd36f0dd6be5121e47e885df4445395 Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Sun, 12 Sep 2021 17:42:21 +0000 Subject: [PATCH 6/7] clang-format and clang-tidy fixes for db8e74a9 --- data_structures/reverse_a_linked_list.cpp | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/data_structures/reverse_a_linked_list.cpp b/data_structures/reverse_a_linked_list.cpp index 0ed7ba3e1..890f5ed4d 100644 --- a/data_structures/reverse_a_linked_list.cpp +++ b/data_structures/reverse_a_linked_list.cpp @@ -18,7 +18,8 @@ * happens. And then we move the prev and current pointers one step forward. * Then the head node is made to point to the last node (prev pointer) after * completion of an iteration. - * [A graphic explanation and view of what's happening behind the scenes](https://drive.google.com/file/d/1pM5COF0wx-wermnNy_svtyZquaCUP2xS/view?usp=sharing) + * [A graphic explanation and view of what's happening behind the + scenes](https://drive.google.com/file/d/1pM5COF0wx-wermnNy_svtyZquaCUP2xS/view?usp=sharing) * */ #include /// for assert From 3635d1b7257e1909d9ee82b1ebecd83af8870d6e Mon Sep 17 00:00:00 2001 From: Tisha Soumya Date: Mon, 13 Sep 2021 15:31:56 +0530 Subject: [PATCH 7/7] fix : display changes Co-authored-by: ERR ! <75872316+amino19@users.noreply.github.com> --- data_structures/reverse_a_linked_list.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/data_structures/reverse_a_linked_list.cpp b/data_structures/reverse_a_linked_list.cpp index 890f5ed4d..07cbb6510 100644 --- a/data_structures/reverse_a_linked_list.cpp +++ b/data_structures/reverse_a_linked_list.cpp @@ -169,7 +169,7 @@ static void test() { // Reversal Testing assert(L.top() == 18); assert(L.last() == 11); - std::cout << "Passed" << std::endl; + std::cout << "All tests have successfully passed!" << std::endl; } /**