Formatting

src/include/migraph/literal.hpp

@@ -68,7 +68,7 @@ struct literal : raw_data<literal>
     template <class Iterator>
     void fill(Iterator start, Iterator end)
     {
-        if(m_shape.packed()) 
+        if(m_shape.packed())
         {
             m_shape.visit_type([&](auto as) { std::copy(start, end, as.from(buffer.data())); });
         }
@@ -82,12 +82,12 @@ struct literal : raw_data<literal>
                     output(idx.begin(), idx.end()) = *it;
                 });
             });
-        //     visit_all(*this)([&](auto output) {
-        //         shape_for_each(output.get_shape(), [&](const auto& idx) {
-        //             it++;
-        //             output(idx.begin(), idx.end()) = *it;
-        //         });
-        // });
+            //     visit_all(*this)([&](auto output) {
+            //         shape_for_each(output.get_shape(), [&](const auto& idx) {
+            //             it++;
+            //             output(idx.begin(), idx.end()) = *it;
+            //         });
+            // });
         }
     }
 };

src/program.cpp

@@ -126,10 +126,7 @@ bool program::has_instruction(instruction_ref ins) const
 instruction_ref program::begin() { return impl->instructions.begin(); }
 instruction_ref program::end() { return impl->instructions.end(); }
 
-shape program::get_shape() const
-{
-    return impl->instructions.back().result;
-}
+shape program::get_shape() const { return impl->instructions.back().result; }
 
 instruction_ref program::validate() const
 {

src/shape.cpp

@@ -22,7 +22,8 @@ shape::shape(type_t t, std::vector<std::size_t> l, std::vector<std::size_t> s)
     assert(m_lens.size() == m_strides.size());
     assert(std::any_of(m_strides.begin(), m_strides.end(), [](auto x) { return x > 0; }) and
            "At least one stride must be non-zero");
-    m_packed = this->elements() == this->element_space() and std::is_sorted(m_strides.rbegin(), m_strides.rend());
+    m_packed = this->elements() == this->element_space() and
+               std::is_sorted(m_strides.rbegin(), m_strides.rend());
 }
 
 void shape::calculate_strides()

test/auto_contiguous_test.cpp

@@ -29,6 +29,4 @@ void after_literal_transpose()
     EXPECT(p.get_shape().packed());
 }
 
-int main() {
-    after_literal_transpose();
-}
+int main() { after_literal_transpose(); }