@@ -24,10 +24,10 @@ concept sizable = requires(T& t)
24
24
} -> std::same_as<size_t >;
25
25
};
26
26
template <class T >
27
- concept iterable =std::ranges::input_range<T>&& requires (T& t)
27
+ concept iterable = std::ranges::input_range<T> && requires (T& t)
28
28
{
29
29
{ std::begin (t) };
30
- { std::end (t) } ;
30
+ { std::end (t) };
31
31
{ ++std::begin (t) };
32
32
33
33
{
@@ -44,7 +44,7 @@ concept equalable = requires(T& t, Y& y)
44
44
} -> std::same_as<bool >;
45
45
};
46
46
template <typename T, typename Y>
47
- requires sizable<T> and sizable<Y> and equalable<T, Y> and iterable<T> and iterable<Y>
47
+ requires sizable<T> and sizable<Y> and equalable<T, Y> and iterable<T> and iterable<Y>
48
48
auto assertContentEquals (T& left, Y& right)
49
49
{
50
50
@@ -89,7 +89,7 @@ TEST(split_a_circular_linked_list, test1)
89
89
#ifdef __TEST__
90
90
ListNodeInspector inspector;
91
91
#endif
92
-
92
+
93
93
auto input = vector<int > { 1 , 5 , 7 };
94
94
auto output = vector<vector<int >> { { 1 , 5 }, { 7 } };
95
95
auto * list = ArrayToCircularLinkedList (input);
@@ -112,7 +112,7 @@ TEST(split_a_circular_linked_list, test2)
112
112
#ifdef __TEST__
113
113
ListNodeInspector inspector;
114
114
#endif
115
-
115
+
116
116
auto input = vector<int > { 2 , 6 , 1 , 5 };
117
117
auto output = vector<vector<int >> { { 2 , 6 }, { 1 , 5 } };
118
118
auto * list = ArrayToCircularLinkedList (input);
0 commit comments