Formatting

src/include/rtg/requires.hpp

@@ -5,10 +5,10 @@
 
 namespace rtg {
 
-template<bool... Bs>
-struct and_
-: std::is_same<and_<Bs...>, and_<(Bs || true)...>>
-{};
+template <bool... Bs>
+struct and_ : std::is_same<and_<Bs...>, and_<(Bs || true)...>>
+{
+};
 
 #define RTG_REQUIRES(...) class = typename std::enable_if<and_<__VA_ARGS__, true>{}>::type
 

src/include/rtg/shape.hpp

@@ -61,8 +61,8 @@ struct shape
 
     std::size_t index(std::initializer_list<std::size_t> l) const;
     std::size_t index(const std::vector<std::size_t>& l) const;
-    
-    template<class Iterator>
+
+    template <class Iterator>
     std::size_t index(Iterator start, Iterator last) const
     {
         assert(std::distance(start, last) <= this->lens().size());

src/include/rtg/shape_for_each.hpp

@@ -6,23 +6,23 @@
 
 namespace rtg {
 
-template<class F>
+template <class F>
 void shape_for_each(const rtg::shape& s, F f)
 {
     // Ensure calls to f use const ref to vector
     auto call = [&f](const std::vector<std::size_t>& i) { f(i); };
     std::vector<std::size_t> indices(s.lens().size());
-    for(std::size_t i = 0;i < s.elements();i++) {
+    for(std::size_t i = 0; i < s.elements(); i++)
+    {
         std::transform(s.strides().begin(),
-                           s.strides().end(),
-                           s.lens().begin(),
-                           indices.begin(),
-                           [&](std::size_t stride, std::size_t len) { return (i / stride) % len; });
+                       s.strides().end(),
+                       s.lens().begin(),
+                       indices.begin(),
+                       [&](std::size_t stride, std::size_t len) { return (i / stride) % len; });
         call(indices);
     }
 }
 
-
 } // namespace rtg
 
 #endif

src/shape.cpp

@@ -63,14 +63,16 @@ std::size_t shape::index(const std::vector<std::size_t>& l) const
 std::size_t shape::index(std::size_t i) const
 {
     assert(this->lens().size() == this->strides().size());
-    if (this->packed()) return i;
-    else return std::inner_product(
-        this->lens().begin(),
-        this->lens().end(),
-        this->strides().begin(),
-        std::size_t{0},
-        std::plus<std::size_t>{},
-        [&](std::size_t len, std::size_t stride) { return ((i / stride) % len) * stride; });
+    if(this->packed())
+        return i;
+    else
+        return std::inner_product(
+            this->lens().begin(),
+            this->lens().end(),
+            this->strides().begin(),
+            std::size_t{0},
+            std::plus<std::size_t>{},
+            [&](std::size_t len, std::size_t stride) { return ((i / stride) % len) * stride; });
 }
 bool shape::packed() const { return this->m_packed; }
 std::size_t shape::element_space() const