Add btas::zb::RangeNd for slimmer zero-based ranges

btas/generic/permute.h

@@ -36,7 +36,7 @@ namespace btas {
         ++itrY;
       }
     };
-    if (r_is_permutable)
+    if constexpr (r_is_permutable)
       do_perm(X, Y, permute(r, p));
     else {
       do_perm(X, Y, permute(btas::Range(r.lobound(), r.upbound(), r.stride()), p));

btas/tensor.h

@@ -14,6 +14,7 @@
 #include <functional>
 #include <iterator>
 #include <type_traits>
+#include <utility>
 #include <vector>
 
 namespace btas {
@@ -144,6 +145,25 @@ namespace btas {
       }
     }
 
+    /// construct from \c range object, fill each element from \c gen called on
+    /// the element's multi-index. \c gen must be callable with the range's
+    /// iteration value (its multi-index) and return a value convertible to
+    /// \c value_type.
+    template <typename Range, typename F,
+              typename = std::enable_if_t<
+                  btas::is_boxrange<Range>::value &&
+                  std::is_invocable_r_v<
+                      value_type, F,
+                      decltype(*std::begin(std::declval<const Range&>()))>>>
+    Tensor(const Range& range, F&& gen)
+        : range_(range.lobound(), range.upbound()) {
+      array_adaptor<storage_type>::resize(storage_, range_.area());
+      auto out_it = begin();
+      for (auto&& idx : range_) {
+        *out_it++ = gen(idx);
+      }
+    }
+
     /// construct from \c range and \c storage
     template <typename Range, typename Storage>
     Tensor(const Range& range, const Storage& storage,