@@ -27,7 +27,8 @@ template <typename T, size_t CAPACITY> class FixedVector {
2727 LIBC_INLINE constexpr FixedVector () = default;
2828
2929 using iterator = typename cpp::array<T, CAPACITY>::iterator;
30- LIBC_INLINE constexpr FixedVector (iterator begin, iterator end) : store{}, item_count{} {
30+ LIBC_INLINE constexpr FixedVector (iterator begin, iterator end)
31+ : store{}, item_count{} {
3132 for (; begin != end; ++begin)
3233 LIBC_ASSERT (push_back (*begin));
3334 }
@@ -39,7 +40,8 @@ template <typename T, size_t CAPACITY> class FixedVector {
3940 LIBC_ASSERT (push_back (*begin));
4041 }
4142
42- LIBC_INLINE constexpr FixedVector (size_t count, const T &value) : store{}, item_count{} {
43+ LIBC_INLINE constexpr FixedVector (size_t count, const T &value)
44+ : store{}, item_count{} {
4345 for (size_t i = 0 ; i < count; ++i)
4446 LIBC_ASSERT (push_back (value));
4547 }
@@ -98,7 +100,9 @@ template <typename T, size_t CAPACITY> class FixedVector {
98100 // dynamically allocated storate. So, the `destroy` method like this
99101 // matches the `destroy` API of those other data structures so that users
100102 // can easily swap one data structure for the other.
101- LIBC_INLINE static void destroy (FixedVector<T, CAPACITY> *store) { store->reset (); }
103+ LIBC_INLINE static void destroy (FixedVector<T, CAPACITY> *store) {
104+ store->reset ();
105+ }
102106
103107 using reverse_iterator = typename cpp::array<T, CAPACITY>::reverse_iterator;
104108 LIBC_INLINE constexpr reverse_iterator rbegin () {
0 commit comments