Reformat

Author: SekaiArendelle

include/fast_io_dsal/impl/deque.h

@@ -859,10 +859,10 @@ inline constexpr void deque_clone_trivial_impl(dequecontroltype &controller, deq
 	using begin_ptrtype = replacetype *;
 
 	begin_ptrtype lastblockbegin;
-			if (front_controller_ptr == back_controller_ptr)
-			{
-				lastblockbegin = fromcontroller.front_block.curr_ptr;
-			}
+	if (front_controller_ptr == back_controller_ptr)
+	{
+		lastblockbegin = fromcontroller.front_block.curr_ptr;
+	}
 	else
 	{
 		auto destit{controller.front_block.controller_ptr};

tests/0026.container/0003.deque/algorithm.cc

@@ -79,7 +79,7 @@ inline void test_copy_backward()
 			dq.push_back(i);
 		}
 
-			dq.resize(110u);
+		dq.resize(110u);
 		::std::copy_backward(dq.cbegin(), dq.cbegin() + 100, dq.end());
 
 		// First 10 elements unchanged (still 0..9)

tests/0026.container/0003.deque/invalidation.cc

@@ -17,8 +17,8 @@ inline void test_pop_front_invalidation()
 
 	while (dq.size() > 1u)
 	{
-		auto it1 = dq.begin() + 1;   // second element
-		auto it2 = dq.end() - 1;     // last element
+		auto it1 = dq.begin() + 1; // second element
+		auto it2 = dq.end() - 1;   // last element
 		::std::size_t val1 = *it1;
 		::std::size_t val2 = *it2;
 
@@ -60,8 +60,8 @@ inline void test_pop_back_invalidation()
 
 	while (dq.size() > 1u)
 	{
-		auto it1 = dq.begin();       // first element
-		auto it2 = dq.end() - 2;     // second-to-last element
+		auto it1 = dq.begin();   // first element
+		auto it2 = dq.end() - 2; // second-to-last element
 		::std::size_t val1 = *it1;
 		::std::size_t val2 = *it2;
 
@@ -101,8 +101,8 @@ inline void test_erase_single_invalidation()
 			dq.push_back(i);
 		}
 
-		auto it1 = dq.begin() + 1;   // element 1
-		auto it2 = dq.end() - 1;     // last element
+		auto it1 = dq.begin() + 1; // element 1
+		auto it2 = dq.end() - 1;   // last element
 
 		dq.erase(dq.begin());
 
@@ -126,8 +126,8 @@ inline void test_erase_single_invalidation()
 			dq.push_back(i);
 		}
 
-		auto it1 = dq.begin();       // first element
-		auto it2 = dq.end() - 2;     // second-to-last
+		auto it1 = dq.begin();   // first element
+		auto it2 = dq.end() - 2; // second-to-last
 
 		dq.erase(dq.end() - 1);
 

tests/0026.container/0003.deque/move_only.cc

@@ -8,7 +8,8 @@ struct MoveOnly
 {
 	::std::size_t value;
 
-	explicit MoveOnly(::std::size_t v) : value(v) {}
+	explicit MoveOnly(::std::size_t v) : value(v)
+	{}
 
 	MoveOnly(MoveOnly const &) = delete;
 	MoveOnly &operator=(MoveOnly const &) = delete;

tests/0026.container/0003.deque/type_traits.cc

@@ -30,47 +30,47 @@ int main()
 	static_assert(::std::same_as<deque_type::iterator::reference, ::std::size_t &>);
 	static_assert(::std::same_as<deque_type::iterator::pointer, ::std::size_t *>);
 	static_assert(::std::same_as<
-		::std::iterator_traits<deque_type::iterator>::iterator_category,
-		::std::random_access_iterator_tag>);
+				  ::std::iterator_traits<deque_type::iterator>::iterator_category,
+				  ::std::random_access_iterator_tag>);
 	static_assert(::std::same_as<
-		::std::iterator_traits<deque_type::iterator>::value_type,
-		deque_type::value_type>);
+				  ::std::iterator_traits<deque_type::iterator>::value_type,
+				  deque_type::value_type>);
 	static_assert(::std::same_as<
-		::std::iterator_traits<deque_type::iterator>::difference_type,
-		deque_type::difference_type>);
+				  ::std::iterator_traits<deque_type::iterator>::difference_type,
+				  deque_type::difference_type>);
 
 	// --- const_iterator ---
 	static_assert(::std::same_as<deque_type::const_iterator::value_type, ::std::size_t>);
 	static_assert(::std::same_as<deque_type::const_iterator::difference_type, ::std::ptrdiff_t>);
 	static_assert(::std::same_as<deque_type::const_iterator::reference, ::std::size_t const &>);
 	static_assert(::std::same_as<deque_type::const_iterator::pointer, ::std::size_t const *>);
 	static_assert(::std::same_as<
-		::std::iterator_traits<deque_type::const_iterator>::iterator_category,
-		::std::random_access_iterator_tag>);
+				  ::std::iterator_traits<deque_type::const_iterator>::iterator_category,
+				  ::std::random_access_iterator_tag>);
 	static_assert(::std::same_as<
-		::std::iterator_traits<deque_type::const_iterator>::value_type,
-		deque_type::value_type>);
+				  ::std::iterator_traits<deque_type::const_iterator>::value_type,
+				  deque_type::value_type>);
 	static_assert(::std::same_as<
-		::std::iterator_traits<deque_type::const_iterator>::difference_type,
-		deque_type::difference_type>);
+				  ::std::iterator_traits<deque_type::const_iterator>::difference_type,
+				  deque_type::difference_type>);
 
 	// --- difference_type consistency across iterator and const_iterator ---
 	static_assert(::std::same_as<
-		deque_type::difference_type,
-		::std::iterator_traits<deque_type::iterator>::difference_type>);
+				  deque_type::difference_type,
+				  ::std::iterator_traits<deque_type::iterator>::difference_type>);
 	static_assert(::std::same_as<
-		deque_type::difference_type,
-		::std::iterator_traits<deque_type::const_iterator>::difference_type>);
+				  deque_type::difference_type,
+				  ::std::iterator_traits<deque_type::const_iterator>::difference_type>);
 
 	// --- reverse_iterator ---
 	static_assert(::std::same_as<
-		deque_type::reverse_iterator,
-		::std::reverse_iterator<deque_type::iterator>>);
+				  deque_type::reverse_iterator,
+				  ::std::reverse_iterator<deque_type::iterator>>);
 
 	// --- const_reverse_iterator ---
 	static_assert(::std::same_as<
-		deque_type::const_reverse_iterator,
-		::std::reverse_iterator<deque_type::const_iterator>>);
+				  deque_type::const_reverse_iterator,
+				  ::std::reverse_iterator<deque_type::const_iterator>>);
 
 	// --- mutable to const iterator conversion ---
 	static_assert(::std::convertible_to<deque_type::iterator, deque_type::const_iterator>);