Update test.cpp

Author: masx200

split-a-circular-linked-list/test.cpp

@@ -8,36 +8,33 @@ import leetcode_test.split_a_circular_linked_list.TraversalCircularListNode;
 #include <iterator>
 #include <unordered_set>
 #include <vector>
-using std::ranges::views::transform;
+
 using namespace leetcode_test::split_a_circular_linked_list;
 using namespace std;
 using std::vector;
 template <class T>
-concept sizable = requires(T& t)
-{
+concept sizable = requires(T& t) {
     {
         t.size()
-        } -> std::same_as<size_t>;
+    } -> std::same_as<size_t>;
 };
 template <class T>
-concept iterable = requires(T& t)
-{
+concept iterable = requires(T& t) {
     ++t.begin();
     {
         t.begin() != t.end()
 
-        } -> std::same_as<bool>;
+    } -> std::same_as<bool>;
 };
 
 template <class T, typename Y>
-concept equalable = requires(T& t, Y& y, size_t i)
-{
+concept equalable = requires(T& t, Y& y, size_t i) {
     {
         *t.begin() == *y.begin()
-        } -> std::same_as<bool>;
+    } -> std::same_as<bool>;
 };
 template <typename T, typename Y>
-requires sizable<T> and sizable<Y> and equalable<T, Y> and iterable<T> and iterable<Y>
+    requires sizable<T> and sizable<Y> and equalable<T, Y> and iterable<T> and iterable<Y>
 auto assertContentEquals(T& left, Y& right)
 {
 
@@ -53,6 +50,7 @@ auto assertContentEquals(T& left, Y& right)
 }
 TEST(split_a_circular_linked_list, test1)
 {
+    using std::ranges::views::transform;
     auto input = vector<int> { 1, 5, 7 };
     auto output = vector<vector<int>> { { 1, 5 }, { 7 } };
     auto* list = ArrayToCircularLinkedList(input);
@@ -69,6 +67,7 @@ TEST(split_a_circular_linked_list, test1)
 }
 TEST(split_a_circular_linked_list, test2)
 {
+    using std::ranges::views::transform;
     auto input = vector<int> { 2, 6, 1, 5 };
     auto output = vector<vector<int>> { { 2, 6 }, { 1, 5 } };
     auto* list = ArrayToCircularLinkedList(input);