diff --git a/README.md b/README.md
index c687673..5743bb3 100644
--- a/README.md
+++ b/README.md
@@ -4,11 +4,11 @@ The Guidelines Support Library (GSL) contains functions and types that are sugge
 [C++ Core Guidelines](https://github.com/isocpp/CppCoreGuidelines) maintained by the [Standard C++ Foundation](https://isocpp.org).
 This repo contains Microsoft's implementation of GSL.
 
-The library includes types like `array_view<>`, `string_view<>`, `owner<>` and others.
+The library includes types like `span<T>`, `string_span`, `owner<>` and others.
 
-The entire implementation is provided inline in the headers under the [include](./include) directory.
+The entire implementation is provided inline in the headers under the [include](./include) directory. The implementation generally assumes a platform that implements C++14 support. There are specific workarounds to support MSVC 2013 and 2015.
 
-While some types have been broken out into their own headers (e.g. [include/array_view.h](./include/array_view.h)),
+While some types have been broken out into their own headers (e.g. [include/span.h](./include/span.h)),
 it is simplest to just include [gsl.h](./include/gsl.h) and gain access to the entire library.
 
 > NOTE: We encourage contributions that improve or refine any of the types in this library as well as ports to
diff --git a/include/array_view.h b/include/array_view.h
deleted file mode 100644
index 69559f6..0000000
--- a/include/array_view.h
+++ /dev/null
@@ -1,1998 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////// 
-// 
-// Copyright (c) 2015 Microsoft Corporation. All rights reserved. 
-// 
-// This code is licensed under the MIT License (MIT). 
-// 
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 
-// THE SOFTWARE. 
-// 
-///////////////////////////////////////////////////////////////////////////////
-
-#pragma once
-
-#ifndef GSL_ARRAY_VIEW_H
-#define GSL_ARRAY_VIEW_H
-
-#include <new>
-#include <stdexcept>
-#include <cstddef>
-#include <cstdint>
-#include <limits>
-#include <numeric>
-#include <type_traits>
-#include <utility>
-#include <array>
-#include <iterator>
-#include <algorithm>
-#include <functional>
-#include "fail_fast.h"
-
-#ifdef _MSC_VER
-
-// No MSVC does constexpr fully yet
-#pragma push_macro("constexpr")
-#define constexpr /* nothing */
-
-
-// VS 2013 workarounds
-#if _MSC_VER <= 1800
-
-// noexcept is not understood 
-#ifndef GSL_THROWS_FOR_TESTING
-#define noexcept /* nothing */ 
-#endif
-
-// turn off some misguided warnings
-#pragma warning(push)
-#pragma warning(disable: 4351) // warns about newly introduced aggregate initializer behavior
-
-#endif // _MSC_VER <= 1800
-
-#endif // _MSC_VER
-
-// In order to test the library, we need it to throw exceptions that we can catch
-#ifdef GSL_THROWS_FOR_TESTING
-#define noexcept /* nothing */ 
-#endif // GSL_THROWS_FOR_TESTING 
-
-
-namespace gsl {
-
-/*
-** begin definitions of index and bounds
-*/
-namespace details
-{
-	template <typename SizeType>
-	struct SizeTypeTraits
-	{
-		static const SizeType max_value = std::numeric_limits<SizeType>::max();
-	};
-
-
-	template<typename... Ts>
-	class are_integral : public std::integral_constant<bool, true> {};
-
-	template<typename T, typename... Ts>
-	class are_integral<T, Ts...> : public std::integral_constant<bool, std::is_integral<T>::value && are_integral<Ts...>::value> {};
-}
-
-template <size_t Rank, typename ValueType = size_t>
-class index final
-{
-	static_assert(std::is_integral<ValueType>::value, "ValueType must be an integral type!");
-	static_assert(Rank > 0, "Rank must be greater than 0!");
-
-	template <size_t OtherRank, typename OtherValueType>
-	friend class index;
-
-public:
-	static const size_t rank = Rank;
-	using value_type = std::remove_reference_t<ValueType>;
-	using reference = std::add_lvalue_reference_t<value_type>;
-	using const_reference = std::add_lvalue_reference_t<std::add_const_t<value_type>>;
-
-	constexpr index() noexcept
-	{}
-
-	constexpr index(const value_type(&values)[Rank]) noexcept
-	{
-		std::copy(values, values + Rank, elems);
-	}
-
-	template<typename... Ts, bool Enabled1 = (sizeof...(Ts) == Rank), bool Enabled2 = details::are_integral<Ts...>::value, typename Dummy = std::enable_if_t<Enabled1 && Enabled2, bool>>
-	constexpr index(Ts... ds) noexcept : elems{ static_cast<value_type>(ds)... }
-	{}
-
-	constexpr index(const index& other) noexcept = default;
-
-	// copy from index over smaller domain
-	template <typename OtherValueType,
-		bool Enabled = (details::SizeTypeTraits<OtherValueType>::max_value <= details::SizeTypeTraits<value_type>::max_value),
-		typename Other = std::enable_if_t<Enabled, index<Rank, OtherValueType>>>
-	constexpr index(const index<Rank, OtherValueType>& other) noexcept
-	{
-		std::copy(other.elems, other.elems + Rank, elems);
-	}
-
-	// copy from index over larger domain
-	template <typename OtherValueType,
-		bool Enabled = (details::SizeTypeTraits<OtherValueType>::max_value > details::SizeTypeTraits<value_type>::max_value),
-		typename Other = std::enable_if_t<Enabled, index<Rank, OtherValueType>>>
-	constexpr index(const index<Rank, OtherValueType>& other, void* = 0) noexcept
-	{
-		bool ok = std::accumulate(other.elems, other.elems + Rank, true,
-			[&](bool b, OtherValueType val) { return b && (val <= static_cast<OtherValueType>(details::SizeTypeTraits<value_type>::max_value)); }
-		);
-
-		fail_fast_assert(ok, "other value must fit in the new domain");
-		std::transform(other.elems, other.elems + rank, elems, [&](OtherValueType val) { return static_cast<value_type>(val); });
-	}
-
-	constexpr index& operator=(const index& rhs) noexcept = default;
-
-	// Preconditions: component_idx < rank
-	constexpr reference operator[](size_t component_idx)
-	{
-		fail_fast_assert(component_idx < Rank, "Component index must be less than rank");
-		return elems[component_idx];
-	}
-
-	// Preconditions: component_idx < rank
-	constexpr const_reference operator[](size_t component_idx) const noexcept
-	{
-		fail_fast_assert(component_idx < Rank, "Component index must be less than rank");
-		return elems[component_idx];
-	}
-
-	constexpr bool operator==(const index& rhs) const noexcept
-	{
-		return std::equal(elems, elems + rank, rhs.elems);
-	}
-
-	constexpr bool operator!=(const index& rhs) const noexcept
-	{
-		return !(this == rhs);
-	}
-
-	constexpr index operator+() const noexcept
-	{
-		return *this;
-	}
-
-	constexpr index operator-() const noexcept
-	{
-		index ret = *this;
-		std::transform(ret, ret + rank, ret, std::negate<ValueType>{});
-		return ret;
-	}
-
-	constexpr index operator+(const index& rhs) const noexcept
-	{
-		index ret = *this;
-		ret += rhs;
-		return ret;
-	}
-
-	constexpr index operator-(const index& rhs) const noexcept
-	{
-		index ret = *this;
-		ret -= rhs;
-		return ret;
-	}
-
-	constexpr index& operator+=(const index& rhs) noexcept
-	{
-		std::transform(elems, elems + rank, rhs.elems, elems, std::plus<ValueType>{});
-		return *this;
-	}
-
-	constexpr index& operator-=(const index& rhs) noexcept
-	{
-		std::transform(elems, elems + rank, rhs.elems, elems, std::minus<ValueType>{});
-		return *this;
-	}
-
-	constexpr index operator*(value_type v) const noexcept
-	{
-		index ret = *this;
-		ret *= v;
-		return ret;
-	}
-
-	constexpr index operator/(value_type v) const noexcept
-	{
-		index ret = *this;
-		ret /= v;
-		return ret;
-	}
-
-	friend constexpr index operator*(value_type v, const index& rhs) noexcept
-	{
-		return rhs * v;
-	}
-
-	constexpr index& operator*=(value_type v) noexcept
-	{
-		std::transform(elems, elems + rank, elems, [v](value_type x) { return std::multiplies<ValueType>{}(x, v); });
-		return *this;
-	}
-
-	constexpr index& operator/=(value_type v) noexcept
-	{
-		std::transform(elems, elems + rank, elems, [v](value_type x) { return std::divides<ValueType>{}(x, v); });
-		return *this;
-	}
-
-private:
-	value_type elems[Rank] = {};
-};
-
-#ifndef _MSC_VER
-
-struct static_bounds_dynamic_range_t
-{
-	template <typename T, typename Dummy = std::enable_if_t<std::is_integral<T>::value>>
-	constexpr operator T() const noexcept
-	{
-		return static_cast<T>(-1);
-	}
-
-	template <typename T, typename Dummy = std::enable_if_t<std::is_integral<T>::value>>
-	constexpr bool operator ==(T other) const noexcept
-	{
-		return static_cast<T>(-1) == other;
-	}
-
-	template <typename T, typename Dummy = std::enable_if_t<std::is_integral<T>::value>>
-	constexpr bool operator !=(T other) const noexcept
-	{
-		return static_cast<T>(-1) != other;
-	}
-
-};
-
-template <typename T, typename Dummy = std::enable_if_t<std::is_integral<T>::value>>
-constexpr bool operator ==(T left, static_bounds_dynamic_range_t right) noexcept
-{
-	return right == left;
-}
-
-template <typename T, typename Dummy = std::enable_if_t<std::is_integral<T>::value>>
-constexpr bool operator !=(T left, static_bounds_dynamic_range_t right) noexcept
-{
-	return right != left;
-}
-
-constexpr static_bounds_dynamic_range_t dynamic_range{};
-#else
-const char dynamic_range = -1;
-#endif
-
-struct generalized_mapping_tag {};
-struct contiguous_mapping_tag : generalized_mapping_tag {};
-
-namespace details
-{
-	template <typename SizeType, SizeType Fact1, SizeType Fact2, SizeType ConstBound>
-	struct StaticSizeHelperImpl
-	{
-		static_assert(static_cast<size_t>(Fact1) * static_cast<size_t>(Fact2) <= SizeTypeTraits<SizeType>::max_value, "Value out of the range of SizeType");
-		static const SizeType value = Fact1 * Fact2;
-	};
-
-	template <typename SizeType, SizeType Fact1, SizeType ConstBound>
-	struct StaticSizeHelperImpl<SizeType, Fact1, ConstBound, ConstBound>
-	{
-		static const SizeType value = ConstBound;
-	};
-
-	template <typename SizeType, SizeType Fact2, SizeType ConstBound>
-	struct StaticSizeHelperImpl<SizeType, ConstBound, Fact2, ConstBound>
-	{
-		static const SizeType value = ConstBound;
-	};
-
-	template <typename SizeType, SizeType ConstBound>
-	struct StaticSizeHelperImpl<SizeType, ConstBound, ConstBound, ConstBound>
-	{
-		static const SizeType value = static_cast<SizeType>(ConstBound);
-	};
-
-	template <typename SizeType, SizeType Fact1, SizeType Fact2>
-	struct StaticSizeHelper
-	{
-		static const SizeType value = StaticSizeHelperImpl<SizeType, static_cast<SizeType>(Fact1), static_cast<SizeType>(Fact2), static_cast<SizeType>(dynamic_range)>::value;
-	};
-
-
-	template <size_t Left, size_t Right>
-	struct LessThan
-	{
-		static const bool value = Left < Right;
-	};
-
-	template <typename SizeType, size_t... Ranges>
-	struct BoundsRanges {
-		static const size_t Depth = 0;
-		static const size_t DynamicNum = 0;
-		static const SizeType CurrentRange = 1;
-		static const SizeType TotalSize = 1;
-
-		BoundsRanges (const BoundsRanges &) = default;
-
-		// TODO : following signature is for work around VS bug
-		template <typename OtherType>
-		BoundsRanges (const OtherType &, bool /* firstLevel */) {}
-		BoundsRanges(const SizeType * const) { }
-		BoundsRanges() = default;
-
-
-		template <typename T, size_t Dim>
-		void serialize(T &) const {
-		}
-		template <typename T, size_t Dim>
-		SizeType linearize(const T &) const { 
-			return 0;
-		}
-		template <typename T, size_t Dim>
-		ptrdiff_t contains(const T &) const {
-			return 0;
-		}
-
-		size_t totalSize() const noexcept {
-			return TotalSize;
-		}
-
-		bool operator == (const BoundsRanges &) const noexcept
-		{
-			return true;
-		}
-	};
-
-	template <typename SizeType, size_t... RestRanges>
-	struct BoundsRanges <SizeType, dynamic_range, RestRanges...> : BoundsRanges<SizeType, RestRanges...>{
-		using Base = BoundsRanges <SizeType, RestRanges... >;
-		static const size_t Depth = Base::Depth + 1;
-		static const size_t DynamicNum = Base::DynamicNum + 1;
-		static const SizeType CurrentRange = dynamic_range;
-		static const SizeType TotalSize = dynamic_range;
-		const SizeType m_bound;
-
-		BoundsRanges (const BoundsRanges &) = default;
-		BoundsRanges(const SizeType * const arr) : Base(arr + 1), m_bound(static_cast<SizeType>(*arr * this->Base::totalSize()))
-		{
-			fail_fast_assert(0 <= *arr);
-			fail_fast_assert(*arr * this->Base::totalSize() <= details::SizeTypeTraits<SizeType>::max_value);
-		}
-		BoundsRanges() : m_bound(0) {}
-
-		template <typename OtherSizeType, size_t OtherRange, size_t... RestOtherRanges>
-		BoundsRanges(const BoundsRanges<OtherSizeType, OtherRange, RestOtherRanges...> &other, bool /* firstLevel */ = true) :
-			Base(static_cast<const BoundsRanges<OtherSizeType, RestOtherRanges...>&>(other), false), m_bound (static_cast<SizeType>(other.totalSize()))
-		{
-		}
-
-		template <typename T, size_t Dim = 0>
-		void serialize(T & arr) const {
-			arr[Dim] = elementNum();
-			this->Base::template serialize<T, Dim + 1>(arr);
-		}
-		template <typename T, size_t Dim = 0>
-		SizeType linearize(const T & arr) const { 
-			const size_t index = this->Base::totalSize() * arr[Dim];
-			fail_fast_assert(index < static_cast<size_t>(m_bound));
-			return static_cast<SizeType>(index) + this->Base::template linearize<T, Dim + 1>(arr);
-		}
-		
-		template <typename T, size_t Dim = 0>
-		ptrdiff_t contains(const T & arr) const {
-			const ptrdiff_t last = this->Base::template contains<T, Dim + 1>(arr);
-			if (last == -1)
-				return -1;
-			const ptrdiff_t cur = this->Base::totalSize() * arr[Dim];
-			return static_cast<size_t>(cur) < static_cast<size_t>(m_bound) ? cur + last : -1;
-		}
-		
-		size_t totalSize() const noexcept {
-			return m_bound;
-		}
-		
-		SizeType elementNum() const noexcept {
-			return static_cast<SizeType>(totalSize() / this->Base::totalSize());
-		}
-		
-		SizeType elementNum(size_t dim) const noexcept{
-			if (dim > 0)
-				return this->Base::elementNum(dim - 1);
-			else
-				return elementNum();
-		}
-
-		bool operator == (const BoundsRanges & rhs) const noexcept
-		{
-			return m_bound == rhs.m_bound && static_cast<const Base &>(*this) == static_cast<const Base &>(rhs);
-		}
-	};
-
-	template <typename SizeType, size_t CurRange, size_t... RestRanges>
-	struct BoundsRanges <SizeType, CurRange, RestRanges...> : BoundsRanges<SizeType, RestRanges...>{
-		using Base = BoundsRanges <SizeType, RestRanges... >;
-		static const size_t Depth = Base::Depth + 1;
-		static const size_t DynamicNum = Base::DynamicNum;
-		static const SizeType CurrentRange = static_cast<SizeType>(CurRange);
-		static const SizeType TotalSize = StaticSizeHelper<SizeType, Base::TotalSize, CurrentRange>::value;
-		static_assert (CurRange <= SizeTypeTraits<SizeType>::max_value, "CurRange must be smaller than SizeType limits");
-
-		BoundsRanges (const BoundsRanges &) = default;
-		BoundsRanges(const SizeType * const arr) : Base(arr) { }
-		BoundsRanges() = default;
-
-		template <typename OtherSizeType, size_t OtherRange, size_t... RestOtherRanges>
-		BoundsRanges(const BoundsRanges<OtherSizeType, OtherRange, RestOtherRanges...> &other, bool firstLevel = true) : Base(static_cast<const BoundsRanges<OtherSizeType, RestOtherRanges...>&>(other), false)
-		{
-			fail_fast_assert((firstLevel && totalSize() <= other.totalSize()) || totalSize() == other.totalSize());
-		}
-
-		template <typename T, size_t Dim = 0>
-		void serialize(T & arr) const {
-			arr[Dim] = elementNum();
-			this->Base::template serialize<T, Dim + 1>(arr);
-		}
-
-		template <typename T, size_t Dim = 0>
-		SizeType linearize(const T & arr) const {  
-			fail_fast_assert(arr[Dim] < CurrentRange, "Index is out of range");
-			return static_cast<SizeType>(this->Base::totalSize()) * arr[Dim] + this->Base::template linearize<T, Dim + 1>(arr);
-		}
-
-		template <typename T, size_t Dim = 0>
-		ptrdiff_t contains(const T & arr) const {
-			if (static_cast<size_t>(arr[Dim]) >= CurrentRange)
-				return -1;
-			const ptrdiff_t last = this->Base::template contains<T, Dim + 1>(arr);
-			if (last == -1)
-				return -1;
-			return static_cast<ptrdiff_t>(this->Base::totalSize() * arr[Dim]) + last;
-		}
-
-		size_t totalSize() const noexcept{
-			return CurrentRange * this->Base::totalSize();
-		}
-
-		SizeType elementNum() const noexcept{
-			return CurrentRange;
-		}
-
-		SizeType elementNum(size_t dim) const noexcept{
-			if (dim > 0)
-				return this->Base::elementNum(dim - 1);
-			else
-				return elementNum();
-		}
-
-		bool operator == (const BoundsRanges & rhs) const noexcept
-		{
-			return static_cast<const Base &>(*this) == static_cast<const Base &>(rhs);
-		}
-	};
-
-	template <typename SourceType, typename TargetType, size_t Rank>
-	struct BoundsRangeConvertible2;
-
-	// TODO: I have to rewrite BoundsRangeConvertible into following way to workaround VS 2013 bugs
-	template <size_t Rank, typename SourceType, typename TargetType, typename Ret = BoundsRangeConvertible2<typename SourceType::Base, typename TargetType::Base, Rank>>
-	auto helpBoundsRangeConvertible(SourceType, TargetType, std::true_type) -> Ret;
-
-	template <size_t Rank, typename SourceType, typename TargetType>
-	auto helpBoundsRangeConvertible(SourceType, TargetType, ...) -> std::false_type;
-	
-	template <typename SourceType, typename TargetType, size_t Rank>
-	struct BoundsRangeConvertible2 : decltype(helpBoundsRangeConvertible<Rank - 1>(SourceType(), TargetType(), 
-		std::integral_constant<bool, SourceType::Depth == TargetType::Depth 
-		&& (SourceType::CurrentRange == TargetType::CurrentRange || TargetType::CurrentRange == dynamic_range || SourceType::CurrentRange == dynamic_range)>())) 
-	{};
-
-	template <typename SourceType, typename TargetType>
-	struct BoundsRangeConvertible2<SourceType, TargetType, 0> : std::true_type {};
-
-	template <typename SourceType, typename TargetType, size_t Rank = TargetType::Depth>
-	struct BoundsRangeConvertible : decltype(helpBoundsRangeConvertible<Rank - 1>(SourceType(), TargetType(), 
-		std::integral_constant<bool, SourceType::Depth == TargetType::Depth 
-		&& (!LessThan<size_t(SourceType::CurrentRange), size_t(TargetType::CurrentRange)>::value || TargetType::CurrentRange == dynamic_range || SourceType::CurrentRange == dynamic_range)>())) 
-	{};
-	template <typename SourceType, typename TargetType>
-	struct BoundsRangeConvertible<SourceType, TargetType, 0> : std::true_type {};
-
-	template <typename TypeChain>
-	struct TypeListIndexer
-	{
-		const TypeChain & obj;
-		TypeListIndexer(const TypeChain & obj) :obj(obj){}
-		template<size_t N>
-		const TypeChain & getObj(std::true_type)
-		{
-			return obj;
-		}
-		template<size_t N, typename MyChain = TypeChain, typename MyBase = typename MyChain::Base>
-		auto getObj(std::false_type) -> decltype(TypeListIndexer<MyBase>(static_cast<const MyBase &>(obj)).template get<N>())
-		{
-			return TypeListIndexer<MyBase>(static_cast<const MyBase &>(obj)).template get<N>();
-		}
-		template <size_t N>
-		auto get() -> decltype(getObj<N - 1>(std::integral_constant<bool, true>()))
-		{
-			return getObj<N - 1>(std::integral_constant<bool, N == 0>());
-		}
-	};
-
-	template <typename TypeChain>
-	TypeListIndexer<TypeChain> createTypeListIndexer(const TypeChain &obj)
-	{
-		return TypeListIndexer<TypeChain>(obj);
-	}
-
-	template <size_t Rank, typename ValueType, bool Enabled = (Rank > 1), typename Ret = std::enable_if_t<Enabled, index<Rank - 1, ValueType>>>
-	constexpr Ret shift_left(const index<Rank, ValueType>& other) noexcept
-	{
-		Ret ret{};
-		for (size_t i = 0; i < Rank - 1; ++i)
-		{
-			ret[i] = other[i + 1];
-		}
-		return ret;
-	}
-}
-
-template <typename IndexType>
-class bounds_iterator;
-
-template <typename SizeType, size_t... Ranges>
-class static_bounds {
-public:
-	static_bounds(const details::BoundsRanges<SizeType, Ranges...> &) {
-	}
-};
-
-template <typename SizeType, size_t FirstRange, size_t... RestRanges>
-class static_bounds<SizeType, FirstRange, RestRanges...>
-{
-	using MyRanges = details::BoundsRanges <SizeType, FirstRange, RestRanges... >;
-	static_assert(std::is_integral<SizeType>::value
-		&& details::SizeTypeTraits<SizeType>::max_value <= SIZE_MAX, "SizeType must be an integral type and its numeric limits must be smaller than SIZE_MAX");
-
-	MyRanges m_ranges;
-	constexpr static_bounds(const MyRanges & range) : m_ranges(range) { }
-	
-	template <typename SizeType2, size_t... Ranges2>
-	friend class static_bounds;
-public:
-	static const size_t rank = MyRanges::Depth;
-	static const size_t dynamic_rank = MyRanges::DynamicNum;
-	static const SizeType static_size = static_cast<SizeType>(MyRanges::TotalSize);
-
-	using size_type = SizeType;
-	using index_type = index<rank, size_type>;
-	using const_index_type = std::add_const_t<index_type>;
-	using iterator = bounds_iterator<const_index_type>;
-	using const_iterator = bounds_iterator<const_index_type>;
-	using difference_type = ptrdiff_t;
-	using sliced_type = static_bounds<SizeType, RestRanges...>;
-	using mapping_type = contiguous_mapping_tag;
-public:
-	constexpr static_bounds(const static_bounds &) = default;
-	
-	template <typename OtherSizeType, size_t... Ranges, typename Dummy = std::enable_if_t<
-		details::BoundsRangeConvertible<details::BoundsRanges<OtherSizeType, Ranges...>, details::BoundsRanges <SizeType, FirstRange, RestRanges... >>::value>>
-	constexpr static_bounds(const static_bounds<OtherSizeType, Ranges...> &other):
-		m_ranges(other.m_ranges)
-	{
-	}
-
-	constexpr static_bounds(std::initializer_list<size_type> il) : m_ranges(il.begin())
-	{
-		fail_fast_assert(MyRanges::DynamicNum == il.size(), "Size of the initializer list must match the rank of the array");
-		fail_fast_assert(m_ranges.totalSize() <= details::SizeTypeTraits<size_type>::max_value, "Size of the range is larger than the max element of the size type");
-	}
-	
-	constexpr static_bounds() = default;
-
-	constexpr static_bounds & operator = (const static_bounds & otherBounds)
-	{
-		new(&m_ranges) MyRanges (otherBounds.m_ranges);
-		return *this;
-	}
-
-	constexpr sliced_type slice() const noexcept
-	{
-		return sliced_type{static_cast<const details::BoundsRanges<SizeType, RestRanges...> &>(m_ranges)};
-	}
-
-	constexpr size_type stride() const noexcept
-	{
-		return rank > 1 ? slice().size() : 1;
-	}
-	
-	constexpr size_type size() const noexcept
-	{
-		return static_cast<size_type>(m_ranges.totalSize());
-	}
-
-	constexpr size_type total_size() const noexcept
-	{
-		return static_cast<size_type>(m_ranges.totalSize());
-	}
-	
-	constexpr size_type linearize(const index_type & idx) const
-	{
-		return m_ranges.linearize(idx);
-	}
-	
-	constexpr bool contains(const index_type& idx) const noexcept
-	{
-		return m_ranges.contains(idx) != -1;
-	}
-	
-	constexpr size_type operator[](size_t index) const noexcept
-	{
-		return m_ranges.elementNum(index);
-	}
-	
-	template <size_t Dim = 0>
-	constexpr size_type extent() const noexcept
-	{
-		static_assert(Dim < rank, "dimension should be less than rank (dimension count starts from 0)");
-		return details::createTypeListIndexer(m_ranges).template get<Dim>().elementNum();
-	}
-	
-	constexpr index_type index_bounds() const noexcept
-	{
-		size_type extents[rank] = {};
-		m_ranges.serialize(extents);
-		return{ extents };
-	}
-	
-	template <typename OtherSizeTypes, size_t... Ranges>
-	constexpr bool operator == (const static_bounds<OtherSizeTypes, Ranges...> & rhs) const noexcept
-	{
-		return this->size() == rhs.size();
-	}
-	
-	template <typename OtherSizeTypes, size_t... Ranges>
-	constexpr bool operator != (const static_bounds<OtherSizeTypes, Ranges...> & rhs) const noexcept
-	{
-		return !(*this == rhs);
-	}
-	
-	constexpr const_iterator begin() const noexcept
-	{
-		return const_iterator(*this, index_type{});
-	}
-	
-	constexpr const_iterator end() const noexcept
-	{
-		return const_iterator(*this, this->index_bounds());
-	}
-};
-
-template <size_t Rank, typename SizeType = size_t>
-class strided_bounds
-{
-	template <size_t OtherRank, typename OtherSizeType>
-	friend class strided_bounds;
-
-public:
-	static const size_t rank = Rank;
-	using reference       = SizeType&;
-	using const_reference = const SizeType&;
-	using size_type       = SizeType;
-	using difference_type = SizeType;
-	using value_type      = SizeType;
-	using index_type      = index<rank, size_type>;
-	using const_index_type = std::add_const_t<index_type>;
-	using iterator = bounds_iterator<const_index_type>;
-	using const_iterator = bounds_iterator<const_index_type>;
-	static const int dynamic_rank = rank;
-	static const size_t static_size = dynamic_range;
-	using sliced_type = std::conditional_t<rank != 0, strided_bounds<rank - 1>, void>;
-	using mapping_type = generalized_mapping_tag;
-	constexpr strided_bounds(const strided_bounds &) noexcept = default;
-
-	template <typename OtherSizeType>
-	constexpr strided_bounds(const strided_bounds<rank, OtherSizeType> &other) noexcept
-		: m_extents(other.extents), m_strides(other.strides)
-	{}
-	constexpr strided_bounds(const index_type &extents, const index_type &strides) noexcept
-		: m_extents(extents), m_strides(strides)
-	{}
-	constexpr index_type strides() const noexcept
-	{
-		return m_strides;
-	}
-	constexpr size_type total_size() const noexcept
-	{
-		size_type ret = 0;
-		for (size_t i = 0; i < rank; ++i)
-		{
-			ret += (m_extents[i] - 1) * m_strides[i];
-		}
-		return ret + 1;
-	}
-	constexpr size_type size() const noexcept
-	{
-		size_type ret = 1;
-		for (size_t i = 0; i < rank; ++i)
-		{
-			ret *= m_extents[i];
-		}
-		return ret;
-	}
-	constexpr bool contains(const index_type& idx) const noexcept
-	{
-		for (size_t i = 0; i < rank; ++i)
-		{
-			if (idx[i] < 0 || idx[i] >= m_extents[i])
-				return false;
-		}
-		return true;
-	}
-	constexpr size_type linearize(const index_type & idx) const noexcept
-	{
-		size_type ret = 0;
-		for (size_t i = 0; i < rank; i++)
-		{
-			fail_fast_assert(idx[i] < m_extents[i], "index is out of bounds of the array");
-			ret += idx[i] * m_strides[i];
-		}
-		return ret;
-	}
-	constexpr size_type stride() const noexcept
-	{
-		return m_strides[0];
-	}
-	template <bool Enabled = (rank > 1), typename Ret = std::enable_if_t<Enabled, sliced_type>>
-	constexpr sliced_type slice() const
-	{
-		return{ details::shift_left(m_extents), details::shift_left(m_strides) };
-	}
-	template <size_t Dim = 0>
-	constexpr size_type extent() const noexcept
-	{
-		static_assert(Dim < Rank, "dimension should be less than rank (dimension count starts from 0)");
-		return m_extents[Dim];
-	}
-	constexpr index_type index_bounds() const noexcept
-	{
-		return m_extents;
-	}
-	constexpr const_iterator begin() const noexcept
-	{
-		return const_iterator{ *this, index_type{} };
-	}
-	constexpr const_iterator end() const noexcept
-	{
-		return const_iterator{ *this, index_bounds() };
-	}
-private:
-	index_type m_extents;
-	index_type m_strides;
-};
-
-template <typename T>
-struct is_bounds : std::integral_constant<bool, false> {};
-template <typename SizeType, size_t... Ranges>
-struct is_bounds<static_bounds<SizeType, Ranges...>> : std::integral_constant<bool, true> {};
-template <size_t Rank, typename SizeType>
-struct is_bounds<strided_bounds<Rank, SizeType>> : std::integral_constant<bool, true> {};
-
-template <typename IndexType>
-class bounds_iterator: public std::iterator<std::random_access_iterator_tag, IndexType>
-{
-private:
-	using Base = std::iterator <std::random_access_iterator_tag, IndexType>;
-
-public:
-	static const size_t rank = IndexType::rank;
-	using typename Base::reference;
-	using typename Base::pointer;
-	using typename Base::difference_type;
-	using typename Base::value_type;
-	using index_type = value_type;
-	using index_size_type = typename IndexType::value_type;
-	template <typename Bounds>
-	explicit bounds_iterator(const Bounds& bnd, value_type curr) noexcept
-		: boundary(bnd.index_bounds()), curr(std::move(curr))
-	{
-		static_assert(is_bounds<Bounds>::value, "Bounds type must be provided");
-	}
-
-	constexpr reference operator*() const noexcept
-	{
-		return curr;
-	}
-
-	constexpr pointer operator->() const noexcept
-	{
-		return &curr;
-	}
-
-	constexpr bounds_iterator& operator++() noexcept
-	{
-		for (size_t i = rank; i-- > 0;)
-		{
-			if (curr[i] < boundary[i] - 1)
-			{
-				curr[i]++;
-				return *this;
-			}
-			curr[i] = 0;
-		}
-		// If we're here we've wrapped over - set to past-the-end.
-		curr = boundary;
-		return *this;
-	}
-
-	constexpr bounds_iterator operator++(int) noexcept
-	{
-		auto ret = *this;
-		++(*this);
-		return ret;
-	}
-
-	constexpr bounds_iterator& operator--() noexcept
-	{
-		if (!less(curr, boundary))
-		{
-			// if at the past-the-end, set to last element
-			for (size_t i = 0; i < rank; ++i)
-			{
-				curr[i] = boundary[i] - 1;
-			}
-			return *this;
-		}
-		for (size_t i = rank; i-- > 0;)
-		{
-			if (curr[i] >= 1)
-			{
-				curr[i]--;
-				return *this;
-			}
-			curr[i] = boundary[i] - 1;
-		}
-		// If we're here the preconditions were violated
-		// "pre: there exists s such that r == ++s"
-		fail_fast_assert(false);
-		return *this;
-	}
-
-	constexpr bounds_iterator operator--(int) noexcept
-	{
-		auto ret = *this;
-		--(*this);
-		return ret;
-	}
-
-	constexpr bounds_iterator operator+(difference_type n) const noexcept
-	{
-		bounds_iterator ret{ *this };
-		return ret += n;
-	}
-
-	constexpr bounds_iterator& operator+=(difference_type n) noexcept
-	{
-		auto linear_idx = linearize(curr) + n;
-		std::remove_const_t<value_type> stride = 0;
-		stride[rank - 1] = 1;
-		for (size_t i = rank - 1; i-- > 0;)
-		{
-			stride[i] = stride[i + 1] * boundary[i + 1];
-		}
-		for (size_t i = 0; i < rank; ++i)
-		{
-			curr[i] = linear_idx / stride[i];
-			linear_idx = linear_idx % stride[i];
-		}
-		fail_fast_assert(!less(curr, index_type{}) && !less(boundary, curr), "index is out of bounds of the array");
-		return *this;
-	}
-
-	constexpr bounds_iterator operator-(difference_type n) const noexcept
-	{
-		bounds_iterator ret{ *this };
-		return ret -= n;
-	}
-
-	constexpr bounds_iterator& operator-=(difference_type n) noexcept
-	{
-		return *this += -n;
-	}
-
-	constexpr difference_type operator-(const bounds_iterator& rhs) const noexcept
-	{
-		return linearize(curr) - linearize(rhs.curr);
-	}
-
-	constexpr reference operator[](difference_type n) const noexcept
-	{
-		return *(*this + n);
-	}
-
-	constexpr bool operator==(const bounds_iterator& rhs) const noexcept
-	{
-		return curr == rhs.curr;
-	}
-
-	constexpr bool operator!=(const bounds_iterator& rhs) const noexcept
-	{
-		return !(*this == rhs);
-	}
-
-	constexpr bool operator<(const bounds_iterator& rhs) const noexcept
-	{
-		return less(curr, rhs.curr);
-	}
-
-	constexpr bool operator<=(const bounds_iterator& rhs) const noexcept
-	{
-		return !(rhs < *this);
-	}
-
-	constexpr bool operator>(const bounds_iterator& rhs) const noexcept
-	{
-		return rhs < *this;
-	}
-
-	constexpr bool operator>=(const bounds_iterator& rhs) const noexcept
-	{
-		return !(rhs > *this);
-	}
-
-	void swap(bounds_iterator& rhs) noexcept
-	{
-		std::swap(boundary, rhs.boundary);
-		std::swap(curr, rhs.curr);
-	}
-private:
-	constexpr bool less(index_type& one, index_type& other) const noexcept
-	{
-		for (size_t i = 0; i < rank; ++i)
-		{
-			if (one[i] < other[i])
-				return true;
-		}
-		return false;
-	}
-
-	constexpr index_size_type linearize(const value_type& idx) const noexcept
-	{
-		// TODO: Smarter impl.
-		// Check if past-the-end
-		index_size_type multiplier = 1;
-		index_size_type res = 0;
-		if (!less(idx, boundary))
-		{
-			res = 1;
-			for (size_t i = rank; i-- > 0;)
-			{
-				res += (idx[i] - 1) * multiplier;
-				multiplier *= boundary[i];
-			}
-		}
-		else
-		{
-			for (size_t i = rank; i-- > 0;)
-			{
-				res += idx[i] * multiplier;
-				multiplier *= boundary[i];
-			}
-		}
-		return res;
-	}
-
-	value_type boundary;
-	std::remove_const_t<value_type> curr;
-};
-
-template <typename IndexType>
-bounds_iterator<IndexType> operator+(typename bounds_iterator<IndexType>::difference_type n, const bounds_iterator<IndexType>& rhs) noexcept
-{
-	return rhs + n;
-}
-
-/*
-** begin definitions of basic_array_view
-*/
-namespace details
-{
-	template <typename Bounds>
-	constexpr std::enable_if_t<std::is_same<typename Bounds::mapping_type, generalized_mapping_tag>::value, typename Bounds::index_type> make_stride(const Bounds& bnd) noexcept
-	{
-		return bnd.strides();
-	}
-
-	// Make a stride vector from bounds, assuming contiguous memory.
-	template <typename Bounds>
-	constexpr std::enable_if_t<std::is_same<typename Bounds::mapping_type, contiguous_mapping_tag>::value, typename Bounds::index_type> make_stride(const Bounds& bnd) noexcept
-	{
-		auto extents = bnd.index_bounds();
-		typename Bounds::size_type stride[Bounds::rank] = {};
-
-		stride[Bounds::rank - 1] = 1;
-		for (size_t i = 1; i < Bounds::rank; ++i)
-		{
-			stride[Bounds::rank - i - 1] = stride[Bounds::rank - i] * extents[Bounds::rank - i];
-		}
-		return{ stride };
-	}
-
-	template <typename BoundsSrc, typename BoundsDest>
-	void verifyBoundsReshape(const BoundsSrc &src, const BoundsDest &dest)
-	{
-		static_assert(is_bounds<BoundsSrc>::value && is_bounds<BoundsDest>::value, "The src type and dest type must be bounds");
-		static_assert(std::is_same<typename BoundsSrc::mapping_type, contiguous_mapping_tag>::value, "The source type must be a contiguous bounds");
-		static_assert(BoundsDest::static_size == dynamic_range || BoundsSrc::static_size == dynamic_range || BoundsDest::static_size == BoundsSrc::static_size, "The source bounds must have same size as dest bounds");
-		fail_fast_assert(src.size() == dest.size());
-	}
-
-
-} // namespace details
-
-template <typename ArrayView>
-class contiguous_array_view_iterator;
-template <typename ArrayView>
-class general_array_view_iterator;
-enum class byte : std::uint8_t {};
-
-template <typename ValueType, typename BoundsType>
-class basic_array_view
-{
-public:
-	static const size_t rank = BoundsType::rank;
-	using bounds_type = BoundsType;
-	using size_type = typename bounds_type::size_type;
-	using index_type = typename bounds_type::index_type;
-	using value_type = ValueType;
-	using const_value_type = std::add_const_t<value_type>;
-	using pointer = ValueType*;
-	using reference = ValueType&;
-	using iterator = std::conditional_t<std::is_same<typename BoundsType::mapping_type, contiguous_mapping_tag>::value, contiguous_array_view_iterator<basic_array_view>, general_array_view_iterator<basic_array_view>>;
-	using const_iterator = std::conditional_t<std::is_same<typename BoundsType::mapping_type, contiguous_mapping_tag>::value, contiguous_array_view_iterator<basic_array_view<const_value_type, BoundsType>>, general_array_view_iterator<basic_array_view<const_value_type, BoundsType>>>;
-	using reverse_iterator = std::reverse_iterator<iterator>;
-	using const_reverse_iterator = std::reverse_iterator<const_iterator>;
-	using sliced_type = std::conditional_t<rank == 1, value_type, basic_array_view<value_type, typename BoundsType::sliced_type>>;
-
-private:
-	pointer m_pdata;
-	bounds_type m_bounds;
-
-public:
-	constexpr bounds_type bounds() const noexcept
-	{
-		return m_bounds;
-	}
-	template <size_t Dim = 0>
-	constexpr size_type extent() const noexcept
-	{
-		static_assert(Dim < rank, "dimension should be less than rank (dimension count starts from 0)");
-		return m_bounds.template extent<Dim>();
-	}
-	constexpr size_type size() const noexcept
-	{
-		return m_bounds.size();
-	}
-	constexpr reference operator[](const index_type& idx) const
-	{
-		return m_pdata[m_bounds.linearize(idx)];
-	}
-	constexpr pointer data() const noexcept
-	{
-		return m_pdata;
-	}
-	template <bool Enabled = (rank > 1), typename Ret = std::enable_if_t<Enabled, sliced_type>>
-	constexpr Ret operator[](size_type idx) const
-	{
-		fail_fast_assert(idx < m_bounds.size(), "index is out of bounds of the array");
-		const size_type ridx = idx * m_bounds.stride();
-
-		fail_fast_assert(ridx < m_bounds.total_size(), "index is out of bounds of the underlying data");
-		return Ret {m_pdata + ridx, m_bounds.slice()};
-	}
-
-	constexpr operator bool () const noexcept
-	{
-		return m_pdata != nullptr;
-	}
-
-	constexpr iterator begin() const
-	{
-		return iterator {this, true};
-	}
-	constexpr iterator end() const
-	{
-		return iterator {this, false};
-	}
-	constexpr const_iterator cbegin() const
-	{
-		return const_iterator {reinterpret_cast<const basic_array_view<const value_type, bounds_type> *>(this), true};
-	}
-	constexpr const_iterator cend() const
-	{
-		return const_iterator {reinterpret_cast<const basic_array_view<const value_type, bounds_type> *>(this), false};
-	}
-
-	constexpr reverse_iterator rbegin() const
-	{
-		return reverse_iterator {end()};
-	}
-	constexpr reverse_iterator rend() const
-	{
-		return reverse_iterator {begin()};
-	}
-	constexpr const_reverse_iterator crbegin() const
-	{
-		return const_reverse_iterator {cend()};
-	}
-	constexpr const_reverse_iterator crend() const
-	{
-		return const_reverse_iterator {cbegin()};
-	}
-
-	template <typename OtherValueType, typename OtherBoundsType, typename Dummy = std::enable_if_t<std::is_same<std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
-	constexpr bool operator== (const basic_array_view<OtherValueType, OtherBoundsType> & other) const noexcept
-	{
-		return m_bounds.size() == other.m_bounds.size() &&
-			(m_pdata == other.m_pdata || std::equal(this->begin(), this->end(), other.begin()));
-	}
-
-	template <typename OtherValueType, typename OtherBoundsType, typename Dummy = std::enable_if_t<std::is_same<std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
-	constexpr bool operator!= (const basic_array_view<OtherValueType, OtherBoundsType> & other) const noexcept
-	{
-		return !(*this == other);
-	}
-
-	template <typename OtherValueType, typename OtherBoundsType, typename Dummy = std::enable_if_t<std::is_same<std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
-	constexpr bool operator< (const basic_array_view<OtherValueType, OtherBoundsType> & other) const noexcept
-	{
-		return std::lexicographical_compare(this->begin(), this->end(), other.begin(), other.end());
-	}
-
-	template <typename OtherValueType, typename OtherBoundsType, typename Dummy = std::enable_if_t<std::is_same<std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
-	constexpr bool operator<= (const basic_array_view<OtherValueType, OtherBoundsType> & other) const noexcept
-	{
-		return !(other < *this);
-	}
-
-	template <typename OtherValueType, typename OtherBoundsType, typename Dummy = std::enable_if_t<std::is_same<std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
-	constexpr bool operator> (const basic_array_view<OtherValueType, OtherBoundsType> & other) const noexcept
-	{
-		return (other < *this);
-	}
-
-	template <typename OtherValueType, typename OtherBoundsType, typename Dummy = std::enable_if_t<std::is_same<std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
-	constexpr bool operator>= (const basic_array_view<OtherValueType, OtherBoundsType> & other) const noexcept
-	{
-		return !(*this < other);
-	}
-
-public:
-	template <typename OtherValueType, typename OtherBounds,
-		typename Dummy = std::enable_if_t<std::is_convertible<OtherValueType(*)[], value_type(*)[]>::value
-			&& std::is_convertible<OtherBounds, bounds_type>::value>>
-	constexpr basic_array_view(const basic_array_view<OtherValueType, OtherBounds> & other ) noexcept
-		: m_pdata(other.m_pdata), m_bounds(other.m_bounds)
-	{
-	}
-protected:
-
-	constexpr basic_array_view(pointer data, bounds_type bound) noexcept
-		: m_pdata(data)
-		, m_bounds(std::move(bound))
-	{
-		fail_fast_assert((m_bounds.size() > 0 && data != nullptr) || m_bounds.size() == 0);
-	}
-	template <typename T>
-	constexpr basic_array_view(T *data, std::enable_if_t<std::is_same<value_type, std::remove_all_extents_t<T>>::value, bounds_type> bound) noexcept
-		: m_pdata(reinterpret_cast<pointer>(data))
-		, m_bounds(std::move(bound))
-	{
-		fail_fast_assert((m_bounds.size() > 0 && data != nullptr) || m_bounds.size() == 0);
-	}
-	template <typename DestBounds>
-	constexpr basic_array_view<value_type, DestBounds> as_array_view(const DestBounds &bounds)
-	{
-		details::verifyBoundsReshape(m_bounds, bounds);
-		return {m_pdata, bounds};
-	}
-private:
-
-	friend iterator;
-	friend const_iterator;
-	template <typename ValueType2, typename BoundsType2>
-	friend class basic_array_view;
-};
-
-template <size_t DimSize = dynamic_range>
-struct dim
-{
-	static const size_t value = DimSize;
-};
-template <>
-struct dim<dynamic_range>
-{
-	static const size_t value = dynamic_range;
-	const size_t dvalue;
-	dim(size_t size) : dvalue(size) {}
-};
-
-template <typename ValueTypeOpt, size_t FirstDimension = dynamic_range, size_t... RestDimensions>
-class array_view;
-template <typename ValueTypeOpt, size_t Rank>
-class strided_array_view;
-
-namespace details
-{
-	template <typename T, typename = std::true_type>
-	struct ArrayViewTypeTraits
-	{
-		using value_type = T;
-		using size_type = size_t;
-	};
-
-	template <typename Traits>
-	struct ArrayViewTypeTraits<Traits, typename std::is_reference<typename Traits::array_view_traits &>::type>
-	{
-		using value_type = typename Traits::array_view_traits::value_type;
-		using size_type = typename Traits::array_view_traits::size_type;
-	};
-
-	template <typename T, typename SizeType, size_t... Ranks>
-	struct ArrayViewArrayTraits {
-		using type = array_view<T, Ranks...>;
-		using value_type = T;
-		using bounds_type = static_bounds<SizeType, Ranks...>;
-		using pointer = T*;
-		using reference = T&;
-	};
-	template <typename T, typename SizeType, size_t N, size_t... Ranks>
-	struct ArrayViewArrayTraits<T[N], SizeType, Ranks...> : ArrayViewArrayTraits<T, SizeType, Ranks..., N> {};
-
-	template <typename BoundsType>
-	BoundsType newBoundsHelperImpl(size_t totalSize, std::true_type) // dynamic size
-	{
-		fail_fast_assert(totalSize <= details::SizeTypeTraits<typename BoundsType::size_type>::max_value);
-		return BoundsType{static_cast<typename BoundsType::size_type>(totalSize)};
-	}
-	template <typename BoundsType>
-	BoundsType newBoundsHelperImpl(size_t totalSize, std::false_type) // static size
-	{
-		fail_fast_assert(BoundsType::static_size == totalSize);
-		return {};
-	}
-	template <typename BoundsType>
-	BoundsType newBoundsHelper(size_t totalSize)
-	{
-		static_assert(BoundsType::dynamic_rank <= 1, "dynamic rank must less or equal to 1");
-		return newBoundsHelperImpl<BoundsType>(totalSize, std::integral_constant<bool, BoundsType::dynamic_rank == 1>());
-	}
-	
-	struct Sep{};
-	
-	template <typename T, typename... Args>
-	T static_as_array_view_helper(Sep, Args... args)
-	{
-		return T{static_cast<typename T::size_type>(args)...};
-	}
-	template <typename T, typename Arg, typename... Args>
-	std::enable_if_t<!std::is_same<Arg, dim<dynamic_range>>::value && !std::is_same<Arg, Sep>::value, T> static_as_array_view_helper(Arg, Args... args)
-	{
-		return static_as_array_view_helper<T>(args...);
-	}
-	template <typename T, typename... Args>
-	T static_as_array_view_helper(dim<dynamic_range> val, Args ... args)
-	{
-		return static_as_array_view_helper<T>(args..., val.dvalue);
-	}
-
-	template <typename SizeType, typename ...Dimensions>
-	struct static_as_array_view_static_bounds_helper
-	{
-		using type = static_bounds<SizeType, (Dimensions::value)...>;
-	};
-
-	template <typename T>
-	struct is_array_view_oracle : std::false_type
-	{};
-	template <typename ValueType, size_t FirstDimension, size_t... RestDimensions>
-	struct is_array_view_oracle<array_view<ValueType, FirstDimension, RestDimensions...>> : std::true_type
-	{};
-	template <typename ValueType, size_t Rank>
-	struct is_array_view_oracle<strided_array_view<ValueType, Rank>> : std::true_type
-	{};
-	template <typename T>
-	struct is_array_view : is_array_view_oracle<std::remove_cv_t<T>>
-	{};
-
-}
-
-
-template <typename ValueType, typename SizeType>
-struct array_view_options
-{
-	struct array_view_traits
-	{
-		using value_type = ValueType;
-		using size_type = SizeType;
-	};
-};
-
-template <typename ValueTypeOpt, size_t FirstDimension, size_t... RestDimensions>
-class array_view : public basic_array_view<typename details::ArrayViewTypeTraits<ValueTypeOpt>::value_type, 
-	static_bounds<typename details::ArrayViewTypeTraits<ValueTypeOpt>::size_type, FirstDimension, RestDimensions...>>
-{
-	template <typename ValueTypeOpt2, size_t FirstDimension2, size_t... RestDimensions2>
-	friend class array_view;
-	using Base = basic_array_view<typename details::ArrayViewTypeTraits<ValueTypeOpt>::value_type,
-		static_bounds<typename details::ArrayViewTypeTraits<ValueTypeOpt>::size_type, FirstDimension, RestDimensions...>>;
-
-public:
-	using typename Base::bounds_type;
-	using typename Base::size_type;
-	using typename Base::pointer;
-	using typename Base::value_type;
-	using typename Base::index_type;
-	using typename Base::iterator;
-	using typename Base::const_iterator;
-	using typename Base::reference;
-	using Base::rank;
-
-public:
-	// basic
-	constexpr array_view(pointer ptr, bounds_type bounds) : Base(ptr, std::move(bounds))
-	{
-	}
-
-	constexpr array_view(std::nullptr_t) : Base(nullptr, bounds_type{})
-	{
-	}
-
-	constexpr array_view(std::nullptr_t, size_type size) : Base(nullptr, bounds_type{})
-	{
-		fail_fast_assert(size == 0);
-	}
-
-	// default
-	template <size_t DynamicRank = bounds_type::dynamic_rank, typename Dummy = std::enable_if_t<DynamicRank != 0>>
-	constexpr array_view() : Base(nullptr, bounds_type())
-	{
-	}
-
-	// from n-dimensions dynamic array (e.g. new int[m][4]) (precedence will be lower than the 1-dimension pointer)
-	template <typename T, typename Helper = details::ArrayViewArrayTraits<T, size_type, dynamic_range>,
-		typename Dummy = std::enable_if_t<std::is_convertible<typename Helper::value_type (*)[], typename Base::value_type (*)[]>::value
-			&& std::is_convertible<typename Helper::bounds_type, typename Base::bounds_type>::value>>
-	constexpr array_view(T * const & data, size_type size) : Base(data, typename Helper::bounds_type{size})
-	{
-	}
-
-	// from n-dimensions static array
-	template <typename T, size_t N, typename Helper = details::ArrayViewArrayTraits<T, size_type, N>,
-		typename Dummy = std::enable_if_t<std::is_convertible<typename Helper::value_type(*)[], typename Base::value_type(*)[]>::value
-		&& std::is_convertible<typename Helper::bounds_type, typename Base::bounds_type>::value>>
-	constexpr array_view (T (&arr)[N]) : Base(arr, typename Helper::bounds_type())
-	{
-	}
-
-	// from n-dimensions static array with size
-	template <typename T, size_t N, typename Helper = details::ArrayViewArrayTraits<T, size_type, dynamic_range>,
-		typename Dummy = std::enable_if_t<std::is_convertible<typename Helper::value_type(*)[], typename Base::value_type(*)[]>::value
-			&& std::is_convertible<typename Helper::bounds_type, typename Base::bounds_type>::value >>
-	constexpr array_view(T(&arr)[N], size_type size) : Base(arr, typename Helper::bounds_type{ size })
-	{
-		fail_fast_assert(size <= N);
-	}
-
-	// from std array
-	template <size_t N, typename Dummy = std::enable_if_t<std::is_convertible<static_bounds<size_type, N>, typename Base::bounds_type>::value>>
-	constexpr array_view (std::array<std::remove_const_t<value_type>, N> & arr) : Base(arr.data(), static_bounds<size_type, N>())
-	{
-	}
-
-	template <size_t N, typename Dummy = std::enable_if_t<std::is_convertible<static_bounds<size_type, N>, typename Base::bounds_type>::value && std::is_const<value_type>::value>>
-	constexpr array_view (const std::array<std::remove_const_t<value_type>, N> & arr) : Base(arr.data(), static_bounds<size_type, N>())
-	{
-	}
-
-
-	// from begin, end pointers. We don't provide iterator pair since no way to guarantee the contiguity 
-	template <typename Ptr,
-		typename Dummy = std::enable_if_t<std::is_convertible<Ptr, pointer>::value
-		&& details::LessThan<Base::bounds_type::dynamic_rank, 2>::value>> // remove literal 0 case
-	constexpr array_view (pointer begin, Ptr end) : Base(begin, details::newBoundsHelper<typename Base::bounds_type>(static_cast<pointer>(end) - begin))
-	{
-	}
-
-	// from containers. It must has .size() and .data() two function signatures
-	template <typename Cont, typename DataType = typename Cont::value_type, typename SizeType = typename Cont::size_type,
-		typename Dummy = std::enable_if_t<!details::is_array_view<Cont>::value
-		&& std::is_convertible<DataType (*)[], typename Base::value_type (*)[]>::value
-		&& std::is_convertible<static_bounds<SizeType, dynamic_range>, typename Base::bounds_type>::value
-		&& std::is_same<std::decay_t<decltype(std::declval<Cont>().size(), *std::declval<Cont>().data())>, DataType>::value>
-	>
-	constexpr array_view (Cont& cont) : Base(static_cast<pointer>(cont.data()), details::newBoundsHelper<typename Base::bounds_type>(cont.size()))
-	{
-
-	}
-
-	constexpr  array_view(const array_view &) = default;
-
-	// convertible
-	template <typename OtherValueTypeOpt, size_t... OtherDimensions,
-		typename BaseType = basic_array_view<typename details::ArrayViewTypeTraits<ValueTypeOpt>::value_type, static_bounds<typename details::ArrayViewTypeTraits<ValueTypeOpt>::size_type, FirstDimension, RestDimensions...>>,
-		typename OtherBaseType = basic_array_view<typename details::ArrayViewTypeTraits<OtherValueTypeOpt>::value_type, static_bounds<typename details::ArrayViewTypeTraits<OtherValueTypeOpt>::size_type, OtherDimensions...>>,
-		typename Dummy = std::enable_if_t<std::is_convertible<OtherBaseType, BaseType>::value>
-	>
-	constexpr array_view(const array_view<OtherValueTypeOpt, OtherDimensions...> &av) : Base(static_cast<const typename array_view<OtherValueTypeOpt, OtherDimensions...>::Base &>(av)) {} // static_cast is required
-
-	// reshape
-	template <typename... Dimensions2>
-	constexpr array_view<ValueTypeOpt, Dimensions2::value...> as_array_view(Dimensions2... dims)
-	{
-		static_assert(sizeof...(Dimensions2) > 0, "the target array_view must have at least one dimension.");
-		using BoundsType = typename array_view<ValueTypeOpt, (Dimensions2::value)...>::bounds_type;
-		auto tobounds = details::static_as_array_view_helper<BoundsType>(dims..., details::Sep{});
-		details::verifyBoundsReshape(this->bounds(), tobounds);
-		return {this->data(), tobounds};
-	}
-
-	// to bytes array
-	template <bool Enabled = std::is_standard_layout<std::decay_t<typename details::ArrayViewTypeTraits<ValueTypeOpt>::value_type>>::value>
-	constexpr auto as_bytes() const noexcept ->
-		array_view<array_view_options<const byte, size_type>, static_cast<size_t>(details::StaticSizeHelper<size_type, Base::bounds_type::static_size, sizeof(value_type)>::value)>
-	{
-		static_assert(Enabled, "The value_type of array_view must be standarded layout");
-		return { reinterpret_cast<const byte*>(this->data()), this->bytes() };
-	}
-
-	template <bool Enabled = std::is_standard_layout<std::decay_t<typename details::ArrayViewTypeTraits<ValueTypeOpt>::value_type>>::value>
-	constexpr auto as_writeable_bytes() const noexcept ->
-		array_view<array_view_options<byte, size_type>, static_cast<size_t>(details::StaticSizeHelper<size_type, Base::bounds_type::static_size, sizeof(value_type)>::value)>
-	{
-		static_assert(Enabled, "The value_type of array_view must be standarded layout");
-		return { reinterpret_cast<byte*>(this->data()), this->bytes() };
-	}
-
-
-	// from bytes array
-	template<typename U, bool IsByte = std::is_same<value_type, const byte>::value, typename Dummy = std::enable_if_t<IsByte && sizeof...(RestDimensions) == 0>>
-	constexpr auto as_array_view() const noexcept -> array_view<const U, (Base::bounds_type::dynamic_rank == 0 ? Base::bounds_type::static_size / sizeof(U) : static_cast<size_type>(dynamic_range))>
-	{
-		static_assert(std::is_standard_layout<U>::value && (Base::bounds_type::static_size == dynamic_range || Base::bounds_type::static_size % sizeof(U) == 0),
-			"Target type must be standard layout and its size must match the byte array size");
-		fail_fast_assert((this->bytes() % sizeof(U)) == 0);
-		return { reinterpret_cast<const U*>(this->data()), this->bytes() / sizeof(U) };
-	}
-
-	template<typename U, bool IsByte = std::is_same<value_type, byte>::value, typename Dummy = std::enable_if_t<IsByte && sizeof...(RestDimensions) == 0>>
-	constexpr auto as_array_view() const noexcept -> array_view<U, (Base::bounds_type::dynamic_rank == 0 ? Base::bounds_type::static_size / sizeof(U) : static_cast<size_type>(dynamic_range))>
-	{
-		static_assert(std::is_standard_layout<U>::value && (Base::bounds_type::static_size == dynamic_range || Base::bounds_type::static_size % sizeof(U) == 0),
-			"Target type must be standard layout and its size must match the byte array size");
-		fail_fast_assert((this->bytes() % sizeof(U)) == 0);
-		return { reinterpret_cast<U*>(this->data()), this->bytes() / sizeof(U) };
-	}
-
-	// section on linear space
-	template<size_t Count>
-	constexpr array_view<ValueTypeOpt, Count> first() const noexcept
-	{
-		static_assert(bounds_type::static_size == dynamic_range || Count <= bounds_type::static_size, "Index is out of bound");
-		fail_fast_assert(bounds_type::static_size != dynamic_range || Count <= this->size()); // ensures we only check condition when needed
-		return { this->data(), Count };
-	}
-
-	constexpr array_view<ValueTypeOpt, dynamic_range> first(size_type count) const noexcept
-	{
-		fail_fast_assert(count <= this->size());
-		return { this->data(), count };
-	}
-
-	template<size_t Count>
-	constexpr array_view<ValueTypeOpt, Count> last() const noexcept
-	{
-		static_assert(bounds_type::static_size == dynamic_range || Count <= bounds_type::static_size, "Index is out of bound");
-		fail_fast_assert(bounds_type::static_size != dynamic_range || Count <= this->size());
-		return { this->data() + this->size() - Count, Count };
-	}
-
-	constexpr array_view<ValueTypeOpt, dynamic_range> last(size_type count) const noexcept
-	{
-		fail_fast_assert(count <= this->size());
-		return { this->data() + this->size() - count, count };
-	}
-
-	template<size_t Offset, size_t Count>
-	constexpr array_view<ValueTypeOpt, Count> sub() const noexcept
-	{
-		static_assert(bounds_type::static_size == dynamic_range || ((Offset == 0 || Offset <= bounds_type::static_size) && Offset + Count <= bounds_type::static_size), "Index is out of bound");
-		fail_fast_assert(bounds_type::static_size != dynamic_range || ((Offset == 0 || Offset <= this->size()) && Offset + Count <= this->size()));
-		return { this->data() + Offset, Count };
-	}
-
-	constexpr array_view<ValueTypeOpt, dynamic_range> sub(size_type offset, size_type count = dynamic_range) const noexcept
-	{
-		fail_fast_assert((offset == 0 || offset <= this->size()) && (count == dynamic_range || (offset + count) <= this->size()));
-		return { this->data() + offset, count == dynamic_range ? this->length() - offset : count };
-	}
-
-	// size
-	constexpr size_type length() const noexcept
-	{
-		return this->size();
-	}
-	constexpr size_type used_length() const noexcept
-	{
-		return length();
-	}
-	constexpr size_type bytes() const noexcept
-	{
-		return sizeof(value_type) * this->size();
-	}
-	constexpr size_type used_bytes() const noexcept
-	{
-		return bytes();
-	}
-
-	// section
-	constexpr strided_array_view<ValueTypeOpt, rank> section(index_type origin, index_type extents) const
-	{
-		size_type size = this->bounds().total_size() - this->bounds().linearize(origin);
-		return{ &this->operator[](origin), size, strided_bounds<rank, size_type> {extents, details::make_stride(Base::bounds())} };
-	}
-	
-		constexpr reference operator[](const index_type& idx) const
-	{
-		return Base::operator[](idx);
-	}
-	
-		template <bool Enabled = (rank > 1), typename Dummy = std::enable_if_t<Enabled>>
-	constexpr array_view<ValueTypeOpt, RestDimensions...> operator[](size_type idx) const
-	{
-		auto ret = Base::operator[](idx);
-		return{ ret.data(), ret.bounds() };
-	}
-
-	using Base::operator==;
-	using Base::operator!=;
-	using Base::operator<;
-	using Base::operator<=;
-	using Base::operator>;
-	using Base::operator>=;
-};
-
-template <typename T, size_t... Dimensions>
-constexpr auto as_array_view(T * const & ptr, dim<Dimensions>... args) -> array_view<std::remove_all_extents_t<T>, Dimensions...>
-{
-	return {reinterpret_cast<std::remove_all_extents_t<T>*>(ptr), details::static_as_array_view_helper<static_bounds<size_t, Dimensions...>>(args..., details::Sep{})};
-}
-
-template <typename T>
-constexpr auto as_array_view (T * arr, size_t len) -> typename details::ArrayViewArrayTraits<T, size_t, dynamic_range>::type
-{
-	return {arr, len};
-}
-
-template <typename T, size_t N>
-constexpr auto as_array_view (T (&arr)[N]) -> typename details::ArrayViewArrayTraits<T, size_t, N>::type
-{
-	return {arr};
-}
-
-template <typename T, size_t N>
-constexpr array_view<const T, N> as_array_view(const std::array<T, N> &arr)
-{
-	return {arr};
-}
-
-template <typename T, size_t N>
-constexpr array_view<const T, N> as_array_view(const std::array<T, N> &&) = delete;
-
-template <typename T, size_t N>
-constexpr array_view<T, N> as_array_view(std::array<T, N> &arr)
-{
-	return {arr};
-}
-
-template <typename T>
-constexpr array_view<T, dynamic_range> as_array_view(T *begin, T *end)
-{
-	return {begin, end};
-}
-
-template <typename Cont>
-constexpr auto as_array_view(Cont &arr) -> std::enable_if_t<!details::is_array_view<std::decay_t<Cont>>::value,
-	array_view<std::remove_reference_t<decltype(arr.size(), *arr.data())>, dynamic_range>>
-{
-	return {arr.data(), arr.size()};
-}
-
-template <typename Cont>
-constexpr auto as_array_view(Cont &&arr) -> std::enable_if_t<!details::is_array_view<std::decay_t<Cont>>::value,
-	array_view<std::remove_reference_t<decltype(arr.size(), *arr.data())>, dynamic_range>> = delete;
-
-template <typename ValueTypeOpt, size_t Rank>
-class strided_array_view : public basic_array_view<typename details::ArrayViewTypeTraits<ValueTypeOpt>::value_type, strided_bounds<Rank, typename details::ArrayViewTypeTraits<ValueTypeOpt>::size_type>>
-{
-	using Base = basic_array_view<typename details::ArrayViewTypeTraits<ValueTypeOpt>::value_type, strided_bounds<Rank, typename details::ArrayViewTypeTraits<ValueTypeOpt>::size_type>>;
-
-	template<typename OtherValueOpt, size_t OtherRank>
-	friend class strided_array_view;
-public:
-	using Base::rank;
-	using typename Base::bounds_type;
-	using typename Base::size_type;
-	using typename Base::pointer;
-	using typename Base::value_type;
-	using typename Base::index_type;
-	using typename Base::iterator;
-	using typename Base::const_iterator;
-	using typename Base::reference;
-	
-	// from static array of size N
-	template<size_type N>
-	strided_array_view(value_type(&values)[N], bounds_type bounds) : Base(values, std::move(bounds))
-	{
-		fail_fast_assert(this->bounds().total_size() <= N, "Bounds cross data boundaries");
-	}
-
-	// from raw data
-	strided_array_view(pointer ptr, size_type size, bounds_type bounds): Base(ptr, std::move(bounds))
-	{
-		fail_fast_assert(this->bounds().total_size() <= size, "Bounds cross data boundaries");
-	}
-
-	// from array view
-	template <size_t... Dimensions, typename Dummy = std::enable_if<sizeof...(Dimensions) == Rank>>
-	strided_array_view(array_view<ValueTypeOpt, Dimensions...> av, bounds_type bounds) : Base(av.data(), std::move(bounds))
-	{
-		fail_fast_assert(this->bounds().total_size() <= av.bounds().total_size(), "Bounds cross data boundaries");
-	}
-	
-	// convertible
-	template <typename OtherValueTypeOpt,
-		typename BaseType = basic_array_view<typename details::ArrayViewTypeTraits<ValueTypeOpt>::value_type, strided_bounds<Rank, typename details::ArrayViewTypeTraits<ValueTypeOpt>::size_type>>,
-		typename OtherBaseType = basic_array_view<typename details::ArrayViewTypeTraits<OtherValueTypeOpt>::value_type, strided_bounds<Rank, typename details::ArrayViewTypeTraits<OtherValueTypeOpt>::size_type>>,
-		typename Dummy = std::enable_if_t<std::is_convertible<OtherBaseType, BaseType>::value>
-	>
-	constexpr strided_array_view(const strided_array_view<OtherValueTypeOpt, Rank> &av): Base(static_cast<const typename strided_array_view<OtherValueTypeOpt, Rank>::Base &>(av)) // static_cast is required
-	{
-	}
-
-	// convert from bytes
-		template <typename OtherValueType>
-		strided_array_view<typename std::enable_if<std::is_same<value_type, const byte>::value, OtherValueType>::type, rank> as_strided_array_view() const 
-	{
-		static_assert((sizeof(OtherValueType) >= sizeof(value_type)) && (sizeof(OtherValueType) % sizeof(value_type) == 0), "OtherValueType should have a size to contain a multiple of ValueTypes");
-		auto d = sizeof(OtherValueType) / sizeof(value_type);
-
-		size_type size = this->bounds().total_size() / d;
-		return{ (OtherValueType*)this->data(), size, bounds_type{ resize_extent(this->bounds().index_bounds(), d), resize_stride(this->bounds().strides(), d)} };
-	}
-
-	strided_array_view section(index_type origin, index_type extents) const
-	{
-		size_type size = this->bounds().total_size() - this->bounds().linearize(origin);
-		return { &this->operator[](origin), size, bounds_type {extents, details::make_stride(Base::bounds())}};
-	}
-
-	constexpr reference operator[](const index_type& idx) const
-	{
-		return Base::operator[](idx);
-	}
-
-	template <bool Enabled = (rank > 1), typename Dummy = std::enable_if_t<Enabled>>
-	constexpr strided_array_view<value_type, rank-1> operator[](size_type idx) const
-	{
-		auto ret = Base::operator[](idx);
-		return{ ret.data(), ret.bounds().total_size(), ret.bounds() };
-	}
-
-private:
-	static index_type resize_extent(const index_type& extent, size_t d)
-	{
-		fail_fast_assert(extent[rank - 1] >= d && (extent[rank-1] % d == 0), "The last dimension of the array needs to contain a multiple of new type elements");
-
-		index_type ret = extent;
-		ret[rank - 1] /= d;
-
-		return ret;
-	}
-
-	template <bool Enabled = (rank == 1), typename Dummy = std::enable_if_t<Enabled>>
-	static index_type resize_stride(const index_type& strides, size_t , void * = 0)
-	{
-		fail_fast_assert(strides[rank - 1] == 1, "Only strided arrays with regular strides can be resized");
-
-		return strides;
-	}
-
-	template <bool Enabled = (rank > 1), typename Dummy = std::enable_if_t<Enabled>>
-	static index_type resize_stride(const index_type& strides, size_t d)
-	{
-		fail_fast_assert(strides[rank - 1] == 1, "Only strided arrays with regular strides can be resized");
-		fail_fast_assert(strides[rank - 2] >= d && (strides[rank - 2] % d == 0), "The strides must have contiguous chunks of memory that can contain a multiple of new type elements");
-
-		for (size_t i = rank - 1; i > 0; --i)
-			fail_fast_assert((strides[i-1] >= strides[i]) && (strides[i-1] % strides[i] == 0), "Only strided arrays with regular strides can be resized");
-
-		index_type ret = strides / d;
-		ret[rank - 1] = 1;
-
-		return ret;
-	}
-};
-
-template <typename ArrayView>
-class contiguous_array_view_iterator : public std::iterator<std::random_access_iterator_tag, typename ArrayView::value_type>
-{
-	using Base = std::iterator<std::random_access_iterator_tag, typename ArrayView::value_type>;
-public:
-	using typename Base::reference;
-	using typename Base::pointer;
-	using typename Base::difference_type;
-private:
-	template <typename ValueType, typename Bounds>
-	friend class basic_array_view;
-	pointer m_pdata;
-	const ArrayView * m_validator;
-	void validateThis() const
-	{
-		fail_fast_assert(m_pdata >= m_validator->m_pdata && m_pdata < m_validator->m_pdata + m_validator->size(), "iterator is out of range of the array");
-	}
-	contiguous_array_view_iterator (const ArrayView *container, bool isbegin) :
-		m_pdata(isbegin ? container->m_pdata : container->m_pdata + container->size()), m_validator(container) {}
-public:
-	reference operator*() const noexcept
-	{
-		validateThis();
-		return *m_pdata;
-	}
-	pointer operator->() const noexcept
-	{
-		validateThis();
-		return m_pdata;
-	}
-	contiguous_array_view_iterator& operator++() noexcept
-	{
-		++m_pdata;
-		return *this;
-	}
-	contiguous_array_view_iterator operator++(int)noexcept
-	{
-		auto ret = *this;
-		++(*this);
-		return ret;
-	}
-	contiguous_array_view_iterator& operator--() noexcept
-	{
-		--m_pdata;
-		return *this;
-	}
-	contiguous_array_view_iterator operator--(int)noexcept
-	{
-		auto ret = *this;
-		--(*this);
-		return ret;
-	}
-	contiguous_array_view_iterator operator+(difference_type n) const noexcept
-	{
-		contiguous_array_view_iterator ret{ *this };
-		return ret += n;
-	}
-	contiguous_array_view_iterator& operator+=(difference_type n) noexcept
-	{
-		m_pdata += n;
-		return *this;
-	}
-	contiguous_array_view_iterator operator-(difference_type n) const noexcept
-	{
-		contiguous_array_view_iterator ret{ *this };
-		return ret -= n;
-	}
-	contiguous_array_view_iterator& operator-=(difference_type n) noexcept
-	{
-		return *this += -n;
-	}
-	difference_type operator-(const contiguous_array_view_iterator& rhs) const noexcept
-	{
-		fail_fast_assert(m_validator == rhs.m_validator);
-		return m_pdata - rhs.m_pdata;
-	}
-	reference operator[](difference_type n) const noexcept
-	{
-		return *(*this + n);
-	}
-	bool operator==(const contiguous_array_view_iterator& rhs) const noexcept
-	{
-		fail_fast_assert(m_validator == rhs.m_validator);
-		return m_pdata == rhs.m_pdata;
-	}
-	bool operator!=(const contiguous_array_view_iterator& rhs) const noexcept
-	{
-		return !(*this == rhs);
-	}
-	bool operator<(const contiguous_array_view_iterator& rhs) const noexcept
-	{
-		fail_fast_assert(m_validator == rhs.m_validator);
-		return m_pdata < rhs.m_pdata;
-	}
-	bool operator<=(const contiguous_array_view_iterator& rhs) const noexcept
-	{
-		return !(rhs < *this);
-	}
-	bool operator>(const contiguous_array_view_iterator& rhs) const noexcept
-	{
-		return rhs < *this;
-	}
-	bool operator>=(const contiguous_array_view_iterator& rhs) const noexcept
-	{
-		return !(rhs > *this);
-	}
-	void swap(contiguous_array_view_iterator& rhs) noexcept
-	{
-		std::swap(m_pdata, rhs.m_pdata);
-		std::swap(m_validator, rhs.m_validator);
-	}
-};
-
-template <typename ArrayView>
-contiguous_array_view_iterator<ArrayView> operator+(typename contiguous_array_view_iterator<ArrayView>::difference_type n, const contiguous_array_view_iterator<ArrayView>& rhs) noexcept
-{
-	return rhs + n;
-}
-
-template <typename ArrayView>
-class general_array_view_iterator : public std::iterator<std::random_access_iterator_tag, typename ArrayView::value_type>
-{
-	using Base = std::iterator<std::random_access_iterator_tag, typename ArrayView::value_type>;
-public:
-	using typename Base::reference;
-	using typename Base::pointer;
-	using typename Base::difference_type;
-	using typename Base::value_type;
-private:
-	template <typename ValueType, typename Bounds>
-	friend class basic_array_view;
-	const ArrayView * m_container;
-	typename ArrayView::bounds_type::iterator m_itr;
-	general_array_view_iterator(const ArrayView *container, bool isbegin) :
-		m_container(container), m_itr(isbegin ? m_container->bounds().begin() : m_container->bounds().end())
-	{
-	}
-public:
-	reference operator*() noexcept
-	{
-		return (*m_container)[*m_itr];
-	}
-	pointer operator->() noexcept
-	{
-		return &(*m_container)[*m_itr];
-	}
-	general_array_view_iterator& operator++() noexcept
-	{
-		++m_itr;
-		return *this;
-	}
-	general_array_view_iterator operator++(int)noexcept
-	{
-		auto ret = *this;
-		++(*this);
-		return ret;
-	}
-	general_array_view_iterator& operator--() noexcept
-	{
-		--m_itr;
-		return *this;
-	}
-	general_array_view_iterator operator--(int)noexcept
-	{
-		auto ret = *this;
-		--(*this);
-		return ret;
-	}
-	general_array_view_iterator operator+(difference_type n) const noexcept
-	{
-		general_array_view_iterator ret{ *this };
-		return ret += n;
-	}
-	general_array_view_iterator& operator+=(difference_type n) noexcept
-	{
-		m_itr += n;
-		return *this;
-	}
-	general_array_view_iterator operator-(difference_type n) const noexcept
-	{
-		general_array_view_iterator ret{ *this };
-		return ret -= n;
-	}
-	general_array_view_iterator& operator-=(difference_type n) noexcept
-	{
-		return *this += -n;
-	}
-	difference_type operator-(const general_array_view_iterator& rhs) const noexcept
-	{
-		fail_fast_assert(m_container == rhs.m_container);
-		return m_itr - rhs.m_itr;
-	}
-	value_type operator[](difference_type n) const noexcept
-	{
-		return (*m_container)[m_itr[n]];;
-	}
-	bool operator==(const general_array_view_iterator& rhs) const noexcept
-	{
-		fail_fast_assert(m_container == rhs.m_container);
-		return m_itr == rhs.m_itr;
-	}
-	bool operator !=(const general_array_view_iterator& rhs) const noexcept
-	{
-		return !(*this == rhs);
-	}
-	bool operator<(const general_array_view_iterator& rhs) const noexcept
-	{
-		fail_fast_assert(m_container == rhs.m_container);
-		return m_itr < rhs.m_itr;
-	}
-	bool operator<=(const general_array_view_iterator& rhs) const noexcept
-	{
-		return !(rhs < *this);
-	}
-	bool operator>(const general_array_view_iterator& rhs) const noexcept
-	{
-		return rhs < *this;
-	}
-	bool operator>=(const general_array_view_iterator& rhs) const noexcept
-	{
-		return !(rhs > *this);
-	}
-	void swap(general_array_view_iterator& rhs) noexcept
-	{
-		std::swap(m_itr, rhs.m_itr);
-		std::swap(m_container, rhs.m_container);
-	}
-};
-
-template <typename ArrayView>
-general_array_view_iterator<ArrayView> operator+(typename general_array_view_iterator<ArrayView>::difference_type n, const general_array_view_iterator<ArrayView>& rhs) noexcept
-{
-	return rhs + n;
-}
-
-} // namespace gsl
-
-#ifdef _MSC_VER
-
-#undef constexpr
-#pragma pop_macro("constexpr")
-
-#if _MSC_VER <= 1800
-#pragma warning(pop)
-
-#ifndef GSL_THROWS_FOR_TESTING
-#pragma undef noexcept
-#endif // GSL_THROWS_FOR_TESTING
-
-#endif // _MSC_VER <= 1800
-
-#endif // _MSC_VER
-
-#if defined(GSL_THROWS_FOR_TESTING) 
-#undef noexcept 
-#endif // GSL_THROWS_FOR_TESTING 
-
-
-#endif // GSL_ARRAY_VIEW_H
diff --git a/include/fail_fast.h b/include/fail_fast.h
deleted file mode 100644
index b9982eb..0000000
--- a/include/fail_fast.h
+++ /dev/null
@@ -1,55 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////// 
-// 
-// Copyright (c) 2015 Microsoft Corporation. All rights reserved. 
-// 
-// This code is licensed under the MIT License (MIT). 
-// 
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 
-// THE SOFTWARE. 
-// 
-///////////////////////////////////////////////////////////////////////////////
-
-#pragma once
-
-#ifndef GSL_FAIL_FAST_H
-#define GSL_FAIL_FAST_H
-
-#include <exception>
-
-#if defined(GSL_THROWS_FOR_TESTING)
-#include <stdexcept>
-#endif
-
-namespace gsl
-{
-
-//
-// Having "fail fast" result in an exception makes unit testing
-// the GSL classes that rely upon it much simpler. 
-//
-#if defined(GSL_THROWS_FOR_TESTING)
-
-struct fail_fast : public std::runtime_error 
-{
-	fail_fast() : std::runtime_error("") {}
-	explicit fail_fast(char const* const message) : std::runtime_error(message) {}
-};
-
-inline void fail_fast_assert(bool cond) { if (!cond) throw fail_fast(); }
-inline void fail_fast_assert(bool cond, const char* const message) { if (!cond) throw fail_fast(message); }
-
-#else
-
-inline void fail_fast_assert(bool cond) { if (!cond) std::terminate(); }
-inline void fail_fast_assert(bool cond, const char* const) { if (!cond) std::terminate(); }
-
-#endif // GSL_THROWS_FOR_TESTING
-
-}
-
-#endif // GSL_FAIL_FAST_H
diff --git a/include/gsl.h b/include/gsl.h
index ec75723..ad064ba 100644
--- a/include/gsl.h
+++ b/include/gsl.h
@@ -19,23 +19,23 @@
 #ifndef GSL_GSL_H
 #define GSL_GSL_H
 
-#include "array_view.h"     // array_view, strided_array_view...
-#include "string_view.h"    // zstring, string_view, zstring_builder...
+#include "gsl_assert.h"  // Ensures/Expects
+#include "gsl_util.h"    // finally()/narrow()/narrow_cast()...
+#include "span.h"           // span, strided_span...
+#include "string_span.h"    // zstring, string_span, zstring_builder...
 #include <memory>
 
 #ifdef _MSC_VER
 
 // No MSVC does constexpr fully yet
 #pragma push_macro("constexpr")
-#define constexpr /* nothing */
+#define constexpr 
 
 // MSVC 2013 workarounds
 #if _MSC_VER <= 1800
-
 // noexcept is not understood 
-#ifndef GSL_THROWS_FOR_TESTING
-#define noexcept /* nothing */ 
-#endif
+#pragma push_macro("noexcept")
+#define noexcept  
 
 // turn off some misguided warnings
 #pragma warning(push)
@@ -45,11 +45,6 @@
 
 #endif // _MSC_VER
 
-// In order to test the library, we need it to throw exceptions that we can catch
-#ifdef GSL_THROWS_FOR_TESTING
-#define noexcept /* nothing */ 
-#endif // GSL_THROWS_FOR_TESTING 
-
 
 namespace gsl
 {
@@ -63,62 +58,6 @@ using std::shared_ptr;
 template <class T>
 using owner = T;
 
-//
-// GSL.assert: assertions
-//
-#define Expects(x)  gsl::fail_fast_assert((x))
-#define Ensures(x)  gsl::fail_fast_assert((x))
-
-//
-// GSL.util: utilities
-//
-
-// final_act allows you to ensure something gets run at the end of a scope
-template <class F>
-class final_act
-{
-public:
-    explicit final_act(F f) noexcept : f_(std::move(f)), invoke_(true) {}
-
-    final_act(final_act&& other) noexcept : f_(std::move(other.f_)), invoke_(other.invoke_) { other.invoke_ = false; }
-    final_act(const final_act&) = delete;
-    final_act& operator=(const final_act&) = delete;
-
-    ~final_act() noexcept { if (invoke_) f_(); }
-
-private:
-    F f_;
-    bool invoke_;
-};
-
-// finally() - convenience function to generate a final_act
-template <class F>
-final_act<F> finally(const F &f) noexcept { return final_act<F>(f); }
-
-template <class F>
-final_act<F> finally(F &&f) noexcept { return final_act<F>(std::forward<F>(f)); }
-
-// narrow_cast(): a searchable way to do narrowing casts of values
-template<class T, class U>
-T narrow_cast(U u) noexcept { return static_cast<T>(u); }
-
-struct narrowing_error : public std::exception {};
-// narrow() : a checked version of narrow_cast() that throws if the cast changed the value
-template<class T, class U>
-T narrow(U u) { T t = narrow_cast<T>(u); if (static_cast<U>(t) != u) throw narrowing_error(); return t; }
-
-//
-// at() - Bounds-checked way of accessing static arrays, std::array, std::vector
-//
-template <class T, size_t N>
-T& at(T(&arr)[N], size_t index) { fail_fast_assert(index < N); return arr[index]; }
-
-template <class T, size_t N>
-T& at(std::array<T, N>& arr, size_t index) { fail_fast_assert(index < N); return arr[index]; }
-
-template <class Cont>
-typename Cont::value_type& at(Cont& cont, size_t index) { fail_fast_assert(index < cont.size()); return cont[index]; }
-
 
 //
 // not_null
@@ -181,7 +120,7 @@ private:
 
     // we assume that the compiler can hoist/prove away most of the checks inlined from this function
     // if not, we could make them optional via conditional compilation
-    void ensure_invariant() const { fail_fast_assert(ptr_ != nullptr); }
+    void ensure_invariant() const { Expects(ptr_ != nullptr); }
 
     // unwanted operators...pointers only point to single objects!
     // TODO ensure all arithmetic ops on this type are unavailable
@@ -216,18 +155,14 @@ namespace std
 #pragma pop_macro("constexpr")
 
 #if _MSC_VER <= 1800
-#pragma warning(pop)
 
-#ifndef GSL_THROWS_FOR_TESTING
-#pragma undef noexcept
-#endif // GSL_THROWS_FOR_TESTING
+#undef noexcept
+#pragma pop_macro("noexcept")
+ 
+#pragma warning(pop)
 
 #endif // _MSC_VER <= 1800
 
 #endif // _MSC_VER
 
-#if defined(GSL_THROWS_FOR_TESTING) 
-#undef noexcept 
-#endif // GSL_THROWS_FOR_TESTING 
-
 #endif // GSL_GSL_H
diff --git a/include/gsl_assert.h b/include/gsl_assert.h
new file mode 100644
index 0000000..81cfd13
--- /dev/null
+++ b/include/gsl_assert.h
@@ -0,0 +1,78 @@
+/////////////////////////////////////////////////////////////////////////////// 
+// 
+// Copyright (c) 2015 Microsoft Corporation. All rights reserved. 
+// 
+// This code is licensed under the MIT License (MIT). 
+// 
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 
+// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 
+// THE SOFTWARE. 
+// 
+///////////////////////////////////////////////////////////////////////////////
+
+#pragma once
+
+#ifndef GSL_CONTRACTS_H
+#define GSL_CONTRACTS_H
+
+#include <exception>
+
+//
+// There are three configuration options for this GSL implementation's behavior
+// when pre/post conditions on the GSL types are violated:
+//
+// 1. GSL_TERMINATE_ON_CONTRACT_VIOLATION: std::terminate will be called (default)
+// 2. GSL_THROW_ON_CONTRACT_VIOLATION: a gsl::fail_fast exception will be thrown
+// 3. GSL_UNENFORCED_ON_CONTRACT_VIOLATION: nothing happens  
+//
+#if !(defined(GSL_THROW_ON_CONTRACT_VIOLATION) ^ defined(GSL_TERMINATE_ON_CONTRACT_VIOLATION) ^ defined(GSL_UNENFORCED_ON_CONTRACT_VIOLATION))
+#define GSL_TERMINATE_ON_CONTRACT_VIOLATION 
+#endif
+
+
+#define GSL_STRINGIFY_DETAIL(x) #x
+#define GSL_STRINGIFY(x) GSL_STRINGIFY_DETAIL(x)
+
+
+//
+// GSL.assert: assertions
+//
+
+#if defined(GSL_THROW_ON_CONTRACT_VIOLATION)
+
+#include <stdexcept>
+
+namespace gsl
+{
+struct fail_fast : public std::runtime_error 
+{
+	explicit fail_fast(char const* const message) : std::runtime_error(message) {}   
+};
+}
+
+#define Expects(cond)  if (!(cond)) \
+    throw gsl::fail_fast("GSL: Precondition failure at " __FILE__ ": " GSL_STRINGIFY(__LINE__));
+#define Ensures(cond)  if (!(cond)) \
+    throw gsl::fail_fast("GSL: Postcondition failure at " __FILE__ ": " GSL_STRINGIFY(__LINE__));
+
+
+#elif defined(GSL_TERMINATE_ON_CONTRACT_VIOLATION)
+
+
+#define Expects(cond)           if (!(cond)) std::terminate(); 
+#define Ensures(cond)           if (!(cond)) std::terminate();
+
+
+#elif defined(GSL_UNENFORCED_ON_CONTRACT_VIOLATION)
+
+#define Expects(cond)           
+#define Ensures(cond)           
+
+#endif 
+
+
+#endif // GSL_CONTRACTS_H
diff --git a/include/gsl_util.h b/include/gsl_util.h
new file mode 100644
index 0000000..e38868c
--- /dev/null
+++ b/include/gsl_util.h
@@ -0,0 +1,132 @@
+/////////////////////////////////////////////////////////////////////////////// 
+// 
+// Copyright (c) 2015 Microsoft Corporation. All rights reserved. 
+// 
+// This code is licensed under the MIT License (MIT). 
+// 
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 
+// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 
+// THE SOFTWARE. 
+// 
+///////////////////////////////////////////////////////////////////////////////
+
+#pragma once
+
+#ifndef GSL_UTIL_H
+#define GSL_UTIL_H
+
+#include "gsl_assert.h"  // Ensures/Expects
+#include <array>
+#include <utility>
+#include <exception>
+
+#ifdef _MSC_VER
+
+// No MSVC does constexpr fully yet
+#pragma push_macro("constexpr")
+#define constexpr 
+
+// MSVC 2013 workarounds
+#if _MSC_VER <= 1800
+// noexcept is not understood 
+#pragma push_macro("noexcept")
+#define noexcept  
+
+// turn off some misguided warnings
+#pragma warning(push)
+#pragma warning(disable: 4351) // warns about newly introduced aggregate initializer behavior
+
+#endif // _MSC_VER <= 1800
+
+#endif // _MSC_VER
+
+
+namespace gsl
+{
+//
+// GSL.util: utilities
+//
+
+// final_act allows you to ensure something gets run at the end of a scope
+template <class F>
+class final_act
+{
+public:
+    explicit final_act(F f) noexcept
+    : f_(std::move(f)), invoke_(true)
+    {}
+
+    final_act(final_act&& other) noexcept
+    : f_(std::move(other.f_)), invoke_(other.invoke_)
+    { other.invoke_ = false; }
+    
+    final_act(const final_act&) = delete;
+    final_act& operator=(const final_act&) = delete;
+
+    ~final_act() noexcept { if (invoke_) f_(); }
+
+private:
+    F f_;
+    bool invoke_;
+};
+
+// finally() - convenience function to generate a final_act
+template <class F>
+inline final_act<F> finally(const F &f)
+noexcept { return final_act<F>(f); }
+
+template <class F>
+inline final_act<F> finally(F &&f) noexcept
+{ return final_act<F>(std::forward<F>(f)); }
+
+// narrow_cast(): a searchable way to do narrowing casts of values
+template<class T, class U>
+inline constexpr T narrow_cast(U u) noexcept
+{ return static_cast<T>(u); }
+
+struct narrowing_error : public std::exception {};
+
+// narrow() : a checked version of narrow_cast() that throws if the cast changed the value
+template<class T, class U>
+inline T narrow(U u)
+{ T t = narrow_cast<T>(u); if (static_cast<U>(t) != u) throw narrowing_error(); return t; }
+
+//
+// at() - Bounds-checked way of accessing static arrays, std::array, std::vector
+//
+template <class T, size_t N> 
+constexpr T& at(T(&arr)[N], size_t index)
+{ Expects(index < N); return arr[index]; }
+
+template <class T, size_t N>
+constexpr T& at(std::array<T, N>& arr, size_t index)
+{ Expects(index < N); return arr[index]; }
+
+template <class Cont>
+constexpr typename Cont::value_type& at(Cont& cont, size_t index)
+{ Expects(index < cont.size()); return cont[index]; }
+
+} // namespace gsl
+
+
+#ifdef _MSC_VER
+
+#undef constexpr
+#pragma pop_macro("constexpr")
+
+#if _MSC_VER <= 1800
+
+#undef noexcept
+#pragma pop_macro("noexcept")
+ 
+#pragma warning(pop)
+
+#endif // _MSC_VER <= 1800
+
+#endif // _MSC_VER
+
+#endif // GSL_UTIL_H
diff --git a/include/span.h b/include/span.h
new file mode 100644
index 0000000..72d55d6
--- /dev/null
+++ b/include/span.h
@@ -0,0 +1,2224 @@
+///////////////////////////////////////////////////////////////////////////////
+//
+// Copyright (c) 2015 Microsoft Corporation. All rights reserved.
+//
+// This code is licensed under the MIT License (MIT).
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+// THE SOFTWARE.
+//
+///////////////////////////////////////////////////////////////////////////////
+
+#pragma once
+
+#ifndef GSL_SPAN_H
+#define GSL_SPAN_H
+
+#include "gsl_assert.h"
+#include "gsl_util.h"
+#include <algorithm>
+#include <array>
+#include <cassert>
+#include <cstddef>
+#include <cstdint>
+#include <functional>
+#include <iterator>
+#include <limits>
+#include <new>
+#include <numeric>
+#include <stdexcept>
+#include <type_traits>
+#include <utility>
+
+#ifdef _MSC_VER
+
+// turn off some warnings that are noisy about our Expects statements
+#pragma warning(push)
+#pragma warning(disable : 4127) // conditional expression is constant
+
+// No MSVC does constexpr fully yet
+#pragma push_macro("constexpr")
+#define constexpr
+
+// VS 2013 workarounds
+#if _MSC_VER <= 1800
+
+#define GSL_MSVC_HAS_VARIADIC_CTOR_BUG
+#define GSL_MSVC_NO_SUPPORT_FOR_MOVE_CTOR_DEFAULT
+
+// noexcept is not understood 
+#ifndef GSL_THROW_ON_CONTRACT_VIOLATION
+#pragma push_macro("noexcept")
+#define noexcept /* nothing */
+#endif
+
+// turn off some misguided warnings
+#pragma warning(push)
+#pragma warning(disable : 4351) // warns about newly introduced aggregate initializer behavior
+#pragma warning(disable : 4512) // warns that assignment op could not be generated
+
+#endif // _MSC_VER <= 1800
+
+#endif // _MSC_VER
+
+#ifdef GSL_THROW_ON_CONTRACT_VIOLATION
+
+#ifdef _MSC_VER
+#pragma push_macro("noexcept")
+#endif
+
+#define noexcept /* nothing */
+
+#endif // GSL_THROW_ON_CONTRACT_VIOLATION
+
+namespace gsl
+{
+
+/*
+** begin definitions of index and bounds
+*/
+namespace details
+{
+    template <typename SizeType>
+    struct SizeTypeTraits
+    {
+        static const SizeType max_value = std::numeric_limits<SizeType>::max();
+    };
+
+    template <typename... Ts>
+    class are_integral : public std::integral_constant<bool, true>
+    {
+    };
+
+    template <typename T, typename... Ts>
+    class are_integral<T, Ts...>
+        : public std::integral_constant<bool,
+                                        std::is_integral<T>::value && are_integral<Ts...>::value>
+    {
+    };
+}
+
+template <size_t Rank>
+class index final
+{
+    static_assert(Rank > 0, "Rank must be greater than 0!");
+
+    template <size_t OtherRank>
+    friend class index;
+
+public:
+    static const size_t rank = Rank;
+    using value_type = std::ptrdiff_t;
+    using size_type = value_type;
+    using reference = std::add_lvalue_reference_t<value_type>;
+    using const_reference = std::add_lvalue_reference_t<std::add_const_t<value_type>>;
+
+    constexpr index() noexcept {}
+
+    constexpr index(const value_type (&values)[Rank]) noexcept
+    {
+        std::copy(values, values + Rank, elems);
+    }
+
+#ifdef GSL_MSVC_HAS_VARIADIC_CTOR_BUG
+    template <
+        typename T, typename... Ts,
+        typename = std::enable_if_t<((sizeof...(Ts) + 1) == Rank) && std::is_integral<T>::value &&
+                                    details::are_integral<Ts...>::value>>
+    constexpr index(T t, Ts... ds)
+        : index({narrow_cast<value_type>(t), narrow_cast<value_type>(ds)...})
+    {
+    }
+#else
+    template <typename... Ts, typename = std::enable_if_t<(sizeof...(Ts) == Rank) &&
+                                                          details::are_integral<Ts...>::value>>
+    constexpr index(Ts... ds) noexcept : elems{narrow_cast<value_type>(ds)...}
+    {
+    }
+#endif
+
+    constexpr index(const index& other) noexcept = default;
+
+    constexpr index& operator=(const index& rhs) noexcept = default;
+
+    // Preconditions: component_idx < rank
+    constexpr reference operator[](size_t component_idx)
+    {
+        Expects(component_idx < Rank); // Component index must be less than rank
+        return elems[component_idx];
+    }
+
+    // Preconditions: component_idx < rank
+    constexpr const_reference operator[](size_t component_idx) const noexcept
+    {
+        Expects(component_idx < Rank); // Component index must be less than rank
+        return elems[component_idx];
+    }
+
+    constexpr bool operator==(const index& rhs) const noexcept
+    {
+        return std::equal(elems, elems + rank, rhs.elems);
+    }
+
+    constexpr bool operator!=(const index& rhs) const noexcept { return !(this == rhs); }
+
+    constexpr index operator+() const noexcept { return *this; }
+
+    constexpr index operator-() const noexcept
+    {
+        index ret = *this;
+        std::transform(ret, ret + rank, ret, std::negate<value_type>{});
+        return ret;
+    }
+
+    constexpr index operator+(const index& rhs) const noexcept
+    {
+        index ret = *this;
+        ret += rhs;
+        return ret;
+    }
+
+    constexpr index operator-(const index& rhs) const noexcept
+    {
+        index ret = *this;
+        ret -= rhs;
+        return ret;
+    }
+
+    constexpr index& operator+=(const index& rhs) noexcept
+    {
+        std::transform(elems, elems + rank, rhs.elems, elems, std::plus<value_type>{});
+        return *this;
+    }
+
+    constexpr index& operator-=(const index& rhs) noexcept
+    {
+        std::transform(elems, elems + rank, rhs.elems, elems, std::minus<value_type>{});
+        return *this;
+    }
+
+    constexpr index operator*(value_type v) const noexcept
+    {
+        index ret = *this;
+        ret *= v;
+        return ret;
+    }
+
+    constexpr index operator/(value_type v) const noexcept
+    {
+        index ret = *this;
+        ret /= v;
+        return ret;
+    }
+
+    friend constexpr index operator*(value_type v, const index& rhs) noexcept
+    {
+        return rhs * v;
+    }
+
+    constexpr index& operator*=(value_type v) noexcept
+    {
+        std::transform(elems, elems + rank, elems,
+                       [v](value_type x) { return std::multiplies<value_type>{}(x, v); });
+        return *this;
+    }
+
+    constexpr index& operator/=(value_type v) noexcept
+    {
+        std::transform(elems, elems + rank, elems,
+                       [v](value_type x) { return std::divides<value_type>{}(x, v); });
+        return *this;
+    }
+
+private:
+    value_type elems[Rank] = {};
+};
+
+#ifndef _MSC_VER
+
+struct static_bounds_dynamic_range_t
+{
+    template <typename T, typename Dummy = std::enable_if_t<std::is_integral<T>::value>>
+    constexpr operator T() const noexcept
+    {
+        return narrow_cast<T>(-1);
+    }
+
+    template <typename T, typename Dummy = std::enable_if_t<std::is_integral<T>::value>>
+    constexpr bool operator==(T other) const noexcept
+    {
+        return narrow_cast<T>(-1) == other;
+    }
+
+    template <typename T, typename Dummy = std::enable_if_t<std::is_integral<T>::value>>
+    constexpr bool operator!=(T other) const noexcept
+    {
+        return narrow_cast<T>(-1) != other;
+    }
+};
+
+template <typename T, typename Dummy = std::enable_if_t<std::is_integral<T>::value>>
+constexpr bool operator==(T left, static_bounds_dynamic_range_t right) noexcept
+{
+    return right == left;
+}
+
+template <typename T, typename Dummy = std::enable_if_t<std::is_integral<T>::value>>
+constexpr bool operator!=(T left, static_bounds_dynamic_range_t right) noexcept
+{
+    return right != left;
+}
+
+constexpr static_bounds_dynamic_range_t dynamic_range{};
+#else
+const std::ptrdiff_t dynamic_range = -1;
+#endif
+
+struct generalized_mapping_tag
+{
+};
+struct contiguous_mapping_tag : generalized_mapping_tag
+{
+};
+
+namespace details
+{
+
+    template <std::ptrdiff_t Left, std::ptrdiff_t Right>
+    struct LessThan
+    {
+        static const bool value = Left < Right;
+    };
+
+    template <std::ptrdiff_t... Ranges>
+    struct BoundsRanges
+    {
+        using size_type = std::ptrdiff_t;
+        static const size_type Depth = 0;
+        static const size_type DynamicNum = 0;
+        static const size_type CurrentRange = 1;
+        static const size_type TotalSize = 1;
+
+        // TODO : following signature is for work around VS bug
+        template <typename OtherRange>
+        BoundsRanges(const OtherRange&, bool /* firstLevel */)
+        {
+        }
+
+        BoundsRanges(const BoundsRanges&) = default;
+        BoundsRanges& operator=(const BoundsRanges&) = default;
+        BoundsRanges(const std::ptrdiff_t* const) {}
+        BoundsRanges() = default;
+
+        template <typename T, size_t Dim>
+        void serialize(T&) const
+        {
+        }
+
+        template <typename T, size_t Dim>
+        size_type linearize(const T&) const
+        {
+            return 0;
+        }
+
+        template <typename T, size_t Dim>
+        size_type contains(const T&) const
+        {
+            return -1;
+        }
+
+        size_type elementNum(size_t) const noexcept { return 0; }
+
+        size_type totalSize() const noexcept { return TotalSize; }
+
+        bool operator==(const BoundsRanges&) const noexcept { return true; }
+    };
+
+    template <std::ptrdiff_t... RestRanges>
+    struct BoundsRanges<dynamic_range, RestRanges...> : BoundsRanges<RestRanges...>
+    {
+        using Base = BoundsRanges<RestRanges...>;
+        using size_type = std::ptrdiff_t;
+        static const size_t Depth = Base::Depth + 1;
+        static const size_t DynamicNum = Base::DynamicNum + 1;
+        static const size_type CurrentRange = dynamic_range;
+        static const size_type TotalSize = dynamic_range;
+        const size_type m_bound;
+
+        BoundsRanges(const BoundsRanges&) = default;
+
+        BoundsRanges(const std::ptrdiff_t* const arr)
+            : Base(arr + 1), m_bound(*arr * this->Base::totalSize())
+        {
+            Expects(0 <= *arr);
+        }
+
+        BoundsRanges() : m_bound(0) {}
+
+        template <std::ptrdiff_t OtherRange, std::ptrdiff_t... RestOtherRanges>
+        BoundsRanges(const BoundsRanges<OtherRange, RestOtherRanges...>& other,
+                     bool /* firstLevel */ = true)
+            : Base(static_cast<const BoundsRanges<RestOtherRanges...>&>(other), false)
+            , m_bound(other.totalSize())
+        {
+        }
+
+        template <typename T, size_t Dim = 0>
+        void serialize(T& arr) const
+        {
+            arr[Dim] = elementNum();
+            this->Base::template serialize<T, Dim + 1>(arr);
+        }
+
+        template <typename T, size_t Dim = 0>
+        size_type linearize(const T& arr) const
+        {
+            const size_type index = this->Base::totalSize() * arr[Dim];
+            Expects(index < m_bound);
+            return index + this->Base::template linearize<T, Dim + 1>(arr);
+        }
+
+        template <typename T, size_t Dim = 0>
+        size_type contains(const T& arr) const
+        {
+            const ptrdiff_t last = this->Base::template contains<T, Dim + 1>(arr);
+            if (last == -1) return -1;
+            const ptrdiff_t cur = this->Base::totalSize() * arr[Dim];
+            return cur < m_bound ? cur + last : -1;
+        }
+
+        size_type totalSize() const noexcept { return m_bound; }
+
+        size_type elementNum() const noexcept { return totalSize() / this->Base::totalSize(); }
+
+        size_type elementNum(size_t dim) const noexcept
+        {
+            if (dim > 0)
+                return this->Base::elementNum(dim - 1);
+            else
+                return elementNum();
+        }
+
+        bool operator==(const BoundsRanges& rhs) const noexcept
+        {
+            return m_bound == rhs.m_bound &&
+                   static_cast<const Base&>(*this) == static_cast<const Base&>(rhs);
+        }
+    };
+
+    template <std::ptrdiff_t CurRange, std::ptrdiff_t... RestRanges>
+    struct BoundsRanges<CurRange, RestRanges...> : BoundsRanges<RestRanges...>
+    {
+        using Base = BoundsRanges<RestRanges...>;
+        using size_type = std::ptrdiff_t;
+        static const size_t Depth = Base::Depth + 1;
+        static const size_t DynamicNum = Base::DynamicNum;
+        static const size_type CurrentRange = CurRange;
+        static const size_type TotalSize =
+            Base::TotalSize == dynamic_range ? dynamic_range : CurrentRange * Base::TotalSize;
+
+        BoundsRanges(const BoundsRanges&) = default;
+
+        BoundsRanges(const std::ptrdiff_t* const arr) : Base(arr) {}
+        BoundsRanges() = default;
+
+        template <std::ptrdiff_t OtherRange, std::ptrdiff_t... RestOtherRanges>
+        BoundsRanges(const BoundsRanges<OtherRange, RestOtherRanges...>& other,
+                     bool firstLevel = true)
+            : Base(static_cast<const BoundsRanges<RestOtherRanges...>&>(other), false)
+        {
+            (void) firstLevel;
+        }
+
+        template <typename T, size_t Dim = 0>
+        void serialize(T& arr) const
+        {
+            arr[Dim] = elementNum();
+            this->Base::template serialize<T, Dim + 1>(arr);
+        }
+
+        template <typename T, size_t Dim = 0>
+        size_type linearize(const T& arr) const
+        {
+            Expects(arr[Dim] < CurrentRange); // Index is out of range
+            return this->Base::totalSize() * arr[Dim] +
+                   this->Base::template linearize<T, Dim + 1>(arr);
+        }
+
+        template <typename T, size_t Dim = 0>
+        size_type contains(const T& arr) const
+        {
+            if (arr[Dim] >= CurrentRange) return -1;
+            const size_type last = this->Base::template contains<T, Dim + 1>(arr);
+            if (last == -1) return -1;
+            return this->Base::totalSize() * arr[Dim] + last;
+        }
+
+        size_type totalSize() const noexcept { return CurrentRange * this->Base::totalSize(); }
+
+        size_type elementNum() const noexcept { return CurrentRange; }
+
+        size_type elementNum(size_t dim) const noexcept
+        {
+            if (dim > 0)
+                return this->Base::elementNum(dim - 1);
+            else
+                return elementNum();
+        }
+
+        bool operator==(const BoundsRanges& rhs) const noexcept
+        {
+            return static_cast<const Base&>(*this) == static_cast<const Base&>(rhs);
+        }
+    };
+
+    template <typename SourceType, typename TargetType>
+    struct BoundsRangeConvertible
+        : public std::integral_constant<bool, (SourceType::TotalSize >= TargetType::TotalSize ||
+                                               TargetType::TotalSize == dynamic_range ||
+                                               SourceType::TotalSize == dynamic_range ||
+                                               TargetType::TotalSize == 0)>
+    {
+    };
+
+    template <typename TypeChain>
+    struct TypeListIndexer
+    {
+        const TypeChain& obj_;
+        TypeListIndexer(const TypeChain& obj) : obj_(obj) {}
+
+        template <size_t N>
+        const TypeChain& getObj(std::true_type)
+        {
+            return obj_;
+        }
+
+        template <size_t N, typename MyChain = TypeChain, typename MyBase = typename MyChain::Base>
+        auto getObj(std::false_type)
+            -> decltype(TypeListIndexer<MyBase>(static_cast<const MyBase&>(obj_)).template get<N>())
+        {
+            return TypeListIndexer<MyBase>(static_cast<const MyBase&>(obj_)).template get<N>();
+        }
+
+        template <size_t N>
+        auto get() -> decltype(getObj<N - 1>(std::integral_constant<bool, N == 0>()))
+        {
+            return getObj<N - 1>(std::integral_constant<bool, N == 0>());
+        }
+    };
+
+    template <typename TypeChain>
+    TypeListIndexer<TypeChain> createTypeListIndexer(const TypeChain& obj)
+    {
+        return TypeListIndexer<TypeChain>(obj);
+    }
+
+    template <size_t Rank, bool Enabled = (Rank > 1),
+              typename Ret = std::enable_if_t<Enabled, index<Rank - 1>>>
+    constexpr Ret shift_left(const index<Rank>& other) noexcept
+    {
+        Ret ret{};
+        for (size_t i = 0; i < Rank - 1; ++i) {
+            ret[i] = other[i + 1];
+        }
+        return ret;
+    }
+}
+
+template <typename IndexType>
+class bounds_iterator;
+
+template <std::ptrdiff_t... Ranges>
+class static_bounds
+{
+public:
+    static_bounds(const details::BoundsRanges<Ranges...>&) {}
+};
+
+template <std::ptrdiff_t FirstRange, std::ptrdiff_t... RestRanges>
+class static_bounds<FirstRange, RestRanges...>
+{
+    using MyRanges = details::BoundsRanges<FirstRange, RestRanges...>;
+
+    MyRanges m_ranges;
+    constexpr static_bounds(const MyRanges& range) : m_ranges(range) {}
+
+    template <std::ptrdiff_t... OtherRanges>
+    friend class static_bounds;
+
+public:
+    static const size_t rank = MyRanges::Depth;
+    static const size_t dynamic_rank = MyRanges::DynamicNum;
+    static const std::ptrdiff_t static_size = MyRanges::TotalSize;
+
+    using size_type = std::ptrdiff_t;
+    using index_type = index<rank>;
+    using const_index_type = std::add_const_t<index_type>;
+    using iterator = bounds_iterator<const_index_type>;
+    using const_iterator = bounds_iterator<const_index_type>;
+    using difference_type = std::ptrdiff_t;
+    using sliced_type = static_bounds<RestRanges...>;
+    using mapping_type = contiguous_mapping_tag;
+
+    constexpr static_bounds(const static_bounds&) = default;
+
+    template <typename SourceType, typename TargetType, size_t Rank>
+    struct BoundsRangeConvertible2;
+
+    template <size_t Rank, typename SourceType, typename TargetType,
+              typename Ret = BoundsRangeConvertible2<typename SourceType::Base,
+                                                     typename TargetType::Base, Rank>>
+    static auto helpBoundsRangeConvertible(SourceType, TargetType, std::true_type) -> Ret;
+
+    template <size_t Rank, typename SourceType, typename TargetType>
+    static auto helpBoundsRangeConvertible(SourceType, TargetType, ...) -> std::false_type;
+
+    template <typename SourceType, typename TargetType, size_t Rank>
+    struct BoundsRangeConvertible2
+        : decltype(helpBoundsRangeConvertible<Rank - 1>(
+              SourceType(), TargetType(),
+              std::integral_constant<bool,
+                                     SourceType::Depth == TargetType::Depth &&
+                                         (SourceType::CurrentRange == TargetType::CurrentRange ||
+                                          TargetType::CurrentRange == dynamic_range ||
+                                          SourceType::CurrentRange == dynamic_range)>()))
+    {
+    };
+
+    template <typename SourceType, typename TargetType>
+    struct BoundsRangeConvertible2<SourceType, TargetType, 0> : std::true_type
+    {
+    };
+
+    template <typename SourceType, typename TargetType, std::ptrdiff_t Rank = TargetType::Depth>
+    struct BoundsRangeConvertible
+        : decltype(helpBoundsRangeConvertible<Rank - 1>(
+              SourceType(), TargetType(),
+              std::integral_constant<bool,
+                                     SourceType::Depth == TargetType::Depth &&
+                                         (!details::LessThan<SourceType::CurrentRange,
+                                                             TargetType::CurrentRange>::value ||
+                                          TargetType::CurrentRange == dynamic_range ||
+                                          SourceType::CurrentRange == dynamic_range)>()))
+    {
+    };
+
+    template <typename SourceType, typename TargetType>
+    struct BoundsRangeConvertible<SourceType, TargetType, 0> : std::true_type
+    {
+    };
+
+    template <std::ptrdiff_t... Ranges,
+              typename = std::enable_if_t<details::BoundsRangeConvertible<
+                  details::BoundsRanges<Ranges...>,
+                  details::BoundsRanges<FirstRange, RestRanges...>>::value>>
+    constexpr static_bounds(const static_bounds<Ranges...>& other) : m_ranges(other.m_ranges)
+    {
+        Expects((MyRanges::DynamicNum == 0 && details::BoundsRanges<Ranges...>::DynamicNum == 0) ||
+                MyRanges::DynamicNum > 0 || other.m_ranges.totalSize() >= m_ranges.totalSize());
+    }
+
+    constexpr static_bounds(std::initializer_list<size_type> il)
+        : m_ranges(static_cast<const std::ptrdiff_t*>(il.begin()))
+    {
+        // Size of the initializer list must match the rank of the array
+        Expects((MyRanges::DynamicNum == 0 && il.size() == 1 && *il.begin() == static_size) ||
+                MyRanges::DynamicNum == il.size());
+        // Size of the range must be less than the max element of the size type
+        Expects(m_ranges.totalSize() <= PTRDIFF_MAX);
+    }
+
+    constexpr static_bounds() = default;
+
+    constexpr static_bounds& operator=(const static_bounds& otherBounds)
+    {
+        new (&m_ranges) MyRanges(otherBounds.m_ranges);
+        return *this;
+    }
+
+    constexpr sliced_type slice() const noexcept
+    {
+        return sliced_type{static_cast<const details::BoundsRanges<RestRanges...>&>(m_ranges)};
+    }
+
+    constexpr size_type stride() const noexcept { return rank > 1 ? slice().size() : 1; }
+
+    constexpr size_type size() const noexcept { return m_ranges.totalSize(); }
+
+    constexpr size_type total_size() const noexcept { return m_ranges.totalSize(); }
+
+    constexpr size_type linearize(const index_type& idx) const { return m_ranges.linearize(idx); }
+
+    constexpr bool contains(const index_type& idx) const noexcept
+    {
+        return m_ranges.contains(idx) != -1;
+    }
+
+    constexpr size_type operator[](size_t index) const noexcept
+    {
+        return m_ranges.elementNum(index);
+    }
+
+    template <size_t Dim = 0>
+    constexpr size_type extent() const noexcept
+    {
+        static_assert(Dim < rank,
+                      "dimension should be less than rank (dimension count starts from 0)");
+        return details::createTypeListIndexer(m_ranges).template get<Dim>().elementNum();
+    }
+
+    template <typename IntType>
+    constexpr size_type extent(IntType dim) const noexcept
+    {
+        static_assert(std::is_integral<IntType>::value,
+                      "Dimension parameter must be supplied as an integral type.");
+        auto real_dim = narrow_cast<size_t>(dim);
+        Expects(real_dim < rank);
+
+        return m_ranges.elementNum(real_dim);
+    }
+
+    constexpr index_type index_bounds() const noexcept
+    {
+        size_type extents[rank] = {};
+        m_ranges.serialize(extents);
+        return {extents};
+    }
+
+    template <std::ptrdiff_t... Ranges>
+    constexpr bool operator==(const static_bounds<Ranges...>& rhs) const noexcept
+    {
+        return this->size() == rhs.size();
+    }
+
+    template <std::ptrdiff_t... Ranges>
+    constexpr bool operator!=(const static_bounds<Ranges...>& rhs) const noexcept
+    {
+        return !(*this == rhs);
+    }
+
+    constexpr const_iterator begin() const noexcept { return const_iterator(*this, index_type{}); }
+
+    constexpr const_iterator end() const noexcept
+    {
+        return const_iterator(*this, this->index_bounds());
+    }
+};
+
+template <size_t Rank>
+class strided_bounds
+{
+    template <size_t OtherRank>
+    friend class strided_bounds;
+
+public:
+    static const size_t rank = Rank;
+    using value_type = std::ptrdiff_t;
+    using reference = std::add_lvalue_reference_t<value_type>;
+    using const_reference = std::add_const_t<reference>;
+    using size_type = value_type;
+    using difference_type = value_type;
+    using index_type = index<rank>;
+    using const_index_type = std::add_const_t<index_type>;
+    using iterator = bounds_iterator<const_index_type>;
+    using const_iterator = bounds_iterator<const_index_type>;
+    static const value_type dynamic_rank = rank;
+    static const value_type static_size = dynamic_range;
+    using sliced_type = std::conditional_t<rank != 0, strided_bounds<rank - 1>, void>;
+    using mapping_type = generalized_mapping_tag;
+
+    constexpr strided_bounds(const strided_bounds&) noexcept = default;
+
+    constexpr strided_bounds& operator=(const strided_bounds&) noexcept = default;
+
+    constexpr strided_bounds(const value_type (&values)[rank], index_type strides)
+        : m_extents(values), m_strides(std::move(strides))
+    {
+    }
+
+    constexpr strided_bounds(const index_type& extents, const index_type& strides) noexcept
+        : m_extents(extents),
+          m_strides(strides)
+    {
+    }
+
+    constexpr index_type strides() const noexcept { return m_strides; }
+
+    constexpr size_type total_size() const noexcept
+    {
+        size_type ret = 0;
+        for (size_t i = 0; i < rank; ++i) {
+            ret += (m_extents[i] - 1) * m_strides[i];
+        }
+        return ret + 1;
+    }
+
+    constexpr size_type size() const noexcept
+    {
+        size_type ret = 1;
+        for (size_t i = 0; i < rank; ++i) {
+            ret *= m_extents[i];
+        }
+        return ret;
+    }
+
+    constexpr bool contains(const index_type& idx) const noexcept
+    {
+        for (size_t i = 0; i < rank; ++i) {
+            if (idx[i] < 0 || idx[i] >= m_extents[i]) return false;
+        }
+        return true;
+    }
+
+    constexpr size_type linearize(const index_type& idx) const noexcept
+    {
+        size_type ret = 0;
+        for (size_t i = 0; i < rank; i++) {
+            Expects(idx[i] < m_extents[i]); // index is out of bounds of the array
+            ret += idx[i] * m_strides[i];
+        }
+        return ret;
+    }
+
+    constexpr size_type stride() const noexcept { return m_strides[0]; }
+
+    template <bool Enabled = (rank > 1), typename Ret = std::enable_if_t<Enabled, sliced_type>>
+    constexpr sliced_type slice() const
+    {
+        return {details::shift_left(m_extents), details::shift_left(m_strides)};
+    }
+
+    template <size_t Dim = 0>
+    constexpr size_type extent() const noexcept
+    {
+        static_assert(Dim < Rank,
+                      "dimension should be less than rank (dimension count starts from 0)");
+        return m_extents[Dim];
+    }
+
+    constexpr index_type index_bounds() const noexcept { return m_extents; }
+    constexpr const_iterator begin() const noexcept { return const_iterator{*this, index_type{}}; }
+
+    constexpr const_iterator end() const noexcept { return const_iterator{*this, index_bounds()}; }
+
+private:
+    index_type m_extents;
+    index_type m_strides;
+};
+
+template <typename T>
+struct is_bounds : std::integral_constant<bool, false>
+{
+};
+template <std::ptrdiff_t... Ranges>
+struct is_bounds<static_bounds<Ranges...>> : std::integral_constant<bool, true>
+{
+};
+template <size_t Rank>
+struct is_bounds<strided_bounds<Rank>> : std::integral_constant<bool, true>
+{
+};
+
+template <typename IndexType>
+class bounds_iterator : public std::iterator<std::random_access_iterator_tag, IndexType>
+{
+private:
+    using Base = std::iterator<std::random_access_iterator_tag, IndexType>;
+
+public:
+    static const size_t rank = IndexType::rank;
+    using typename Base::reference;
+    using typename Base::pointer;
+    using typename Base::difference_type;
+    using typename Base::value_type;
+    using index_type = value_type;
+    using index_size_type = typename IndexType::value_type;
+    template <typename Bounds>
+    explicit bounds_iterator(const Bounds& bnd, value_type curr) noexcept
+        : boundary_(bnd.index_bounds()),
+          curr_(std::move(curr))
+    {
+        static_assert(is_bounds<Bounds>::value, "Bounds type must be provided");
+    }
+
+    constexpr reference operator*() const noexcept { return curr_; }
+
+    constexpr pointer operator->() const noexcept { return &curr_; }
+
+    constexpr bounds_iterator& operator++() noexcept
+    {
+        for (size_t i = rank; i-- > 0;) {
+            if (curr_[i] < boundary_[i] - 1) {
+                curr_[i]++;
+                return *this;
+            }
+            curr_[i] = 0;
+        }
+        // If we're here we've wrapped over - set to past-the-end.
+        curr_ = boundary_;
+        return *this;
+    }
+
+    constexpr bounds_iterator operator++(int) noexcept
+    {
+        auto ret = *this;
+        ++(*this);
+        return ret;
+    }
+
+    constexpr bounds_iterator& operator--() noexcept
+    {
+        if (!less(curr_, boundary_)) {
+            // if at the past-the-end, set to last element
+            for (size_t i = 0; i < rank; ++i) {
+                curr_[i] = boundary_[i] - 1;
+            }
+            return *this;
+        }
+        for (size_t i = rank; i-- > 0;) {
+            if (curr_[i] >= 1) {
+                curr_[i]--;
+                return *this;
+            }
+            curr_[i] = boundary_[i] - 1;
+        }
+        // If we're here the preconditions were violated
+        // "pre: there exists s such that r == ++s"
+        Expects(false);
+        return *this;
+    }
+
+    constexpr bounds_iterator operator--(int) noexcept
+    {
+        auto ret = *this;
+        --(*this);
+        return ret;
+    }
+
+    constexpr bounds_iterator operator+(difference_type n) const noexcept
+    {
+        bounds_iterator ret{*this};
+        return ret += n;
+    }
+
+    constexpr bounds_iterator& operator+=(difference_type n) noexcept
+    {
+        auto linear_idx = linearize(curr_) + n;
+        std::remove_const_t<value_type> stride = 0;
+        stride[rank - 1] = 1;
+        for (size_t i = rank - 1; i-- > 0;) {
+            stride[i] = stride[i + 1] * boundary_[i + 1];
+        }
+        for (size_t i = 0; i < rank; ++i) {
+            curr_[i] = linear_idx / stride[i];
+            linear_idx = linear_idx % stride[i];
+        }
+        // index is out of bounds of the array
+        Expects(!less(curr_, index_type{}) && !less(boundary_, curr_));
+        return *this;
+    }
+
+    constexpr bounds_iterator operator-(difference_type n) const noexcept
+    {
+        bounds_iterator ret{*this};
+        return ret -= n;
+    }
+
+    constexpr bounds_iterator& operator-=(difference_type n) noexcept { return * this += -n; }
+
+    constexpr difference_type operator-(const bounds_iterator& rhs) const noexcept
+    {
+        return linearize(curr_) - linearize(rhs.curr_);
+    }
+
+    constexpr value_type operator[](difference_type n) const noexcept { return *(*this + n); }
+
+    constexpr bool operator==(const bounds_iterator& rhs) const noexcept
+    {
+        return curr_ == rhs.curr_;
+    }
+
+    constexpr bool operator!=(const bounds_iterator& rhs) const noexcept { return !(*this == rhs); }
+
+    constexpr bool operator<(const bounds_iterator& rhs) const noexcept
+    {
+        return less(curr_, rhs.curr_);
+    }
+
+    constexpr bool operator<=(const bounds_iterator& rhs) const noexcept { return !(rhs < *this); }
+
+    constexpr bool operator>(const bounds_iterator& rhs) const noexcept { return rhs < *this; }
+
+    constexpr bool operator>=(const bounds_iterator& rhs) const noexcept { return !(rhs > *this); }
+
+    void swap(bounds_iterator& rhs) noexcept
+    {
+        std::swap(boundary_, rhs.boundary_);
+        std::swap(curr_, rhs.curr_);
+    }
+
+private:
+    constexpr bool less(index_type& one, index_type& other) const noexcept
+    {
+        for (size_t i = 0; i < rank; ++i) {
+            if (one[i] < other[i]) return true;
+        }
+        return false;
+    }
+
+    constexpr index_size_type linearize(const value_type& idx) const noexcept
+    {
+        // TODO: Smarter impl.
+        // Check if past-the-end
+        index_size_type multiplier = 1;
+        index_size_type res = 0;
+        if (!less(idx, boundary_)) {
+            res = 1;
+            for (size_t i = rank; i-- > 0;) {
+                res += (idx[i] - 1) * multiplier;
+                multiplier *= boundary_[i];
+            }
+        }
+        else
+        {
+            for (size_t i = rank; i-- > 0;) {
+                res += idx[i] * multiplier;
+                multiplier *= boundary_[i];
+            }
+        }
+        return res;
+    }
+
+    value_type boundary_;
+    std::remove_const_t<value_type> curr_;
+};
+
+template <typename IndexType>
+bounds_iterator<IndexType> operator+(typename bounds_iterator<IndexType>::difference_type n,
+                                     const bounds_iterator<IndexType>& rhs) noexcept
+{
+    return rhs + n;
+}
+
+namespace details
+{
+    template <typename Bounds>
+    constexpr std::enable_if_t<
+        std::is_same<typename Bounds::mapping_type, generalized_mapping_tag>::value,
+        typename Bounds::index_type>
+    make_stride(const Bounds& bnd) noexcept
+    {
+        return bnd.strides();
+    }
+
+    // Make a stride vector from bounds, assuming contiguous memory.
+    template <typename Bounds>
+    constexpr std::enable_if_t<
+        std::is_same<typename Bounds::mapping_type, contiguous_mapping_tag>::value,
+        typename Bounds::index_type>
+    make_stride(const Bounds& bnd) noexcept
+    {
+        auto extents = bnd.index_bounds();
+        typename Bounds::size_type stride[Bounds::rank] = {};
+
+        stride[Bounds::rank - 1] = 1;
+        for (size_t i = 1; i < Bounds::rank; ++i) {
+            stride[Bounds::rank - i - 1] = stride[Bounds::rank - i] * extents[Bounds::rank - i];
+        }
+        return {stride};
+    }
+
+    template <typename BoundsSrc, typename BoundsDest>
+    void verifyBoundsReshape(const BoundsSrc& src, const BoundsDest& dest)
+    {
+        static_assert(is_bounds<BoundsSrc>::value && is_bounds<BoundsDest>::value,
+                      "The src type and dest type must be bounds");
+        static_assert(std::is_same<typename BoundsSrc::mapping_type, contiguous_mapping_tag>::value,
+                      "The source type must be a contiguous bounds");
+        static_assert(BoundsDest::static_size == dynamic_range ||
+                          BoundsSrc::static_size == dynamic_range ||
+                          BoundsDest::static_size == BoundsSrc::static_size,
+                      "The source bounds must have same size as dest bounds");
+        Expects(src.size() == dest.size());
+    }
+
+} // namespace details
+
+template <typename Span>
+class contiguous_span_iterator;
+template <typename Span>
+class general_span_iterator;
+enum class byte : std::uint8_t
+{
+};
+
+template <std::ptrdiff_t DimSize = dynamic_range>
+struct dim
+{
+    static const std::ptrdiff_t value = DimSize;
+};
+template <>
+struct dim<dynamic_range>
+{
+    static const std::ptrdiff_t value = dynamic_range;
+    const std::ptrdiff_t dvalue;
+    dim(std::ptrdiff_t size) : dvalue(size) {}
+};
+
+template <typename ValueType, std::ptrdiff_t FirstDimension = dynamic_range,
+          std::ptrdiff_t... RestDimensions>
+class span;
+
+template <typename ValueType, size_t Rank>
+class strided_span;
+
+namespace details
+{
+    template <typename T, typename = std::true_type>
+    struct SpanTypeTraits
+    {
+        using value_type = T;
+        using size_type = size_t;
+    };
+
+    template <typename Traits>
+    struct SpanTypeTraits<Traits, typename std::is_reference<typename Traits::span_traits&>::type>
+    {
+        using value_type = typename Traits::span_traits::value_type;
+        using size_type = typename Traits::span_traits::size_type;
+    };
+
+    template <typename T, std::ptrdiff_t... Ranks>
+    struct SpanArrayTraits
+    {
+        using type = span<T, Ranks...>;
+        using value_type = T;
+        using bounds_type = static_bounds<Ranks...>;
+        using pointer = T*;
+        using reference = T&;
+    };
+    template <typename T, std::ptrdiff_t N, std::ptrdiff_t... Ranks>
+    struct SpanArrayTraits<T[N], Ranks...> : SpanArrayTraits<T, Ranks..., N>
+    {
+    };
+
+    template <typename BoundsType>
+    BoundsType newBoundsHelperImpl(std::ptrdiff_t totalSize, std::true_type) // dynamic size
+    {
+        Expects(totalSize >= 0 && totalSize <= PTRDIFF_MAX);
+        return BoundsType{totalSize};
+    }
+    template <typename BoundsType>
+    BoundsType newBoundsHelperImpl(std::ptrdiff_t totalSize, std::false_type) // static size
+    {
+        Expects(BoundsType::static_size <= totalSize);
+        return {};
+    }
+    template <typename BoundsType>
+    BoundsType newBoundsHelper(std::ptrdiff_t totalSize)
+    {
+        static_assert(BoundsType::dynamic_rank <= 1, "dynamic rank must less or equal to 1");
+        return newBoundsHelperImpl<BoundsType>(
+            totalSize, std::integral_constant<bool, BoundsType::dynamic_rank == 1>());
+    }
+
+    struct Sep
+    {
+    };
+
+    template <typename T, typename... Args>
+    T static_as_span_helper(Sep, Args... args)
+    {
+        return T{narrow_cast<typename T::size_type>(args)...};
+    }
+    template <typename T, typename Arg, typename... Args>
+    std::enable_if_t<
+        !std::is_same<Arg, dim<dynamic_range>>::value && !std::is_same<Arg, Sep>::value, T>
+        static_as_span_helper(Arg, Args... args)
+    {
+        return static_as_span_helper<T>(args...);
+    }
+    template <typename T, typename... Args>
+    T static_as_span_helper(dim<dynamic_range> val, Args... args)
+    {
+        return static_as_span_helper<T>(args..., val.dvalue);
+    }
+
+    template <typename... Dimensions>
+    struct static_as_span_static_bounds_helper
+    {
+        using type = static_bounds<(Dimensions::value)...>;
+    };
+
+    template <typename T>
+    struct is_span_oracle : std::false_type
+    {
+    };
+
+    template <typename ValueType, std::ptrdiff_t FirstDimension, std::ptrdiff_t... RestDimensions>
+    struct is_span_oracle<span<ValueType, FirstDimension, RestDimensions...>> : std::true_type
+    {
+    };
+
+    template <typename ValueType, std::ptrdiff_t Rank>
+    struct is_span_oracle<strided_span<ValueType, Rank>> : std::true_type
+    {
+    };
+
+    template <typename T>
+    struct is_span : is_span_oracle<std::remove_cv_t<T>>
+    {
+    };
+}
+
+template <typename ValueType, std::ptrdiff_t FirstDimension, std::ptrdiff_t... RestDimensions>
+class span
+{
+    // TODO do we still need this?
+    template <typename ValueType2, std::ptrdiff_t FirstDimension2,
+              std::ptrdiff_t... RestDimensions2>
+    friend class span;
+
+public:
+    using bounds_type = static_bounds<FirstDimension, RestDimensions...>;
+    static const size_t Rank = bounds_type::rank;
+    using size_type = typename bounds_type::size_type;
+    using index_type = typename bounds_type::index_type;
+    using value_type = ValueType;
+    using const_value_type = std::add_const_t<value_type>;
+    using pointer = std::add_pointer_t<value_type>;
+    using reference = std::add_lvalue_reference_t<value_type>;
+    using iterator = contiguous_span_iterator<span>;
+    using const_span = span<const_value_type, FirstDimension, RestDimensions...>;
+    using const_iterator = contiguous_span_iterator<const_span>;
+    using reverse_iterator = std::reverse_iterator<iterator>;
+    using const_reverse_iterator = std::reverse_iterator<const_iterator>;
+    using sliced_type =
+        std::conditional_t<Rank == 1, value_type, span<value_type, RestDimensions...>>;
+
+private:
+    pointer data_;
+    bounds_type bounds_;
+
+    friend iterator;
+    friend const_iterator;
+
+public:
+    // default constructor - same as constructing from nullptr_t
+    constexpr span() noexcept : span(nullptr, bounds_type{})
+    {
+        static_assert(bounds_type::dynamic_rank != 0 ||
+                          (bounds_type::dynamic_rank == 0 && bounds_type::static_size == 0),
+                      "Default construction of span<T> only possible "
+                      "for dynamic or fixed, zero-length spans.");
+    }
+
+    // construct from nullptr - get an empty span
+    constexpr span(std::nullptr_t) noexcept : span(nullptr, bounds_type{})
+    {
+        static_assert(bounds_type::dynamic_rank != 0 ||
+                          (bounds_type::dynamic_rank == 0 && bounds_type::static_size == 0),
+                      "nullptr_t construction of span<T> only possible "
+                      "for dynamic or fixed, zero-length spans.");
+    }
+
+    // construct from nullptr with size of 0 (helps with template function calls)
+    template <class IntType, typename = std::enable_if_t<std::is_integral<IntType>::value>>
+    constexpr span(std::nullptr_t, IntType size) noexcept : span(nullptr, bounds_type{})
+    {
+        static_assert(bounds_type::dynamic_rank != 0 ||
+                          (bounds_type::dynamic_rank == 0 && bounds_type::static_size == 0),
+                      "nullptr_t construction of span<T> only possible "
+                      "for dynamic or fixed, zero-length spans.");
+        Expects(size == 0);
+    }
+
+    // construct from a single element
+    constexpr span(reference data) noexcept : span(&data, bounds_type{1})
+    {
+        static_assert(bounds_type::dynamic_rank > 0 || bounds_type::static_size == 0 ||
+                          bounds_type::static_size == 1,
+                      "Construction from a single element only possible "
+                      "for dynamic or fixed spans of length 0 or 1.");
+    }
+
+    // prevent constructing from temporaries for single-elements
+    constexpr span(value_type&&) = delete;
+
+    // construct from pointer + length
+    constexpr span(pointer ptr, size_type size) noexcept : span(ptr, bounds_type{size}) {}
+
+    // construct from pointer + length - multidimensional
+    constexpr span(pointer data, bounds_type bounds) noexcept : data_(data),
+                                                                bounds_(std::move(bounds))
+    {
+        Expects((bounds_.size() > 0 && data != nullptr) || bounds_.size() == 0);
+    }
+
+    // construct from begin,end pointer pair
+    template <typename Ptr,
+              typename = std::enable_if_t<std::is_convertible<Ptr, pointer>::value &&
+                                          details::LessThan<bounds_type::dynamic_rank, 2>::value>>
+    constexpr span(pointer begin, Ptr end)
+        : span(begin, details::newBoundsHelper<bounds_type>(static_cast<pointer>(end) - begin))
+    {
+        Expects(begin != nullptr && end != nullptr && begin <= static_cast<pointer>(end));
+    }
+
+    // construct from n-dimensions static array
+    template <typename T, size_t N, typename Helper = details::SpanArrayTraits<T, N>>
+    constexpr span(T (&arr)[N])
+        : span(reinterpret_cast<pointer>(arr), bounds_type{typename Helper::bounds_type{}})
+    {
+        static_assert(
+            std::is_convertible<typename Helper::value_type(*) [], value_type(*) []>::value,
+            "Cannot convert from source type to target span type.");
+        static_assert(std::is_convertible<typename Helper::bounds_type, bounds_type>::value,
+                      "Cannot construct a span from an array with fewer elements.");
+    }
+
+    // construct from n-dimensions dynamic array (e.g. new int[m][4])
+    // (precedence will be lower than the 1-dimension pointer)
+    template <typename T, typename Helper = details::SpanArrayTraits<T, dynamic_range>>
+    constexpr span(T* const& data, size_type size)
+        : span(reinterpret_cast<pointer>(data), typename Helper::bounds_type{size})
+    {
+        static_assert(
+            std::is_convertible<typename Helper::value_type(*) [], value_type(*) []>::value,
+            "Cannot convert from source type to target span type.");
+    }
+
+    // construct from std::array
+    template <typename T, size_t N>
+    constexpr span(std::array<T, N>& arr) : span(arr.data(), bounds_type{static_bounds<N>{}})
+    {
+        static_assert(
+            std::is_convertible<T(*) [], typename std::remove_const_t<value_type>(*) []>::value,
+            "Cannot convert from source type to target span type.");
+        static_assert(std::is_convertible<static_bounds<N>, bounds_type>::value,
+                      "You cannot construct a span from a std::array of smaller size.");
+    }
+
+    // construct from const std::array
+    template <typename T, size_t N>
+    constexpr span(const std::array<std::remove_const_t<value_type>, N>& arr)
+        : span(arr.data(), static_bounds<N>())
+    {
+        static_assert(std::is_convertible<T(*) [], std::remove_const_t<value_type>>::value,
+                      "Cannot convert from source type to target span type.");
+        static_assert(std::is_convertible<static_bounds<N>, bounds_type>::value,
+                      "You cannot construct a span from a std::array of smaller size.");
+    }
+
+    // prevent constructing from temporary std::array
+    template <typename T, size_t N>
+    constexpr span(std::array<T, N>&& arr) = delete;
+
+    // construct from containers
+    // future: could use contiguous_iterator_traits to identify only contiguous containers
+    // type-requirements: container must have .size(), operator[] which are value_type compatible
+    template <typename Cont, typename DataType = typename Cont::value_type,
+              typename = std::enable_if_t<
+                  !details::is_span<Cont>::value &&
+                  std::is_convertible<DataType (*)[], value_type (*)[]>::value &&
+                  std::is_same<std::decay_t<decltype(std::declval<Cont>().size(),
+                                                     *std::declval<Cont>().data())>,
+                               DataType>::value>>
+    constexpr span(Cont& cont)
+        : span(static_cast<pointer>(cont.data()),
+               details::newBoundsHelper<bounds_type>(narrow_cast<size_type>(cont.size())))
+    {
+    }
+
+    // prevent constructing from temporary containers
+    template <typename Cont, typename DataType = typename Cont::value_type,
+              typename = std::enable_if_t<
+                  !details::is_span<Cont>::value &&
+                  std::is_convertible<DataType (*)[], value_type (*)[]>::value &&
+                  std::is_same<std::decay_t<decltype(std::declval<Cont>().size(),
+                                                     *std::declval<Cont>().data())>,
+                               DataType>::value>>
+    explicit constexpr span(Cont&& cont) = delete;
+
+    // construct from a convertible span
+    template <typename OtherValueType, std::ptrdiff_t... OtherDimensions,
+              typename OtherBounds = static_bounds<OtherDimensions...>,
+              typename = std::enable_if_t<std::is_convertible<OtherValueType, ValueType>::value &&
+                                          std::is_convertible<OtherBounds, bounds_type>::value>>
+    constexpr span(span<OtherValueType, OtherDimensions...> other) noexcept : data_(other.data_),
+                                                                              bounds_(other.bounds_)
+    {
+    }
+
+// trivial copy and move
+#ifndef GSL_MSVC_NO_SUPPORT_FOR_MOVE_CTOR_DEFAULT
+    constexpr span(span&&) = default;
+#endif
+    constexpr span(const span&) = default;
+
+// trivial assignment
+#ifndef GSL_MSVC_NO_SUPPORT_FOR_MOVE_CTOR_DEFAULT
+    constexpr span& operator=(span&&) = default;
+#endif
+    constexpr span& operator=(const span&) = default;
+
+    // first() - extract the first Count elements into a new span
+    template <std::ptrdiff_t Count>
+    constexpr span<ValueType, Count> first() const noexcept
+    {
+        static_assert(Count >= 0, "Count must be >= 0.");
+        static_assert(bounds_type::static_size == dynamic_range ||
+                          Count <= bounds_type::static_size,
+                      "Count is out of bounds.");
+
+        Expects(bounds_type::static_size != dynamic_range || Count <= this->size());
+        return {this->data(), Count};
+    }
+
+    // first() - extract the first count elements into a new span
+    constexpr span<ValueType, dynamic_range> first(size_type count) const noexcept
+    {
+        Expects(count >= 0 && count <= this->size());
+        return {this->data(), count};
+    }
+
+    // last() - extract the last Count elements into a new span
+    template <std::ptrdiff_t Count>
+    constexpr span<ValueType, Count> last() const noexcept
+    {
+        static_assert(Count >= 0, "Count must be >= 0.");
+        static_assert(bounds_type::static_size == dynamic_range ||
+                          Count <= bounds_type::static_size,
+                      "Count is out of bounds.");
+
+        Expects(bounds_type::static_size != dynamic_range || Count <= this->size());
+        return {this->data() + this->size() - Count, Count};
+    }
+
+    // last() - extract the last count elements into a new span
+    constexpr span<ValueType, dynamic_range> last(size_type count) const noexcept
+    {
+        Expects(count >= 0 && count <= this->size());
+        return {this->data() + this->size() - count, count};
+    }
+
+    // subspan() - create a subview of Count elements starting at Offset
+    template <std::ptrdiff_t Offset, std::ptrdiff_t Count>
+    constexpr span<ValueType, Count> subspan() const noexcept
+    {
+        static_assert(Count >= 0, "Count must be >= 0.");
+        static_assert(Offset >= 0, "Offset must be >= 0.");
+        static_assert(bounds_type::static_size == dynamic_range ||
+                          ((Offset <= bounds_type::static_size) &&
+                           Count <= bounds_type::static_size - Offset),
+                      "You must describe a sub-range within bounds of the span.");
+
+        Expects(bounds_type::static_size != dynamic_range ||
+                (Offset <= this->size() && Count <= this->size() - Offset));
+        return {this->data() + Offset, Count};
+    }
+
+    // subspan() - create a subview of count elements starting at offset
+    // supplying dynamic_range for count will consume all available elements from offset
+    constexpr span<ValueType, dynamic_range> subspan(size_type offset,
+                                                     size_type count = dynamic_range) const noexcept
+    {
+        Expects((offset >= 0 && offset <= this->size()) &&
+                (count == dynamic_range || (count <= this->size() - offset)));
+        return {this->data() + offset, count == dynamic_range ? this->length() - offset : count};
+    }
+
+    // section - creates a non-contiguous, strided span from a contiguous one
+    constexpr strided_span<ValueType, Rank> section(index_type origin, index_type extents) const
+        noexcept
+    {
+        size_type size = this->bounds().total_size() - this->bounds().linearize(origin);
+        return {&this->operator[](origin), size,
+                strided_bounds<Rank>{extents, details::make_stride(bounds())}};
+    }
+
+    // length of the span in elements
+    constexpr size_type size() const noexcept { return bounds_.size(); }
+
+    // length of the span in elements
+    constexpr size_type length() const noexcept { return this->size(); }
+
+    // length of the span in bytes
+    constexpr size_type size_bytes() const noexcept { return sizeof(value_type) * this->size(); }
+
+    // length of the span in bytes
+    constexpr size_type length_bytes() const noexcept { return this->size_bytes(); }
+
+    constexpr bool empty() const noexcept { return this->size() == 0; }
+
+    static constexpr std::size_t rank() { return Rank; }
+
+    template <size_t Dim = 0>
+    constexpr size_type extent() const noexcept
+    {
+        static_assert(Dim < Rank,
+                      "Dimension should be less than rank (dimension count starts from 0).");
+        return bounds_.template extent<Dim>();
+    }
+
+    template <typename IntType>
+    constexpr size_type extent(IntType dim) const noexcept
+    {
+        return bounds_.extent(dim);
+    }
+
+    constexpr bounds_type bounds() const noexcept { return bounds_; }
+
+    constexpr pointer data() const noexcept { return data_; }
+
+    template <typename FirstIndex>
+    constexpr reference operator()(FirstIndex index)
+    {
+        return this->operator[](narrow_cast<std::ptrdiff_t>(index));
+    }
+
+    template <typename FirstIndex, typename... OtherIndices>
+    constexpr reference operator()(FirstIndex index, OtherIndices... indices)
+    {
+        index_type idx = {narrow_cast<std::ptrdiff_t>(index),
+                          narrow_cast<std::ptrdiff_t>(indices...)};
+        return this->operator[](idx);
+    }
+
+    constexpr reference operator[](const index_type& idx) const noexcept
+    {
+        return data_[bounds_.linearize(idx)];
+    }
+
+    template <bool Enabled = (Rank > 1), typename Ret = std::enable_if_t<Enabled, sliced_type>>
+    constexpr Ret operator[](size_type idx) const noexcept
+    {
+        Expects(idx < bounds_.size()); // index is out of bounds of the array
+        const size_type ridx = idx * bounds_.stride();
+
+        // index is out of bounds of the underlying data
+        Expects(ridx < bounds_.total_size());
+        return Ret{data_ + ridx, bounds_.slice()};
+    }
+
+    constexpr iterator begin() const noexcept { return iterator{this, true}; }
+
+    constexpr iterator end() const noexcept { return iterator{this, false}; }
+
+    constexpr const_iterator cbegin() const noexcept
+    {
+        return const_iterator{reinterpret_cast<const const_span*>(this), true};
+    }
+
+    constexpr const_iterator cend() const noexcept
+    {
+        return const_iterator{reinterpret_cast<const const_span*>(this), false};
+    }
+
+    constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator{end()}; }
+
+    constexpr reverse_iterator rend() const noexcept { return reverse_iterator{begin()}; }
+
+    constexpr const_reverse_iterator crbegin() const noexcept
+    {
+        return const_reverse_iterator{cend()};
+    }
+
+    constexpr const_reverse_iterator crend() const noexcept
+    {
+        return const_reverse_iterator{cbegin()};
+    }
+
+    template <typename OtherValueType, std::ptrdiff_t... OtherDimensions,
+              typename Dummy = std::enable_if_t<std::is_same<
+                  std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
+    constexpr bool operator==(const span<OtherValueType, OtherDimensions...>& other) const noexcept
+    {
+        return bounds_.size() == other.bounds_.size() &&
+               (data_ == other.data_ || std::equal(this->begin(), this->end(), other.begin()));
+    }
+
+    template <typename OtherValueType, std::ptrdiff_t... OtherDimensions,
+              typename Dummy = std::enable_if_t<std::is_same<
+                  std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
+    constexpr bool operator!=(const span<OtherValueType, OtherDimensions...>& other) const noexcept
+    {
+        return !(*this == other);
+    }
+
+    template <typename OtherValueType, std::ptrdiff_t... OtherDimensions,
+              typename Dummy = std::enable_if_t<std::is_same<
+                  std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
+    constexpr bool operator<(const span<OtherValueType, OtherDimensions...>& other) const noexcept
+    {
+        return std::lexicographical_compare(this->begin(), this->end(), other.begin(), other.end());
+    }
+
+    template <typename OtherValueType, std::ptrdiff_t... OtherDimensions,
+              typename Dummy = std::enable_if_t<std::is_same<
+                  std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
+    constexpr bool operator<=(const span<OtherValueType, OtherDimensions...>& other) const noexcept
+    {
+        return !(other < *this);
+    }
+
+    template <typename OtherValueType, std::ptrdiff_t... OtherDimensions,
+              typename Dummy = std::enable_if_t<std::is_same<
+                  std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
+    constexpr bool operator>(const span<OtherValueType, OtherDimensions...>& other) const noexcept
+    {
+        return (other < *this);
+    }
+
+    template <typename OtherValueType, std::ptrdiff_t... OtherDimensions,
+              typename Dummy = std::enable_if_t<std::is_same<
+                  std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
+    constexpr bool operator>=(const span<OtherValueType, OtherDimensions...>& other) const noexcept
+    {
+        return !(*this < other);
+    }
+};
+
+//
+// Free functions for manipulating spans
+//
+
+// reshape a span into a different dimensionality
+// DimCount and Enabled here are workarounds for a bug in MSVC 2015
+template <typename SpanType, typename... Dimensions2, size_t DimCount = sizeof...(Dimensions2),
+          bool Enabled = (DimCount > 0), typename = std::enable_if_t<Enabled>>
+constexpr span<typename SpanType::value_type, Dimensions2::value...> as_span(SpanType s,
+                                                                             Dimensions2... dims)
+{
+    static_assert(details::is_span<SpanType>::value,
+                  "Variadic as_span() is for reshaping existing spans.");
+    using BoundsType =
+        typename span<typename SpanType::value_type, (Dimensions2::value)...>::bounds_type;
+    auto tobounds = details::static_as_span_helper<BoundsType>(dims..., details::Sep{});
+    details::verifyBoundsReshape(s.bounds(), tobounds);
+    return {s.data(), tobounds};
+}
+
+// convert a span<T> to a span<const byte>
+template <typename U, std::ptrdiff_t... Dimensions>
+span<const byte, dynamic_range> as_bytes(span<U, Dimensions...> s) noexcept
+{
+    static_assert(std::is_trivial<std::decay_t<U>>::value,
+                  "The value_type of span must be a trivial type.");
+    return {reinterpret_cast<const byte*>(s.data()), s.size_bytes()};
+}
+
+// convert a span<T> to a span<byte> (a writeable byte span)
+// this is not currently a portable function that can be relied upon to work
+// on all implementations. It should be considered an experimental extension
+// to the standard GSL interface.
+template <typename U, std::ptrdiff_t... Dimensions>
+span<byte> as_writeable_bytes(span<U, Dimensions...> s) noexcept
+{
+    static_assert(std::is_trivial<std::decay_t<U>>::value,
+                  "The value_type of span must be a trivial type.");
+    return {reinterpret_cast<byte*>(s.data()), s.size_bytes()};
+}
+
+// convert a span<const byte> to a span<const T>
+// this is not currently a portable function that can be relied upon to work
+// on all implementations. It should be considered an experimental extension
+// to the standard GSL interface.
+template <typename U, std::ptrdiff_t... Dimensions>
+constexpr auto as_span(span<const byte, Dimensions...> s) noexcept
+    -> span<const U, static_cast<std::ptrdiff_t>(
+                         span<const byte, Dimensions...>::bounds_type::static_size != dynamic_range
+                             ? (static_cast<size_t>(
+                                    span<const byte, Dimensions...>::bounds_type::static_size) /
+                                sizeof(U))
+                             : dynamic_range)>
+{
+    using ConstByteSpan = span<const byte, Dimensions...>;
+    static_assert(
+        std::is_trivial<std::decay_t<U>>::value &&
+            (ConstByteSpan::bounds_type::static_size == dynamic_range ||
+             ConstByteSpan::bounds_type::static_size % narrow_cast<std::ptrdiff_t>(sizeof(U)) == 0),
+        "Target type must be a trivial type and its size must match the byte array size");
+
+    Expects((s.size_bytes() % sizeof(U)) == 0 && (s.size_bytes() / sizeof(U)) < PTRDIFF_MAX);
+    return {reinterpret_cast<const U*>(s.data()),
+            s.size_bytes() / narrow_cast<std::ptrdiff_t>(sizeof(U))};
+}
+
+// convert a span<byte> to a span<T>
+// this is not currently a portable function that can be relied upon to work
+// on all implementations. It should be considered an experimental extension
+// to the standard GSL interface.
+template <typename U, std::ptrdiff_t... Dimensions>
+constexpr auto as_span(span<byte, Dimensions...> s) noexcept -> span<
+    U, narrow_cast<std::ptrdiff_t>(
+           span<byte, Dimensions...>::bounds_type::static_size != dynamic_range
+               ? static_cast<std::size_t>(span<byte, Dimensions...>::bounds_type::static_size) /
+                     sizeof(U)
+               : dynamic_range)>
+{
+    using ByteSpan = span<byte, Dimensions...>;
+    static_assert(
+        std::is_trivial<std::decay_t<U>>::value &&
+            (ByteSpan::bounds_type::static_size == dynamic_range ||
+             ByteSpan::bounds_type::static_size % static_cast<std::size_t>(sizeof(U)) == 0),
+        "Target type must be a trivial type and its size must match the byte array size");
+
+    Expects((s.size_bytes() % sizeof(U)) == 0);
+    return {reinterpret_cast<U*>(s.data()),
+            s.size_bytes() / narrow_cast<std::ptrdiff_t>(sizeof(U))};
+}
+
+template <typename T, std::ptrdiff_t... Dimensions>
+constexpr auto as_span(T* const& ptr, dim<Dimensions>... args)
+    -> span<std::remove_all_extents_t<T>, Dimensions...>
+{
+    return {reinterpret_cast<std::remove_all_extents_t<T>*>(ptr),
+            details::static_as_span_helper<static_bounds<Dimensions...>>(args..., details::Sep{})};
+}
+
+template <typename T>
+constexpr auto as_span(T* arr, std::ptrdiff_t len) ->
+    typename details::SpanArrayTraits<T, dynamic_range>::type
+{
+    return {reinterpret_cast<std::remove_all_extents_t<T>*>(arr), len};
+}
+
+template <typename T, size_t N>
+constexpr auto as_span(T (&arr)[N]) -> typename details::SpanArrayTraits<T, N>::type
+{
+    return {arr};
+}
+
+template <typename T, size_t N>
+constexpr span<const T, N> as_span(const std::array<T, N>& arr)
+{
+    return {arr};
+}
+
+template <typename T, size_t N>
+constexpr span<const T, N> as_span(const std::array<T, N>&&) = delete;
+
+template <typename T, size_t N>
+constexpr span<T, N> as_span(std::array<T, N>& arr)
+{
+    return {arr};
+}
+
+template <typename T>
+constexpr span<T, dynamic_range> as_span(T* begin, T* end)
+{
+    return {begin, end};
+}
+
+template <typename Cont>
+constexpr auto as_span(Cont& arr) -> std::enable_if_t<
+    !details::is_span<std::decay_t<Cont>>::value,
+    span<std::remove_reference_t<decltype(arr.size(), *arr.data())>, dynamic_range>>
+{
+    Expects(arr.size() < PTRDIFF_MAX);
+    return {arr.data(), narrow_cast<std::ptrdiff_t>(arr.size())};
+}
+
+template <typename Cont>
+constexpr auto as_span(Cont&& arr) -> std::enable_if_t<
+    !details::is_span<std::decay_t<Cont>>::value,
+    span<std::remove_reference_t<decltype(arr.size(), *arr.data())>, dynamic_range>> = delete;
+
+// from basic_string which doesn't have nonconst .data() member like other contiguous containers
+template <typename CharT, typename Traits, typename Allocator>
+constexpr auto as_span(std::basic_string<CharT, Traits, Allocator>& str)
+    -> span<CharT, dynamic_range>
+{
+    Expects(str.size() < PTRDIFF_MAX);
+    return {&str[0], narrow_cast<std::ptrdiff_t>(str.size())};
+}
+
+// strided_span is an extension that is not strictly part of the GSL at this time.
+// It is kept here while the multidimensional interface is still being defined.
+template <typename ValueType, size_t Rank>
+class strided_span
+{
+public:
+    using bounds_type = strided_bounds<Rank>;
+    using size_type = typename bounds_type::size_type;
+    using index_type = typename bounds_type::index_type;
+    using value_type = ValueType;
+    using const_value_type = std::add_const_t<value_type>;
+    using pointer = std::add_pointer_t<value_type>;
+    using reference = std::add_lvalue_reference_t<value_type>;
+    using iterator = general_span_iterator<strided_span>;
+    using const_strided_span = strided_span<const_value_type, Rank>;
+    using const_iterator = general_span_iterator<const_strided_span>;
+    using reverse_iterator = std::reverse_iterator<iterator>;
+    using const_reverse_iterator = std::reverse_iterator<const_iterator>;
+    using sliced_type =
+        std::conditional_t<Rank == 1, value_type, strided_span<value_type, Rank - 1>>;
+
+private:
+    pointer data_;
+    bounds_type bounds_;
+
+    friend iterator;
+    friend const_iterator;
+    template <typename OtherValueType, size_t OtherRank>
+    friend class strided_span;
+
+public:
+    // from raw data
+    constexpr strided_span(pointer ptr, size_type size, bounds_type bounds)
+        : data_(ptr), bounds_(std::move(bounds))
+    {
+        Expects((bounds_.size() > 0 && ptr != nullptr) || bounds_.size() == 0);
+        // Bounds cross data boundaries
+        Expects(this->bounds().total_size() <= size);
+        (void) size;
+    }
+
+    // from static array of size N
+    template <size_type N>
+    constexpr strided_span(value_type (&values)[N], bounds_type bounds)
+        : strided_span(values, N, std::move(bounds))
+    {
+    }
+
+    // from array view
+    template <typename OtherValueType, std::ptrdiff_t... Dimensions,
+              bool Enabled1 = (sizeof...(Dimensions) == Rank),
+              bool Enabled2 = std::is_convertible<OtherValueType*, ValueType*>::value,
+              typename Dummy = std::enable_if_t<Enabled1 && Enabled2>>
+    constexpr strided_span(span<OtherValueType, Dimensions...> av, bounds_type bounds)
+        : strided_span(av.data(), av.bounds().total_size(), std::move(bounds))
+    {
+    }
+
+    // convertible
+    template <typename OtherValueType, typename Dummy = std::enable_if_t<std::is_convertible<
+                                           OtherValueType (*)[], value_type (*)[]>::value>>
+    constexpr strided_span(const strided_span<OtherValueType, Rank>& other)
+        : data_(other.data_), bounds_(other.bounds_)
+    {
+    }
+
+    // convert from bytes
+    template <typename OtherValueType>
+    constexpr strided_span<
+        typename std::enable_if<std::is_same<value_type, const byte>::value, OtherValueType>::type,
+        Rank>
+    as_strided_span() const
+    {
+        static_assert((sizeof(OtherValueType) >= sizeof(value_type)) &&
+                          (sizeof(OtherValueType) % sizeof(value_type) == 0),
+                      "OtherValueType should have a size to contain a multiple of ValueTypes");
+        auto d = narrow_cast<size_type>(sizeof(OtherValueType) / sizeof(value_type));
+
+        size_type size = this->bounds().total_size() / d;
+        return {(OtherValueType*) this->data(), size,
+                bounds_type{resize_extent(this->bounds().index_bounds(), d),
+                            resize_stride(this->bounds().strides(), d)}};
+    }
+
+    constexpr strided_span section(index_type origin, index_type extents) const
+    {
+        size_type size = this->bounds().total_size() - this->bounds().linearize(origin);
+        return {&this->operator[](origin), size,
+                bounds_type{extents, details::make_stride(bounds())}};
+    }
+
+    constexpr reference operator[](const index_type& idx) const
+    {
+        return data_[bounds_.linearize(idx)];
+    }
+
+    template <bool Enabled = (Rank > 1), typename Ret = std::enable_if_t<Enabled, sliced_type>>
+    constexpr Ret operator[](size_type idx) const
+    {
+        Expects(idx < bounds_.size()); // index is out of bounds of the array
+        const size_type ridx = idx * bounds_.stride();
+
+        // index is out of bounds of the underlying data
+        Expects(ridx < bounds_.total_size());
+        return {data_ + ridx, bounds_.slice().total_size(), bounds_.slice()};
+    }
+
+    constexpr bounds_type bounds() const noexcept { return bounds_; }
+
+    template <size_t Dim = 0>
+    constexpr size_type extent() const noexcept
+    {
+        static_assert(Dim < Rank,
+                      "dimension should be less than Rank (dimension count starts from 0)");
+        return bounds_.template extent<Dim>();
+    }
+
+    constexpr size_type size() const noexcept { return bounds_.size(); }
+
+    constexpr pointer data() const noexcept { return data_; }
+
+    constexpr explicit operator bool() const noexcept { return data_ != nullptr; }
+
+    constexpr iterator begin() const { return iterator{this, true}; }
+
+    constexpr iterator end() const { return iterator{this, false}; }
+
+    constexpr const_iterator cbegin() const
+    {
+        return const_iterator{reinterpret_cast<const const_strided_span*>(this), true};
+    }
+
+    constexpr const_iterator cend() const
+    {
+        return const_iterator{reinterpret_cast<const const_strided_span*>(this), false};
+    }
+
+    constexpr reverse_iterator rbegin() const { return reverse_iterator{end()}; }
+
+    constexpr reverse_iterator rend() const { return reverse_iterator{begin()}; }
+
+    constexpr const_reverse_iterator crbegin() const { return const_reverse_iterator{cend()}; }
+
+    constexpr const_reverse_iterator crend() const { return const_reverse_iterator{cbegin()}; }
+
+    template <typename OtherValueType, std::ptrdiff_t OtherRank,
+              typename Dummy = std::enable_if_t<std::is_same<
+                  std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
+    constexpr bool operator==(const strided_span<OtherValueType, OtherRank>& other) const noexcept
+    {
+        return bounds_.size() == other.bounds_.size() &&
+               (data_ == other.data_ || std::equal(this->begin(), this->end(), other.begin()));
+    }
+
+    template <typename OtherValueType, std::ptrdiff_t OtherRank,
+              typename Dummy = std::enable_if_t<std::is_same<
+                  std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
+    constexpr bool operator!=(const strided_span<OtherValueType, OtherRank>& other) const noexcept
+    {
+        return !(*this == other);
+    }
+
+    template <typename OtherValueType, std::ptrdiff_t OtherRank,
+              typename Dummy = std::enable_if_t<std::is_same<
+                  std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
+    constexpr bool operator<(const strided_span<OtherValueType, OtherRank>& other) const noexcept
+    {
+        return std::lexicographical_compare(this->begin(), this->end(), other.begin(), other.end());
+    }
+
+    template <typename OtherValueType, std::ptrdiff_t OtherRank,
+              typename Dummy = std::enable_if_t<std::is_same<
+                  std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
+    constexpr bool operator<=(const strided_span<OtherValueType, OtherRank>& other) const noexcept
+    {
+        return !(other < *this);
+    }
+
+    template <typename OtherValueType, std::ptrdiff_t OtherRank,
+              typename Dummy = std::enable_if_t<std::is_same<
+                  std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
+    constexpr bool operator>(const strided_span<OtherValueType, OtherRank>& other) const noexcept
+    {
+        return (other < *this);
+    }
+
+    template <typename OtherValueType, std::ptrdiff_t OtherRank,
+              typename Dummy = std::enable_if_t<std::is_same<
+                  std::remove_cv_t<value_type>, std::remove_cv_t<OtherValueType>>::value>>
+    constexpr bool operator>=(const strided_span<OtherValueType, OtherRank>& other) const noexcept
+    {
+        return !(*this < other);
+    }
+
+private:
+    static index_type resize_extent(const index_type& extent, std::ptrdiff_t d)
+    {
+        // The last dimension of the array needs to contain a multiple of new type elements
+        Expects(extent[Rank - 1] >= d && (extent[Rank - 1] % d == 0));
+
+        index_type ret = extent;
+        ret[Rank - 1] /= d;
+
+        return ret;
+    }
+
+    template <bool Enabled = (Rank == 1), typename Dummy = std::enable_if_t<Enabled>>
+    static index_type resize_stride(const index_type& strides, std::ptrdiff_t, void* = 0)
+    {
+        // Only strided arrays with regular strides can be resized
+        Expects(strides[Rank - 1] == 1);
+
+        return strides;
+    }
+
+    template <bool Enabled = (Rank > 1), typename Dummy = std::enable_if_t<Enabled>>
+    static index_type resize_stride(const index_type& strides, std::ptrdiff_t d)
+    {
+        // Only strided arrays with regular strides can be resized
+        Expects(strides[Rank - 1] == 1);
+        // The strides must have contiguous chunks of
+        // memory that can contain a multiple of new type elements
+        Expects(strides[Rank - 2] >= d && (strides[Rank - 2] % d == 0));
+
+        for (size_t i = Rank - 1; i > 0; --i) {
+            // Only strided arrays with regular strides can be resized
+            Expects((strides[i - 1] >= strides[i]) && (strides[i - 1] % strides[i] == 0));
+        }
+
+        index_type ret = strides / d;
+        ret[Rank - 1] = 1;
+
+        return ret;
+    }
+};
+
+template <class Span>
+class contiguous_span_iterator
+    : public std::iterator<std::random_access_iterator_tag, typename Span::value_type>
+{
+    using Base = std::iterator<std::random_access_iterator_tag, typename Span::value_type>;
+
+public:
+    using typename Base::reference;
+    using typename Base::pointer;
+    using typename Base::difference_type;
+
+private:
+    template <typename ValueType, std::ptrdiff_t FirstDimension, std::ptrdiff_t... RestDimensions>
+    friend class span;
+
+    pointer data_;
+    const Span* m_validator;
+    void validateThis() const
+    {
+        // iterator is out of range of the array
+        Expects(data_ >= m_validator->data_ && data_ < m_validator->data_ + m_validator->size());
+    }
+    contiguous_span_iterator(const Span* container, bool isbegin)
+        : data_(isbegin ? container->data_ : container->data_ + container->size())
+        , m_validator(container)
+    {
+    }
+
+public:
+    reference operator*() const noexcept
+    {
+        validateThis();
+        return *data_;
+    }
+    pointer operator->() const noexcept
+    {
+        validateThis();
+        return data_;
+    }
+    contiguous_span_iterator& operator++() noexcept
+    {
+        ++data_;
+        return *this;
+    }
+    contiguous_span_iterator operator++(int) noexcept
+    {
+        auto ret = *this;
+        ++(*this);
+        return ret;
+    }
+    contiguous_span_iterator& operator--() noexcept
+    {
+        --data_;
+        return *this;
+    }
+    contiguous_span_iterator operator--(int) noexcept
+    {
+        auto ret = *this;
+        --(*this);
+        return ret;
+    }
+    contiguous_span_iterator operator+(difference_type n) const noexcept
+    {
+        contiguous_span_iterator ret{*this};
+        return ret += n;
+    }
+    contiguous_span_iterator& operator+=(difference_type n) noexcept
+    {
+        data_ += n;
+        return *this;
+    }
+    contiguous_span_iterator operator-(difference_type n) const noexcept
+    {
+        contiguous_span_iterator ret{*this};
+        return ret -= n;
+    }
+    contiguous_span_iterator& operator-=(difference_type n) noexcept { return * this += -n; }
+    difference_type operator-(const contiguous_span_iterator& rhs) const noexcept
+    {
+        Expects(m_validator == rhs.m_validator);
+        return data_ - rhs.data_;
+    }
+    reference operator[](difference_type n) const noexcept { return *(*this + n); }
+    bool operator==(const contiguous_span_iterator& rhs) const noexcept
+    {
+        Expects(m_validator == rhs.m_validator);
+        return data_ == rhs.data_;
+    }
+    bool operator!=(const contiguous_span_iterator& rhs) const noexcept { return !(*this == rhs); }
+    bool operator<(const contiguous_span_iterator& rhs) const noexcept
+    {
+        Expects(m_validator == rhs.m_validator);
+        return data_ < rhs.data_;
+    }
+    bool operator<=(const contiguous_span_iterator& rhs) const noexcept { return !(rhs < *this); }
+    bool operator>(const contiguous_span_iterator& rhs) const noexcept { return rhs < *this; }
+    bool operator>=(const contiguous_span_iterator& rhs) const noexcept { return !(rhs > *this); }
+    void swap(contiguous_span_iterator& rhs) noexcept
+    {
+        std::swap(data_, rhs.data_);
+        std::swap(m_validator, rhs.m_validator);
+    }
+};
+
+template <typename Span>
+contiguous_span_iterator<Span> operator+(typename contiguous_span_iterator<Span>::difference_type n,
+                                         const contiguous_span_iterator<Span>& rhs) noexcept
+{
+    return rhs + n;
+}
+
+template <typename Span>
+class general_span_iterator
+    : public std::iterator<std::random_access_iterator_tag, typename Span::value_type>
+{
+    using Base = std::iterator<std::random_access_iterator_tag, typename Span::value_type>;
+
+public:
+    using typename Base::reference;
+    using typename Base::pointer;
+    using typename Base::difference_type;
+    using typename Base::value_type;
+
+private:
+    template <typename ValueType, size_t Rank>
+    friend class strided_span;
+
+    const Span* m_container;
+    typename Span::bounds_type::iterator m_itr;
+    general_span_iterator(const Span* container, bool isbegin)
+        : m_container(container)
+        , m_itr(isbegin ? m_container->bounds().begin() : m_container->bounds().end())
+    {
+    }
+
+public:
+    reference operator*() noexcept { return (*m_container)[*m_itr]; }
+    pointer operator->() noexcept { return &(*m_container)[*m_itr]; }
+    general_span_iterator& operator++() noexcept
+    {
+        ++m_itr;
+        return *this;
+    }
+    general_span_iterator operator++(int) noexcept
+    {
+        auto ret = *this;
+        ++(*this);
+        return ret;
+    }
+    general_span_iterator& operator--() noexcept
+    {
+        --m_itr;
+        return *this;
+    }
+    general_span_iterator operator--(int) noexcept
+    {
+        auto ret = *this;
+        --(*this);
+        return ret;
+    }
+    general_span_iterator operator+(difference_type n) const noexcept
+    {
+        general_span_iterator ret{*this};
+        return ret += n;
+    }
+    general_span_iterator& operator+=(difference_type n) noexcept
+    {
+        m_itr += n;
+        return *this;
+    }
+    general_span_iterator operator-(difference_type n) const noexcept
+    {
+        general_span_iterator ret{*this};
+        return ret -= n;
+    }
+    general_span_iterator& operator-=(difference_type n) noexcept { return * this += -n; }
+    difference_type operator-(const general_span_iterator& rhs) const noexcept
+    {
+        Expects(m_container == rhs.m_container);
+        return m_itr - rhs.m_itr;
+    }
+    value_type operator[](difference_type n) const noexcept
+    {
+        return (*m_container)[m_itr[n]];
+        ;
+    }
+    bool operator==(const general_span_iterator& rhs) const noexcept
+    {
+        Expects(m_container == rhs.m_container);
+        return m_itr == rhs.m_itr;
+    }
+    bool operator!=(const general_span_iterator& rhs) const noexcept { return !(*this == rhs); }
+    bool operator<(const general_span_iterator& rhs) const noexcept
+    {
+        Expects(m_container == rhs.m_container);
+        return m_itr < rhs.m_itr;
+    }
+    bool operator<=(const general_span_iterator& rhs) const noexcept { return !(rhs < *this); }
+    bool operator>(const general_span_iterator& rhs) const noexcept { return rhs < *this; }
+    bool operator>=(const general_span_iterator& rhs) const noexcept { return !(rhs > *this); }
+    void swap(general_span_iterator& rhs) noexcept
+    {
+        std::swap(m_itr, rhs.m_itr);
+        std::swap(m_container, rhs.m_container);
+    }
+};
+
+template <typename Span>
+general_span_iterator<Span> operator+(typename general_span_iterator<Span>::difference_type n,
+                                      const general_span_iterator<Span>& rhs) noexcept
+{
+    return rhs + n;
+}
+
+} // namespace gsl
+
+#ifdef _MSC_VER
+
+#undef constexpr
+#pragma pop_macro("constexpr")
+
+#if _MSC_VER <= 1800
+#pragma warning(pop)
+
+#ifndef GSL_THROW_ON_CONTRACT_VIOLATION
+#undef noexcept
+#pragma pop_macro("noexcept")
+#endif // GSL_THROW_ON_CONTRACT_VIOLATION
+
+#undef GSL_MSVC_HAS_VARIADIC_CTOR_BUG
+
+#endif // _MSC_VER <= 1800
+
+#endif // _MSC_VER
+
+#if defined(GSL_THROW_ON_CONTRACT_VIOLATION)
+
+#undef noexcept
+
+#ifdef _MSC_VER
+#pragma warning(pop)
+#pragma pop_macro("noexcept")
+#endif
+
+#endif // GSL_THROW_ON_CONTRACT_VIOLATION
+
+#endif // GSL_SPAN_H
diff --git a/include/string_span.h b/include/string_span.h
new file mode 100644
index 0000000..a451314
--- /dev/null
+++ b/include/string_span.h
@@ -0,0 +1,881 @@
+///////////////////////////////////////////////////////////////////////////////
+//
+// Copyright (c) 2015 Microsoft Corporation. All rights reserved.
+//
+// This code is licensed under the MIT License (MIT).
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+// THE SOFTWARE.
+//
+///////////////////////////////////////////////////////////////////////////////
+
+#pragma once
+
+#ifndef GSL_STRING_SPAN_H
+#define GSL_STRING_SPAN_H
+
+#include "gsl_assert.h"
+#include "gsl_util.h"
+#include "span.h"
+#include <cstring>
+
+#ifdef _MSC_VER
+
+// No MSVC does constexpr fully yet
+#pragma push_macro("constexpr")
+#define constexpr /* nothing */
+
+// VS 2013 workarounds
+#if _MSC_VER <= 1800
+
+#define GSL_MSVC_HAS_TYPE_DEDUCTION_BUG
+
+// noexcept is not understood
+#ifndef GSL_THROW_ON_CONTRACT_VIOLATION
+#pragma push_macro("noexcept")
+#define noexcept /* nothing */
+#endif
+
+#endif // _MSC_VER <= 1800
+#endif // _MSC_VER
+
+// In order to test the library, we need it to throw exceptions that we can catch
+#ifdef GSL_THROW_ON_CONTRACT_VIOLATION
+
+#ifdef _MSC_VER
+#pragma push_macro("noexcept")
+#endif
+
+#define noexcept /* nothing */
+
+#endif // GSL_THROW_ON_CONTRACT_VIOLATION
+
+namespace gsl
+{
+//
+// czstring and wzstring
+//
+// These are "tag" typedef's for C-style strings (i.e. null-terminated character arrays)
+// that allow static analysis to help find bugs.
+//
+// There are no additional features/semantics that we can find a way to add inside the
+// type system for these types that will not either incur significant runtime costs or
+// (sometimes needlessly) break existing programs when introduced.
+//
+template<std::ptrdiff_t Extent = dynamic_range>
+using czstring = const char*;
+
+template<std::ptrdiff_t Extent = dynamic_range>
+using cwzstring = const wchar_t*;
+
+template<std::ptrdiff_t Extent = dynamic_range>
+using zstring = char*;
+
+template<std::ptrdiff_t Extent = dynamic_range>
+using wzstring = wchar_t*;
+
+//
+// ensure_sentinel()
+//
+// Provides a way to obtain an span from a contiguous sequence
+// that ends with a (non-inclusive) sentinel value.
+//
+// Will fail-fast if sentinel cannot be found before max elements are examined.
+//
+template<typename T, const T Sentinel>
+span<T, dynamic_range> ensure_sentinel(T* seq, std::ptrdiff_t max = PTRDIFF_MAX)
+{
+    auto cur = seq;
+    while ((cur - seq) < max && *cur != Sentinel) ++cur;
+    Ensures(*cur == Sentinel);
+    return{ seq, cur - seq };
+}
+
+
+//
+// ensure_z - creates a span for a czstring or cwzstring.
+// Will fail fast if a null-terminator cannot be found before
+// the limit of size_type.
+//
+template<typename T>
+inline span<T, dynamic_range> ensure_z(T* const & sz, std::ptrdiff_t max = PTRDIFF_MAX)
+{
+    return ensure_sentinel<T, 0>(sz, max);
+}
+
+// TODO (neilmac) there is probably a better template-magic way to get the const and non-const overloads to share an implementation
+inline span<char, dynamic_range> ensure_z(char* const& sz, std::ptrdiff_t max)
+{
+    auto len = strnlen(sz, max);
+    Ensures(sz[len] == 0);
+    return{ sz, static_cast<std::ptrdiff_t>(len) };
+}
+
+inline span<const char, dynamic_range> ensure_z(const char* const& sz, std::ptrdiff_t max)
+{
+    auto len = strnlen(sz, max);
+    Ensures(sz[len] == 0);
+    return{ sz, static_cast<std::ptrdiff_t>(len) };
+}
+
+inline span<wchar_t, dynamic_range> ensure_z(wchar_t* const& sz, std::ptrdiff_t max)
+{
+    auto len = wcsnlen(sz, max);
+    Ensures(sz[len] == 0);
+    return{ sz, static_cast<std::ptrdiff_t>(len) };
+}
+
+inline span<const wchar_t, dynamic_range> ensure_z(const wchar_t* const& sz, std::ptrdiff_t max)
+{
+    auto len = wcsnlen(sz, max);
+    Ensures(sz[len] == 0);
+    return{ sz, static_cast<std::ptrdiff_t>(len) };
+}
+
+template<typename T, size_t N>
+span<T, dynamic_range> ensure_z(T(&sz)[N]) { return ensure_z(&sz[0], static_cast<std::ptrdiff_t>(N)); }
+
+template<class Cont>
+span<typename std::remove_pointer<typename Cont::pointer>::type, dynamic_range> ensure_z(Cont& cont)
+{
+    return ensure_z(cont.data(), static_cast<std::ptrdiff_t>(cont.length()));
+}
+
+template<typename CharT, std::ptrdiff_t>
+class basic_string_span;
+
+namespace details
+{
+    template <typename T>
+    struct is_basic_string_span_oracle : std::false_type
+    {};
+
+    template <typename CharT, std::ptrdiff_t Extent>
+    struct is_basic_string_span_oracle<basic_string_span<CharT, Extent>> : std::true_type
+    {};
+
+    template <typename T>
+    struct is_basic_string_span : is_basic_string_span_oracle<std::remove_cv_t<T>>
+    {};
+
+    template <typename T>
+    struct length_func
+    {};
+
+    template <>
+    struct length_func<char>
+    {
+        std::ptrdiff_t operator()(char* const ptr, std::ptrdiff_t length) noexcept
+        {
+            return narrow_cast<std::ptrdiff_t>(strnlen(ptr, length));
+        }
+    };
+
+    template <>
+    struct length_func<wchar_t>
+    {
+        std::ptrdiff_t operator()(wchar_t* const ptr, std::ptrdiff_t length) noexcept
+        {
+            return narrow_cast<std::ptrdiff_t>(wcsnlen(ptr, length));
+        }
+    };
+
+    template <>
+    struct length_func<const char>
+    {
+        std::ptrdiff_t operator()(const char* const ptr, std::ptrdiff_t length) noexcept
+        {
+            return narrow_cast<std::ptrdiff_t>(strnlen(ptr, length));
+        }
+    };
+
+    template <>
+    struct length_func<const wchar_t>
+    {
+        std::ptrdiff_t operator()(const wchar_t* const ptr, std::ptrdiff_t length) noexcept
+        {
+            return narrow_cast<std::ptrdiff_t>(wcsnlen(ptr, length));
+        }
+    };
+}
+
+
+//
+// string_span and relatives
+//
+// Note that Extent is always single-dimension only
+//
+template <typename CharT, std::ptrdiff_t Extent = dynamic_range>
+class basic_string_span
+{
+public:
+    using value_type = CharT;
+    using const_value_type = std::add_const_t<value_type>;
+    using pointer = std::add_pointer_t<value_type>;
+    using reference = std::add_lvalue_reference_t<value_type>;
+    using const_reference = std::add_lvalue_reference_t<const_value_type>;
+    using bounds_type = static_bounds<Extent>;
+    using impl_type = span<value_type, Extent>;
+
+    using size_type = ptrdiff_t;
+    using iterator = typename impl_type::iterator;
+    using const_iterator = typename impl_type::const_iterator;
+    using reverse_iterator = typename impl_type::reverse_iterator;
+    using const_reverse_iterator = typename impl_type::const_reverse_iterator;
+
+    // default (empty)
+    constexpr basic_string_span() = default;
+
+    // copy
+    constexpr basic_string_span(const basic_string_span& other) = default;
+
+    // move
+    constexpr basic_string_span(basic_string_span&& other) = default;
+
+    // assign
+    constexpr basic_string_span& operator=(const basic_string_span& other) = default;
+
+    // move assign
+    constexpr basic_string_span& operator=(basic_string_span&& other) = default;
+
+    // from nullptr
+    constexpr basic_string_span(std::nullptr_t ptr) noexcept
+        : span_(ptr)
+    {}
+
+    // from nullptr and length
+    constexpr basic_string_span(std::nullptr_t ptr, size_type length) noexcept
+        : span_(ptr, length)
+    {}
+
+    // From static arrays - if 0-terminated, remove 0 from the view
+
+    // from static arrays and string literals
+    template<size_t N>
+    constexpr basic_string_span(value_type(&arr)[N]) noexcept
+        : span_(remove_z(arr))
+    {}
+
+    // Those allow 0s within the length, so we do not remove them
+
+    // from raw data and length
+    constexpr basic_string_span(pointer ptr, size_type length) noexcept
+        : span_(ptr, length)
+    {}
+
+    // from string
+    constexpr basic_string_span(std::string& s) noexcept
+        : span_(const_cast<pointer>(s.data()), narrow_cast<std::ptrdiff_t>(s.length()))
+    {}
+
+    // from containers. Containers must have .size() and .data() function signatures
+    template <typename Cont, typename DataType = typename Cont::value_type,
+        typename Dummy = std::enable_if_t<!details::is_span<Cont>::value
+        && !details::is_basic_string_span<Cont>::value
+        && !(!std::is_const<value_type>::value && std::is_const<Cont>::value) // no converting const containers to non-const span
+        && std::is_convertible<DataType*, value_type*>::value
+        && std::is_same<std::decay_t<decltype(std::declval<Cont>().size(), *std::declval<Cont>().data())>, DataType>::value>
+    >
+    constexpr basic_string_span(Cont& cont)
+        : span_(cont.data(), cont.size())
+    {}
+
+    // disallow creation from temporary containers and strings
+    template <typename Cont, typename DataType = typename Cont::value_type,
+        typename Dummy = std::enable_if_t<!details::is_span<Cont>::value
+        && !details::is_basic_string_span<Cont>::value
+        && std::is_convertible<DataType*, value_type*>::value
+        && std::is_same<std::decay_t<decltype(std::declval<Cont>().size(), *std::declval<Cont>().data())>, DataType>::value>
+    >
+    basic_string_span(Cont&& cont) = delete;
+
+    // from span
+    template <typename OtherValueType, std::ptrdiff_t OtherExtent,
+        typename OtherBounds = static_bounds<OtherExtent>,
+        typename Dummy = std::enable_if_t<std::is_convertible<OtherValueType*, value_type*>::value && std::is_convertible<OtherBounds, bounds_type>::value>
+    >
+    constexpr basic_string_span(span<OtherValueType, OtherExtent> other) noexcept
+        : span_(other)
+    {}
+
+    // from string_span
+    template <typename OtherValueType, std::ptrdiff_t OtherExtent,
+        typename OtherBounds = static_bounds<OtherExtent>,
+        typename Dummy = std::enable_if_t<std::is_convertible<OtherValueType*, value_type*>::value && std::is_convertible<OtherBounds, bounds_type>::value>
+    >
+    constexpr basic_string_span(basic_string_span<OtherValueType, OtherExtent> other) noexcept
+        : span_(other.data(), other.length())
+    {}
+
+    constexpr bool empty() const noexcept
+    {
+        return length() == 0;
+    }
+
+    // first Count elements
+    template<size_type Count>
+    constexpr basic_string_span<value_type, Count> first() const noexcept
+    {
+        return{ span_.template first<Count>() };
+    }
+
+    constexpr basic_string_span<value_type, dynamic_range> first(size_type count) const noexcept
+    {
+        return{ span_.first(count) };
+    }
+
+    // last Count elements
+    template<size_type Count>
+    constexpr basic_string_span<value_type, Count> last() const noexcept
+    {
+        return{ span_.template last<Count>() };
+    }
+
+    constexpr basic_string_span<value_type, dynamic_range> last(size_type count) const noexcept
+    {
+        return{ span_.last(count) };
+    }
+
+    // create a subview of Count elements starting from Offset
+    template<size_type Offset, size_type Count>
+    constexpr basic_string_span<value_type, Count> subspan() const noexcept
+    {
+        return{ span_.template subspan<Offset, Count>() };
+    }
+
+    constexpr basic_string_span<value_type, dynamic_range> subspan(size_type offset, size_type count = dynamic_range) const noexcept
+    {
+        return{ span_.subspan(offset, count) };
+    }
+
+    constexpr reference operator[](size_type idx) const noexcept
+    {
+        return span_[idx];
+    }
+
+    constexpr pointer data() const noexcept
+    {
+        return span_.data();
+    }
+
+    // length of the span in elements
+    constexpr size_type length() const noexcept
+    {
+        return span_.size();
+    }
+
+    // length of the span in elements
+    constexpr size_type size() const noexcept
+    {
+        return span_.size();
+    }
+
+    // length of the span in bytes
+    constexpr size_type size_bytes() const noexcept
+    {
+        return span_.size_bytes();
+    }
+
+    // length of the span in bytes
+    constexpr size_type length_bytes() const noexcept
+    {
+        return span_.length_bytes();
+    }
+
+    constexpr iterator begin() const noexcept
+    {
+        return span_.begin();
+    }
+
+    constexpr iterator end() const noexcept
+    {
+        return span_.end();
+    }
+
+    constexpr const_iterator cbegin() const noexcept
+    {
+        return span_.cbegin();
+    }
+
+    constexpr const_iterator cend() const noexcept
+    {
+        span_.cend();
+    }
+
+    constexpr reverse_iterator rbegin() const noexcept
+    {
+        return span_.rbegin();
+    }
+
+    constexpr reverse_iterator rend() const noexcept
+    {
+        return span_.rend();
+    }
+
+    constexpr const_reverse_iterator crbegin() const noexcept
+    {
+        return span_.crbegin();
+    }
+
+    constexpr const_reverse_iterator crend() const noexcept
+    {
+        return span_.crend();
+    }
+
+private:
+
+    static impl_type remove_z(pointer const& sz, std::ptrdiff_t max) noexcept
+    {
+        return{ sz, details::length_func<value_type>()(sz, max)};
+    }
+
+    template<size_t N>
+    static impl_type remove_z(value_type(&sz)[N]) noexcept
+    {
+        return remove_z(&sz[0], narrow_cast<std::ptrdiff_t>(N));
+    }
+
+    impl_type span_;
+};
+
+template<std::ptrdiff_t Extent = dynamic_range>
+using string_span = basic_string_span<char, Extent>;
+
+template<std::ptrdiff_t Extent = dynamic_range>
+using cstring_span = basic_string_span<const char, Extent>;
+
+template<std::ptrdiff_t Extent = dynamic_range>
+using wstring_span = basic_string_span<wchar_t, Extent>;
+
+template<std::ptrdiff_t Extent = dynamic_range>
+using cwstring_span = basic_string_span<const wchar_t, Extent>;
+
+//
+// to_string() allow (explicit) conversions from string_span to string
+//
+#ifndef GSL_MSVC_HAS_TYPE_DEDUCTION_BUG
+
+template<typename CharT, ptrdiff_t Extent>
+std::basic_string<typename std::remove_const<CharT>::type> to_string(basic_string_span<CharT, Extent> view)
+{
+    return{ view.data(), static_cast<size_t>(view.length()) };
+}
+
+#else
+
+inline std::string to_string(cstring_span<> view)
+{
+    return{ view.data(), view.length() };
+}
+
+inline std::string to_string(string_span<> view)
+{
+    return{ view.data(), view.length() };
+}
+
+inline std::wstring to_string(cwstring_span<> view)
+{
+    return{ view.data(), view.length() };
+}
+
+inline std::wstring to_string(wstring_span<> view)
+{
+    return{ view.data(), view.length() };
+}
+
+#endif
+
+template<typename CharT, size_t Extent = dynamic_range>
+class basic_zstring_builder
+{
+public:
+    using impl_type = span<CharT, Extent>;
+    using string_span_type = basic_string_span<CharT, Extent>;
+    using value_type = CharT;
+    using pointer = CharT*;
+    using size_type = typename string_span_type::size_type;
+    using iterator = typename string_span_type::iterator;
+
+    basic_zstring_builder(CharT* data, size_type length) : sv_(data, length) {}
+
+    template<size_t Size>
+    basic_zstring_builder(CharT(&arr)[Size]) : sv_(arr) {}
+
+    pointer data() const { return sv_.data(); }
+    string_span_type view() const { return sv_; }
+
+    size_type length() const { return sv_.length(); }
+
+    pointer assume0() const { return data(); }
+    string_span_type ensure_z() const { return gsl::ensure_z(sv_); }
+
+    iterator begin() const { return sv_.begin(); }
+    iterator end() const { return sv_.end(); }
+
+private:
+    impl_type sv_;
+};
+
+template <size_t Max = dynamic_range>
+using zstring_builder = basic_zstring_builder<char, Max>;
+
+template <size_t Max = dynamic_range>
+using wzstring_builder = basic_zstring_builder<wchar_t, Max>;
+}
+
+// operator ==
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename = std::enable_if_t<
+    std::is_convertible<T, gsl::basic_string_span<std::add_const_t<CharT>, Extent>>::value>
+>
+bool operator==(gsl::basic_string_span<CharT, Extent> one, const T& other) noexcept
+{
+    gsl::basic_string_span<std::add_const_t<CharT>, Extent> tmp(other);
+    return std::equal(one.begin(), one.end(), tmp.begin(), tmp.end());
+}
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename Dummy = std::enable_if_t<
+    std::is_convertible<T, gsl::basic_string_span<std::add_const_t<CharT>, Extent>>::value
+    && !gsl::details::is_basic_string_span<T>::value>
+>
+bool operator==(const T& one, gsl::basic_string_span<CharT, Extent> other) noexcept
+{
+    gsl::basic_string_span<std::add_const_t<CharT>, Extent> tmp(one);
+    return std::equal(tmp.begin(), tmp.end(), other.begin(), other.end());
+}
+
+#ifndef _MSC_VER 
+
+// VS treats temp and const containers as convertible to basic_string_span,
+// so the cases below are already covered by the previous operators
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename DataType = typename T::value_type,
+    typename Dummy = std::enable_if_t<
+    !gsl::details::is_span<T>::value
+    && !gsl::details::is_basic_string_span<T>::value
+    && std::is_convertible<DataType*, CharT*>::value
+    && std::is_same<std::decay_t<decltype(std::declval<T>().size(), *std::declval<T>().data())>, DataType>::value>
+>
+bool operator==(gsl::basic_string_span<CharT, Extent> one, const T& other) noexcept
+{
+    gsl::basic_string_span<std::add_const_t<CharT>, Extent> tmp(other);
+    return std::equal(one.begin(), one.end(), tmp.begin(), tmp.end());
+}
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename DataType = typename T::value_type,
+    typename Dummy = std::enable_if_t<
+    !gsl::details::is_span<T>::value
+    && !gsl::details::is_basic_string_span<T>::value
+    && std::is_convertible<DataType*, CharT*>::value
+    && std::is_same<std::decay_t<decltype(std::declval<T>().size(), *std::declval<T>().data())>, DataType>::value>
+>
+bool operator==(const T& one, gsl::basic_string_span<CharT, Extent> other) noexcept
+{
+    gsl::basic_string_span<std::add_const_t<CharT>, Extent> tmp(one);
+    return std::equal(tmp.begin(), tmp.end(), other.begin(), other.end());
+}
+#endif
+
+// operator !=
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename = std::enable_if_t<
+    std::is_convertible<T, gsl::basic_string_span<std::add_const_t<CharT>, Extent>>::value>
+>
+bool operator!=(gsl::basic_string_span<CharT, Extent> one, const T& other) noexcept
+{
+    return !(one == other);
+}
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename Dummy = std::enable_if_t<
+    std::is_convertible<T, gsl::basic_string_span<std::add_const_t<CharT>, Extent>>::value
+    && !gsl::details::is_basic_string_span<T>::value>
+>
+bool operator!=(const T& one, gsl::basic_string_span<CharT, Extent> other) noexcept
+{
+    return !(one == other);
+}
+
+#ifndef _MSC_VER 
+
+// VS treats temp and const containers as convertible to basic_string_span,
+// so the cases below are already covered by the previous operators
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename DataType = typename T::value_type,
+    typename Dummy = std::enable_if_t<
+    !gsl::details::is_span<T>::value
+    && !gsl::details::is_basic_string_span<T>::value
+    && std::is_convertible<DataType*, CharT*>::value
+    && std::is_same<std::decay_t<decltype(std::declval<T>().size(), *std::declval<T>().data())>, DataType>::value>
+>
+bool operator!=(gsl::basic_string_span<CharT, Extent> one, const T& other) noexcept
+{
+    return !(one == other);
+}
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename DataType = typename T::value_type,
+    typename Dummy = std::enable_if_t<
+    !gsl::details::is_span<T>::value
+    && !gsl::details::is_basic_string_span<T>::value
+    && std::is_convertible<DataType*, CharT*>::value
+    && std::is_same<std::decay_t<decltype(std::declval<T>().size(), *std::declval<T>().data())>, DataType>::value>
+>
+bool operator!=(const T& one, gsl::basic_string_span<CharT, Extent> other) noexcept
+{
+    return !(one == other);
+}
+#endif
+
+// operator<
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename = std::enable_if_t<
+    std::is_convertible<T, gsl::basic_string_span<std::add_const_t<CharT>, Extent>>::value>
+>
+bool operator<(gsl::basic_string_span<CharT, Extent> one, const T& other) noexcept
+{
+    gsl::basic_string_span<std::add_const_t<CharT>, Extent> tmp(other);
+    return std::lexicographical_compare(one.begin(), one.end(), tmp.begin(), tmp.end());
+}
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename Dummy = std::enable_if_t<
+    std::is_convertible<T, gsl::basic_string_span<std::add_const_t<CharT>, Extent>>::value
+    && !gsl::details::is_basic_string_span<T>::value>
+>
+bool operator<(const T& one, gsl::basic_string_span<CharT, Extent> other) noexcept
+{
+    gsl::basic_string_span<std::add_const_t<CharT>, Extent> tmp(one);
+    return std::lexicographical_compare(tmp.begin(), tmp.end(), other.begin(), other.end());
+}
+
+#ifndef _MSC_VER 
+
+// VS treats temp and const containers as convertible to basic_string_span,
+// so the cases below are already covered by the previous operators
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename DataType = typename T::value_type,
+    typename Dummy = std::enable_if_t<
+    !gsl::details::is_span<T>::value
+    && !gsl::details::is_basic_string_span<T>::value
+    && std::is_convertible<DataType*, CharT*>::value
+    && std::is_same<std::decay_t<decltype(std::declval<T>().size(), *std::declval<T>().data())>, DataType>::value>
+>
+bool operator<(gsl::basic_string_span<CharT, Extent> one, const T& other) noexcept
+{
+    gsl::basic_string_span<std::add_const_t<CharT>, Extent> tmp(other);
+    return std::lexicographical_compare(one.begin(), one.end(), tmp.begin(), tmp.end());
+}
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename DataType = typename T::value_type,
+    typename Dummy = std::enable_if_t<
+    !gsl::details::is_span<T>::value
+    && !gsl::details::is_basic_string_span<T>::value
+    && std::is_convertible<DataType*, CharT*>::value
+    && std::is_same<std::decay_t<decltype(std::declval<T>().size(), *std::declval<T>().data())>, DataType>::value>
+>
+bool operator<(const T& one, gsl::basic_string_span<CharT, Extent> other) noexcept
+{
+    gsl::basic_string_span<std::add_const_t<CharT>, Extent> tmp(one);
+    return std::lexicographical_compare(tmp.begin(), tmp.end(), other.begin(), other.end());
+}
+#endif
+
+// operator <=
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename = std::enable_if_t<
+    std::is_convertible<T, gsl::basic_string_span<std::add_const_t<CharT>, Extent>>::value>
+>
+bool operator<=(gsl::basic_string_span<CharT, Extent> one, const T& other) noexcept
+{
+    return !(other < one);
+}
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename Dummy = std::enable_if_t<
+    std::is_convertible<T, gsl::basic_string_span<std::add_const_t<CharT>, Extent>>::value
+    && !gsl::details::is_basic_string_span<T>::value>
+>
+bool operator<=(const T& one, gsl::basic_string_span<CharT, Extent> other) noexcept
+{
+    return !(other < one);
+}
+
+#ifndef _MSC_VER 
+
+// VS treats temp and const containers as convertible to basic_string_span,
+// so the cases below are already covered by the previous operators
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename DataType = typename T::value_type,
+    typename Dummy = std::enable_if_t<
+    !gsl::details::is_span<T>::value
+    && !gsl::details::is_basic_string_span<T>::value
+    && std::is_convertible<DataType*, CharT*>::value
+    && std::is_same<std::decay_t<decltype(std::declval<T>().size(), *std::declval<T>().data())>, DataType>::value>
+>
+bool operator<=(gsl::basic_string_span<CharT, Extent> one, const T& other) noexcept
+{
+    return !(other < one);
+}
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename DataType = typename T::value_type,
+    typename Dummy = std::enable_if_t<
+    !gsl::details::is_span<T>::value
+    && !gsl::details::is_basic_string_span<T>::value
+    && std::is_convertible<DataType*, CharT*>::value
+    && std::is_same<std::decay_t<decltype(std::declval<T>().size(), *std::declval<T>().data())>, DataType>::value>
+>
+bool operator<=(const T& one, gsl::basic_string_span<CharT, Extent> other) noexcept
+{
+    return !(other < one);
+}
+#endif
+
+// operator>
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename = std::enable_if_t<
+    std::is_convertible<T, gsl::basic_string_span<std::add_const_t<CharT>, Extent>>::value>
+>
+bool operator>(gsl::basic_string_span<CharT, Extent> one, const T& other) noexcept
+{
+    return other < one;
+}
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename Dummy = std::enable_if_t<
+    std::is_convertible<T, gsl::basic_string_span<std::add_const_t<CharT>, Extent>>::value
+    && !gsl::details::is_basic_string_span<T>::value>
+>
+bool operator>(const T& one, gsl::basic_string_span<CharT, Extent> other) noexcept
+{
+    return other < one;
+}
+
+#ifndef _MSC_VER 
+
+// VS treats temp and const containers as convertible to basic_string_span,
+// so the cases below are already covered by the previous operators
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename DataType = typename T::value_type,
+    typename Dummy = std::enable_if_t<
+    !gsl::details::is_span<T>::value
+    && !gsl::details::is_basic_string_span<T>::value
+    && std::is_convertible<DataType*, CharT*>::value
+    && std::is_same<std::decay_t<decltype(std::declval<T>().size(), *std::declval<T>().data())>, DataType>::value>
+>
+bool operator>(gsl::basic_string_span<CharT, Extent> one, const T& other) noexcept
+{
+    return other < one;
+}
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename DataType = typename T::value_type,
+    typename Dummy = std::enable_if_t<
+    !gsl::details::is_span<T>::value
+    && !gsl::details::is_basic_string_span<T>::value
+    && std::is_convertible<DataType*, CharT*>::value
+    && std::is_same<std::decay_t<decltype(std::declval<T>().size(), *std::declval<T>().data())>, DataType>::value>
+>
+bool operator>(const T& one, gsl::basic_string_span<CharT, Extent> other) noexcept
+{
+    return other < one;
+}
+#endif
+
+// operator >=
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename = std::enable_if_t<
+    std::is_convertible<T, gsl::basic_string_span<std::add_const_t<CharT>, Extent>>::value>
+>
+bool operator>=(gsl::basic_string_span<CharT, Extent> one, const T& other) noexcept
+{
+    return !(one < other);
+}
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename Dummy = std::enable_if_t<
+    std::is_convertible<T, gsl::basic_string_span<std::add_const_t<CharT>, Extent>>::value
+    && !gsl::details::is_basic_string_span<T>::value>
+>
+bool operator>=(const T& one, gsl::basic_string_span<CharT, Extent> other) noexcept
+{
+    return !(one < other);
+}
+
+#ifndef _MSC_VER 
+
+// VS treats temp and const containers as convertible to basic_string_span,
+// so the cases below are already covered by the previous operators
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename DataType = typename T::value_type,
+    typename Dummy = std::enable_if_t<
+    !gsl::details::is_span<T>::value
+    && !gsl::details::is_basic_string_span<T>::value
+    && std::is_convertible<DataType*, CharT*>::value
+    && std::is_same<std::decay_t<decltype(std::declval<T>().size(), *std::declval<T>().data())>, DataType>::value>
+>
+bool operator>=(gsl::basic_string_span<CharT, Extent> one, const T& other) noexcept
+{
+    return !(one < other);
+}
+
+template <typename CharT, std::ptrdiff_t Extent = gsl::dynamic_range, typename T,
+    typename DataType = typename T::value_type,
+    typename Dummy = std::enable_if_t<
+    !gsl::details::is_span<T>::value
+    && !gsl::details::is_basic_string_span<T>::value
+    && std::is_convertible<DataType*, CharT*>::value
+    && std::is_same<std::decay_t<decltype(std::declval<T>().size(), *std::declval<T>().data())>, DataType>::value>
+>
+bool operator>=(const T& one, gsl::basic_string_span<CharT, Extent> other) noexcept
+{
+    return !(one < other);
+}
+#endif
+
+// VS 2013 workarounds
+#ifdef _MSC_VER
+
+#undef constexpr
+#pragma pop_macro("constexpr")
+
+#if _MSC_VER <= 1800
+
+#pragma warning(pop)
+
+#ifndef GSL_THROW_ON_CONTRACT_VIOLATION
+#undef noexcept
+#pragma pop_macro("noexcept")
+#endif // GSL_THROW_ON_CONTRACT_VIOLATION
+
+#undef GSL_MSVC_HAS_TYPE_DEDUCTION_BUG
+
+#endif // _MSC_VER <= 1800
+#endif // _MSC_VER
+
+#if defined(GSL_THROW_ON_CONTRACT_VIOLATION)
+
+#undef noexcept
+
+#ifdef _MSC_VER
+#pragma pop_macro("noexcept")
+#endif
+
+#endif // GSL_THROW_ON_CONTRACT_VIOLATION
+
+#endif // GSL_STRING_SPAN_H
diff --git a/include/string_view.h b/include/string_view.h
deleted file mode 100644
index 7080ce5..0000000
--- a/include/string_view.h
+++ /dev/null
@@ -1,183 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////// 
-// 
-// Copyright (c) 2015 Microsoft Corporation. All rights reserved. 
-// 
-// This code is licensed under the MIT License (MIT). 
-// 
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 
-// THE SOFTWARE. 
-// 
-///////////////////////////////////////////////////////////////////////////////
-
-#pragma once
-
-#ifndef GSL_STRING_VIEW_H
-#define GSL_STRING_VIEW_H
-
-#include "array_view.h"
-#include <cstring>
-
-namespace gsl
-{
-//
-// czstring and wzstring
-//
-// These are "tag" typedef's for C-style strings (i.e. null-terminated character arrays) 
-// that allow static analysis to help find bugs.
-//
-// There are no additional features/semantics that we can find a way to add inside the
-// type system for these types that will not either incur significant runtime costs or
-// (sometimes needlessly) break existing programs when introduced.
-//
-template<size_t Max = dynamic_range>
-using czstring = const char*;
-
-template<size_t Max = dynamic_range>
-using cwzstring = const wchar_t*;
-
-template<size_t Max = dynamic_range>
-using zstring = char*;
-
-template<size_t Max = dynamic_range>
-using wzstring = wchar_t*;
-
-//
-// string_view and relatives
-//
-// Note that Extent is always single-dimension only
-// Note that SizeType is defaulted to be smaller than size_t which is the array_view default
-//
-// TODO (neilmac) once array_view regains configurable size_type, update these typedef's
-//
-template <class CharT, size_t Extent = dynamic_range>
-using basic_string_view = array_view<CharT, Extent>;
-
-template<size_t Extent = dynamic_range>
-using string_view = basic_string_view<char, Extent>;
-
-template<size_t Extent = dynamic_range>
-using cstring_view = basic_string_view<const char, Extent>;
-
-template<size_t Extent = dynamic_range>
-using wstring_view = basic_string_view<wchar_t, Extent>;
-
-template<size_t Extent = dynamic_range>
-using cwstring_view = basic_string_view<const wchar_t, Extent>;
-
-
-//
-// ensure_sentinel() 
-//
-// Provides a way to obtain an array_view from a contiguous sequence
-// that ends with a (non-inclusive) sentinel value.
-//
-// Will fail-fast if sentinel cannot be found before max elements are examined.
-//
-template<class T, class SizeType, const T Sentinel>
-array_view<T, dynamic_range> ensure_sentinel(const T* seq, SizeType max = std::numeric_limits<SizeType>::max())
-{
-    auto cur = seq;
-    while (SizeType(cur - seq) < max && *cur != Sentinel) ++cur;
-    fail_fast_assert(*cur == Sentinel);
-    return{ seq, SizeType(cur - seq) };
-}
-
-
-//
-// ensure_z - creates a string_view for a czstring or cwzstring.
-// Will fail fast if a null-terminator cannot be found before
-// the limit of size_type.
-//
-template<class T>
-inline basic_string_view<T, dynamic_range> ensure_z(T* const & sz, size_t max = std::numeric_limits<size_t>::max())
-{
-    return ensure_sentinel<T, size_t, 0>(sz, max);
-}
-
-// TODO (neilmac) there is probably a better template-magic way to get the const and non-const overloads to share an implementation
-inline basic_string_view<char, dynamic_range> ensure_z(char* const & sz, size_t max)
-{
-    auto len = strnlen(sz, max);
-    fail_fast_assert(sz[len] == 0); return{ sz, len };
-}
-
-inline basic_string_view<const char, dynamic_range> ensure_z(const char* const& sz, size_t max)
-{
-    auto len = strnlen(sz, max);
-    fail_fast_assert(sz[len] == 0); return{ sz, len };
-}
-
-inline basic_string_view<wchar_t, dynamic_range> ensure_z(wchar_t* const & sz, size_t max)
-{
-    auto len = wcsnlen(sz, max);
-    fail_fast_assert(sz[len] == 0); return{ sz, len };
-}
-
-inline basic_string_view<const wchar_t, dynamic_range> ensure_z(const wchar_t* const & sz, size_t max)
-{
-    auto len = wcsnlen(sz, max);
-    fail_fast_assert(sz[len] == 0); return{ sz, len };
-}
-
-template<class T, size_t N>
-basic_string_view<T, dynamic_range> ensure_z(T(&sz)[N]) { return ensure_z(&sz[0], N); }
-
-template<class Cont>
-basic_string_view<typename std::remove_pointer<typename Cont::pointer>::type, dynamic_range> ensure_z(Cont& cont)
-{
-    return ensure_z(cont.data(), cont.length());
-}
-
-//
-// to_string() allow (explicit) conversions from string_view to string
-//
-template<class CharT, size_t Extent>
-std::basic_string<typename std::remove_const<CharT>::type> to_string(basic_string_view<CharT, Extent> view)
-{
-    return{ view.data(), view.length() };
-}
-
-
-template<class CharT, size_t Extent = dynamic_range>
-class basic_zstring_builder
-{
-public:
-    using string_view_type = basic_string_view<CharT, Extent>;
-    using value_type = CharT;
-    using pointer = CharT*;
-    using size_type = typename string_view_type::size_type;
-    using iterator = typename string_view_type::iterator;
-
-    basic_zstring_builder(CharT* data, size_type length) : sv_(data, length) {}
-
-    template<size_t Size>
-    basic_zstring_builder(CharT(&arr)[Size]) : sv_(arr) {}
-
-    pointer data() const { return sv_.data(); }
-    string_view_type view() const { return sv_; }
-
-    size_type length() const { return sv_.length(); }
-
-    pointer assume0() const { return data(); }
-    string_view_type ensure_z() const { return gsl::ensure_z(sv_); }
-
-    iterator begin() const { return sv_.begin(); }
-    iterator end() const { return sv_.end(); }
-
-private:
-    string_view_type sv_;
-};
-
-template <size_t Max = dynamic_range>
-using zstring_builder = basic_zstring_builder<char, Max>;
-
-template <size_t Max = dynamic_range>
-using wzstring_builder = basic_zstring_builder<wchar_t, Max>;
-}
-
-#endif // GSL_STRING_VIEW_H
diff --git a/tests/CMakeLists.txt b/tests/CMakeLists.txt
index 5e4c395..7990ec3 100644
--- a/tests/CMakeLists.txt
+++ b/tests/CMakeLists.txt
@@ -9,19 +9,20 @@ include_directories(
     ./unittest-cpp
 )
 
-add_definitions(-DGSL_THROWS_FOR_TESTING)
+add_definitions(-DGSL_THROW_ON_CONTRACT_VIOLATION)
 
 if(MSVC14 OR MSVC12) # has the support we need
     # remove unnecessary warnings about unchecked iterators
     add_definitions(-D_SCL_SECURE_NO_WARNINGS)
+    add_compile_options(/W4)
 else()
     include(CheckCXXCompilerFlag)
     CHECK_CXX_COMPILER_FLAG("-std=c++14" COMPILER_SUPPORTS_CXX14)
     CHECK_CXX_COMPILER_FLAG("-std=c++11" COMPILER_SUPPORTS_CXX11)
     if(COMPILER_SUPPORTS_CXX14)
-    	set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++14")
+    	set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++14 -Wall -Wno-missing-braces")
     elseif(COMPILER_SUPPORTS_CXX11)
-    	set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11")
+    	set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11 -Wall -Wno-missing-braces")
     else()
       message(STATUS "The compiler ${CMAKE_CXX_COMPILER} has no C++11 support. Please use a different C++ compiler.")
     endif()
@@ -32,7 +33,7 @@ if (NOT EXISTS ${CMAKE_CURRENT_SOURCE_DIR}/unittest-cpp)
 endif()
 
 function(add_gsl_test name)
-    add_executable(${name} ${name}.cpp)
+    add_executable(${name} ${name}.cpp ../include/gsl.h ../include/gsl_assert.h ../include/gsl_util.h ../include/span.h ../include/string_span.h)
     target_link_libraries(${name} UnitTest++)
     install(TARGETS ${name}
         RUNTIME DESTINATION bin
@@ -43,8 +44,9 @@ function(add_gsl_test name)
     )
 endfunction()
 
-add_gsl_test(array_view_tests)
-add_gsl_test(string_view_tests)
+add_gsl_test(span_tests)
+add_gsl_test(strided_span_tests)
+add_gsl_test(string_span_tests)
 add_gsl_test(at_tests)
 add_gsl_test(bounds_tests)
 add_gsl_test(notnull_tests)
diff --git a/tests/array_view_tests.cpp b/tests/array_view_tests.cpp
deleted file mode 100644
index 3a8acc2..0000000
--- a/tests/array_view_tests.cpp
+++ /dev/null
@@ -1,1963 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////// 
-// 
-// Copyright (c) 2015 Microsoft Corporation. All rights reserved. 
-// 
-// This code is licensed under the MIT License (MIT). 
-// 
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 
-// THE SOFTWARE. 
-// 
-///////////////////////////////////////////////////////////////////////////////
-
-#include <UnitTest++/UnitTest++.h> 
-#include <array_view.h>
-
-#include <string>
-#include <vector>
-#include <list>
-#include <iostream>
-
-using namespace std;
-using namespace gsl;
-
-namespace 
-{
-	void use(int&) {}
-	struct BaseClass {};
-	struct DerivedClass : BaseClass {};
-}
-
-SUITE(array_view_tests)
-{
-	TEST(basics)
-	{
-		auto ptr = as_array_view(new int[10], 10);
-		fill(ptr.begin(), ptr.end(), 99);
-		for (int num : ptr)
-		{
-			CHECK(num == 99);
-		}
-
-		delete[] ptr.data();
-
-
-		static_bounds<size_t, 4, dynamic_range, 2> bounds{ 3 };
-	
-#ifdef CONFIRM_COMPILATION_ERRORS
-		array_view<int, 4, dynamic_range, 2> av(nullptr, bounds);
-		av.extent();
-		av.extent<2>();
-		av[8][4][3];
-#endif
-	}
-
-	TEST (array_view_convertible)
-	{
-#ifdef CONFIRM_COMPILATION_ERRORS
-		array_view<int, 7, 4, 2> av1(nullptr, b1);
-#endif
-	
-		auto f = [&]() { array_view<int, 7, 4, 2> av1(nullptr); };
-		CHECK_THROW(f(), fail_fast); 
-		
-		array_view<int, 7, dynamic_range, 2> av1(nullptr);
-
-#ifdef CONFIRM_COMPILATION_ERRORS
-		static_bounds<size_t, 7, dynamic_range, 2> b12(b11);
-		b12 = b11;
-		b11 = b12;
-	
-		array_view<int, dynamic_range> av1 = nullptr;
-		array_view<int, 7, dynamic_range, 2> av2(av1);
-		array_view<int, 7, 4, 2> av2(av1);
-#endif
-
-		array_view<DerivedClass> avd;
-#ifdef CONFIRM_COMPILATION_ERRORS
-		array_view<BaseClass> avb = avd;
-#endif
-		array_view<const DerivedClass> avcd = avd;
-	}
-
-	TEST(boundary_checks)
-	{
-		int arr[10][2];
-		auto av = as_array_view(arr);
-
-		fill(begin(av), end(av), 0);
-
-		av[2][0] = 1;
-		av[1][1] = 3;
-
-		// out of bounds
-		CHECK_THROW(av[1][3] = 3, fail_fast);
-		CHECK_THROW((av[{1, 3}] = 3), fail_fast);
-
-		CHECK_THROW(av[10][2], fail_fast);
-		CHECK_THROW((av[{10,2}]), fail_fast);
-	}
-
-	void overloaded_func(array_view<const int, dynamic_range, 3, 5> exp, int expected_value) {
-		for (auto val : exp)
-		{
-			CHECK(val == expected_value);
-		}
-	}
-
-	void overloaded_func(array_view<const char, dynamic_range, 3, 5> exp, char expected_value) {
-		for (auto val : exp)
-		{
-			CHECK(val == expected_value);
-		}
-	}
-
-	void fixed_func(array_view<int, 3, 3, 5> exp, int expected_value) {
-		for (auto val : exp)
-		{
-			CHECK(val == expected_value);
-		}
-	}
-
-	TEST(array_view_parameter_test)
-	{
-		auto data = new int[4][3][5];
-
-		auto av = as_array_view(data, 4);
-
-		CHECK(av.size() == 60);
-
-		fill(av.begin(), av.end(), 34);
-					
-		int count = 0;
-		for_each(av.rbegin(), av.rend(), [&](int val) { count += val; });
-		CHECK(count == 34 * 60);
-		overloaded_func(av, 34);
-
-		overloaded_func(av.as_array_view(dim<>(4), dim<>(3), dim<>(5)), 34);
-
-		//fixed_func(av, 34);
-		delete[] data;
-	}
-
-
-	TEST(md_access)
-	{
-		unsigned int width = 5, height = 20;
-
-		unsigned int imgSize = width * height;
-		auto image_ptr = new int[imgSize][3];
-
-		// size check will be done
-		auto image_view = as_array_view(image_ptr, imgSize).as_array_view(dim<>(height), dim<>(width), dim<3>());
-
-		iota(image_view.begin(), image_view.end(), 1);
-
-		int expected = 0;
-		for (unsigned int i = 0; i < height; i++)
-		{
-			for (unsigned int j = 0; j < width; j++)
-			{
-				CHECK(expected + 1 == image_view[i][j][0]);
-				CHECK(expected + 2 == image_view[i][j][1]);
-				CHECK(expected + 3 == image_view[i][j][2]);
-				
-				auto val = image_view[{i, j, 0}];
-				CHECK(expected + 1 == val);
-				val = image_view[{i, j, 1}];
-				CHECK(expected + 2 == val);
-				val = image_view[{i, j, 2}];
-				CHECK(expected + 3 == val);
-
-				expected += 3;
-			}
-		}
-	}
-
-	TEST(array_view_factory_test)
-	{
-		{
-			int * arr = new int[150];
-
-			auto av = as_array_view(arr, dim<10>(), dim<>(3), dim<5>());
-
-			fill(av.begin(), av.end(), 24);
-			overloaded_func(av, 24);
-
-			delete[] arr;
-
-
-			array<int, 15> stdarr{ 0 };
-			auto av2 = as_array_view(stdarr);
-			overloaded_func(av2.as_array_view(dim<>(1), dim<3>(), dim<5>()), 0);
-
-
-			string str = "ttttttttttttttt"; // size = 15
-			auto t = str.data();
-			auto av3 = as_array_view(str);
-			overloaded_func(av3.as_array_view(dim<>(1), dim<3>(), dim<5>()), 't');
-		}
-
-		{
-			int a[3][4][5];
-			auto av = as_array_view(a);
-			const int (*b)[4][5];
-			b = a;
-			auto bv = as_array_view(b, 3);
-
-			CHECK(av == bv);
-
-			const std::array<double, 3> arr = {0.0, 0.0, 0.0};
-			auto cv = as_array_view(arr);
-
-			vector<float> vec(3);
-			auto dv = as_array_view(vec);
-			
-#ifdef CONFIRM_COMPILATION_ERRORS
-			auto dv2 = as_array_view(std::move(vec));
-#endif
-		}
-	}
-
-	TEST (array_view_reshape_test)
-	{
-		int a[3][4][5];
-		auto av = as_array_view(a);
-		auto av2 = av.as_array_view(dim<60>());
-		auto av3 = av2.as_array_view(dim<3>(), dim<4>(), dim<5>());
-		auto av4 = av3.as_array_view(dim<4>(), dim<>(3), dim<5>());
-		auto av5 = av4.as_array_view(dim<3>(), dim<4>(), dim<5>());
-		auto av6 = av5.as_array_view(dim<12>(), dim<>(5));
-		
-		fill(av6.begin(), av6.end(), 1);
-		
-		auto av7 = av6.as_bytes();
-		
-		auto av8 = av7.as_array_view<int>();
-
-		CHECK(av8.size() == av6.size());
-		for (size_t i = 0; i < av8.size(); i++)
-		{
-			CHECK(av8[i] == 1);
-		}
-
-#ifdef CONFIRM_COMPILATION_ERRORS
-		struct Foo {char c[11];};
-		auto av9 = av7.as_array_view<Foo>();
-#endif
-	}
-
-
-	TEST (array_view_section_test)
-	{
-		int a[30][4][5];
-		
-		auto av = as_array_view(a);
-		auto sub = av.section({15, 0, 0}, gsl::index<3>{2, 2, 2});
-		auto subsub = sub.section({1, 0, 0}, gsl::index<3>{1, 1, 1});
-	}
-
-	TEST(array_view_section)
-	{
-		std::vector<int> data(5 * 10);
-		std::iota(begin(data), end(data), 0);
-		const array_view<int, 5, 10> av = as_array_view(data).as_array_view(dim<5>(), dim<10>());
-
-		strided_array_view<int, 2> av_section_1 = av.section({ 1, 2 }, { 3, 4 });
-		CHECK((av_section_1[{0, 0}] == 12));
-		CHECK((av_section_1[{0, 1}] == 13));
-		CHECK((av_section_1[{1, 0}] == 22));
-		CHECK((av_section_1[{2, 3}] == 35));
-
-		strided_array_view<int, 2> av_section_2 = av_section_1.section({ 1, 2 }, { 2,2 });
-		CHECK((av_section_2[{0, 0}] == 24));
-		CHECK((av_section_2[{0, 1}] == 25));
-		CHECK((av_section_2[{1, 0}] == 34));
-	}
- 
-	TEST(strided_array_view_constructors)
-	{
-		// Check stride constructor
-		{
-			int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
-			const int carr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
-
-			strided_array_view<int, 1> sav1{ arr, {{9}, {1}} }; // T -> T
-			CHECK(sav1.bounds().index_bounds() == index<1>{ 9 });
-			CHECK(sav1.bounds().stride() == 1);
-			CHECK(sav1[0] == 1 && sav1[8] == 9);
-
-
-			strided_array_view<const int, 1> sav2{ carr, {{ 4 }, { 2 }} }; // const T -> const T
-			CHECK(sav2.bounds().index_bounds() == index<1>{ 4 });
-			CHECK(sav2.bounds().strides() == index<1>{2});
-			CHECK(sav2[0] == 1 && sav2[3] == 7);
-
-			strided_array_view<int, 2> sav3{ arr, {{ 2, 2 },{ 6, 2 }} }; // T -> const T
-			CHECK((sav3.bounds().index_bounds() == index<2>{ 2, 2 }));
-			CHECK((sav3.bounds().strides() == index<2>{ 6, 2 }));
-			CHECK((sav3[{0, 0}] == 1 && sav3[{0, 1}] == 3 && sav3[{1, 0}] == 7));
-		}
-
-		// Check array_view constructor
-		{
-			int arr[] = { 1, 2 };
-
-			// From non-cv-qualified source
-			{
-				const array_view<int> src{ arr };
-
-				strided_array_view<int, 1> sav{ src, {2, 1} };
-				CHECK(sav.bounds().index_bounds() == index<1>{ 2 });
-				CHECK(sav.bounds().strides() == index<1>{ 1 });
-				CHECK(sav[1] == 2);
-
-#if _MSC_VER > 1800
-				strided_array_view<const int, 1> sav_c{ {src}, {2, 1} };
-#else                
-				strided_array_view<const int, 1> sav_c{ array_view<const int>{src}, strided_bounds<1>{2, 1} };
-#endif                
-				CHECK(sav_c.bounds().index_bounds() == index<1>{ 2 });
-				CHECK(sav_c.bounds().strides() == index<1>{ 1 });
-				CHECK(sav_c[1] == 2);
-
-#if _MSC_VER > 1800
-				strided_array_view<volatile int, 1> sav_v{ {src}, {2, 1} };
-#else                
-				strided_array_view<volatile int, 1> sav_v{ array_view<volatile int>{src}, strided_bounds<1>{2, 1} };
-#endif                
-				CHECK(sav_v.bounds().index_bounds() == index<1>{ 2 });
-				CHECK(sav_v.bounds().strides() == index<1>{ 1 });
-				CHECK(sav_v[1] == 2);
-
-#if _MSC_VER > 1800
-				strided_array_view<const volatile int, 1> sav_cv{ {src}, {2, 1} };
-#else                
-				strided_array_view<const volatile int, 1> sav_cv{ array_view<const volatile int>{src}, strided_bounds<1>{2, 1} };
-#endif                
-				CHECK(sav_cv.bounds().index_bounds() == index<1>{ 2 });
-				CHECK(sav_cv.bounds().strides() == index<1>{ 1 });
-				CHECK(sav_cv[1] == 2);
-			}
-
-			// From const-qualified source
-			{
-				const array_view<const int> src{ arr };
-
-				strided_array_view<const int, 1> sav_c{ src, {2, 1} };
-				CHECK(sav_c.bounds().index_bounds() == index<1>{ 2 });
-				CHECK(sav_c.bounds().strides() == index<1>{ 1 });
-				CHECK(sav_c[1] == 2);
-
-#if _MSC_VER > 1800
-				strided_array_view<const volatile int, 1> sav_cv{ {src}, {2, 1} };
-#else
-				strided_array_view<const volatile int, 1> sav_cv{ array_view<const volatile int>{src}, strided_bounds<1>{2, 1} };
-#endif                
-				
-				CHECK(sav_cv.bounds().index_bounds() == index<1>{ 2 });
-				CHECK(sav_cv.bounds().strides() == index<1>{ 1 });
-				CHECK(sav_cv[1] == 2);
-			}
-
-			// From volatile-qualified source
-			{
-				const array_view<volatile int> src{ arr };
-
-				strided_array_view<volatile int, 1> sav_v{ src, {2, 1} };
-				CHECK(sav_v.bounds().index_bounds() == index<1>{ 2 });
-				CHECK(sav_v.bounds().strides() == index<1>{ 1 });
-				CHECK(sav_v[1] == 2);
-
-#if _MSC_VER > 1800
-				strided_array_view<const volatile int, 1> sav_cv{ {src}, {2, 1} };
-#else
-				strided_array_view<const volatile int, 1> sav_cv{ array_view<const volatile int>{src}, strided_bounds<1>{2, 1} };
-#endif                
-				CHECK(sav_cv.bounds().index_bounds() == index<1>{ 2 });
-				CHECK(sav_cv.bounds().strides() == index<1>{ 1 });
-				CHECK(sav_cv[1] == 2);
-			}
-
-			// From cv-qualified source
-			{
-				const array_view<const volatile int> src{ arr };
-
-				strided_array_view<const volatile int, 1> sav_cv{ src, {2, 1} };
-				CHECK(sav_cv.bounds().index_bounds() == index<1>{ 2 });
-				CHECK(sav_cv.bounds().strides() == index<1>{ 1 });
-				CHECK(sav_cv[1] == 2);
-			}
-		}
-
-		// Check const-casting constructor
-		{
-			int arr[2] = { 4, 5 };
-
-			const array_view<int, 2> av(arr, 2);
-			array_view<const int, 2> av2{ av };
-			CHECK(av2[1] == 5);
-
-			static_assert(std::is_convertible<const array_view<int, 2>, array_view<const int, 2>>::value, "ctor is not implicit!");
-		
-			const strided_array_view<int, 1> src{ arr, {2, 1} };
-			strided_array_view<const int, 1> sav{ src };
-			CHECK(sav.bounds().index_bounds() == index<1>{ 2 });
-			CHECK(sav.bounds().stride() == 1);
-			CHECK(sav[1] == 5);
-			
-			static_assert(std::is_convertible<const strided_array_view<int, 1>, strided_array_view<const int, 1>>::value, "ctor is not implicit!");
-		}
-
-		// Check copy constructor
-		{
-			int arr1[2] = { 3, 4 };
-			const strided_array_view<int, 1> src1{ arr1, {2, 1} };
-			strided_array_view<int, 1> sav1{ src1 };
- 
-			CHECK(sav1.bounds().index_bounds() == index<1>{ 2 });
-			CHECK(sav1.bounds().stride() == 1);
-			CHECK(sav1[0] == 3);
-
-			int arr2[6] = { 1, 2, 3, 4, 5, 6 };
-			const strided_array_view<const int, 2> src2{ arr2, {{ 3, 2 }, { 2, 1 }} };
-			strided_array_view<const int, 2> sav2{ src2 };
-			CHECK((sav2.bounds().index_bounds() == index<2>{ 3, 2 }));
-			CHECK((sav2.bounds().strides() == index<2>{ 2, 1 }));
-			CHECK((sav2[{0, 0}] == 1 && sav2[{2, 0}] == 5));
-		}
-
-		// Check const-casting assignment operator
-		{
-			int arr1[2] = { 1, 2 };
-			int arr2[6] = { 3, 4, 5, 6, 7, 8 };
-
-			const strided_array_view<int, 1> src{ arr1, {{2}, {1}} };
-			strided_array_view<const int, 1> sav{ arr2, {{3}, {2}} };
-			strided_array_view<const int, 1>& sav_ref = (sav = src);
-			CHECK(sav.bounds().index_bounds() == index<1>{ 2 });
-			CHECK(sav.bounds().strides() == index<1>{ 1 });
-			CHECK(sav[0] == 1);
-			CHECK(&sav_ref == &sav);
-		}
-		
-		// Check copy assignment operator
-		{
-			int arr1[2] = { 3, 4 };
-			int arr1b[1] = { 0 };
-			const strided_array_view<int, 1> src1{ arr1, {2, 1} };
-			strided_array_view<int, 1> sav1{ arr1b, {1, 1} };
-			strided_array_view<int, 1>& sav1_ref = (sav1 = src1);
-			CHECK(sav1.bounds().index_bounds() == index<1>{ 2 });
-			CHECK(sav1.bounds().strides() == index<1>{ 1 });
-			CHECK(sav1[0] == 3);
-			CHECK(&sav1_ref == &sav1);
-
-			const int arr2[6] = { 1, 2, 3, 4, 5, 6 };
-			const int arr2b[1] = { 0 };
-			const strided_array_view<const int, 2> src2{ arr2, {{ 3, 2 },{ 2, 1 }} };
-			strided_array_view<const int, 2> sav2{ arr2b, {{ 1, 1 },{ 1, 1 }} };
-			strided_array_view<const int, 2>& sav2_ref = (sav2 = src2);
-			CHECK((sav2.bounds().index_bounds() == index<2>{ 3, 2 }));
-			CHECK((sav2.bounds().strides() == index<2>{ 2, 1 }));
-			CHECK((sav2[{0, 0}] == 1 && sav2[{2, 0}] == 5));
-			CHECK(&sav2_ref == &sav2);
-		}
-	}
-
-	TEST(strided_array_view_slice)
-	{
-		std::vector<int> data(5 * 10);
-		std::iota(begin(data), end(data), 0);
-		const array_view<int, 5, 10> src = as_array_view(data).as_array_view(dim<5>(), dim<10>());
-
-		const strided_array_view<int, 2> sav{ src, {{5, 10}, {10, 1}} };
-#ifdef CONFIRM_COMPILATION_ERRORS
-		const strided_array_view<const int, 2> csav{ {src},{ { 5, 10 },{ 10, 1 } } };
-#endif
-		const strided_array_view<const int, 2> csav{ array_view<const int, 5, 10>{ src }, { { 5, 10 },{ 10, 1 } } };
-
-		strided_array_view<int, 1> sav_sl = sav[2];
-		CHECK(sav_sl[0] == 20);
-		CHECK(sav_sl[9] == 29);
-
-		strided_array_view<const int, 1> csav_sl = sav[3];
-		CHECK(csav_sl[0] == 30);
-		CHECK(csav_sl[9] == 39);
-
-		CHECK(sav[4][0] == 40);
-		CHECK(sav[4][9] == 49);
-	}
-
-	TEST(strided_array_view_column_major)
-	{
-		// strided_array_view may be used to accomodate more peculiar
-		// use cases, such as column-major multidimensional array
-		// (aka. "FORTRAN" layout).
-
-		int cm_array[3 * 5] = {
-			1, 4, 7, 10, 13,
-			2, 5, 8, 11, 14,
-			3, 6, 9, 12, 15
-		};
-		strided_array_view<int, 2> cm_sav{ cm_array, {{ 5, 3 },{ 1, 5 }} };
-
-		// Accessing elements
-		CHECK((cm_sav[{0, 0}] == 1));
-		CHECK((cm_sav[{0, 1}] == 2));
-		CHECK((cm_sav[{1, 0}] == 4));
-		CHECK((cm_sav[{4, 2}] == 15));
-
-		// Slice
-		strided_array_view<int, 1> cm_sl = cm_sav[3];
-
-		CHECK(cm_sl[0] == 10);
-		CHECK(cm_sl[1] == 11);
-		CHECK(cm_sl[2] == 12);
-
-		// Section 
-		strided_array_view<int, 2> cm_sec = cm_sav.section( { 2, 1 }, { 3, 2 });
-
-		CHECK((cm_sec.bounds().index_bounds() == index<2>{3, 2}));
-		CHECK((cm_sec[{0, 0}] == 8));
-		CHECK((cm_sec[{0, 1}] == 9));
-		CHECK((cm_sec[{1, 0}] == 11));
-		CHECK((cm_sec[{2, 1}] == 15));
-	}
-
-	TEST(strided_array_view_bounds)
-	{
-		int arr[] = { 0, 1, 2, 3 };
-		array_view<int> av(arr);
-
-		{
-			// incorrect sections
-			
-			CHECK_THROW(av.section(0, 0)[0], fail_fast);
-			CHECK_THROW(av.section(1, 0)[0], fail_fast);
-			CHECK_THROW(av.section(1, 1)[1], fail_fast);
-			
-			CHECK_THROW(av.section(2, 5), fail_fast);
-			CHECK_THROW(av.section(5, 2), fail_fast);
-			CHECK_THROW(av.section(5, 0), fail_fast);
-			CHECK_THROW(av.section(0, 5), fail_fast);
-			CHECK_THROW(av.section(5, 5), fail_fast);
-		}
-
-		{
-			// zero stride
-			strided_array_view<int, 1> sav{ av,{ { 4 },{} } };
-			CHECK(sav[0] == 0);
-			CHECK(sav[3] == 0);
-			CHECK_THROW(sav[4], fail_fast);
-		}
-
-		{
-			// zero extent
-			strided_array_view<int, 1> sav{ av,{ {},{ 1 } } };
-			CHECK_THROW(sav[0], fail_fast);
-		}
-
-		{
-			// zero extent and stride
-			strided_array_view<int, 1> sav{ av,{ {},{} } };
-			CHECK_THROW(sav[0], fail_fast);
-		}
-
-		{
-			// strided array ctor with matching strided bounds 
-			strided_array_view<int, 1> sav{ arr,{ 4, 1 } };
-			CHECK(sav.bounds().index_bounds() == index<1>{ 4 });
-			CHECK(sav[3] == 3);
-			CHECK_THROW(sav[4], fail_fast);
-		}
-
-		{
-			// strided array ctor with smaller strided bounds 
-			strided_array_view<int, 1> sav{ arr,{ 2, 1 } };
-			CHECK(sav.bounds().index_bounds() == index<1>{ 2 });
-			CHECK(sav[1] == 1);
-			CHECK_THROW(sav[2], fail_fast);
-		}
-
-		{
-			// strided array ctor with fitting irregular bounds 
-			strided_array_view<int, 1> sav{ arr,{ 2, 3 } };
-			CHECK(sav.bounds().index_bounds() == index<1>{ 2 });
-			CHECK(sav[0] == 0);
-			CHECK(sav[1] == 3);
-			CHECK_THROW(sav[2], fail_fast);
-		}
-
-		{
-			// bounds cross data boundaries - from static arrays
-			CHECK_THROW((strided_array_view<int, 1> { arr, { 3, 2 } }), fail_fast);
-			CHECK_THROW((strided_array_view<int, 1> { arr, { 3, 3 } }), fail_fast);
-			CHECK_THROW((strided_array_view<int, 1> { arr, { 4, 5 } }), fail_fast);
-			CHECK_THROW((strided_array_view<int, 1> { arr, { 5, 1 } }), fail_fast);
-			CHECK_THROW((strided_array_view<int, 1> { arr, { 5, 5 } }), fail_fast);
-		}
-
-		{
-			// bounds cross data boundaries - from array view
-			CHECK_THROW((strided_array_view<int, 1> { av, { 3, 2 } }), fail_fast);
-			CHECK_THROW((strided_array_view<int, 1> { av, { 3, 3 } }), fail_fast);
-			CHECK_THROW((strided_array_view<int, 1> { av, { 4, 5 } }), fail_fast);
-			CHECK_THROW((strided_array_view<int, 1> { av, { 5, 1 } }), fail_fast);
-			CHECK_THROW((strided_array_view<int, 1> { av, { 5, 5 } }), fail_fast);
-		}
-
-		{
-			// bounds cross data boundaries - from dynamic arrays
-			CHECK_THROW((strided_array_view<int, 1> { av.data(), 4, { 3, 2 } }), fail_fast);
-			CHECK_THROW((strided_array_view<int, 1> { av.data(), 4, { 3, 3 } }), fail_fast);
-			CHECK_THROW((strided_array_view<int, 1> { av.data(), 4, { 4, 5 } }), fail_fast);
-			CHECK_THROW((strided_array_view<int, 1> { av.data(), 4, { 5, 1 } }), fail_fast);
-			CHECK_THROW((strided_array_view<int, 1> { av.data(), 4, { 5, 5 } }), fail_fast);
-			CHECK_THROW((strided_array_view<int, 1> { av.data(), 2, { 2, 2 } }), fail_fast);
-		}
-
-#ifdef CONFIRM_COMPILATION_ERRORS
-		{
-			strided_array_view<int, 1> sav0{ av.data(), { 3, 2 } };
-			strided_array_view<int, 1> sav1{ arr, { 1 } };
-			strided_array_view<int, 1> sav2{ arr, { 1,1,1 } };
-			strided_array_view<int, 1> sav3{ av, { 1 } };
-			strided_array_view<int, 1> sav4{ av, { 1,1,1 } };
-			strided_array_view<int, 2> sav5{ av.as_array_view(dim<2>(), dim<2>()), { 1 } };
-			strided_array_view<int, 2> sav6{ av.as_array_view(dim<2>(), dim<2>()), { 1,1,1 } };
-			strided_array_view<int, 2> sav7{ av.as_array_view(dim<2>(), dim<2>()), { { 1,1 },{ 1,1 },{ 1,1 } } };
-
-			index<1> index{ 0, 1 };
-			strided_array_view<int, 1> sav8{ arr,{ 1,{ 1,1 } } };
-			strided_array_view<int, 1> sav9{ arr,{ { 1,1 },{ 1,1 } } };
-			strided_array_view<int, 1> sav10{ av,{ 1,{ 1,1 } } };
-			strided_array_view<int, 1> sav11{ av,{ { 1,1 },{ 1,1 } } };
-			strided_array_view<int, 2> sav12{ av.as_array_view(dim<2>(), dim<2>()),{ { 1 },{ 1 } } };
-			strided_array_view<int, 2> sav13{ av.as_array_view(dim<2>(), dim<2>()),{ { 1 },{ 1,1,1 } } };
-			strided_array_view<int, 2> sav14{ av.as_array_view(dim<2>(), dim<2>()),{ { 1,1,1 },{ 1 } } };
-		}
-#endif
-	}
-
-	TEST(strided_array_view_type_conversion)
-	{
-		int arr[] = { 0, 1, 2, 3 };
-		array_view<int> av(arr);
-
-		{
-			strided_array_view<int, 1> sav{ av.data(), av.size(), { av.size() / 2, 2 } };
-#ifdef CONFIRM_COMPILATION_ERRORS
-			strided_array_view<long, 1> lsav1 = sav.as_strided_array_view<long, 1>();
-#endif
-		}
-		{
-			strided_array_view<int, 1> sav{ av, { av.size() / 2, 2 } };
-#ifdef CONFIRM_COMPILATION_ERRORS
-			strided_array_view<long, 1> lsav1 = sav.as_strided_array_view<long, 1>();
-#endif
-		}
-
-		array_view<const byte, dynamic_range> bytes = av.as_bytes();
-
-		// retype strided array with regular strides - from raw data
-		{
-			strided_bounds<2> bounds{ { 2, bytes.size() / 4 }, { bytes.size() / 2, 1 } };
-			strided_array_view<const byte, 2> sav2{ bytes.data(), bytes.size(), bounds };
-			strided_array_view<const int, 2> sav3 = sav2.as_strided_array_view<const int>();
-			CHECK(sav3[0][0] == 0);
-			CHECK(sav3[1][0] == 2);
-			CHECK_THROW(sav3[1][1], fail_fast);
-			CHECK_THROW(sav3[0][1], fail_fast);
-		}
-
-		// retype strided array with regular strides - from array_view
-		{
-			strided_bounds<2> bounds{ { 2, bytes.size() / 4 }, { bytes.size() / 2, 1 } };
-			array_view<const byte, 2, dynamic_range> bytes2 = bytes.as_array_view(dim<2>(), dim<>(bytes.size() / 2));
-			strided_array_view<const byte, 2> sav2{ bytes2, bounds };
-			strided_array_view<int, 2> sav3 = sav2.as_strided_array_view<int>();
-			CHECK(sav3[0][0] == 0);
-			CHECK(sav3[1][0] == 2);
-			CHECK_THROW(sav3[1][1], fail_fast);
-			CHECK_THROW(sav3[0][1], fail_fast);
-		}
-
-		// retype strided array with not enough elements - last dimension of the array is too small
-		{
-			strided_bounds<2> bounds{ { 4,2 },{ 4, 1 } };
-			array_view<const byte, 2, dynamic_range> bytes2 = bytes.as_array_view(dim<2>(), dim<>(bytes.size() / 2));
-			strided_array_view<const byte, 2> sav2{ bytes2, bounds };
-			CHECK_THROW(sav2.as_strided_array_view<int>(), fail_fast);
-		}
-
-		// retype strided array with not enough elements - strides are too small
-		{
-			strided_bounds<2> bounds{ { 4,2 },{ 2, 1 } };
-			array_view<const byte, 2, dynamic_range> bytes2 = bytes.as_array_view(dim<2>(), dim<>(bytes.size() / 2));
-			strided_array_view<const byte, 2> sav2{ bytes2, bounds };
-			CHECK_THROW(sav2.as_strided_array_view<int>(), fail_fast);
-		}
-
-		// retype strided array with not enough elements - last dimension does not divide by the new typesize
-		{
-			strided_bounds<2> bounds{ { 2,6 },{ 4, 1 } };
-			array_view<const byte, 2, dynamic_range> bytes2 = bytes.as_array_view(dim<2>(), dim<>(bytes.size() / 2));
-			strided_array_view<const byte, 2> sav2{ bytes2, bounds };
-			CHECK_THROW(sav2.as_strided_array_view<int>(), fail_fast);
-		}
-
-		// retype strided array with not enough elements - strides does not divide by the new typesize
-		{
-			strided_bounds<2> bounds{ { 2, 1 },{ 6, 1 } };
-			array_view<const byte, 2, dynamic_range> bytes2 = bytes.as_array_view(dim<2>(), dim<>(bytes.size() / 2));
-			strided_array_view<const byte, 2> sav2{ bytes2, bounds };
-			CHECK_THROW(sav2.as_strided_array_view<int>(), fail_fast);
-		}
-
-		// retype strided array with irregular strides - from raw data
-		{
-			strided_bounds<1> bounds{ bytes.size() / 2, 2 };
-			strided_array_view<const byte, 1> sav2{ bytes.data(), bytes.size(), bounds };
-			CHECK_THROW(sav2.as_strided_array_view<int>(), fail_fast);
-		}
-
-		// retype strided array with irregular strides - from array_view
-		{
-			strided_bounds<1> bounds{ bytes.size() / 2, 2 };
-			strided_array_view<const byte, 1> sav2{ bytes, bounds };
-			CHECK_THROW(sav2.as_strided_array_view<int>(), fail_fast);
-		}
-	}
-
-	TEST(empty_arrays)
-	{
-#ifdef CONFIRM_COMPILATION_ERRORS
-		{
-			array_view<int, 1> empty;
-			strided_array_view<int, 2> empty2;
-			strided_array_view<int, 1> empty3{ nullptr,{ 0, 1 } };
-		}
-#endif
-
-		{
-			array_view<int, 0> empty_av(nullptr);
-
-			CHECK(empty_av.bounds().index_bounds() == index<1>{ 0 });
-			CHECK_THROW(empty_av[0], fail_fast);
-			CHECK_THROW(empty_av.begin()[0], fail_fast);
-			CHECK_THROW(empty_av.cbegin()[0], fail_fast);		
-			for (auto& v : empty_av)
-			{
-				CHECK(false);
-			}
-		}
-
-		{
-			array_view<int> empty_av = {};
-			CHECK(empty_av.bounds().index_bounds() == index<1>{ 0 });
-			CHECK_THROW(empty_av[0], fail_fast);
-			CHECK_THROW(empty_av.begin()[0], fail_fast);
-			CHECK_THROW(empty_av.cbegin()[0], fail_fast); 
-			for (auto& v : empty_av)
-			{
-				CHECK(false);
-			}
-		}
-
-		{
-			array_view<int, 0> empty_av(nullptr);
-			strided_array_view<int, 1> empty_sav{ empty_av, { 0, 1 } };
-
-			CHECK(empty_sav.bounds().index_bounds() == index<1>{ 0 });
-			CHECK_THROW(empty_sav[0], fail_fast);
-			CHECK_THROW(empty_sav.begin()[0], fail_fast);
-			CHECK_THROW(empty_sav.cbegin()[0], fail_fast);
-
-			for (auto& v : empty_sav)
-			{
-				CHECK(false);
-			}
-		}
-
-		{
-			strided_array_view<int, 1> empty_sav{ nullptr, 0, { 0, 1 } };
-
-			CHECK(empty_sav.bounds().index_bounds() == index<1>{ 0 });
-			CHECK_THROW(empty_sav[0], fail_fast);
-			CHECK_THROW(empty_sav.begin()[0], fail_fast);
-			CHECK_THROW(empty_sav.cbegin()[0], fail_fast);
-
-			for (auto& v : empty_sav)
-			{
-				CHECK(false);
-			}
-		}
-	}
-
-	TEST(index_constructor)
-	{
-		auto arr = new int[8];
-		for (int i = 0; i < 4; ++i)
-		{
-			arr[2 * i] = 4 + i;
-			arr[2 * i + 1] = i;
-		}
-
-		array_view<int, dynamic_range> av(arr, 8);
-
-		size_t a[1] = { 0 };
-		index<1> i = a;
-
-		CHECK(av[i] == 4);
-
-		auto av2 = av.as_array_view(dim<4>(), dim<>(2));
-		size_t a2[2] = { 0, 1 };
-		index<2> i2 = a2;
-
-		CHECK(av2[i2] == 0);
-		CHECK(av2[0][i] == 4);
-
-		delete[] arr;
-	}
-
-	TEST(index_constructors)
-	{
-		{
-			// components of the same type
-			index<3> i1(0, 1, 2);
-			CHECK(i1[0] == 0);
-
-			// components of different types
-			size_t c0 = 0;
-			size_t c1 = 1;
-			index<3> i2(c0, c1, 2);
-			CHECK(i2[0] == 0);
-
-			// from array
-			index<3> i3 = { 0,1,2 };
-			CHECK(i3[0] == 0);
-
-			// from other index of the same size type
-			index<3> i4 = i3;
-			CHECK(i4[0] == 0);
-
-			// from other index of bigger size type
-			index<3, short> i5 = i4;
-			CHECK(i5[0] == 0);
-
-			// from other index of smaller size type
-			index<3, long long> i6 = i4;
-			CHECK(i6[0] == 0);
-
-			// default
-			index<3, long long> i7;
-			CHECK(i7[0] == 0);
-
-			// default
-			index<3, long long> i9 = {};
-			CHECK(i9[0] == 0);
-		}
-
-		{
-			// components of the same type
-			index<1> i1(0);
-			CHECK(i1[0] == 0);
-
-			// components of different types
-			size_t c0 = 0;
-			index<1> i2(c0);
-			CHECK(i2[0] == 0);
-
-			// from array
-			index<1> i3 = { 0 };
-			CHECK(i3[0] == 0);
-
-			// from int
-			index<1> i4 = 0;
-			CHECK(i4[0] == 0);
-
-			// from other index of the same size type
-			index<1> i5 = i3;
-			CHECK(i5[0] == 0);
-
-			// from other index of bigger size type
-			index<1, short> i6 = i5;
-			CHECK(i6[0] == 0);
-
-			// from other index of smaller size type
-			index<1, long long> i7 = i6;
-			CHECK(i7[0] == 0);
-
-			// default
-			index<1, long long> i8;
-			CHECK(i8[0] == 0);
-
-			// default
-			index<1, long long> i9 = {};
-			CHECK(i9[0] == 0);
-		}
-
-#ifdef CONFIRM_COMPILATION_ERRORS
-		{
-			index<3> i1(0, 1);
-			index<3> i2(0, 1, 2, 3);
-			index<3> i3 = { 0 };
-			index<3> i4 = { 0, 1, 2, 3 };
-			index<1> i5 = { 0,1 };
-		}
-#endif
-	}
-
-	TEST(index_operations)
-	{
-		size_t a[3] = { 0, 1, 2 };
-		size_t b[3] = { 3, 4, 5 };
-		index<3> i = a;
-		index<3> j = b;
-
-		CHECK(i[0] == 0);
-		CHECK(i[1] == 1);
-		CHECK(i[2] == 2);
-
-		{
-			index<3> k = i + j;
-
-			CHECK(i[0] == 0);
-			CHECK(i[1] == 1);
-			CHECK(i[2] == 2);
-			CHECK(k[0] == 3);
-			CHECK(k[1] == 5);
-			CHECK(k[2] == 7);
-		}
-
-		{
-			index<3> k = i * 3;
-
-			CHECK(i[0] == 0);
-			CHECK(i[1] == 1);
-			CHECK(i[2] == 2);
-			CHECK(k[0] == 0);
-			CHECK(k[1] == 3);
-			CHECK(k[2] == 6);
-		}
-
-		{
-			index<3> k = 3 * i;
-
-			CHECK(i[0] == 0);
-			CHECK(i[1] == 1);
-			CHECK(i[2] == 2);
-			CHECK(k[0] == 0);
-			CHECK(k[1] == 3);
-			CHECK(k[2] == 6);
-		}
-
-		{
-			index<2> k = details::shift_left(i);
-
-			CHECK(i[0] == 0);
-			CHECK(i[1] == 1);
-			CHECK(i[2] == 2);
-			CHECK(k[0] == 1);
-			CHECK(k[1] == 2);
-		}
-
-	}
-
-	void iterate_second_column(array_view<int, dynamic_range, dynamic_range> av)
-	{
-		auto length = av.size() / 2;
-
-		// view to the second column 
-		auto section = av.section({ 0,1 }, { length,1 });
-
-		CHECK(section.size() == length);
-		for (unsigned int i = 0; i < section.size(); ++i)
-		{
-			CHECK(section[i][0] == av[i][1]);
-		}
-
-		for (unsigned int i = 0; i < section.size(); ++i)
-		{
-			auto idx = index<2>{ i,0 }; // avoid braces inside the CHECK macro
-			CHECK(section[idx] == av[i][1]);
-		}
-
-		CHECK(section.bounds().index_bounds()[0] == length);
-		CHECK(section.bounds().index_bounds()[1] == 1);
-		for (unsigned int i = 0; i < section.bounds().index_bounds()[0]; ++i)
-		{
-			for (unsigned int j = 0; j < section.bounds().index_bounds()[1]; ++j)
-			{
-				auto idx = index<2>{ i,j }; // avoid braces inside the CHECK macro
-				CHECK(section[idx] == av[i][1]);
-			}
-		}
-
-		size_t check_sum = 0;
-		for (size_t i = 0; i < length; ++i)
-		{
-			check_sum += av[i][1];
-		}
-
-		{
-			size_t idx = 0;
-			size_t sum = 0;
-			for (auto num : section)
-			{
-				CHECK(num == av[idx][1]);
-				sum += num;
-				idx++;
-			}
-
-			CHECK(sum == check_sum);
-		}
-		{
-			size_t idx = length - 1;
-			size_t sum = 0;
-			for (auto iter = section.rbegin(); iter != section.rend(); ++iter)
-			{
-				CHECK(*iter == av[idx][1]);
-				sum += *iter;
-				idx--;
-			}
-
-			CHECK(sum == check_sum);
-		}
-	}
-
-	TEST(array_view_section_iteration)
-	{
-		int arr[4][2] = { { 4,0 },{ 5,1 },{ 6,2 },{ 7,3 } };
-
-		// static bounds
-		{
-			array_view<int, 4, 2> av = arr;
-			iterate_second_column(av);
-		}
-		// first bound is dynamic
-		{
-			array_view<int, dynamic_range, 2> av  = arr;
-			iterate_second_column(av);
-		}
-		// second bound is dynamic
-		{
-			array_view<int, 4, dynamic_range> av = arr;
-			iterate_second_column(av);
-		}
-		// both bounds are dynamic
-		{
-			array_view<int, dynamic_range, dynamic_range> av(arr, 4);
-			iterate_second_column(av);
-		}
-	}
-
-	TEST(dynamic_array_view_section_iteration)
-	{
-		unsigned int height = 4, width = 2;
-		unsigned int size = height * width;
-
-		auto arr = new int[size];
-		for (int unsigned i = 0; i < size; ++i)
-		{
-			arr[i] = i;
-		}
-
-		auto av = as_array_view(arr, size);
-
-		// first bound is dynamic
-		{
-			array_view<int, dynamic_range, 2> av2 = av.as_array_view(dim<>(height), dim<>(width));
-			iterate_second_column(av2);
-		}
-		// second bound is dynamic
-		{
-			array_view<int, 4, dynamic_range> av2 = av.as_array_view(dim<>(height), dim<>(width));
-			iterate_second_column(av2);
-		}
-		// both bounds are dynamic
-		{
-			array_view<int, dynamic_range, dynamic_range> av2 = av.as_array_view(dim<>(height), dim<>(width));
-			iterate_second_column(av2);
-		}
-
-		delete[] arr;
-	}
-
-	void iterate_every_other_element(array_view<int, dynamic_range> av)
-	{
-		// pick every other element
-
-		auto length = av.size() / 2;
-#if _MSC_VER > 1800
-		auto bounds = strided_bounds<1>({ length }, { 2 });
-#else
-		auto bounds = strided_bounds<1>(index<1>{ length }, index<1>{ 2 });
-#endif
-		strided_array_view<int, 1> strided(&av.data()[1], av.size() - 1, bounds);
-
-		CHECK(strided.size() == length);
-		CHECK(strided.bounds().index_bounds()[0] == length);
-		for (unsigned int i = 0; i < strided.size(); ++i)
-		{
-			CHECK(strided[i] == av[2 * i + 1]);
-		}
-
-		int idx = 0;
-		for (auto num : strided)
-		{
-			CHECK(num == av[2 * idx + 1]);
-			idx++;
-		}
-	}
-
-	TEST(strided_array_view_section_iteration)
-	{
-		int arr[8] = {4,0,5,1,6,2,7,3};
-
-		// static bounds
-		{
-			array_view<int, 8> av(arr, 8);
-			iterate_every_other_element(av);
-		}
-
-		// dynamic bounds
-		{
-			array_view<int, dynamic_range> av(arr, 8);
-			iterate_every_other_element(av);
-		}
-	}
-
-	TEST(dynamic_strided_array_view_section_iteration)
-	{
-		auto arr = new int[8];
-		for (int i = 0; i < 4; ++i)
-		{
-			arr[2 * i] = 4 + i;
-			arr[2 * i + 1] = i;
-		}
-		
-		auto av = as_array_view(arr, 8);
-		iterate_every_other_element(av);
-
-		delete[] arr;
-	}
-
-	void iterate_second_slice(array_view<int, dynamic_range, dynamic_range, dynamic_range> av)
-	{
-		int expected[6] = { 2,3,10,11,18,19 };
-		auto section = av.section({ 0,1,0 }, { 3,1,2 });
-
-		for (unsigned int i = 0; i < section.extent<0>(); ++i)
-		{
-			for (unsigned int j = 0; j < section.extent<1>(); ++j)
-				for (unsigned int k = 0; k < section.extent<2>(); ++k)
-				{
-					auto idx = index<3>{ i,j,k }; // avoid braces in the CHECK macro
-					CHECK(section[idx] == expected[2 * i + 2 * j + k]);
-				}
-		}
-
-		for (unsigned int i = 0; i < section.extent<0>(); ++i)
-		{
-			for (unsigned int j = 0; j < section.extent<1>(); ++j)
-				for (unsigned int k = 0; k < section.extent<2>(); ++k)
-					CHECK(section[i][j][k] == expected[2 * i + 2 * j + k]);
-		}
-
-		int i = 0;
-		for (auto num : section)
-		{
-			CHECK(num == expected[i]);
-			i++;
-		}
-	}
-
-	TEST(strided_array_view_section_iteration_3d)
-	{
-		int arr[3][4][2];
-		for (int i = 0; i < 3; ++i)
-		{
-			for (int j = 0; j < 4; ++j)
-				for (unsigned int k = 0; k < 2; ++k)
-					arr[i][j][k] = 8 * i + 2 * j + k;
-		}
-
-		{
-			array_view<int, 3, 4, 2> av = arr;
-			iterate_second_slice(av);
-		}
-	}
-
-	TEST(dynamic_strided_array_view_section_iteration_3d)
-	{
-		unsigned int height = 12, width = 2;
-		unsigned int size = height * width;
-
-		auto arr = new int[size];
-		for (int unsigned i = 0; i < size; ++i)
-		{
-			arr[i] = i;
-		}
-
-		{
-			auto av = as_array_view(arr, 24).as_array_view(dim<3>(),dim<4>(),dim<2>());
-			iterate_second_slice(av);
-		}
-
-		{
-			auto av = as_array_view(arr, 24).as_array_view(dim<>(3), dim<4>(), dim<2>());
-			iterate_second_slice(av);
-		}
-
-		{
-			auto av = as_array_view(arr, 24).as_array_view(dim<3>(), dim<>(4), dim<2>());
-			iterate_second_slice(av);
-		}
-
-		{
-			auto av = as_array_view(arr, 24).as_array_view(dim<3>(), dim<4>(), dim<>(2));
-			iterate_second_slice(av);
-		}
-		delete[] arr;
-	}
-
-	TEST(strided_array_view_conversion)
-	{
-		// get an array_view of 'c' values from the list of X's
-
-		struct X { int a; int b; int c; };
-
-		X arr[4] = { { 0,1,2 },{ 3,4,5 },{ 6,7,8 },{ 9,10,11 } };
-
-		auto s = sizeof(int) / sizeof(byte);
-		auto d2 = 3 * s;
-		auto d1 = sizeof(int) * 12 / d2;
-
-		// convert to 4x12 array of bytes
-		auto av = as_array_view(arr, 4).as_bytes().as_array_view(dim<>(d1), dim<>(d2));
-
-		CHECK(av.bounds().index_bounds()[0] == 4);
-		CHECK(av.bounds().index_bounds()[1] == 12);
-
-		// get the last 4 columns
-		auto section = av.section({ 0, 2 * s }, { 4, s }); // { { arr[0].c[0], arr[0].c[1], arr[0].c[2], arr[0].c[3] } , { arr[1].c[0], ... } , ... }
-
-		// convert to array 4x1 array of integers
-		auto cs = section.as_strided_array_view<int>(); // { { arr[0].c }, {arr[1].c } , ... } 
-
-		CHECK(cs.bounds().index_bounds()[0] == 4);
-		CHECK(cs.bounds().index_bounds()[1] == 1);
-
-		// transpose to 1x4 array 
-		strided_bounds<2> reverse_bounds{ 
-			{ cs.bounds().index_bounds()[1] , cs.bounds().index_bounds()[0] },
-			{ cs.bounds().strides()[1], cs.bounds().strides()[0] }
-		};
-
-		strided_array_view<int, 2> transposed{ cs.data(), cs.bounds().total_size(), reverse_bounds };
-		
-		// slice to get a one-dimensional array of c's
-		strided_array_view<int, 1> result = transposed[0];
-
-		CHECK(result.bounds().index_bounds()[0] == 4);
-		CHECK_THROW(result.bounds().index_bounds()[1], fail_fast);
-
-		int i = 0;
-		for (auto& num : result)
-		{
-			CHECK(num == arr[i].c);
-			i++;
-		}
-
-	}
-
-	template<size_t Rank, typename T1, typename T2>
-	index<Rank, T2> Convert(index<Rank, T1> index)
-	{
-		return{ index };
-	}
-
-	TEST(DomainConverters)
-	{
-		// to smaller
-		{
-			index<2, int> int_index{ 0,1 };
-			index<2, short> short_index{ int_index };
-
-			CHECK(short_index[0] == 0);
-			CHECK(short_index[1] == 1);
-		}
-
-		// to smaller (failure)
-		{
-			index<2, int> big_int_index{ std::numeric_limits<int>::max(), 1 };
-			CHECK_THROW((Convert<2,int, short int>(big_int_index)), fail_fast);
-		}
-
-		// to same, sign mismatch
-		{
-			index<2, int> int_index{ 0,1 };
-			index<2, unsigned int> uint_index{ int_index };
-
-			CHECK(uint_index[0] == 0);
-			CHECK(uint_index[1] == 1);
-		}
-
-		// to same, sign mismatch, reversed
-		{
-			index<2, unsigned int> uint_index{ 0,1 };
-			index<2, int> int_index{ uint_index };
-
-			CHECK(int_index[0] == 0);
-			CHECK(int_index[1] == 1);
-		}
-
-		// to smaller, sign mismatch
-		{
-			index<2, int> int_index{ 0,1 };
-			index<2, unsigned short> ushort_index{ int_index };
-
-			CHECK(ushort_index[0] == 0);
-			CHECK(ushort_index[1] == 1);
-		}
-
-		// to bigger
-		{
-			index<2, int> int_index{ 0,1 };
-			index<2, long long> longlong_index{ int_index };
-
-			CHECK(longlong_index[0] == 0);
-			CHECK(longlong_index[1] == 1);
-		}
-
-		// to bigger with max index
-		{
-			index<2, int> big_int_index{ std::numeric_limits<int>::max(), 1 };
-			index<2, long long> longlong_index{ big_int_index };
-
-			CHECK(longlong_index[0] == std::numeric_limits<int>::max());
-			CHECK(longlong_index[1] == 1);
-		}
-
-		// to bigger, sign mismatch
-		{
-			index<2, int> int_index{ 0,1 };
-			index<2, unsigned long long> ulonglong_index{ int_index };
-
-			CHECK(ulonglong_index[0] == 0);
-			CHECK(ulonglong_index[1] == 1);
-		}
-
-	}
-
-	TEST(DomainConvertersRank1)
-	{
-		// to smaller
-		{
-			index<1, int> int_index{ 0 };
-			index<1, short> short_index{ int_index };
-
-			CHECK(short_index[0] == 0);
-		}
-
-		// to smaller (failure)
-		{
-			index<1, int> big_int_index{ std::numeric_limits<int>::max() };
-
-			CHECK_THROW((Convert<1, int, short int>(big_int_index)), fail_fast);
-		}
-
-		// to same, sign mismatch
-		{
-			index<1, int> int_index{ 0 };
-			index<1, unsigned int> uint_index{ int_index };
-
-			CHECK(uint_index[0] == 0);
-		}
-
-		// to same, sign mismatch, reversed
-		{
-			index<1, unsigned int> uint_index{ 0 };
-			index<1, int> int_index{ uint_index };
-
-			CHECK(int_index[0] == 0);
-		}
-
-		// to smaller, sign mismatch
-		{
-			index<1, int> int_index{ 0 };
-			index<1, unsigned short> ushort_index{ int_index };
-
-			CHECK(ushort_index[0] == 0);
-		}
-
-		// to bigger
-		{
-			index<1, int> int_index{ 0 };
-			index<1, long long> longlong_index{ int_index };
-
-			CHECK(longlong_index[0] == 0);
-		}
-
-		// to bigger with max index
-		{
-			index<1, int> big_int_index{ std::numeric_limits<int>::max() };
-			index<1, long long> longlong_index{ big_int_index };
-
-			CHECK(longlong_index[0] == std::numeric_limits<int>::max());
-		}
-
-		// to bigger, sign mismatch
-		{
-			index<1, int> int_index{ 0 };
-			index<1, unsigned long long> ulonglong_index{ int_index };
-
-			CHECK(ulonglong_index[0] == 0);
-		}
-
-	}
-
-	TEST(constructors)
-	{
-		array_view<int, dynamic_range> av(nullptr);
-		CHECK(av.length() == 0);
-
-		array_view<int, dynamic_range> av2;
-		CHECK(av2.length() == 0);
-
-		array_view<int, dynamic_range> av3(nullptr, 0);
-		CHECK(av3.length() == 0);
-
-		// Constructing from a nullptr + length is specifically disallowed
-		auto f = [&]() {array_view<int, dynamic_range> av4(nullptr, 2);};
-		CHECK_THROW(f(), fail_fast);
-
-		int arr1[2][3];
-		array_view<int, 2, dynamic_range> av5(arr1);
-
-		array<int, 15> arr2;
-		array_view<int, 15> av6(arr2);
-
-		vector<int> vec1(19);
-		array_view<int> av7(vec1);
-		CHECK(av7.length() == 19);
-
-
-		array_view<int> av8;
-		CHECK(av8.length() == 0);
-		array_view<int> av9(arr2);
-		CHECK(av9.length() == 15);
-
-
-#ifdef CONFIRM_COMPILATION_ERRORS
-		array_view<int, 4> av10;
-		DerivedClass *p = nullptr;
-		array_view<BaseClass> av11(p, 0);
-#endif
-	}
-
-	TEST(copyandassignment)
-	{
-		array_view<int, dynamic_range> av1;
-
-		int arr[] = {3, 4, 5};
-		av1 = arr;
-		array_view<array_view_options<const int, unsigned char>, dynamic_range> av2;
-		av2 = av1;
-	}
-
-	TEST(array_view_first)
-	{
-		int arr[5] = { 1, 2, 3, 4, 5 };
-
-		{
-			array_view<int, 5> av = arr;
-			CHECK((av.first<2>().bounds() == static_bounds<size_t, 2>()));
-			CHECK(av.first<2>().length() == 2);
-			CHECK(av.first(2).length() == 2);
-		}
-
-		{
-			array_view<int, 5> av = arr;
-			CHECK((av.first<0>().bounds() == static_bounds<size_t, 0>()));
-			CHECK(av.first<0>().length() == 0);
-			CHECK(av.first(0).length() == 0);
-		}
-
-		{
-			array_view<int, 5> av = arr;
-			CHECK((av.first<5>().bounds() == static_bounds<size_t, 5>()));
-			CHECK(av.first<5>().length() == 5);
-			CHECK(av.first(5).length() == 5);
-		}
-
-		{
-			array_view<int, 5> av = arr;
-#ifdef CONFIRM_COMPILATION_ERRORS
-			CHECK(av.first<6>().bounds() == static_bounds<size_t, 6>());
-			CHECK(av.first<6>().length() == 6);
-#endif
-			CHECK_THROW(av.first(6).length(), fail_fast);
-		}
-
-		{
-			array_view<int, dynamic_range> av;
-			CHECK((av.first<0>().bounds() == static_bounds<size_t, 0>()));
-			CHECK(av.first<0>().length() == 0);
-			CHECK(av.first(0).length() == 0);
-		}
-	}
-
-	TEST(array_view_last)
-	{
-		int arr[5] = { 1, 2, 3, 4, 5 };
-
-		{
-			array_view<int, 5> av = arr;
-			CHECK((av.last<2>().bounds() == static_bounds<size_t, 2>()));
-			CHECK(av.last<2>().length() == 2);
-			CHECK(av.last(2).length() == 2);
-		}
-
-		{
-			array_view<int, 5> av = arr;
-			CHECK((av.last<0>().bounds() == static_bounds<size_t, 0>()));
-			CHECK(av.last<0>().length() == 0);
-			CHECK(av.last(0).length() == 0);
-		}
-
-		{
-			array_view<int, 5> av = arr;
-			CHECK((av.last<5>().bounds() == static_bounds<size_t, 5>()));
-			CHECK(av.last<5>().length() == 5);
-			CHECK(av.last(5).length() == 5);
-		}
-
-		
-		{
-			array_view<int, 5> av = arr;
-#ifdef CONFIRM_COMPILATION_ERRORS
-			CHECK((av.last<6>().bounds() == static_bounds<size_t, 6>()));
-			CHECK(av.last<6>().length() == 6);
-#endif
-			CHECK_THROW(av.last(6).length(), fail_fast);
-		}
-
-		{
-			array_view<int, dynamic_range> av;
-			CHECK((av.last<0>().bounds() == static_bounds<size_t, 0>()));
-			CHECK(av.last<0>().length() == 0);
-			CHECK(av.last(0).length() == 0);
-		}
-	}
-
-	TEST(custmized_array_view_size)
-	{
-		double (*arr)[3][4] = new double[100][3][4];
-		array_view<array_view_options<double, char>, dynamic_range, 3, 4> av1(arr, (char)10);
-
-		struct EffectiveStructure
-		{
-			double* v1;
-			char v2;
-		};
-		CHECK(sizeof(av1) == sizeof(EffectiveStructure));
-
-		CHECK_THROW(av1[10][3][4], fail_fast);
-
-		array_view<const double, dynamic_range, 6, 4> av2 = av1.as_array_view(dim<>(5), dim<6>(), dim<4>());
-		
-	}
-
-	TEST(array_view_sub)
-	{
-		int arr[5] = { 1, 2, 3, 4, 5 };
-
-		{
-			array_view<int, 5> av = arr;
-			CHECK((av.sub<2,2>().bounds() == static_bounds<size_t, 2>()));
-			CHECK((av.sub<2,2>().length() == 2));
-			CHECK(av.sub(2,2).length() == 2);
-            CHECK(av.sub(2,3).length() == 3);
-		}
-
-
-		{
-			array_view<int, 5> av = arr;
-			CHECK((av.sub<0,0>().bounds() == static_bounds<size_t, 0>()));
-			CHECK((av.sub<0,0>().length() == 0));
-			CHECK(av.sub(0,0).length() == 0);
-		}
-
-		{
-			array_view<int, 5> av = arr;
-			CHECK((av.sub<0,5>().bounds() == static_bounds<size_t, 5>()));
-			CHECK((av.sub<0,5>().length() == 5));
-			CHECK(av.sub(0,5).length() == 5);
-            CHECK_THROW(av.sub(0,6).length(), fail_fast);
-            CHECK_THROW(av.sub(1,5).length(), fail_fast);
-		}
-
-		{
-			array_view<int, 5> av = arr;
-			CHECK((av.sub<5,0>().bounds() == static_bounds<size_t, 0>()));
-            CHECK((av.sub<5, 0>().length() == 0));
-            CHECK(av.sub(5,0).length() == 0);
-            CHECK_THROW(av.sub(6,0).length(), fail_fast);
-		}
-
-		{
-			array_view<int, dynamic_range> av;
-			CHECK((av.sub<0,0>().bounds() == static_bounds<size_t, 0>()));
-			CHECK((av.sub<0,0>().length() == 0));
-			CHECK(av.sub(0,0).length() == 0);
-            CHECK_THROW((av.sub<1,0>().length()), fail_fast);
-		}
-
-        {
-            array_view<int> av;
-            CHECK(av.sub(0).length() == 0);
-            CHECK_THROW(av.sub(1).length(), fail_fast);
-        }
-
-        {
-            array_view<int> av = arr;
-            CHECK(av.sub(0).length() == 5);
-            CHECK(av.sub(1).length() == 4);
-            CHECK(av.sub(4).length() == 1);
-            CHECK(av.sub(5).length() == 0);
-            CHECK_THROW(av.sub(6).length(), fail_fast);
-            auto av2 = av.sub(1);
-            for (int i = 0; i < 4; ++i)
-                CHECK(av2[i] == i+2);
-        }
-        
-        {
-            array_view<int,5> av = arr;
-            CHECK(av.sub(0).length() == 5);
-            CHECK(av.sub(1).length() == 4);
-            CHECK(av.sub(4).length() == 1);
-            CHECK(av.sub(5).length() == 0);
-            CHECK_THROW(av.sub(6).length(), fail_fast);
-            auto av2 = av.sub(1);
-            for (int i = 0; i < 4; ++i)
-                CHECK(av2[i] == i+2);
-        }
-    }
-
-	void AssertNullEmptyProperties(array_view<int, dynamic_range>& av)
-	{
-		CHECK(av.length() == 0);
-		CHECK(av.data() == nullptr);
-		CHECK(!av);
-	}
-
-	template <class T, class U>
-	void AssertContentsMatch(T a1, U a2)
-	{
-		CHECK(a1.length() == a2.length());
-		for (size_t i = 0; i < a1.length(); ++i)
-			CHECK(a1[i] == a2[i]);
-	}
-
-	TEST(TestNullConstruction)
-	{
-		array_view<int, dynamic_range> av;
-		AssertNullEmptyProperties(av);
-
-		array_view<int, dynamic_range> av2(nullptr);
-		AssertNullEmptyProperties(av2);
-	}
-
-	TEST(ArrayConstruction)
-	{
-		int a[] = { 1, 2, 3, 4 };
-
-		array_view<int, dynamic_range> av = { &a[1], 3 };
-		CHECK(av.length() == 3);
-
-		array_view<int, dynamic_range> av3 = { a, 2 };
-		CHECK(av3.length() == 2);
-
-		array_view<int, dynamic_range> av2 = a;
-		CHECK(av2.length() == 4);
-	}
-
-	TEST(NonConstConstConversions)
-	{
-		int a[] = { 1, 2, 3, 4 };
-
-#ifdef CONFIRM_COMPILATION_ERRORS
-		array_view<const int, dynamic_range> cav = a;
-		array_view<int, dynamic_range> av = cav;
-#else
-		array_view<int, dynamic_range> av = a;
-		array_view<const int, dynamic_range> cav = av;			 
-#endif
-		AssertContentsMatch(av, cav);
-	}
-
-	TEST(FixedSizeConversions)
-	{			
-		int arr[] = { 1, 2, 3, 4 };
-	
-		// converting to an array_view from an equal size array is ok
-		array_view<int, 4> av4 = arr;
-		CHECK(av4.length() == 4);
-
-		// converting to dynamic_range a_v is always ok
-		{
-			array_view<int, dynamic_range> av = av4;
-		}
-		{
-			array_view<int, dynamic_range> av = arr;
-		}
-
-		// initialization or assignment to static array_view that REDUCES size is NOT ok
-#ifdef CONFIRM_COMPILATION_ERRORS
-		{
-			array_view<int, 2> av2 = arr;
-		}
-		{
-			array_view<int, 2> av2 = av4;
-		}
-#endif
-
-		{
-			array_view<int, dynamic_range> av = arr;
-			array_view<int, 2> av2 = av;
-		}
-
-#ifdef CONFIRM_COMPILATION_ERRORS
-		{
-			array_view<int, dynamic_range> av = arr;
-			array_view<int, 2, 1> av2 = av.as_array_view(dim<2>(), dim<2>());
-		}
-#endif
-
-		{
-			array_view<int, dynamic_range> av = arr;
-			auto f = [&]() {array_view<int, 2, 1> av2 = av.as_array_view(dim<>(2), dim<>(2));};
-			CHECK_THROW(f(), fail_fast);
-		}
-
-		// but doing so explicitly is ok
-			
-		// you can convert statically
-		{
-			array_view<int, 2> av2 = {arr, 2};
-		}
-		{
-			array_view<int, 1> av2 = av4.first<1>();
-		}
-			
-		// ...or dynamically
-		{
-			// NB: implicit conversion to array_view<int,2> from array_view<int,dynamic_range>
-			array_view<int, 1> av2 = av4.first(1); 
-		}
-
-		// initialization or assignment to static array_view that requires size INCREASE is not ok.
-		int arr2[2]  = { 1, 2 };
-
-#ifdef CONFIRM_COMPILATION_ERRORS
-		{
-			array_view<int, 4> av4 = arr2;
-		}
-		{
-			array_view<int, 2> av2 = arr2;
-			array_view<int, 4> av4 = av2;
-		}
-#endif
-		{
-			auto f = [&]() {array_view<int, 4> av4 = {arr2, 2};};
-			CHECK_THROW(f(), fail_fast);
-		}
-
-		// this should fail - we are trying to assign a small dynamic a_v to a fixed_size larger one
-		array_view<int, dynamic_range> av = arr2;
-		auto f = [&](){ array_view<int, 4> av2 = av; };
-		CHECK_THROW(f(), fail_fast);
-	}
-
-	TEST(AsWriteableBytes)
-	{
-		int a[] = { 1, 2, 3, 4 };
-
-		{
-#ifdef CONFIRM_COMPILATION_ERRORS
-			// you should not be able to get writeable bytes for const objects
-			array_view<const int, dynamic_range> av = a;
-			auto wav = av.as_writeable_bytes();
-#endif
-		}
-
-		{
-			array_view<int, dynamic_range> av;
-			auto wav = av.as_writeable_bytes();
-			CHECK(wav.length() == av.length());
-			CHECK(wav.length() == 0);
-			CHECK(wav.bytes() == 0);
-		}
-
-		{
-			array_view<int, dynamic_range> av = a;
-			auto wav = av.as_writeable_bytes();
-			CHECK(wav.data() == (byte*)&a[0]);
-			CHECK(wav.length() == sizeof(a));
-		}
-	}
-
-	TEST(NonConstIterator)
-	{
-		int a[] = { 1, 2, 3, 4 };
-
-		{
-			array_view<int, dynamic_range> av = a;
-			auto wav = av.as_writeable_bytes();
-			for (auto& b : wav)
-			{
-				b = byte(0);
-			}
-			for (size_t i = 0; i < 4; ++i)
-			{
-				CHECK(a[i] == 0);
-			}
-		}
-
-		{
-			array_view<int, dynamic_range> av = a;
-			for (auto& n : av)
-			{
-				n = 1;
-			}
-			for (size_t i = 0; i < 4; ++i)
-			{
-				CHECK(a[i] == 1);
-			}
-		}
-	}
-
-	TEST(ArrayViewComparison)
-	{
-		{
-			int arr[10][2];
-			auto av1 = as_array_view(arr);
-			array_view<const int, dynamic_range, 2> av2 = av1;
-
-			CHECK(av1 == av2);
-
-			array_view<array_view_options<int, char>, 20> av3 = av1.as_array_view(dim<>(20));
-			CHECK(av3 == av2 && av3 == av1);
-		}
-
-		{
-			auto av1 = nullptr;
-			auto av2 = nullptr;
-			CHECK(av1 == av2);
-			CHECK(!(av1 != av2));
-			CHECK(!(av1 < av2));
-			CHECK(av1 <= av2);
-			CHECK(!(av1 > av2));
-			CHECK(av1 >= av2);
-			CHECK(av2 == av1);
-			CHECK(!(av2 != av1));
-			CHECK(!(av2 < av1));
-			CHECK(av2 <= av1);
-			CHECK(!(av2 > av1));
-			CHECK(av2 >= av1);
-		}
-
-		{
-			int arr[] = { 2, 1 }; // bigger
-
-			array_view<int> av1 = nullptr;
-			array_view<int> av2 = arr;
-
-			CHECK(av1 != av2);
-			CHECK(av2 != av1);
-			CHECK(!(av1 == av2));
-			CHECK(!(av2 == av1));
-			CHECK(av1 < av2);
-			CHECK(!(av2 < av1));
-			CHECK(av1 <= av2);
-			CHECK(!(av2 <= av1));
-			CHECK(av2 > av1);
-			CHECK(!(av1 > av2));
-			CHECK(av2 >= av1);
-			CHECK(!(av1 >= av2));
-		}
-
-		{
-			int arr1[] = { 1, 2 };
-			int arr2[] = { 1, 2 };
-			array_view<int> av1 = arr1;
-			array_view<int> av2 = arr2;
-
-			CHECK(av1 == av2);
-			CHECK(!(av1 != av2));
-			CHECK(!(av1 < av2));
-			CHECK(av1 <= av2);
-			CHECK(!(av1 > av2));
-			CHECK(av1 >= av2);
-			CHECK(av2 == av1);
-			CHECK(!(av2 != av1));
-			CHECK(!(av2 < av1));
-			CHECK(av2 <= av1);
-			CHECK(!(av2 > av1));
-			CHECK(av2 >= av1);
-		}
-
-		{
-			int arr[] = { 1, 2, 3 };
-
-			array_view<int> av1 = { &arr[0], 2 }; // shorter
-			array_view<int> av2 = arr;            // longer
-
-			CHECK(av1 != av2);
-			CHECK(av2 != av1);
-			CHECK(!(av1 == av2));
-			CHECK(!(av2 == av1));
-			CHECK(av1 < av2);
-			CHECK(!(av2 < av1));
-			CHECK(av1 <= av2);
-			CHECK(!(av2 <= av1));
-			CHECK(av2 > av1);
-			CHECK(!(av1 > av2));
-			CHECK(av2 >= av1);
-			CHECK(!(av1 >= av2));
-		}
-
-		{
-			int arr1[] = { 1, 2 }; // smaller
-			int arr2[] = { 2, 1 }; // bigger
-
-			array_view<int> av1 = arr1;
-			array_view<int> av2 = arr2;
-
-			CHECK(av1 != av2);
-			CHECK(av2 != av1);
-			CHECK(!(av1 == av2));
-			CHECK(!(av2 == av1));
-			CHECK(av1 < av2);
-			CHECK(!(av2 < av1));
-			CHECK(av1 <= av2);
-			CHECK(!(av2 <= av1));
-			CHECK(av2 > av1);
-			CHECK(!(av1 > av2));
-			CHECK(av2 >= av1);
-			CHECK(!(av1 >= av2));
-		}
-	}
-}
-
-int main(int, const char *[])
-{
-	return UnitTest::RunAllTests();
-}
diff --git a/tests/bounds_tests.cpp b/tests/bounds_tests.cpp
index c3f549f..0665260 100644
--- a/tests/bounds_tests.cpp
+++ b/tests/bounds_tests.cpp
@@ -15,7 +15,7 @@
 ///////////////////////////////////////////////////////////////////////////////
 
 #include <UnitTest++/UnitTest++.h> 
-#include <array_view.h>
+#include <span.h>
 #include <vector>
 
 using namespace std;
@@ -23,16 +23,18 @@ using namespace gsl;;
 
 namespace 
 {
-	void use(unsigned int&) {}
+    void use(std::ptrdiff_t&) {}
 }
 
 SUITE(bounds_test)
 {
 	TEST(basic_bounds)
 	{
-		for (auto point : static_bounds <unsigned int, dynamic_range, 3, 4 > { 2 })
+		for (auto point : static_bounds<dynamic_range, 3, 4 > { 2 })
 		{
-			for (unsigned int j = 0; j < decltype(point)::rank; j++)
+			for (decltype(point)::size_type j = 0;
+			     j < static_cast<decltype(point)::size_type>(decltype(point)::rank);
+			     j++)
 			{
 				use(j);
 				use(point[j]);
@@ -42,24 +44,25 @@ SUITE(bounds_test)
 	
 	TEST(bounds_basic)
 	{
-		static_bounds<size_t, 3, 4, 5> b;
+		static_bounds<3, 4, 5> b;
 		auto a = b.slice();
-		static_bounds<size_t, 4, dynamic_range, 2> x{ 4 };
+		(void)a;           
+		static_bounds<4, dynamic_range, 2> x{ 4 };
 		x.slice().slice();
 	}
 	
 	TEST (arrayview_iterator)
 	{
-		static_bounds<size_t, 4, dynamic_range, 2> bounds{ 3 };
+		static_bounds<4, dynamic_range, 2> bounds{ 3 };
 		
 		auto itr = bounds.begin();
-	
+		(void)itr;	
 #ifdef CONFIRM_COMPILATION_ERRORS
-		array_view< int, 4, dynamic_range, 2> av(nullptr, bounds);
+		span<int, 4, dynamic_range, 2> av(nullptr, bounds);
 	
 		auto itr2 = av.cbegin();
 	
-		for (auto & v : av) {
+		for (auto& v : av) {
 			v = 4;
 		}
 		fill(av.begin(), av.end(), 0);
@@ -68,24 +71,25 @@ SUITE(bounds_test)
 	
 	TEST (bounds_convertible)
 	{
-		static_bounds<size_t, 7, 4, 2> b1;
-		static_bounds<size_t, 7, dynamic_range, 2> b2 = b1;
-	
+		static_bounds<7, 4, 2> b1;
+		static_bounds<7, dynamic_range, 2> b2 = b1;
+		(void)b2;	
 #ifdef CONFIRM_COMPILATION_ERRORS
-		static_bounds<size_t, 7, dynamic_range, 1> b4 = b2; 
+		static_bounds<7, dynamic_range, 1> b4 = b2; 
 #endif
 	
-		static_bounds<size_t, dynamic_range, dynamic_range, dynamic_range> b3 = b1;
-		static_bounds<int, 7, 4, 2> b4 = b3; 
+		static_bounds<dynamic_range, dynamic_range, dynamic_range> b3 = b1;
+		static_bounds<7, 4, 2> b4 = b3; 
+		(void)b4;
 
-		static_bounds<size_t, dynamic_range> b11;
+		static_bounds<dynamic_range> b11;
 	
-		static_bounds<size_t, dynamic_range> b5;
-		static_bounds<size_t, 34> b6;
+		static_bounds<dynamic_range> b5;
+		static_bounds<34> b6;
 		
-		b5 = static_bounds<size_t, 20>();
+		b5 = static_bounds<20>();
 		CHECK_THROW(b6 = b5, fail_fast);
-		b5 = static_bounds<size_t, 34>();
+		b5 = static_bounds<34>();
 		b6 = b5;
 
 		CHECK(b5 == b6);
diff --git a/tests/notnull_tests.cpp b/tests/notnull_tests.cpp
index a9624b8..67b478a 100644
--- a/tests/notnull_tests.cpp
+++ b/tests/notnull_tests.cpp
@@ -69,7 +69,8 @@ SUITE(NotNullTests)
 	MyDerived derived;
 	Unrelated unrelated;
 	not_null<Unrelated*> u = &unrelated;
-        not_null<MyDerived*> p = &derived;
+        (void)u;
+	not_null<MyDerived*> p = &derived;
         not_null<MyBase*> q = &base;
 	q = p; // allowed with heterogeneous copy ctor
         CHECK(q == p);
diff --git a/tests/span_tests.cpp b/tests/span_tests.cpp
new file mode 100644
index 0000000..8b39639
--- /dev/null
+++ b/tests/span_tests.cpp
@@ -0,0 +1,1679 @@
+///////////////////////////////////////////////////////////////////////////////
+//
+// Copyright (c) 2015 Microsoft Corporation. All rights reserved.
+//
+// This code is licensed under the MIT License (MIT).
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+// THE SOFTWARE.
+//
+///////////////////////////////////////////////////////////////////////////////
+
+#include <UnitTest++/UnitTest++.h>
+#include <span.h>
+
+#include <iostream>
+#include <list>
+#include <map>
+#include <memory>
+#include <string>
+#include <vector>
+
+using namespace std;
+using namespace gsl;
+
+namespace
+{
+struct BaseClass
+{
+};
+struct DerivedClass : BaseClass
+{
+};
+}
+
+SUITE(span_tests)
+{
+
+    TEST(default_constructor)
+    {
+        {
+            span<int> s;
+            CHECK(s.length() == 0 && s.data() == nullptr);
+
+            span<const int> cs;
+            CHECK(cs.length() == 0 && cs.data() == nullptr);
+        }
+
+        {
+            span<int, 0> s;
+            CHECK(s.length() == 0 && s.data() == nullptr);
+
+            span<const int, 0> cs;
+            CHECK(cs.length() == 0 && cs.data() == nullptr);
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            span<int, 1> s;
+            CHECK(s.length() == 1 && s.data() == nullptr); // explains why it can't compile
+#endif
+        }
+
+        {
+            span<int> s{};
+            CHECK(s.length() == 0 && s.data() == nullptr);
+
+            span<const int> cs{};
+            CHECK(cs.length() == 0 && cs.data() == nullptr);
+        }
+    }
+
+    TEST(from_nullptr_constructor)
+    {
+        {
+            span<int> s = nullptr;
+            CHECK(s.length() == 0 && s.data() == nullptr);
+
+            span<const int> cs = nullptr;
+            CHECK(cs.length() == 0 && cs.data() == nullptr);
+        }
+
+        {
+            span<int, 0> s = nullptr;
+            CHECK(s.length() == 0 && s.data() == nullptr);
+
+            span<const int, 0> cs = nullptr;
+            CHECK(cs.length() == 0 && cs.data() == nullptr);
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            span<int, 1> s = nullptr;
+            CHECK(s.length() == 1 && s.data() == nullptr); // explains why it can't compile
+#endif
+        }
+
+        {
+            span<int> s{nullptr};
+            CHECK(s.length() == 0 && s.data() == nullptr);
+
+            span<const int> cs{nullptr};
+            CHECK(cs.length() == 0 && cs.data() == nullptr);
+        }
+
+        {
+            span<int*> s{nullptr};
+            CHECK(s.length() == 0 && s.data() == nullptr);
+
+            span<const int*> cs{nullptr};
+            CHECK(cs.length() == 0 && cs.data() == nullptr);
+        }
+    }
+
+    TEST(from_nullptr_length_constructor)
+    {
+        {
+            span<int> s{nullptr, 0};
+            CHECK(s.length() == 0 && s.data() == nullptr);
+
+            span<const int> cs{nullptr, 0};
+            CHECK(cs.length() == 0 && cs.data() == nullptr);
+        }
+
+        {
+            span<int, 0> s{nullptr, 0};
+            CHECK(s.length() == 0 && s.data() == nullptr);
+
+            span<const int, 0> cs{nullptr, 0};
+            CHECK(cs.length() == 0 && cs.data() == nullptr);
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            span<int, 1> s{nullptr, 0};
+            CHECK(s.length() == 1 && s.data() == nullptr); // explains why it can't compile
+#endif
+        }
+
+        {
+            auto workaround_macro = []() { span<int> s{nullptr, 1}; };
+            CHECK_THROW(workaround_macro(), fail_fast);
+
+            auto const_workaround_macro = []() { span<const int> cs{nullptr, 1}; };
+            CHECK_THROW(const_workaround_macro(), fail_fast);
+        }
+
+        {
+            auto workaround_macro = []() { span<int, 0> s{nullptr, 1}; };
+            CHECK_THROW(workaround_macro(), fail_fast);
+
+            auto const_workaround_macro = []() { span<const int, 0> s{nullptr, 1}; };
+            CHECK_THROW(const_workaround_macro(), fail_fast);
+        }
+
+        {
+            span<int*> s{nullptr, 0};
+            CHECK(s.length() == 0 && s.data() == nullptr);
+
+            span<const int*> cs{nullptr, 0};
+            CHECK(cs.length() == 0 && cs.data() == nullptr);
+        }
+    }
+
+    TEST(from_element_constructor)
+    {
+        int i = 5;
+
+        {
+            span<int> s = i;
+            CHECK(s.length() == 1 && s.data() == &i);
+            CHECK(s[0] == 5);
+
+            span<const int> cs = i;
+            CHECK(cs.length() == 1 && cs.data() == &i);
+            CHECK(cs[0] == 5);
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            const j = 1;
+            span<int, 0> s = j;
+#endif
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            span<int, 0> s = i;
+            CHECK(s.length() == 0 && s.data() == &i);
+#endif
+        }
+
+        {
+            span<int, 1> s = i;
+            CHECK(s.length() == 1 && s.data() == &i);
+            CHECK(s[0] == 5);
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            span<int, 2> s = i;
+            CHECK(s.length() == 2 && s.data() == &i);
+#endif
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            auto get_a_temp = []() -> int { return 4; };
+            auto use_a_span = [](span<int> s) { (void) s; };
+            use_a_span(get_a_temp());
+#endif
+        }
+    }
+
+    TEST(from_pointer_length_constructor)
+    {
+        int arr[4] = {1, 2, 3, 4};
+
+        {
+            span<int> s{&arr[0], 2};
+            CHECK(s.length() == 2 && s.data() == &arr[0]);
+            CHECK(s[0] == 1 && s[1] == 2);
+        }
+
+        {
+            span<int, 2> s{&arr[0], 2};
+            CHECK(s.length() == 2 && s.data() == &arr[0]);
+            CHECK(s[0] == 1 && s[1] == 2);
+        }
+
+        {
+            int* p = nullptr;
+            span<int> s{p, 0};
+            CHECK(s.length() == 0 && s.data() == nullptr);
+        }
+
+        {
+            int* p = nullptr;
+            auto workaround_macro = [=]() { span<int> s{p, 2}; };
+            CHECK_THROW(workaround_macro(), fail_fast);
+        }
+    }
+
+    TEST(from_pointer_pointer_constructor)
+    {
+        int arr[4] = {1, 2, 3, 4};
+
+        {
+            span<int> s{&arr[0], &arr[2]};
+            CHECK(s.length() == 2 && s.data() == &arr[0]);
+            CHECK(s[0] == 1 && s[1] == 2);
+        }
+
+        {
+            span<int, 2> s{&arr[0], &arr[2]};
+            CHECK(s.length() == 2 && s.data() == &arr[0]);
+            CHECK(s[0] == 1 && s[1] == 2);
+        }
+
+        {
+            span<int> s{&arr[0], &arr[0]};
+            CHECK(s.length() == 0 && s.data() == &arr[0]);
+        }
+
+        {
+            span<int, 0> s{&arr[0], &arr[0]};
+            CHECK(s.length() == 0 && s.data() == &arr[0]);
+        }
+
+        {
+            auto workaround_macro = [&]() { span<int> s{&arr[1], &arr[0]}; };
+            CHECK_THROW(workaround_macro(), fail_fast);
+        }
+
+        {
+            int* p = nullptr;
+            auto workaround_macro = [&]() { span<int> s{&arr[0], p}; };
+            CHECK_THROW(workaround_macro(), fail_fast);
+        }
+
+        {
+            int* p = nullptr;
+            auto workaround_macro = [&]() { span<int> s{p, p}; };
+            CHECK_THROW(workaround_macro(), fail_fast);
+        }
+
+        {
+            int* p = nullptr;
+            auto workaround_macro = [&]() { span<int> s{&arr[0], p}; };
+            CHECK_THROW(workaround_macro(), fail_fast);
+        }
+    }
+
+    TEST(from_array_constructor)
+    {
+        int arr[5] = {1, 2, 3, 4, 5};
+
+        {
+            span<int> s{arr};
+            CHECK(s.length() == 5 && s.data() == &arr[0]);
+        }
+
+        {
+            span<int, 5> s{arr};
+            CHECK(s.length() == 5 && s.data() == &arr[0]);
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            span<int, 6> s{arr};
+#endif
+        }
+
+        {
+            span<int, 0> s{arr};
+            CHECK(s.length() == 0 && s.data() == &arr[0]);
+        }
+
+        int arr2d[2][3] = {1, 2, 3, 4, 5, 6};
+
+        {
+            span<int> s{arr2d};
+            CHECK(s.length() == 6 && s.data() == &arr2d[0][0]);
+            CHECK(s[0] == 1 && s[5] == 6);
+        }
+
+        {
+            span<int, 0> s{arr2d};
+            CHECK(s.length() == 0 && s.data() == &arr2d[0][0]);
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            span<int, 5> s{arr2d};
+#endif
+        }
+
+        {
+            span<int, 6> s{arr2d};
+            CHECK(s.length() == 6 && s.data() == &arr2d[0][0]);
+            CHECK(s[0] == 1 && s[5] == 6);
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            span<int, 7> s{arr2d};
+#endif
+        }
+
+        {
+            span<int[3]> s{arr2d[0]};
+            CHECK(s.length() == 1 && s.data() == &arr2d[0]);
+        }
+
+        {
+            span<int, 2, 3> s{arr2d};
+            CHECK(s.length() == 6 && s.data() == &arr2d[0][0]);
+            auto workaround_macro = [&]() { return s[{1, 2}] == 6; };
+            CHECK(workaround_macro());
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            span<int, 3, 3> s{arr2d};
+#endif
+        }
+
+        int arr3d[2][3][2] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};
+
+        {
+            span<int> s{arr3d};
+            CHECK(s.length() == 12 && s.data() == &arr3d[0][0][0]);
+            CHECK(s[0] == 1 && s[11] == 12);
+        }
+
+        {
+            span<int, 0> s{arr3d};
+            CHECK(s.length() == 0 && s.data() == &arr3d[0][0][0]);
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            span<int, 11> s{arr3d};
+#endif
+        }
+
+        {
+            span<int, 12> s{arr3d};
+            CHECK(s.length() == 12 && s.data() == &arr3d[0][0][0]);
+            CHECK(s[0] == 1 && s[5] == 6);
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            span<int, 13> s{arr3d};
+#endif
+        }
+
+        {
+            span<int[3][2]> s{arr3d[0]};
+            CHECK(s.length() == 1 && s.data() == &arr3d[0]);
+        }
+
+        {
+            span<int, 3, 2, 2> s{arr3d};
+            CHECK(s.length() == 12 && s.data() == &arr3d[0][0][0]);
+            auto workaround_macro = [&]() { return s[{2, 1, 0}] == 11; };
+            CHECK(workaround_macro());
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            span<int, 3, 3, 3> s{arr3d};
+#endif
+        }
+    }
+
+    TEST(from_dynamic_array_constructor)
+    {
+        double(*arr)[3][4] = new double[100][3][4];
+
+        {
+            span<double, dynamic_range, 3, 4> s(arr, 10);
+            CHECK(s.length() == 120 && s.data() == &arr[0][0][0]);
+            CHECK_THROW(s[10][3][4], fail_fast);
+        }
+
+        {
+            span<double, dynamic_range, 4, 3> s(arr, 10);
+            CHECK(s.length() == 120 && s.data() == &arr[0][0][0]);
+        }
+
+        {
+            span<double> s(arr, 10);
+            CHECK(s.length() == 120 && s.data() == &arr[0][0][0]);
+        }
+
+        {
+            span<double, dynamic_range, 3, 4> s(arr, 0);
+            CHECK(s.length() == 0 && s.data() == &arr[0][0][0]);
+        }
+
+        delete[] arr;
+    }
+
+    TEST(from_std_array_constructor)
+    {
+        std::array<int, 4> arr = {1, 2, 3, 4};
+
+        {
+            span<int> s{arr};
+            CHECK(s.size() == narrow_cast<ptrdiff_t>(arr.size()) && s.data() == arr.data());
+
+            span<const int> cs{arr};
+            CHECK(cs.size() == narrow_cast<ptrdiff_t>(arr.size()) && cs.data() == arr.data());
+        }
+
+        {
+            span<int, 4> s{arr};
+            CHECK(s.size() == narrow_cast<ptrdiff_t>(arr.size()) && s.data() == arr.data());
+
+            span<const int, 4> cs{arr};
+            CHECK(cs.size() == narrow_cast<ptrdiff_t>(arr.size()) && cs.data() == arr.data());
+        }
+
+        {
+            span<int, 2> s{arr};
+            CHECK(s.size() == 2 && s.data() == arr.data());
+
+            span<const int, 2> cs{arr};
+            CHECK(cs.size() == 2 && cs.data() == arr.data());
+        }
+
+        {
+            span<int, 0> s{arr};
+            CHECK(s.size() == 0 && s.data() == arr.data());
+
+            span<const int, 0> cs{arr};
+            CHECK(cs.size() == 0 && cs.data() == arr.data());
+        }
+
+        // TODO This is currently an unsupported scenario. We will come back to it as we revise
+        // the multidimensional interface and what transformations between dimensionality look like
+        //{
+        //    span<int, 2, 2> s{arr};
+        //    CHECK(s.size() == narrow_cast<ptrdiff_t>(arr.size()) && s.data() == arr.data());
+        //}
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            span<int, 5> s{arr};
+#endif
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            auto get_an_array = []() { return std::array<int, 4>{1, 2, 3, 4}; };
+            auto take_a_span = [](span<int> s) { (void) s; };
+            // try to take a temporary std::array
+            take_a_span(get_an_array());
+#endif
+        }
+    }
+
+    TEST(from_const_std_array_constructor)
+    {
+        const std::array<int, 4> arr = {1, 2, 3, 4};
+
+        {
+            span<const int> s{arr};
+            CHECK(s.size() == narrow_cast<ptrdiff_t>(arr.size()) && s.data() == arr.data());
+        }
+
+        {
+            span<const int, 4> s{arr};
+            CHECK(s.size() == narrow_cast<ptrdiff_t>(arr.size()) && s.data() == arr.data());
+        }
+
+        {
+            span<const int, 2> s{arr};
+            CHECK(s.size() == 2 && s.data() == arr.data());
+        }
+
+        {
+            span<const int, 0> s{arr};
+            CHECK(s.size() == 0 && s.data() == arr.data());
+        }
+
+        // TODO This is currently an unsupported scenario. We will come back to it as we revise
+        // the multidimensional interface and what transformations between dimensionality look like
+        //{
+        //    span<int, 2, 2> s{arr};
+        //    CHECK(s.size() == narrow_cast<ptrdiff_t>(arr.size()) && s.data() == arr.data());
+        //}
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            span<const int, 5> s{arr};
+#endif
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            auto get_an_array = []() -> const std::array<int, 4> { return {1, 2, 3, 4}; };
+            auto take_a_span = [](span<const int> s) { (void) s; };
+            // try to take a temporary std::array
+            take_a_span(get_an_array());
+#endif
+        }
+    }
+
+    TEST(from_container_constructor)
+    {
+        std::vector<int> v = {1, 2, 3};
+        const std::vector<int> cv = v;
+
+        {
+            span<int> s{v};
+            CHECK(s.size() == narrow_cast<std::ptrdiff_t>(v.size()) && s.data() == v.data());
+
+            span<const int> cs{v};
+            CHECK(cs.size() == narrow_cast<std::ptrdiff_t>(v.size()) && cs.data() == v.data());
+        }
+
+        std::string str = "hello";
+        const std::string cstr = "hello";
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            span<char> s{str};
+            CHECK(s.size() == narrow_cast<std::ptrdiff_t>(str.size()) && s.data() == str.data());
+#endif
+            span<const char> cs{str};
+            CHECK(cs.size() == narrow_cast<std::ptrdiff_t>(str.size()) && cs.data() == str.data());
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            span<char> s{cstr};
+#endif
+            span<const char> cs{cstr};
+            CHECK(cs.size() == narrow_cast<std::ptrdiff_t>(cstr.size()) &&
+                  cs.data() == cstr.data());
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            auto get_temp_vector = []() -> std::vector<int> { return {}; };
+            auto use_span = [](span<int> s) { (void) s; };
+            use_span(get_temp_vector());
+#endif
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            auto get_temp_string = []() -> std::string { return {}; };
+            auto use_span = [](span<char> s) { (void) s; };
+            use_span(get_temp_string());
+#endif
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            auto get_temp_vector = []() -> const std::vector<int> { return {}; };
+            auto use_span = [](span<const char> s) { (void) s; };
+            use_span(get_temp_vector());
+#endif
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            auto get_temp_string = []() -> const std::string { return {}; };
+            auto use_span = [](span<const char> s) { (void) s; };
+            use_span(get_temp_string());
+#endif
+        }
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            std::map<int, int> m;
+            span<int> s{m};
+#endif
+        }
+    }
+
+    TEST(from_convertible_span_constructor)
+    {
+#ifdef CONFIRM_COMPILATION_ERRORS
+        span<int, 7, 4, 2> av1(nullptr, b1);
+
+        auto f = [&]() { span<int, 7, 4, 2> av1(nullptr); };
+        CHECK_THROW(f(), fail_fast);
+#endif
+
+#ifdef CONFIRM_COMPILATION_ERRORS
+        static_bounds<size_t, 7, dynamic_range, 2> b12(b11);
+        b12 = b11;
+        b11 = b12;
+
+        span<int, dynamic_range> av1 = nullptr;
+        span<int, 7, dynamic_range, 2> av2(av1);
+        span<int, 7, 4, 2> av2(av1);
+#endif
+
+        span<DerivedClass> avd;
+#ifdef CONFIRM_COMPILATION_ERRORS
+        span<BaseClass> avb = avd;
+#endif
+        span<const DerivedClass> avcd = avd;
+        (void) avcd;
+    }
+
+    TEST(copy_move_and_assignment)
+    {
+        span<int> s1;
+        CHECK(s1.empty());
+
+        int arr[] = {3, 4, 5};
+
+        span<const int> s2 = arr;
+        CHECK(s2.length() == 3 && s2.data() == &arr[0]);
+
+        s2 = s1;
+        CHECK(s2.empty());
+
+        auto get_temp_span = [&]() -> span<int> { return {&arr[1], 2}; };
+        auto use_span = [&](span<const int> s) { CHECK(s.length() == 2 && s.data() == &arr[1]); };
+        use_span(get_temp_span());
+
+        s1 = get_temp_span();
+        CHECK(s1.length() == 2 && s1.data() == &arr[1]);
+    }
+
+    template <class Bounds>
+    void fn(const Bounds&)
+    {
+        static_assert(Bounds::static_size == 60, "static bounds is wrong size");
+    }
+    TEST(as_span_reshape)
+    {
+        int a[3][4][5];
+        auto av = as_span(a);
+        fn(av.bounds());
+        auto av2 = as_span(av, dim<60>());
+        auto av3 = as_span(av2, dim<3>(), dim<4>(), dim<5>());
+        auto av4 = as_span(av3, dim<4>(), dim<>(3), dim<5>());
+        auto av5 = as_span(av4, dim<3>(), dim<4>(), dim<5>());
+        auto av6 = as_span(av5, dim<12>(), dim<>(5));
+
+        fill(av6.begin(), av6.end(), 1);
+
+        auto av7 = as_bytes(av6);
+
+        auto av8 = as_span<int>(av7);
+
+        CHECK(av8.size() == av6.size());
+        for (auto i = 0; i < av8.size(); i++) {
+            CHECK(av8[i] == 1);
+        }
+    }
+
+    TEST(first)
+    {
+        int arr[5] = {1, 2, 3, 4, 5};
+
+        {
+            span<int, 5> av = arr;
+            CHECK((av.first<2>().bounds() == static_bounds<2>()));
+            CHECK(av.first<2>().length() == 2);
+            CHECK(av.first(2).length() == 2);
+        }
+
+        {
+            span<int, 5> av = arr;
+            CHECK((av.first<0>().bounds() == static_bounds<0>()));
+            CHECK(av.first<0>().length() == 0);
+            CHECK(av.first(0).length() == 0);
+        }
+
+        {
+            span<int, 5> av = arr;
+            CHECK((av.first<5>().bounds() == static_bounds<5>()));
+            CHECK(av.first<5>().length() == 5);
+            CHECK(av.first(5).length() == 5);
+        }
+
+        {
+            span<int, 5> av = arr;
+#ifdef CONFIRM_COMPILATION_ERRORS
+            CHECK(av.first<6>().bounds() == static_bounds<6>());
+            CHECK(av.first<6>().length() == 6);
+            CHECK(av.first<-1>().length() == -1);
+#endif
+            CHECK_THROW(av.first(6).length(), fail_fast);
+        }
+
+        {
+            span<int, dynamic_range> av;
+            CHECK((av.first<0>().bounds() == static_bounds<0>()));
+            CHECK(av.first<0>().length() == 0);
+            CHECK(av.first(0).length() == 0);
+        }
+    }
+
+    TEST(last)
+    {
+        int arr[5] = {1, 2, 3, 4, 5};
+
+        {
+            span<int, 5> av = arr;
+            CHECK((av.last<2>().bounds() == static_bounds<2>()));
+            CHECK(av.last<2>().length() == 2);
+            CHECK(av.last(2).length() == 2);
+        }
+
+        {
+            span<int, 5> av = arr;
+            CHECK((av.last<0>().bounds() == static_bounds<0>()));
+            CHECK(av.last<0>().length() == 0);
+            CHECK(av.last(0).length() == 0);
+        }
+
+        {
+            span<int, 5> av = arr;
+            CHECK((av.last<5>().bounds() == static_bounds<5>()));
+            CHECK(av.last<5>().length() == 5);
+            CHECK(av.last(5).length() == 5);
+        }
+
+        {
+            span<int, 5> av = arr;
+#ifdef CONFIRM_COMPILATION_ERRORS
+            CHECK((av.last<6>().bounds() == static_bounds<6>()));
+            CHECK(av.last<6>().length() == 6);
+#endif
+            CHECK_THROW(av.last(6).length(), fail_fast);
+        }
+
+        {
+            span<int, dynamic_range> av;
+            CHECK((av.last<0>().bounds() == static_bounds<0>()));
+            CHECK(av.last<0>().length() == 0);
+            CHECK(av.last(0).length() == 0);
+        }
+    }
+
+    TEST(subspan)
+    {
+        int arr[5] = {1, 2, 3, 4, 5};
+
+        {
+            span<int, 5> av = arr;
+            CHECK((av.subspan<2, 2>().bounds() == static_bounds<2>()));
+            CHECK((av.subspan<2, 2>().length() == 2));
+            CHECK(av.subspan(2, 2).length() == 2);
+            CHECK(av.subspan(2, 3).length() == 3);
+        }
+
+        {
+            span<int, 5> av = arr;
+            CHECK((av.subspan<0, 0>().bounds() == static_bounds<0>()));
+            CHECK((av.subspan<0, 0>().length() == 0));
+            CHECK(av.subspan(0, 0).length() == 0);
+        }
+
+        {
+            span<int, 5> av = arr;
+            CHECK((av.subspan<0, 5>().bounds() == static_bounds<5>()));
+            CHECK((av.subspan<0, 5>().length() == 5));
+            CHECK(av.subspan(0, 5).length() == 5);
+            CHECK_THROW(av.subspan(0, 6).length(), fail_fast);
+            CHECK_THROW(av.subspan(1, 5).length(), fail_fast);
+        }
+
+        {
+            span<int, 5> av = arr;
+            CHECK((av.subspan<5, 0>().bounds() == static_bounds<0>()));
+            CHECK((av.subspan<5, 0>().length() == 0));
+            CHECK(av.subspan(5, 0).length() == 0);
+            CHECK_THROW(av.subspan(6, 0).length(), fail_fast);
+        }
+
+        {
+            span<int, dynamic_range> av;
+            CHECK((av.subspan<0, 0>().bounds() == static_bounds<0>()));
+            CHECK((av.subspan<0, 0>().length() == 0));
+            CHECK(av.subspan(0, 0).length() == 0);
+            CHECK_THROW((av.subspan<1, 0>().length()), fail_fast);
+        }
+
+        {
+            span<int> av;
+            CHECK(av.subspan(0).length() == 0);
+            CHECK_THROW(av.subspan(1).length(), fail_fast);
+        }
+
+        {
+            span<int> av = arr;
+            CHECK(av.subspan(0).length() == 5);
+            CHECK(av.subspan(1).length() == 4);
+            CHECK(av.subspan(4).length() == 1);
+            CHECK(av.subspan(5).length() == 0);
+            CHECK_THROW(av.subspan(6).length(), fail_fast);
+            auto av2 = av.subspan(1);
+            for (int i = 0; i < 4; ++i) CHECK(av2[i] == i + 2);
+        }
+
+        {
+            span<int, 5> av = arr;
+            CHECK(av.subspan(0).length() == 5);
+            CHECK(av.subspan(1).length() == 4);
+            CHECK(av.subspan(4).length() == 1);
+            CHECK(av.subspan(5).length() == 0);
+            CHECK_THROW(av.subspan(6).length(), fail_fast);
+            auto av2 = av.subspan(1);
+            for (int i = 0; i < 4; ++i) CHECK(av2[i] == i + 2);
+        }
+    }
+
+    TEST(rank)
+    {
+        int arr[2] = {1, 2};
+
+        {
+            span<int> s;
+            CHECK(s.rank() == 1);
+        }
+
+        {
+            span<int, 2> s = arr;
+            CHECK(s.rank() == 1);
+        }
+
+        int arr2d[1][1] = {};
+        {
+            span<int, 1, 1> s = arr2d;
+            CHECK(s.rank() == 2);
+        }
+    }
+
+    TEST(extent)
+    {
+        {
+            span<int> s;
+            CHECK(s.extent() == 0);
+            CHECK(s.extent(0) == 0);
+            CHECK_THROW(s.extent(1), fail_fast);
+#ifdef CONFIRM_COMPILATION_ERRORS
+            CHECK(s.extent<1>() == 0);
+#endif
+        }
+
+        {
+            span<int, 0> s;
+            CHECK(s.extent() == 0);
+            CHECK(s.extent(0) == 0);
+            CHECK_THROW(s.extent(1), fail_fast);
+        }
+
+        {
+            int arr2d[1][2] = {};
+
+            span<int, 1, 2> s = arr2d;
+            CHECK(s.extent() == 1);
+            CHECK(s.extent<0>() == 1);
+            CHECK(s.extent<1>() == 2);
+            CHECK(s.extent(0) == 1);
+            CHECK(s.extent(1) == 2);
+            CHECK_THROW(s.extent(3), fail_fast);
+        }
+
+        {
+            int arr2d[1][2] = {};
+
+            span<int, 0, 2> s = arr2d;
+            CHECK(s.extent() == 0);
+            CHECK(s.extent<0>() == 0);
+            CHECK(s.extent<1>() == 2);
+            CHECK(s.extent(0) == 0);
+            CHECK(s.extent(1) == 2);
+            CHECK_THROW(s.extent(3), fail_fast);
+        }
+    }
+
+    TEST(operator_function_call)
+    {
+        int arr[4] = {1, 2, 3, 4};
+
+        {
+            span<int> s = arr;
+            CHECK(s(0) == 1);
+            CHECK_THROW(s(5), fail_fast);
+        }
+
+        int arr2d[2][3] = {1, 2, 3, 4, 5, 6};
+
+        {
+            span<int, 2, 3> s = arr2d;
+            CHECK(s(0, 0) == 1);
+            CHECK(s(1, 2) == 6);
+        }
+    }
+
+    TEST(comparison_operators)
+    {
+        {
+            int arr[10][2];
+            auto s1 = as_span(arr);
+            span<const int, dynamic_range, 2> s2 = s1;
+
+            CHECK(s1 == s2);
+
+            span<int, 20> s3 = as_span(s1, dim<>(20));
+            CHECK(s3 == s2 && s3 == s1);
+        }
+
+        {
+            auto s1 = nullptr;
+            auto s2 = nullptr;
+            CHECK(s1 == s2);
+            CHECK(!(s1 != s2));
+            CHECK(!(s1 < s2));
+            CHECK(s1 <= s2);
+            CHECK(!(s1 > s2));
+            CHECK(s1 >= s2);
+            CHECK(s2 == s1);
+            CHECK(!(s2 != s1));
+            CHECK(!(s2 < s1));
+            CHECK(s2 <= s1);
+            CHECK(!(s2 > s1));
+            CHECK(s2 >= s1);
+        }
+
+        {
+            int arr[] = {2, 1}; // bigger
+
+            span<int> s1 = nullptr;
+            span<int> s2 = arr;
+
+            CHECK(s1 != s2);
+            CHECK(s2 != s1);
+            CHECK(!(s1 == s2));
+            CHECK(!(s2 == s1));
+            CHECK(s1 < s2);
+            CHECK(!(s2 < s1));
+            CHECK(s1 <= s2);
+            CHECK(!(s2 <= s1));
+            CHECK(s2 > s1);
+            CHECK(!(s1 > s2));
+            CHECK(s2 >= s1);
+            CHECK(!(s1 >= s2));
+        }
+
+        {
+            int arr1[] = {1, 2};
+            int arr2[] = {1, 2};
+            span<int> s1 = arr1;
+            span<int> s2 = arr2;
+
+            CHECK(s1 == s2);
+            CHECK(!(s1 != s2));
+            CHECK(!(s1 < s2));
+            CHECK(s1 <= s2);
+            CHECK(!(s1 > s2));
+            CHECK(s1 >= s2);
+            CHECK(s2 == s1);
+            CHECK(!(s2 != s1));
+            CHECK(!(s2 < s1));
+            CHECK(s2 <= s1);
+            CHECK(!(s2 > s1));
+            CHECK(s2 >= s1);
+        }
+
+        {
+            int arr[] = {1, 2, 3};
+
+            span<int> s1 = {&arr[0], 2}; // shorter
+            span<int> s2 = arr; // longer
+
+            CHECK(s1 != s2);
+            CHECK(s2 != s1);
+            CHECK(!(s1 == s2));
+            CHECK(!(s2 == s1));
+            CHECK(s1 < s2);
+            CHECK(!(s2 < s1));
+            CHECK(s1 <= s2);
+            CHECK(!(s2 <= s1));
+            CHECK(s2 > s1);
+            CHECK(!(s1 > s2));
+            CHECK(s2 >= s1);
+            CHECK(!(s1 >= s2));
+        }
+
+        {
+            int arr1[] = {1, 2}; // smaller
+            int arr2[] = {2, 1}; // bigger
+
+            span<int> s1 = arr1;
+            span<int> s2 = arr2;
+
+            CHECK(s1 != s2);
+            CHECK(s2 != s1);
+            CHECK(!(s1 == s2));
+            CHECK(!(s2 == s1));
+            CHECK(s1 < s2);
+            CHECK(!(s2 < s1));
+            CHECK(s1 <= s2);
+            CHECK(!(s2 <= s1));
+            CHECK(s2 > s1);
+            CHECK(!(s1 > s2));
+            CHECK(s2 >= s1);
+            CHECK(!(s1 >= s2));
+        }
+    }
+
+    TEST(basics)
+    {
+        auto ptr = as_span(new int[10], 10);
+        fill(ptr.begin(), ptr.end(), 99);
+        for (int num : ptr) {
+            CHECK(num == 99);
+        }
+
+        delete[] ptr.data();
+    }
+
+    TEST(bounds_checks)
+    {
+        int arr[10][2];
+        auto av = as_span(arr);
+
+        fill(begin(av), end(av), 0);
+
+        av[2][0] = 1;
+        av[1][1] = 3;
+
+        // out of bounds
+        CHECK_THROW(av[1][3] = 3, fail_fast);
+        CHECK_THROW((av[{1, 3}] = 3), fail_fast);
+
+        CHECK_THROW(av[10][2], fail_fast);
+        CHECK_THROW((av[{10, 2}]), fail_fast);
+    }
+
+    void overloaded_func(span<const int, dynamic_range, 3, 5> exp, int expected_value)
+    {
+        for (auto val : exp) {
+            CHECK(val == expected_value);
+        }
+    }
+
+    void overloaded_func(span<const char, dynamic_range, 3, 5> exp, char expected_value)
+    {
+        for (auto val : exp) {
+            CHECK(val == expected_value);
+        }
+    }
+
+    void fixed_func(span<int, 3, 3, 5> exp, int expected_value)
+    {
+        for (auto val : exp) {
+            CHECK(val == expected_value);
+        }
+    }
+
+    TEST(span_parameter_test)
+    {
+        auto data = new int[4][3][5];
+
+        auto av = as_span(data, 4);
+
+        CHECK(av.size() == 60);
+
+        fill(av.begin(), av.end(), 34);
+
+        int count = 0;
+        for_each(av.rbegin(), av.rend(), [&](int val) { count += val; });
+        CHECK(count == 34 * 60);
+        overloaded_func(av, 34);
+
+        overloaded_func(as_span(av, dim<>(4), dim<>(3), dim<>(5)), 34);
+
+        // fixed_func(av, 34);
+        delete[] data;
+    }
+
+    TEST(md_access)
+    {
+        auto width = 5, height = 20;
+
+        auto imgSize = width * height;
+        auto image_ptr = new int[imgSize][3];
+
+        // size check will be done
+        auto image_view =
+            as_span(as_span(image_ptr, imgSize), dim<>(height), dim<>(width), dim<3>());
+
+        iota(image_view.begin(), image_view.end(), 1);
+
+        int expected = 0;
+        for (auto i = 0; i < height; i++) {
+            for (auto j = 0; j < width; j++) {
+                CHECK(expected + 1 == image_view[i][j][0]);
+                CHECK(expected + 2 == image_view[i][j][1]);
+                CHECK(expected + 3 == image_view[i][j][2]);
+
+                auto val = image_view[{i, j, 0}];
+                CHECK(expected + 1 == val);
+                val = image_view[{i, j, 1}];
+                CHECK(expected + 2 == val);
+                val = image_view[{i, j, 2}];
+                CHECK(expected + 3 == val);
+
+                expected += 3;
+            }
+        }
+    }
+
+    TEST(as_span)
+    {
+        {
+            int* arr = new int[150];
+
+            auto av = as_span(arr, dim<10>(), dim<>(3), dim<5>());
+
+            fill(av.begin(), av.end(), 24);
+            overloaded_func(av, 24);
+
+            delete[] arr;
+
+            array<int, 15> stdarr{0};
+            auto av2 = as_span(stdarr);
+            overloaded_func(as_span(av2, dim<>(1), dim<3>(), dim<5>()), 0);
+
+            string str = "ttttttttttttttt"; // size = 15
+            auto t = str.data();
+            (void) t;
+            auto av3 = as_span(str);
+            overloaded_func(as_span(av3, dim<>(1), dim<3>(), dim<5>()), 't');
+        }
+
+        {
+            string str;
+            span<char> strspan = as_span(str);
+            (void) strspan;
+            const string cstr;
+            span<const char> cstrspan = as_span(cstr);
+            (void) cstrspan;
+        }
+
+        {
+            int a[3][4][5];
+            auto av = as_span(a);
+            const int(*b)[4][5];
+            b = a;
+            auto bv = as_span(b, 3);
+
+            CHECK(av == bv);
+
+            const std::array<double, 3> arr = {0.0, 0.0, 0.0};
+            auto cv = as_span(arr);
+            (void) cv;
+
+            vector<float> vec(3);
+            auto dv = as_span(vec);
+            (void) dv;
+
+#ifdef CONFIRM_COMPILATION_ERRORS
+            auto dv2 = as_span(std::move(vec));
+#endif
+        }
+    }
+
+    TEST(empty_spans)
+    {
+        {
+            span<int, 0> empty_av(nullptr);
+
+            CHECK(empty_av.bounds().index_bounds() == index<1>{0});
+            CHECK_THROW(empty_av[0], fail_fast);
+            CHECK_THROW(empty_av.begin()[0], fail_fast);
+            CHECK_THROW(empty_av.cbegin()[0], fail_fast);
+            for (auto& v : empty_av) {
+                (void) v;
+                CHECK(false);
+            }
+        }
+
+        {
+            span<int> empty_av = {};
+            CHECK(empty_av.bounds().index_bounds() == index<1>{0});
+            CHECK_THROW(empty_av[0], fail_fast);
+            CHECK_THROW(empty_av.begin()[0], fail_fast);
+            CHECK_THROW(empty_av.cbegin()[0], fail_fast);
+            for (auto& v : empty_av) {
+                (void) v;
+                CHECK(false);
+            }
+        }
+    }
+
+    TEST(index_constructor)
+    {
+        auto arr = new int[8];
+        for (int i = 0; i < 4; ++i) {
+            arr[2 * i] = 4 + i;
+            arr[2 * i + 1] = i;
+        }
+
+        span<int, dynamic_range> av(arr, 8);
+
+        ptrdiff_t a[1] = {0};
+        index<1> i = a;
+
+        CHECK(av[i] == 4);
+
+        auto av2 = as_span(av, dim<4>(), dim<>(2));
+        ptrdiff_t a2[2] = {0, 1};
+        index<2> i2 = a2;
+
+        CHECK(av2[i2] == 0);
+        CHECK(av2[0][i] == 4);
+
+        delete[] arr;
+    }
+
+    TEST(index_constructors)
+    {
+        {
+            // components of the same type
+            index<3> i1(0, 1, 2);
+            CHECK(i1[0] == 0);
+
+            // components of different types
+            size_t c0 = 0;
+            size_t c1 = 1;
+            index<3> i2(c0, c1, 2);
+            CHECK(i2[0] == 0);
+
+            // from array
+            index<3> i3 = {0, 1, 2};
+            CHECK(i3[0] == 0);
+
+            // from other index of the same size type
+            index<3> i4 = i3;
+            CHECK(i4[0] == 0);
+
+            // default
+            index<3> i7;
+            CHECK(i7[0] == 0);
+
+            // default
+            index<3> i9 = {};
+            CHECK(i9[0] == 0);
+        }
+
+        {
+            // components of the same type
+            index<1> i1(0);
+            CHECK(i1[0] == 0);
+
+            // components of different types
+            size_t c0 = 0;
+            index<1> i2(c0);
+            CHECK(i2[0] == 0);
+
+            // from array
+            index<1> i3 = {0};
+            CHECK(i3[0] == 0);
+
+            // from int
+            index<1> i4 = 0;
+            CHECK(i4[0] == 0);
+
+            // from other index of the same size type
+            index<1> i5 = i3;
+            CHECK(i5[0] == 0);
+
+            // default
+            index<1> i8;
+            CHECK(i8[0] == 0);
+
+            // default
+            index<1> i9 = {};
+            CHECK(i9[0] == 0);
+        }
+
+#ifdef CONFIRM_COMPILATION_ERRORS
+        {
+            index<3> i1(0, 1);
+            index<3> i2(0, 1, 2, 3);
+            index<3> i3 = {0};
+            index<3> i4 = {0, 1, 2, 3};
+            index<1> i5 = {0, 1};
+        }
+#endif
+    }
+
+    TEST(index_operations)
+    {
+        ptrdiff_t a[3] = {0, 1, 2};
+        ptrdiff_t b[3] = {3, 4, 5};
+        index<3> i = a;
+        index<3> j = b;
+
+        CHECK(i[0] == 0);
+        CHECK(i[1] == 1);
+        CHECK(i[2] == 2);
+
+        {
+            index<3> k = i + j;
+
+            CHECK(i[0] == 0);
+            CHECK(i[1] == 1);
+            CHECK(i[2] == 2);
+            CHECK(k[0] == 3);
+            CHECK(k[1] == 5);
+            CHECK(k[2] == 7);
+        }
+
+        {
+            index<3> k = i * 3;
+
+            CHECK(i[0] == 0);
+            CHECK(i[1] == 1);
+            CHECK(i[2] == 2);
+            CHECK(k[0] == 0);
+            CHECK(k[1] == 3);
+            CHECK(k[2] == 6);
+        }
+
+        {
+            index<3> k = 3 * i;
+
+            CHECK(i[0] == 0);
+            CHECK(i[1] == 1);
+            CHECK(i[2] == 2);
+            CHECK(k[0] == 0);
+            CHECK(k[1] == 3);
+            CHECK(k[2] == 6);
+        }
+
+        {
+            index<2> k = details::shift_left(i);
+
+            CHECK(i[0] == 0);
+            CHECK(i[1] == 1);
+            CHECK(i[2] == 2);
+            CHECK(k[0] == 1);
+            CHECK(k[1] == 2);
+        }
+    }
+
+    void iterate_second_column(span<int, dynamic_range, dynamic_range> av)
+    {
+        auto length = av.size() / 2;
+
+        // view to the second column
+        auto section = av.section({0, 1}, {length, 1});
+
+        CHECK(section.size() == length);
+        for (auto i = 0; i < section.size(); ++i) {
+            CHECK(section[i][0] == av[i][1]);
+        }
+
+        for (auto i = 0; i < section.size(); ++i) {
+            auto idx = index<2>{i, 0}; // avoid braces inside the CHECK macro
+            CHECK(section[idx] == av[i][1]);
+        }
+
+        CHECK(section.bounds().index_bounds()[0] == length);
+        CHECK(section.bounds().index_bounds()[1] == 1);
+        for (auto i = 0; i < section.bounds().index_bounds()[0]; ++i) {
+            for (auto j = 0; j < section.bounds().index_bounds()[1]; ++j) {
+                auto idx = index<2>{i, j}; // avoid braces inside the CHECK macro
+                CHECK(section[idx] == av[i][1]);
+            }
+        }
+
+        size_t check_sum = 0;
+        for (auto i = 0; i < length; ++i) {
+            check_sum += av[i][1];
+        }
+
+        {
+            auto idx = 0;
+            size_t sum = 0;
+            for (auto num : section) {
+                CHECK(num == av[idx][1]);
+                sum += num;
+                idx++;
+            }
+
+            CHECK(sum == check_sum);
+        }
+        {
+            size_t idx = length - 1;
+            size_t sum = 0;
+            for (auto iter = section.rbegin(); iter != section.rend(); ++iter) {
+                CHECK(*iter == av[idx][1]);
+                sum += *iter;
+                idx--;
+            }
+
+            CHECK(sum == check_sum);
+        }
+    }
+
+    TEST(span_section_iteration)
+    {
+        int arr[4][2] = {{4, 0}, {5, 1}, {6, 2}, {7, 3}};
+
+        // static bounds
+        {
+            span<int, 4, 2> av = arr;
+            iterate_second_column(av);
+        }
+        // first bound is dynamic
+        {
+            span<int, dynamic_range, 2> av = arr;
+            iterate_second_column(av);
+        }
+        // second bound is dynamic
+        {
+            span<int, 4, dynamic_range> av = arr;
+            iterate_second_column(av);
+        }
+        // both bounds are dynamic
+        {
+            span<int, dynamic_range, dynamic_range> av = arr;
+            iterate_second_column(av);
+        }
+    }
+
+    TEST(dynamic_span_section_iteration)
+    {
+        auto height = 4, width = 2;
+        auto size = height * width;
+
+        auto arr = new int[size];
+        for (auto i = 0; i < size; ++i) {
+            arr[i] = i;
+        }
+
+        auto av = as_span(arr, size);
+
+        // first bound is dynamic
+        {
+            span<int, dynamic_range, 2> av2 = as_span(av, dim<>(height), dim<>(width));
+            iterate_second_column(av2);
+        }
+        // second bound is dynamic
+        {
+            span<int, 4, dynamic_range> av2 = as_span(av, dim<>(height), dim<>(width));
+            iterate_second_column(av2);
+        }
+        // both bounds are dynamic
+        {
+            span<int, dynamic_range, dynamic_range> av2 = as_span(av, dim<>(height), dim<>(width));
+            iterate_second_column(av2);
+        }
+
+        delete[] arr;
+    }
+
+    TEST(span_structure_size)
+    {
+        double(*arr)[3][4] = new double[100][3][4];
+        span<double, dynamic_range, 3, 4> av1(arr, 10);
+
+        struct EffectiveStructure
+        {
+            double* v1;
+            ptrdiff_t v2;
+        };
+        CHECK(sizeof(av1) == sizeof(EffectiveStructure));
+
+        CHECK_THROW(av1[10][3][4], fail_fast);
+
+        span<const double, dynamic_range, 6, 4> av2 = as_span(av1, dim<>(5), dim<6>(), dim<4>());
+        (void) av2;
+    }
+
+    TEST(fixed_size_conversions)
+    {
+        int arr[] = {1, 2, 3, 4};
+
+        // converting to an span from an equal size array is ok
+        span<int, 4> av4 = arr;
+        CHECK(av4.length() == 4);
+
+        // converting to dynamic_range a_v is always ok
+        {
+            span<int, dynamic_range> av = av4;
+            (void) av;
+        }
+        {
+            span<int, dynamic_range> av = arr;
+            (void) av;
+        }
+
+// initialization or assignment to static span that REDUCES size is NOT ok
+#ifdef CONFIRM_COMPILATION_ERRORS
+        {
+            span<int, 2> av2 = arr;
+        }
+        {
+            span<int, 2> av2 = av4;
+        }
+#endif
+
+        {
+            span<int, dynamic_range> av = arr;
+            span<int, 2> av2 = av;
+            (void) av2;
+        }
+
+#ifdef CONFIRM_COMPILATION_ERRORS
+        {
+            span<int, dynamic_range> av = arr;
+            span<int, 2, 1> av2 = av.as_span(dim<2>(), dim<2>());
+        }
+#endif
+
+        {
+            span<int, dynamic_range> av = arr;
+            span<int, 2, 1> av2 = as_span(av, dim<>(2), dim<>(2));
+            auto workaround_macro = [&]() { return av2[{1, 0}] == 2; };
+            CHECK(workaround_macro());
+        }
+
+        // but doing so explicitly is ok
+
+        // you can convert statically
+        {
+            span<int, 2> av2 = {arr, 2};
+            (void) av2;
+        }
+        {
+            span<int, 1> av2 = av4.first<1>();
+            (void) av2;
+        }
+
+        // ...or dynamically
+        {
+            // NB: implicit conversion to span<int,2> from span<int,dynamic_range>
+            span<int, 1> av2 = av4.first(1);
+            (void) av2;
+        }
+
+        // initialization or assignment to static span that requires size INCREASE is not ok.
+        int arr2[2] = {1, 2};
+
+#ifdef CONFIRM_COMPILATION_ERRORS
+        {
+            span<int, 4> av4 = arr2;
+        }
+        {
+            span<int, 2> av2 = arr2;
+            span<int, 4> av4 = av2;
+        }
+#endif
+        {
+            auto f = [&]() {
+                span<int, 4> av9 = {arr2, 2};
+                (void) av9;
+            };
+            CHECK_THROW(f(), fail_fast);
+        }
+
+        // this should fail - we are trying to assign a small dynamic a_v to a fixed_size larger one
+        span<int, dynamic_range> av = arr2;
+        auto f = [&]() {
+            span<int, 4> av2 = av;
+            (void) av2;
+        };
+        CHECK_THROW(f(), fail_fast);
+    }
+
+    TEST(as_writeable_bytes)
+    {
+        int a[] = {1, 2, 3, 4};
+
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            // you should not be able to get writeable bytes for const objects
+            span<const int, dynamic_range> av = a;
+            auto wav = av.as_writeable_bytes();
+#endif
+        }
+
+        {
+            span<int, dynamic_range> av;
+            auto wav = as_writeable_bytes(av);
+            CHECK(wav.length() == av.length());
+            CHECK(wav.length() == 0);
+            CHECK(wav.size_bytes() == 0);
+        }
+
+        {
+            span<int, dynamic_range> av = a;
+            auto wav = as_writeable_bytes(av);
+            CHECK(wav.data() == (byte*) &a[0]);
+            CHECK(wav.length() == sizeof(a));
+        }
+    }
+
+    TEST(iterator)
+    {
+        int a[] = {1, 2, 3, 4};
+
+        {
+            span<int, dynamic_range> av = a;
+            auto wav = as_writeable_bytes(av);
+            for (auto& b : wav) {
+                b = byte(0);
+            }
+            for (size_t i = 0; i < 4; ++i) {
+                CHECK(a[i] == 0);
+            }
+        }
+
+        {
+            span<int, dynamic_range> av = a;
+            for (auto& n : av) {
+                n = 1;
+            }
+            for (size_t i = 0; i < 4; ++i) {
+                CHECK(a[i] == 1);
+            }
+        }
+    }
+}
+
+int main(int, const char* []) { return UnitTest::RunAllTests(); }
diff --git a/tests/strided_span_tests.cpp b/tests/strided_span_tests.cpp
new file mode 100644
index 0000000..0fbf1d7
--- /dev/null
+++ b/tests/strided_span_tests.cpp
@@ -0,0 +1,748 @@
+/////////////////////////////////////////////////////////////////////////////// 
+// 
+// Copyright (c) 2015 Microsoft Corporation. All rights reserved. 
+// 
+// This code is licensed under the MIT License (MIT). 
+// 
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 
+// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 
+// THE SOFTWARE. 
+// 
+///////////////////////////////////////////////////////////////////////////////
+
+#include <UnitTest++/UnitTest++.h> 
+#include <span.h>
+
+#include <string>
+#include <vector>
+#include <list>
+#include <iostream>
+#include <memory>
+#include <map>
+
+using namespace std;
+using namespace gsl;
+
+namespace 
+{
+	struct BaseClass {};
+	struct DerivedClass : BaseClass {};
+}
+
+SUITE(strided_span_tests)
+{
+	TEST (span_section_test)
+	{
+		int a[30][4][5];
+		
+		auto av = as_span(a);
+		auto sub = av.section({15, 0, 0}, gsl::index<3>{2, 2, 2});
+		auto subsub = sub.section({1, 0, 0}, gsl::index<3>{1, 1, 1});
+		(void)subsub;
+	}
+
+	TEST(span_section)
+	{
+		std::vector<int> data(5 * 10);
+		std::iota(begin(data), end(data), 0);
+        const span<int, 5, 10> av = as_span(span<int>{data}, dim<5>(), dim<10>());
+
+		strided_span<int, 2> av_section_1 = av.section({ 1, 2 }, { 3, 4 });
+		CHECK((av_section_1[{0, 0}] == 12));
+		CHECK((av_section_1[{0, 1}] == 13));
+		CHECK((av_section_1[{1, 0}] == 22));
+		CHECK((av_section_1[{2, 3}] == 35));
+
+		strided_span<int, 2> av_section_2 = av_section_1.section({ 1, 2 }, { 2,2 });
+		CHECK((av_section_2[{0, 0}] == 24));
+		CHECK((av_section_2[{0, 1}] == 25));
+		CHECK((av_section_2[{1, 0}] == 34));
+	}
+
+	TEST(strided_span_constructors)
+	{
+		// Check stride constructor
+		{
+			int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
+			const int carr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
+
+			strided_span<int, 1> sav1{ arr, {{9}, {1}} }; // T -> T
+			CHECK(sav1.bounds().index_bounds() == index<1>{ 9 });
+			CHECK(sav1.bounds().stride() == 1);
+			CHECK(sav1[0] == 1 && sav1[8] == 9);
+
+
+			strided_span<const int, 1> sav2{ carr, {{ 4 }, { 2 }} }; // const T -> const T
+			CHECK(sav2.bounds().index_bounds() == index<1>{ 4 });
+			CHECK(sav2.bounds().strides() == index<1>{2});
+			CHECK(sav2[0] == 1 && sav2[3] == 7);
+
+			strided_span<int, 2> sav3{ arr, {{ 2, 2 },{ 6, 2 }} }; // T -> const T
+			CHECK((sav3.bounds().index_bounds() == index<2>{ 2, 2 }));
+			CHECK((sav3.bounds().strides() == index<2>{ 6, 2 }));
+			CHECK((sav3[{0, 0}] == 1 && sav3[{0, 1}] == 3 && sav3[{1, 0}] == 7));
+		}
+
+		// Check span constructor
+		{
+			int arr[] = { 1, 2 };
+
+			// From non-cv-qualified source
+			{
+				const span<int> src = arr;
+
+				strided_span<int, 1> sav{ src, {2, 1} };
+				CHECK(sav.bounds().index_bounds() == index<1>{ 2 });
+				CHECK(sav.bounds().strides() == index<1>{ 1 });
+				CHECK(sav[1] == 2);
+
+#if _MSC_VER > 1800
+				//strided_span<const int, 1> sav_c{ {src}, {2, 1} };
+				strided_span<const int, 1> sav_c{ span<const int>{src}, strided_bounds<1>{2, 1} };
+#else
+				strided_span<const int, 1> sav_c{ span<const int>{src}, strided_bounds<1>{2, 1} };
+#endif
+				CHECK(sav_c.bounds().index_bounds() == index<1>{ 2 });
+				CHECK(sav_c.bounds().strides() == index<1>{ 1 });
+				CHECK(sav_c[1] == 2);
+
+#if _MSC_VER > 1800
+				strided_span<volatile int, 1> sav_v{ src, {2, 1} };
+#else
+				strided_span<volatile int, 1> sav_v{ span<volatile int>{src}, strided_bounds<1>{2, 1} };
+#endif
+				CHECK(sav_v.bounds().index_bounds() == index<1>{ 2 });
+				CHECK(sav_v.bounds().strides() == index<1>{ 1 });
+				CHECK(sav_v[1] == 2);
+
+#if _MSC_VER > 1800
+				strided_span<const volatile int, 1> sav_cv{ src, {2, 1} };
+#else
+				strided_span<const volatile int, 1> sav_cv{ span<const volatile int>{src}, strided_bounds<1>{2, 1} };
+#endif
+				CHECK(sav_cv.bounds().index_bounds() == index<1>{ 2 });
+				CHECK(sav_cv.bounds().strides() == index<1>{ 1 });
+				CHECK(sav_cv[1] == 2);
+			}
+
+			// From const-qualified source
+			{
+				const span<const int> src{ arr };
+
+				strided_span<const int, 1> sav_c{ src, {2, 1} };
+				CHECK(sav_c.bounds().index_bounds() == index<1>{ 2 });
+				CHECK(sav_c.bounds().strides() == index<1>{ 1 });
+				CHECK(sav_c[1] == 2);
+
+#if _MSC_VER > 1800
+				strided_span<const volatile int, 1> sav_cv{ src, {2, 1} };
+#else
+				strided_span<const volatile int, 1> sav_cv{ span<const volatile int>{src}, strided_bounds<1>{2, 1} };
+#endif
+				
+				CHECK(sav_cv.bounds().index_bounds() == index<1>{ 2 });
+				CHECK(sav_cv.bounds().strides() == index<1>{ 1 });
+				CHECK(sav_cv[1] == 2);
+			}
+
+			// From volatile-qualified source
+			{
+				const span<volatile int> src{ arr };
+
+				strided_span<volatile int, 1> sav_v{ src, {2, 1} };
+				CHECK(sav_v.bounds().index_bounds() == index<1>{ 2 });
+				CHECK(sav_v.bounds().strides() == index<1>{ 1 });
+				CHECK(sav_v[1] == 2);
+
+#if _MSC_VER > 1800
+				strided_span<const volatile int, 1> sav_cv{ src, {2, 1} };
+#else
+				strided_span<const volatile int, 1> sav_cv{ span<const volatile int>{src}, strided_bounds<1>{2, 1} };
+#endif
+				CHECK(sav_cv.bounds().index_bounds() == index<1>{ 2 });
+				CHECK(sav_cv.bounds().strides() == index<1>{ 1 });
+				CHECK(sav_cv[1] == 2);
+			}
+
+			// From cv-qualified source
+			{
+				const span<const volatile int> src{ arr };
+
+				strided_span<const volatile int, 1> sav_cv{ src, {2, 1} };
+				CHECK(sav_cv.bounds().index_bounds() == index<1>{ 2 });
+				CHECK(sav_cv.bounds().strides() == index<1>{ 1 });
+				CHECK(sav_cv[1] == 2);
+			}
+		}
+
+		// Check const-casting constructor
+		{
+			int arr[2] = { 4, 5 };
+
+			const span<int, 2> av(arr, 2);
+			span<const int, 2> av2{ av };
+			CHECK(av2[1] == 5);
+
+			static_assert(std::is_convertible<const span<int, 2>, span<const int, 2>>::value, "ctor is not implicit!");
+		
+			const strided_span<int, 1> src{ arr, {2, 1} };
+			strided_span<const int, 1> sav{ src };
+			CHECK(sav.bounds().index_bounds() == index<1>{ 2 });
+			CHECK(sav.bounds().stride() == 1);
+			CHECK(sav[1] == 5);
+			
+			static_assert(std::is_convertible<const strided_span<int, 1>, strided_span<const int, 1>>::value, "ctor is not implicit!");
+		}
+
+		// Check copy constructor
+		{
+			int arr1[2] = { 3, 4 };
+			const strided_span<int, 1> src1{ arr1, {2, 1} };
+			strided_span<int, 1> sav1{ src1 };
+ 
+			CHECK(sav1.bounds().index_bounds() == index<1>{ 2 });
+			CHECK(sav1.bounds().stride() == 1);
+			CHECK(sav1[0] == 3);
+
+			int arr2[6] = { 1, 2, 3, 4, 5, 6 };
+			const strided_span<const int, 2> src2{ arr2, {{ 3, 2 }, { 2, 1 }} };
+			strided_span<const int, 2> sav2{ src2 };
+			CHECK((sav2.bounds().index_bounds() == index<2>{ 3, 2 }));
+			CHECK((sav2.bounds().strides() == index<2>{ 2, 1 }));
+			CHECK((sav2[{0, 0}] == 1 && sav2[{2, 0}] == 5));
+		}
+
+		// Check const-casting assignment operator
+		{
+			int arr1[2] = { 1, 2 };
+			int arr2[6] = { 3, 4, 5, 6, 7, 8 };
+
+			const strided_span<int, 1> src{ arr1, {{2}, {1}} };
+			strided_span<const int, 1> sav{ arr2, {{3}, {2}} };
+			strided_span<const int, 1>& sav_ref = (sav = src);
+			CHECK(sav.bounds().index_bounds() == index<1>{ 2 });
+			CHECK(sav.bounds().strides() == index<1>{ 1 });
+			CHECK(sav[0] == 1);
+			CHECK(&sav_ref == &sav);
+		}
+		
+		// Check copy assignment operator
+		{
+			int arr1[2] = { 3, 4 };
+			int arr1b[1] = { 0 };
+			const strided_span<int, 1> src1{ arr1, {2, 1} };
+			strided_span<int, 1> sav1{ arr1b, {1, 1} };
+			strided_span<int, 1>& sav1_ref = (sav1 = src1);
+			CHECK(sav1.bounds().index_bounds() == index<1>{ 2 });
+			CHECK(sav1.bounds().strides() == index<1>{ 1 });
+			CHECK(sav1[0] == 3);
+			CHECK(&sav1_ref == &sav1);
+
+			const int arr2[6] = { 1, 2, 3, 4, 5, 6 };
+			const int arr2b[1] = { 0 };
+			const strided_span<const int, 2> src2{ arr2, {{ 3, 2 },{ 2, 1 }} };
+			strided_span<const int, 2> sav2{ arr2b, {{ 1, 1 },{ 1, 1 }} };
+			strided_span<const int, 2>& sav2_ref = (sav2 = src2);
+			CHECK((sav2.bounds().index_bounds() == index<2>{ 3, 2 }));
+			CHECK((sav2.bounds().strides() == index<2>{ 2, 1 }));
+			CHECK((sav2[{0, 0}] == 1 && sav2[{2, 0}] == 5));
+			CHECK(&sav2_ref == &sav2);
+		}
+	}
+
+	TEST(strided_span_slice)
+	{
+		std::vector<int> data(5 * 10);
+		std::iota(begin(data), end(data), 0);
+        const span<int, 5, 10> src = as_span(span<int>{data}, dim<5>(), dim<10>());
+
+		const strided_span<int, 2> sav{ src, {{5, 10}, {10, 1}} };
+#ifdef CONFIRM_COMPILATION_ERRORS
+		const strided_span<const int, 2> csav{ {src},{ { 5, 10 },{ 10, 1 } } };
+#endif
+		const strided_span<const int, 2> csav{ span<const int, 5, 10>{ src }, { { 5, 10 },{ 10, 1 } } };
+
+		strided_span<int, 1> sav_sl = sav[2];
+		CHECK(sav_sl[0] == 20);
+		CHECK(sav_sl[9] == 29);
+
+		strided_span<const int, 1> csav_sl = sav[3];
+		CHECK(csav_sl[0] == 30);
+		CHECK(csav_sl[9] == 39);
+
+		CHECK(sav[4][0] == 40);
+		CHECK(sav[4][9] == 49);
+	}
+
+	TEST(strided_span_column_major)
+	{
+		// strided_span may be used to accomodate more peculiar
+		// use cases, such as column-major multidimensional array
+		// (aka. "FORTRAN" layout).
+
+		int cm_array[3 * 5] = {
+			1, 4, 7, 10, 13,
+			2, 5, 8, 11, 14,
+			3, 6, 9, 12, 15
+		};
+		strided_span<int, 2> cm_sav{ cm_array, {{ 5, 3 },{ 1, 5 }} };
+
+		// Accessing elements
+		CHECK((cm_sav[{0, 0}] == 1));
+		CHECK((cm_sav[{0, 1}] == 2));
+		CHECK((cm_sav[{1, 0}] == 4));
+		CHECK((cm_sav[{4, 2}] == 15));
+
+		// Slice
+		strided_span<int, 1> cm_sl = cm_sav[3];
+
+		CHECK(cm_sl[0] == 10);
+		CHECK(cm_sl[1] == 11);
+		CHECK(cm_sl[2] == 12);
+
+		// Section 
+		strided_span<int, 2> cm_sec = cm_sav.section( { 2, 1 }, { 3, 2 });
+
+		CHECK((cm_sec.bounds().index_bounds() == index<2>{3, 2}));
+		CHECK((cm_sec[{0, 0}] == 8));
+		CHECK((cm_sec[{0, 1}] == 9));
+		CHECK((cm_sec[{1, 0}] == 11));
+		CHECK((cm_sec[{2, 1}] == 15));
+	}
+
+	TEST(strided_span_bounds)
+	{
+		int arr[] = { 0, 1, 2, 3 };
+		span<int> av(arr);
+
+		{
+			// incorrect sections
+			
+			CHECK_THROW(av.section(0, 0)[0], fail_fast);
+			CHECK_THROW(av.section(1, 0)[0], fail_fast);
+			CHECK_THROW(av.section(1, 1)[1], fail_fast);
+			
+			CHECK_THROW(av.section(2, 5), fail_fast);
+			CHECK_THROW(av.section(5, 2), fail_fast);
+			CHECK_THROW(av.section(5, 0), fail_fast);
+			CHECK_THROW(av.section(0, 5), fail_fast);
+			CHECK_THROW(av.section(5, 5), fail_fast);
+		}
+
+		{
+			// zero stride
+			strided_span<int, 1> sav{ av,{ { 4 },{} } };
+			CHECK(sav[0] == 0);
+			CHECK(sav[3] == 0);
+			CHECK_THROW(sav[4], fail_fast);
+		}
+
+		{
+			// zero extent
+			strided_span<int, 1> sav{ av,{ {},{ 1 } } };
+			CHECK_THROW(sav[0], fail_fast);
+		}
+
+		{
+			// zero extent and stride
+			strided_span<int, 1> sav{ av,{ {},{} } };
+			CHECK_THROW(sav[0], fail_fast);
+		}
+
+		{
+			// strided array ctor with matching strided bounds 
+			strided_span<int, 1> sav{ arr,{ 4, 1 } };
+			CHECK(sav.bounds().index_bounds() == index<1>{ 4 });
+			CHECK(sav[3] == 3);
+			CHECK_THROW(sav[4], fail_fast);
+		}
+
+		{
+			// strided array ctor with smaller strided bounds 
+			strided_span<int, 1> sav{ arr,{ 2, 1 } };
+			CHECK(sav.bounds().index_bounds() == index<1>{ 2 });
+			CHECK(sav[1] == 1);
+			CHECK_THROW(sav[2], fail_fast);
+		}
+
+		{
+			// strided array ctor with fitting irregular bounds 
+			strided_span<int, 1> sav{ arr,{ 2, 3 } };
+			CHECK(sav.bounds().index_bounds() == index<1>{ 2 });
+			CHECK(sav[0] == 0);
+			CHECK(sav[1] == 3);
+			CHECK_THROW(sav[2], fail_fast);
+		}
+
+		{
+			// bounds cross data boundaries - from static arrays
+			CHECK_THROW((strided_span<int, 1> { arr, { 3, 2 } }), fail_fast);
+			CHECK_THROW((strided_span<int, 1> { arr, { 3, 3 } }), fail_fast);
+			CHECK_THROW((strided_span<int, 1> { arr, { 4, 5 } }), fail_fast);
+			CHECK_THROW((strided_span<int, 1> { arr, { 5, 1 } }), fail_fast);
+			CHECK_THROW((strided_span<int, 1> { arr, { 5, 5 } }), fail_fast);
+		}
+
+		{
+			// bounds cross data boundaries - from array view
+			CHECK_THROW((strided_span<int, 1> { av, { 3, 2 } }), fail_fast);
+			CHECK_THROW((strided_span<int, 1> { av, { 3, 3 } }), fail_fast);
+			CHECK_THROW((strided_span<int, 1> { av, { 4, 5 } }), fail_fast);
+			CHECK_THROW((strided_span<int, 1> { av, { 5, 1 } }), fail_fast);
+			CHECK_THROW((strided_span<int, 1> { av, { 5, 5 } }), fail_fast);
+		}
+
+		{
+			// bounds cross data boundaries - from dynamic arrays
+			CHECK_THROW((strided_span<int, 1> { av.data(), 4, { 3, 2 } }), fail_fast);
+			CHECK_THROW((strided_span<int, 1> { av.data(), 4, { 3, 3 } }), fail_fast);
+			CHECK_THROW((strided_span<int, 1> { av.data(), 4, { 4, 5 } }), fail_fast);
+			CHECK_THROW((strided_span<int, 1> { av.data(), 4, { 5, 1 } }), fail_fast);
+			CHECK_THROW((strided_span<int, 1> { av.data(), 4, { 5, 5 } }), fail_fast);
+			CHECK_THROW((strided_span<int, 1> { av.data(), 2, { 2, 2 } }), fail_fast);
+		}
+
+#ifdef CONFIRM_COMPILATION_ERRORS
+		{
+			strided_span<int, 1> sav0{ av.data(), { 3, 2 } };
+			strided_span<int, 1> sav1{ arr, { 1 } };
+			strided_span<int, 1> sav2{ arr, { 1,1,1 } };
+			strided_span<int, 1> sav3{ av, { 1 } };
+			strided_span<int, 1> sav4{ av, { 1,1,1 } };
+			strided_span<int, 2> sav5{ av.as_span(dim<2>(), dim<2>()), { 1 } };
+			strided_span<int, 2> sav6{ av.as_span(dim<2>(), dim<2>()), { 1,1,1 } };
+			strided_span<int, 2> sav7{ av.as_span(dim<2>(), dim<2>()), { { 1,1 },{ 1,1 },{ 1,1 } } };
+
+			index<1> index{ 0, 1 };
+			strided_span<int, 1> sav8{ arr,{ 1,{ 1,1 } } };
+			strided_span<int, 1> sav9{ arr,{ { 1,1 },{ 1,1 } } };
+			strided_span<int, 1> sav10{ av,{ 1,{ 1,1 } } };
+			strided_span<int, 1> sav11{ av,{ { 1,1 },{ 1,1 } } };
+			strided_span<int, 2> sav12{ av.as_span(dim<2>(), dim<2>()),{ { 1 },{ 1 } } };
+			strided_span<int, 2> sav13{ av.as_span(dim<2>(), dim<2>()),{ { 1 },{ 1,1,1 } } };
+			strided_span<int, 2> sav14{ av.as_span(dim<2>(), dim<2>()),{ { 1,1,1 },{ 1 } } };
+		}
+#endif
+	}
+
+	TEST(strided_span_type_conversion)
+	{
+		int arr[] = { 0, 1, 2, 3 };
+		span<int> av(arr);
+
+		{
+			strided_span<int, 1> sav{ av.data(), av.size(), { av.size() / 2, 2 } };
+#ifdef CONFIRM_COMPILATION_ERRORS
+			strided_span<long, 1> lsav1 = sav.as_strided_span<long, 1>();
+#endif
+		}
+		{
+			strided_span<int, 1> sav{ av, { av.size() / 2, 2 } };
+#ifdef CONFIRM_COMPILATION_ERRORS
+			strided_span<long, 1> lsav1 = sav.as_strided_span<long, 1>();
+#endif
+		}
+
+		span<const byte, dynamic_range> bytes = as_bytes(av);
+
+		// retype strided array with regular strides - from raw data
+		{
+			strided_bounds<2> bounds{ { 2, bytes.size() / 4 }, { bytes.size() / 2, 1 } };
+			strided_span<const byte, 2> sav2{ bytes.data(), bytes.size(), bounds };
+			strided_span<const int, 2> sav3 = sav2.as_strided_span<const int>();
+			CHECK(sav3[0][0] == 0);
+			CHECK(sav3[1][0] == 2);
+			CHECK_THROW(sav3[1][1], fail_fast);
+			CHECK_THROW(sav3[0][1], fail_fast);
+		}
+
+		// retype strided array with regular strides - from span
+		{
+			strided_bounds<2> bounds{ { 2, bytes.size() / 4 }, { bytes.size() / 2, 1 } };
+			span<const byte, 2, dynamic_range> bytes2 = as_span(bytes, dim<2>(), dim<>(bytes.size() / 2));
+			strided_span<const byte, 2> sav2{ bytes2, bounds };
+			strided_span<int, 2> sav3 = sav2.as_strided_span<int>();
+			CHECK(sav3[0][0] == 0);
+			CHECK(sav3[1][0] == 2);
+			CHECK_THROW(sav3[1][1], fail_fast);
+			CHECK_THROW(sav3[0][1], fail_fast);
+		}
+
+		// retype strided array with not enough elements - last dimension of the array is too small
+		{
+			strided_bounds<2> bounds{ { 4,2 },{ 4, 1 } };
+			span<const byte, 2, dynamic_range> bytes2 = as_span(bytes, dim<2>(), dim<>(bytes.size() / 2));
+			strided_span<const byte, 2> sav2{ bytes2, bounds };
+			CHECK_THROW(sav2.as_strided_span<int>(), fail_fast);
+		}
+
+		// retype strided array with not enough elements - strides are too small
+		{
+			strided_bounds<2> bounds{ { 4,2 },{ 2, 1 } };
+			span<const byte, 2, dynamic_range> bytes2 = as_span(bytes, dim<2>(), dim<>(bytes.size() / 2));
+			strided_span<const byte, 2> sav2{ bytes2, bounds };
+			CHECK_THROW(sav2.as_strided_span<int>(), fail_fast);
+		}
+
+		// retype strided array with not enough elements - last dimension does not divide by the new typesize
+		{
+			strided_bounds<2> bounds{ { 2,6 },{ 4, 1 } };
+			span<const byte, 2, dynamic_range> bytes2 = as_span(bytes, dim<2>(), dim<>(bytes.size() / 2));
+			strided_span<const byte, 2> sav2{ bytes2, bounds };
+			CHECK_THROW(sav2.as_strided_span<int>(), fail_fast);
+		}
+
+		// retype strided array with not enough elements - strides does not divide by the new typesize
+		{
+			strided_bounds<2> bounds{ { 2, 1 },{ 6, 1 } };
+			span<const byte, 2, dynamic_range> bytes2 = as_span(bytes, dim<2>(), dim<>(bytes.size() / 2));
+			strided_span<const byte, 2> sav2{ bytes2, bounds };
+			CHECK_THROW(sav2.as_strided_span<int>(), fail_fast);
+		}
+
+		// retype strided array with irregular strides - from raw data
+		{
+			strided_bounds<1> bounds{ bytes.size() / 2, 2 };
+			strided_span<const byte, 1> sav2{ bytes.data(), bytes.size(), bounds };
+			CHECK_THROW(sav2.as_strided_span<int>(), fail_fast);
+		}
+
+		// retype strided array with irregular strides - from span
+		{
+			strided_bounds<1> bounds{ bytes.size() / 2, 2 };
+			strided_span<const byte, 1> sav2{ bytes, bounds };
+			CHECK_THROW(sav2.as_strided_span<int>(), fail_fast);
+		}
+	}
+
+	TEST(empty_strided_spans)
+	{
+		{
+			span<int, 0> empty_av(nullptr);
+			strided_span<int, 1> empty_sav{ empty_av, { 0, 1 } };
+
+			CHECK(empty_sav.bounds().index_bounds() == index<1>{ 0 });
+			CHECK_THROW(empty_sav[0], fail_fast);
+			CHECK_THROW(empty_sav.begin()[0], fail_fast);
+			CHECK_THROW(empty_sav.cbegin()[0], fail_fast);
+
+			for (auto& v : empty_sav)
+			{
+                (void)v;
+				CHECK(false);
+			}
+		}
+
+		{
+			strided_span<int, 1> empty_sav{ nullptr, 0, { 0, 1 } };
+
+			CHECK(empty_sav.bounds().index_bounds() == index<1>{ 0 });
+			CHECK_THROW(empty_sav[0], fail_fast);
+			CHECK_THROW(empty_sav.begin()[0], fail_fast);
+			CHECK_THROW(empty_sav.cbegin()[0], fail_fast);
+
+			for (auto& v : empty_sav)
+			{
+                (void)v;
+				CHECK(false);
+			}
+		}
+	}
+
+    void iterate_every_other_element(span<int, dynamic_range> av)
+    {
+        // pick every other element
+
+        auto length = av.size() / 2;
+#if _MSC_VER > 1800
+        auto bounds = strided_bounds<1>({length}, {2});
+#else
+        auto bounds = strided_bounds<1>(index<1>{ length }, index<1>{ 2 });
+#endif
+        strided_span<int, 1> strided(&av.data()[1], av.size() - 1, bounds);
+
+        CHECK(strided.size() == length);
+        CHECK(strided.bounds().index_bounds()[0] == length);
+        for (auto i = 0; i < strided.size(); ++i)
+        {
+            CHECK(strided[i] == av[2 * i + 1]);
+        }
+
+        int idx = 0;
+        for (auto num : strided)
+        {
+            CHECK(num == av[2 * idx + 1]);
+            idx++;
+        }
+    }
+
+    TEST(strided_span_section_iteration)
+    {
+        int arr[8] = {4,0,5,1,6,2,7,3};
+
+        // static bounds
+        {
+            span<int, 8> av(arr, 8);
+            iterate_every_other_element(av);
+        }
+
+        // dynamic bounds
+        {
+            span<int, dynamic_range> av(arr, 8);
+            iterate_every_other_element(av);
+        }
+    }
+
+    TEST(dynamic_strided_span_section_iteration)
+    {
+        auto arr = new int[8];
+        for (int i = 0; i < 4; ++i)
+        {
+            arr[2 * i] = 4 + i;
+            arr[2 * i + 1] = i;
+        }
+
+        auto av = as_span(arr, 8);
+        iterate_every_other_element(av);
+
+        delete[] arr;
+    }
+
+    void iterate_second_slice(span<int, dynamic_range, dynamic_range, dynamic_range> av)
+    {
+        int expected[6] = {2,3,10,11,18,19};
+        auto section = av.section({0,1,0}, {3,1,2});
+
+        for (auto i = 0; i < section.extent<0>(); ++i)
+        {
+            for (auto j = 0; j < section.extent<1>(); ++j)
+                for (auto k = 0; k < section.extent<2>(); ++k)
+                {
+                    auto idx = index<3>{i,j,k}; // avoid braces in the CHECK macro
+                    CHECK(section[idx] == expected[2 * i + 2 * j + k]);
+                }
+        }
+
+        for (auto i = 0; i < section.extent<0>(); ++i)
+        {
+            for (auto j = 0; j < section.extent<1>(); ++j)
+                for (auto k = 0; k < section.extent<2>(); ++k)
+                    CHECK(section[i][j][k] == expected[2 * i + 2 * j + k]);
+        }
+
+        int i = 0;
+        for (auto num : section)
+        {
+            CHECK(num == expected[i]);
+            i++;
+        }
+    }
+
+    TEST(strided_span_section_iteration_3d)
+    {
+        int arr[3][4][2];
+        for (auto i = 0; i < 3; ++i)
+        {
+            for (auto j = 0; j < 4; ++j)
+                for (auto k = 0; k < 2; ++k)
+                    arr[i][j][k] = 8 * i + 2 * j + k;
+        }
+
+        {
+            span<int, 3, 4, 2> av = arr;
+            iterate_second_slice(av);
+        }
+    }
+
+    TEST(dynamic_strided_span_section_iteration_3d)
+    {
+        auto height = 12, width = 2;
+        auto size = height * width;
+
+        auto arr = new int[size];
+        for (auto i = 0; i < size; ++i)
+        {
+            arr[i] = i;
+        }
+
+        {
+            auto av = as_span(as_span(arr, 24), dim<3>(), dim<4>(), dim<2>());
+            iterate_second_slice(av);
+        }
+
+        {
+            auto av = as_span(as_span(arr, 24), dim<>(3), dim<4>(), dim<2>());
+            iterate_second_slice(av);
+        }
+
+        {
+            auto av = as_span(as_span(arr, 24), dim<3>(), dim<>(4), dim<2>());
+            iterate_second_slice(av);
+        }
+
+        {
+            auto av = as_span(as_span(arr, 24), dim<3>(), dim<4>(), dim<>(2));
+            iterate_second_slice(av);
+        }
+        delete[] arr;
+    }
+
+    TEST(strided_span_conversion)
+    {
+        // get an span of 'c' values from the list of X's
+
+        struct X { int a; int b; int c; };
+
+        X arr[4] = {{0,1,2},{3,4,5},{6,7,8},{9,10,11}};
+
+        int s = sizeof(int) / sizeof(byte);
+        auto d2 = 3 * s;
+        auto d1 = sizeof(int) * 12 / d2;
+
+        // convert to 4x12 array of bytes
+        auto av = as_span(as_bytes(as_span(arr, 4)), dim<>(d1), dim<>(d2));
+
+        CHECK(av.bounds().index_bounds()[0] == 4);
+        CHECK(av.bounds().index_bounds()[1] == 12);
+
+        // get the last 4 columns
+        auto section = av.section({0, 2 * s}, {4, s}); // { { arr[0].c[0], arr[0].c[1], arr[0].c[2], arr[0].c[3] } , { arr[1].c[0], ... } , ... }
+
+                                                       // convert to array 4x1 array of integers
+        auto cs = section.as_strided_span<int>(); // { { arr[0].c }, {arr[1].c } , ... } 
+
+        CHECK(cs.bounds().index_bounds()[0] == 4);
+        CHECK(cs.bounds().index_bounds()[1] == 1);
+
+        // transpose to 1x4 array 
+        strided_bounds<2> reverse_bounds{
+            {cs.bounds().index_bounds()[1] , cs.bounds().index_bounds()[0]},
+            {cs.bounds().strides()[1], cs.bounds().strides()[0]}
+        };
+
+        strided_span<int, 2> transposed{cs.data(), cs.bounds().total_size(), reverse_bounds};
+
+        // slice to get a one-dimensional array of c's
+        strided_span<int, 1> result = transposed[0];
+
+        CHECK(result.bounds().index_bounds()[0] == 4);
+        CHECK_THROW(result.bounds().index_bounds()[1], fail_fast);
+
+        int i = 0;
+        for (auto& num : result)
+        {
+            CHECK(num == arr[i].c);
+            i++;
+        }
+
+    }
+}
+
+int main(int, const char *[])
+{
+	return UnitTest::RunAllTests();
+}
diff --git a/tests/string_span_tests.cpp b/tests/string_span_tests.cpp
new file mode 100644
index 0000000..18fda26
--- /dev/null
+++ b/tests/string_span_tests.cpp
@@ -0,0 +1,808 @@
+///////////////////////////////////////////////////////////////////////////////
+//
+// Copyright (c) 2015 Microsoft Corporation. All rights reserved.
+//
+// This code is licensed under the MIT License (MIT).
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+// THE SOFTWARE.
+//
+///////////////////////////////////////////////////////////////////////////////
+
+#include <UnitTest++/UnitTest++.h>
+#include <cstdlib>
+#include <string_span.h>
+#include <vector>
+
+using namespace std;
+using namespace gsl;
+
+
+SUITE(string_span_tests)
+{
+
+    TEST(TestLiteralConstruction)
+    {
+        cwstring_span<> v = ensure_z(L"Hello");
+
+        CHECK(5 == v.length());
+
+#ifdef CONFIRM_COMPILATION_ERRORS
+        wstring_span<> v2 = ensure0(L"Hello");
+#endif
+    }
+
+    TEST(TestConstructFromStdString)
+    {
+        std::string s = "Hello there world";
+        cstring_span<> v = s;
+        CHECK(v.length() == static_cast<cstring_span<>::size_type>(s.length()));
+    }
+
+    TEST(TestConstructFromStdVector)
+    {
+        std::vector<char> vec(5, 'h');
+        string_span<> v = vec;
+        CHECK(v.length() == static_cast<string_span<>::size_type>(vec.size()));
+    }
+
+    TEST(TestStackArrayConstruction)
+    {
+        wchar_t stack_string[] = L"Hello";
+
+        {
+            cwstring_span<> v = ensure_z(stack_string);
+            CHECK(v.length() == 5);
+        }
+
+        {
+            cwstring_span<> v = stack_string;
+            CHECK(v.length() == 5);
+        }
+
+        {
+            wstring_span<> v = ensure_z(stack_string);
+            CHECK(v.length() == 5);
+        }
+
+        {
+            wstring_span<> v = stack_string;
+            CHECK(v.length() == 5);
+        }
+    }
+
+    TEST(TestConstructFromConstCharPointer)
+    {
+        const char* s = "Hello";
+        cstring_span<> v = ensure_z(s);
+        CHECK(v.length() == 5);
+    }
+
+    TEST(TestConversionToConst)
+    {
+        char stack_string[] = "Hello";
+        string_span<> v = ensure_z(stack_string);
+        cstring_span<> v2 = v;
+        CHECK(v.length() == v2.length());
+    }
+
+    TEST(TestConversionFromConst)
+    {
+        char stack_string[] = "Hello";
+        cstring_span<> v = ensure_z(stack_string);
+        (void)v;
+#ifdef CONFIRM_COMPILATION_ERRORS
+        string_span<> v2 = v;
+        string_span<> v3 = "Hello";
+#endif
+    }
+
+    TEST(TestToString)
+    {
+        auto s = gsl::to_string(cstring_span<>{});
+        CHECK(s.length() == 0);
+
+        char stack_string[] = "Hello";
+        cstring_span<> v = ensure_z(stack_string);
+        auto s2 = gsl::to_string(v);
+        CHECK(static_cast<cstring_span<>::size_type>(s2.length()) == v.length());
+        CHECK(s2.length() == 5);
+    }
+
+    TEST(EqualityAndImplicitConstructors)
+    {
+        {
+            cstring_span<> span = "Hello";
+
+            const char ar[] = { 'H', 'e', 'l', 'l', 'o' };
+            const char ar1[] = "Hello";
+            const char ar2[10] = "Hello";
+            const char* ptr = "Hello";
+            const std::string str = "Hello";
+            const std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            gsl::span<const char> sp = ensure_z("Hello");
+
+            // comparison to  literal
+            CHECK(span == cstring_span<>("Hello"));
+
+            // comparison to static array with no null termination
+            CHECK(span == cstring_span<>(ar));
+
+            // comparison to static array with null at the end
+            CHECK(span == cstring_span<>(ar1));
+
+            // comparison to static array with null in the middle
+            CHECK(span == cstring_span<>(ar2));
+
+            // comparison to null-terminated c string
+            CHECK(span == cstring_span<>(ptr, 5));
+
+            // comparison to string
+            CHECK(span == cstring_span<>(str));
+
+            // comparison to vector of charaters with no null termination
+            CHECK(span == cstring_span<>(vec));
+
+            // comparison to span
+            CHECK(span == cstring_span<>(sp));
+
+            // comparison to string_span
+            CHECK(span == span);
+
+            // comparison of the original data to string
+            CHECK(span.data() == std::string("Hello"));
+        }
+
+        {
+            char ar[] = { 'H', 'e', 'l', 'l', 'o' };
+
+            string_span<> span = ar;
+
+            char ar1[] = "Hello";
+            char ar2[10] = "Hello";
+            char* ptr = ar;
+            std::string str = "Hello";
+            std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            gsl::span<char> sp = ensure_z(ar1);
+
+            // comparison to static array with no null termination
+            CHECK(span == string_span<>(ar));
+
+            // comparison to static array with null at the end
+            CHECK(span == string_span<>(ar1));
+
+            // comparison to static array with null in the middle
+            CHECK(span == string_span<>(ar2));
+
+            // comparison to null-terminated c string
+            CHECK(span == string_span<>(ptr, 5));
+
+            // comparison to string
+            CHECK(span == string_span<>(str));
+
+            // comparison to vector of charaters with no null termination
+            CHECK(span == string_span<>(vec));
+
+            // comparison to span
+            CHECK(span == string_span<>(sp));
+
+            // comparison to string_span
+            CHECK(span == span);
+        }
+
+
+        {
+            const char ar[] = { 'H', 'e', 'l', 'l', 'o' };
+            const char ar1[] = "Hello";
+            const char ar2[10] = "Hello";
+            const std::string str = "Hello";
+            const std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            gsl::span<const char> sp = ensure_z("Hello");
+
+            cstring_span<> span = "Hello";
+
+            // const span, const other type
+
+            CHECK(span == "Hello");
+            CHECK(span == ar);
+            CHECK(span == ar1);
+            CHECK(span == ar2);
+#ifdef CONFIRM_COMPILATION_ERRORS
+            const char* ptr = "Hello";
+            CHECK(span == ptr);
+#endif
+            CHECK(span == str);
+            CHECK(span == vec);
+            CHECK(span == sp);
+
+            CHECK("Hello" == span);
+            CHECK(ar == span);
+            CHECK(ar1 == span);
+            CHECK(ar2 == span);
+#ifdef CONFIRM_COMPILATION_ERRORS
+            CHECK(ptr == span);
+#endif
+            CHECK(str == span);
+            CHECK(vec == span);
+            CHECK(sp == span);
+
+            // const span, non-const other type
+
+            char _ar[] = { 'H', 'e', 'l', 'l', 'o' };
+            char _ar1[] = "Hello";
+            char _ar2[10] = "Hello";
+            char* _ptr = _ar;
+            std::string _str = "Hello";
+            std::vector<char> _vec = { 'H', 'e', 'l', 'l', 'o' };
+            gsl::span<char> _sp{ _ar, 5 };
+
+            CHECK(span == _ar);
+            CHECK(span == _ar1);
+            CHECK(span == _ar2);
+#ifdef CONFIRM_COMPILATION_ERRORS
+            CHECK(span == _ptr);
+#endif
+            CHECK(span == _str);
+            CHECK(span == _vec);
+            CHECK(span == _sp);
+
+            CHECK(_ar == span);
+            CHECK(_ar1 == span);
+            CHECK(_ar2 == span);
+#ifdef CONFIRM_COMPILATION_ERRORS
+            CHECK(_ptr == span);
+#endif
+            CHECK(_str == span);
+            CHECK(_vec == span);
+            CHECK(_sp == span);
+
+            string_span<> _span{ _ptr, 5 };
+
+            // non-const span, non-const other type
+            
+            CHECK(_span == _ar);
+            CHECK(_span == _ar1);
+            CHECK(_span == _ar2);
+#ifdef CONFIRM_COMPILATION_ERRORS
+            CHECK(_span == _ptr);
+#endif
+            CHECK(_span == _str);
+            CHECK(_span == _vec);
+            CHECK(_span == _sp);
+
+            CHECK(_ar == _span);
+            CHECK(_ar1 == _span);
+            CHECK(_ar2 == _span);
+#ifdef CONFIRM_COMPILATION_ERRORS
+            CHECK(_ptr == _span);
+#endif
+            CHECK(_str == _span);
+            CHECK(_vec == _span);
+            CHECK(_sp == _span);
+
+            // non-const span, const other type
+
+            CHECK(_span == "Hello");
+            CHECK(_span == ar);
+            CHECK(_span == ar1);
+            CHECK(_span == ar2);
+#ifdef CONFIRM_COMPILATION_ERRORS
+            CHECK(_span == ptr);
+#endif
+            CHECK(_span == str);
+            CHECK(_span == vec);
+            CHECK(_span == sp);
+
+            CHECK("Hello" == _span);
+            CHECK(ar == _span);
+            CHECK(ar1 == _span);
+            CHECK(ar2 == _span);
+#ifdef CONFIRM_COMPILATION_ERRORS
+            CHECK(ptr == _span);
+#endif
+            CHECK(str == _span);
+            CHECK(vec == _span);
+            CHECK(sp == _span);
+
+            // two spans
+
+            CHECK(_span == span);
+            CHECK(span == _span);
+        }
+
+        {
+            std::vector<char> str1 = { 'H', 'e', 'l', 'l', 'o' };
+            cstring_span<> span1 = str1;
+            std::vector<char> str2 = std::move(str1);
+            cstring_span<> span2 = str2;
+
+            // comparison of spans from the same vector before and after move (ok)
+            CHECK(span1 == span2);
+        }
+    }
+
+    TEST(ComparisonAndImplicitConstructors)
+    {
+        {
+            cstring_span<> span = "Hello";
+
+            const char ar[] = { 'H', 'e', 'l', 'l', 'o' };
+            const char ar1[] = "Hello";
+            const char ar2[10] = "Hello";
+            const char* ptr = "Hello";
+            const std::string str = "Hello";
+            const std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+
+            // comparison to  literal
+            CHECK(span < cstring_span<>("Helloo"));
+            CHECK(span > cstring_span<>("Hell"));
+
+            // comparison to static array with no null termination
+            CHECK(span >= cstring_span<>(ar));
+
+            // comparison to static array with null at the end
+            CHECK(span <= cstring_span<>(ar1));
+
+            // comparison to static array with null in the middle
+            CHECK(span >= cstring_span<>(ar2));
+
+            // comparison to null-terminated c string
+            CHECK(span <= cstring_span<>(ptr, 5));
+
+            // comparison to string
+            CHECK(span >= cstring_span<>(str));
+
+            // comparison to vector of charaters with no null termination
+            CHECK(span <= cstring_span<>(vec));
+        }
+
+        {
+            char ar[] = { 'H', 'e', 'l', 'l', 'o' };
+
+            string_span<> span = ar;
+
+            char larr[] = "Hell";
+            char rarr[] = "Helloo";
+
+            char ar1[] = "Hello";
+            char ar2[10] = "Hello";
+            char* ptr = ar;
+            std::string str = "Hello";
+            std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+
+
+            // comparison to static array with no null termination
+            CHECK(span <= string_span<>(ar));
+            CHECK(span < string_span<>(rarr));
+            CHECK(span > string_span<>(larr));
+
+            // comparison to static array with null at the end
+            CHECK(span >= string_span<>(ar1));
+
+            // comparison to static array with null in the middle
+            CHECK(span <= string_span<>(ar2));
+
+            // comparison to null-terminated c string
+            CHECK(span >= string_span<>(ptr, 5));
+
+            // comparison to string
+            CHECK(span <= string_span<>(str));
+
+            // comparison to vector of charaters with no null termination
+            CHECK(span >= string_span<>(vec));
+        }
+    }
+    TEST(ConstrutorsEnsureZ)
+    {
+        // remove z from literals
+        {
+            cstring_span<> sp = "hello";
+            CHECK((sp.length() == 5));
+        }
+
+        // take the string as is
+        {
+            auto str = std::string("hello");
+            cstring_span<> sp = str;
+            CHECK((sp.length() == 5));
+        }
+
+        // ensure z on c strings
+        {
+            char* ptr = new char[3];
+
+            ptr[0] = 'a';
+            ptr[1] = 'b';
+            ptr[2] = '\0';
+
+            string_span<> span = ensure_z(ptr);
+            CHECK(span.length() == 2);
+
+            delete[] ptr;
+        }
+    }
+
+    TEST(Constructors)
+    {
+        // creating cstring_span
+
+        // from string temporary
+#ifdef CONFIRM_COMPILATION_ERRORS
+        {
+            cstring_span<> span = std::string("Hello");
+        }
+#endif
+
+        // default
+        {
+            cstring_span<> span;
+            CHECK(span.length() == 0);
+        }
+
+        // from nullptr
+        {
+            cstring_span<> span(nullptr);
+            CHECK(span.length() == 0);
+        }
+
+        // from string literal
+        {
+            cstring_span<> span = "Hello";
+            CHECK(span.length() == 5);
+        }
+
+        // from const static array
+        {
+            const char ar[] = { 'H', 'e', 'l', 'l', 'o' };
+            cstring_span<> span = ar;
+            CHECK(span.length() == 5);
+        }
+
+        // from non-const static array
+        {
+            char ar[] = { 'H', 'e', 'l', 'l', 'o' };
+            cstring_span<> span = ar;
+            CHECK(span.length() == 5);
+        }
+
+        // from const ptr and length
+        {
+            const char* ptr = "Hello";
+            cstring_span<> span{ ptr, 5 };
+            CHECK(span.length() == 5);
+        }
+
+        // from const ptr and length, include 0
+        {
+            const char* ptr = "Hello";
+            cstring_span<> span{ ptr, 6 };
+            CHECK(span.length() == 6);
+        }
+
+        // from const ptr and length, 0 inside
+        {
+            const char* ptr = "He\0lo";
+            cstring_span<> span{ ptr, 5 };
+            CHECK(span.length() == 5);
+        }
+
+        // from non-const ptr and length
+        {
+            char ar[] = { 'H', 'e', 'l', 'l', 'o' };
+            char* ptr = ar;
+            cstring_span<> span{ ptr, 5 };
+            CHECK(span.length() == 5);
+        }
+
+        // from non-const ptr and length, 0 inside
+        {
+            char ar[] = { 'H', 'e', '\0', 'l', 'o' };
+            char* ptr = ar;
+            cstring_span<> span{ ptr, 5 };
+            CHECK(span.length() == 5);
+        }
+
+        // from const string
+        {
+            const std::string str = "Hello";
+            cstring_span<> span = str;
+            CHECK(span.length() == 5);
+        }
+
+        // from non-const string
+        {
+            std::string str = "Hello";
+            cstring_span<> span = str;
+            CHECK(span.length() == 5);
+        }
+
+        // from const vector
+        {
+            const std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            cstring_span<> span = vec;
+            CHECK(span.length() == 5);
+        }
+
+        // from non-const vector
+        {
+            std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            cstring_span<> span = vec;
+            CHECK(span.length() == 5);
+        }
+
+        // from const span
+        {
+            std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            const span<const char> inner = vec;
+            cstring_span<> span = inner;
+            CHECK(span.length() == 5);
+        }
+
+        // from non-const span
+        {
+            std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            span<char> inner = vec;
+            cstring_span<> span = inner;
+            CHECK(span.length() == 5);
+        }
+
+        // from const string_span
+        {
+            std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            cstring_span<> tmp = vec;
+            cstring_span<> span = tmp;
+            CHECK(span.length() == 5);
+        }
+
+        // from non-const string_span
+        {
+            std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            string_span<> tmp = vec;
+            cstring_span<> span = tmp;
+            CHECK(span.length() == 5);
+        }
+
+        // creating string_span
+
+        // from string literal
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            string_span<> span = "Hello";
+#endif
+        }
+
+        // from const static array
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            const char ar[] = { 'H', 'e', 'l', 'l', 'o' };
+            string_span<> span = ar;
+            CHECK(span.length() == 5);
+#endif
+        }
+
+        // from non-const static array
+        {
+            char ar[] = { 'H', 'e', 'l', 'l', 'o' };
+            string_span<> span = ar;
+            CHECK(span.length() == 5);
+        }
+
+        // from const ptr and length
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            const char* ptr = "Hello";
+            string_span<> span{ ptr, 5 };
+            CHECK(span.length() == 5);
+#endif
+        }
+
+        // from non-const ptr and length
+        {
+            char ar[] = { 'H', 'e', 'l', 'l', 'o' };
+            char* ptr = ar;
+            string_span<> span{ ptr, 5 };
+            CHECK(span.length() == 5);
+        }
+
+        // from const string
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            const std::string str = "Hello";
+            string_span<> span = str;
+            CHECK(span.length() == 5);
+#endif
+        }
+
+        // from non-const string
+        {
+            std::string str = "Hello";
+            string_span<> span = str;
+            CHECK(span.length() == 5);
+        }
+
+        // from const vector
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            const std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            string_span<> span = vec;
+            CHECK(span.length() == 5);
+#endif
+        }
+
+        // from non-const vector
+        {
+            std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            string_span<> span = vec;
+            CHECK(span.length() == 5);
+        }
+
+        // from const span
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            const span<const char> inner = vec;
+            string_span<> span = inner;
+            CHECK(span.length() == 5);
+#endif
+        }
+
+        // from non-const span
+        {
+            std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            span<char> inner = vec;
+            string_span<> span = inner;
+            CHECK(span.length() == 5);
+        }
+
+        // from non-const span of non-const data from const vector
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            const std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            const span<char> inner = vec;
+            string_span<> span = inner;
+            CHECK(span.length() == 5);
+#endif
+        }
+
+        // from const string_span
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            cstring_span<> tmp = vec;
+            string_span<> span = tmp;
+            CHECK(span.length() == 5);
+#endif
+        }
+
+        // from non-const string_span
+        {
+            std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            string_span<> tmp = vec;
+            string_span<> span = tmp;
+            CHECK(span.length() == 5);
+        }
+
+        // from non-const string_span from const vector
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            const std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            string_span<> tmp = vec;
+            string_span<> span = tmp;
+            CHECK(span.length() == 5);
+#endif
+        }
+
+        // from const string_span of non-const data
+        {
+            std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            const string_span<> tmp = vec;
+            string_span<> span = tmp;
+            CHECK(span.length() == 5);
+        }
+    }
+
+    template<typename T>
+    T move_wrapper(T&& t)
+    {
+        return std::move(t);
+    }
+
+    template <class T>
+    T create() { return T{}; }
+
+    template <class T>
+    void use(basic_string_span<T, gsl::dynamic_range> s) {}
+
+    TEST(MoveConstructors)
+    {
+        // move string_span
+        {
+            cstring_span<> span = "Hello";
+            auto span1 = std::move(span);
+            CHECK(span1.length() == 5);
+        }
+        {
+            cstring_span<> span = "Hello";
+            auto span1 = move_wrapper(std::move(span));
+            CHECK(span1.length() == 5);
+        }
+        {
+            cstring_span<> span = "Hello";
+            auto span1 = move_wrapper(std::move(span));
+            CHECK(span1.length() == 5);
+        }
+
+        // move span
+        {
+            span<const char> span = ensure_z("Hello");
+            cstring_span<> span1 = std::move(span);
+            CHECK(span1.length() == 5);
+        }
+        {
+            span<const char> span = ensure_z("Hello");
+            cstring_span<> span2 = move_wrapper(std::move(span));
+            CHECK(span2.length() == 5);
+        }
+
+        // move string
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            std::string str = "Hello";
+            string_span<> span = std::move(str);
+            CHECK(span.length() == 5);
+#endif
+        }
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            std::string str = "Hello";
+            string_span<> span = move_wrapper<std::string>(std::move(str));
+            CHECK(span.length() == 5);
+#endif
+        }
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            use<char>(create<string>());
+#endif
+        }
+
+        // move container
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            string_span<> span = std::move(vec);
+            CHECK(span.length() == 5);
+#endif
+        }
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            std::vector<char> vec = { 'H', 'e', 'l', 'l', 'o' };
+            string_span<> span = move_wrapper<std::vector<char>>(std::move(vec));
+            CHECK(span.length() == 5);
+#endif
+        }
+        {
+#ifdef CONFIRM_COMPILATION_ERRORS
+            use<char>(create<std::vector<char>>());
+#endif
+        }
+    }
+
+    TEST(Conversion)
+    {
+#ifdef CONFIRM_COMPPILATION_ERRORS
+        cstring_span<> span = "Hello";
+        cwstring_span<> wspan{ span };
+        CHECK(wspan.length() == 5);
+#endif
+    }
+}
+
+int main(int, const char *[])
+{
+    return UnitTest::RunAllTests();
+}
diff --git a/tests/string_view_tests.cpp b/tests/string_view_tests.cpp
deleted file mode 100644
index e553ccd..0000000
--- a/tests/string_view_tests.cpp
+++ /dev/null
@@ -1,112 +0,0 @@
-/////////////////////////////////////////////////////////////////////////////// 
-// 
-// Copyright (c) 2015 Microsoft Corporation. All rights reserved. 
-// 
-// This code is licensed under the MIT License (MIT). 
-// 
-// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 
-// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 
-// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 
-// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 
-// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 
-// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 
-// THE SOFTWARE. 
-// 
-///////////////////////////////////////////////////////////////////////////////
-
-#include <UnitTest++/UnitTest++.h> 
-#include <string_view.h>
-#include <vector>
-#include <cstdlib>
-
-using namespace std;
-using namespace gsl;
-
-SUITE(string_view_tests)
-{
-
-    TEST(TestLiteralConstruction)
-	{
-        cwstring_view<> v = ensure_z(L"Hello");
-
-        CHECK(5 == v.length());
-
-#ifdef CONFIRM_COMPILATION_ERRORS
-        wstring_view<> v2 = ensure0(L"Hello");
-#endif
-	}
-
-    TEST(TestConstructFromStdString)
-    {
-        std::string s = "Hello there world";
-        cstring_view<> v = s;
-        CHECK(v.length() == s.length());
-    }
-
-    TEST(TestConstructFromStdVector)
-    {
-        std::vector<char> vec(5, 'h');
-        string_view<> v = vec;
-        CHECK(v.length() == vec.size());
-    }
-
-	TEST(TestStackArrayConstruction)
-	{
-        wchar_t stack_string[] = L"Hello";
-
-        {
-            cwstring_view<> v = ensure_z(stack_string);
-            CHECK(v.length() == 5);
-            CHECK(v.used_length() == v.length());
-        }
-
-        {
-            cwstring_view<> v = stack_string;
-            CHECK(v.length() == 6);
-            CHECK(v.used_length() == v.length());
-        }
-
-        {
-            wstring_view<> v = ensure_z(stack_string);
-            CHECK(v.length() == 5);
-            CHECK(v.used_length() == v.length());
-        }
-
-        {
-            wstring_view<> v = stack_string;
-            CHECK(v.length() == 6);
-            CHECK(v.used_length() == v.length());
-        }
-	}
-
-    TEST(TestConstructFromConstCharPointer)
-    {
-        const char* s = "Hello";
-        cstring_view<> v = ensure_z(s);
-        CHECK(v.length() == 5);
-        CHECK(v.used_length() == v.length());
-    }
-
-    TEST(TestConversionToConst)
-    {
-        char stack_string[] = "Hello";
-        string_view<> v = ensure_z(stack_string);
-        cstring_view<> v2 = v; 
-        CHECK(v.length() == v2.length());
-    }
-
-    TEST(TestConversionFromConst)
-    {
-        char stack_string[] = "Hello";
-        cstring_view<> v = ensure_z(stack_string);
-#ifdef CONFIRM_COMPILATION_ERRORS
-        string_view<> v2 = v;
-        string_view<> v3 = "Hello";
-#endif
-    }
-}
-
-int main(int, const char *[])
-{
-    return UnitTest::RunAllTests();
-}