1 files changed, 164 insertions, 0 deletions
diff --git a/include/estd/ContiguousRange.hpp b/include/estd/ContiguousRange.hpp
new file mode 100644
index 0000000..adfc8a0
--- /dev/null
+++ b/include/estd/ContiguousRange.hpp
@@ -0,0 +1,164 @@
+/**
+ * \file
+ * \brief ContiguousRange template class header.
+ *
+ * \author Copyright (C) 2014-2015 Kamil Szczygiel http://www.distortec.com http://www.freddiechopin.info
+ *
+ * \par License
+ * This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not
+ * distributed with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
+ */
+
+#ifndef ESTD_CONTIGUOUSRANGE_HPP_
+#define ESTD_CONTIGUOUSRANGE_HPP_
+
+#include <iterator>
+
+namespace estd
+{
+
+/**
+ * \brief ContiguousRange template class is a pair of iterators to contiguous sequence of elements in memory
+ *
+ * \tparam T is the type of data in the range
+ */
+
+template<typename T>
+class ContiguousRange
+{
+public:
+
+	/// value_type type
+	using value_type = T;
+
+	/// pointer type
+	using pointer = value_type*;
+
+	/// const_pointer type
+	using const_pointer = const value_type*;
+
+	/// reference type
+	using reference = value_type&;
+
+	/// const_reference type
+	using const_reference = const value_type&;
+
+	/// iterator type
+	using iterator = value_type*;
+
+	/// const_iterator type
+	using const_iterator = const value_type*;
+
+	/// size_type type
+	using size_type = std::size_t;
+
+	/// difference_type type
+	using difference_type = std::ptrdiff_t;
+
+	/// reverse_iterator type
+	using reverse_iterator = std::reverse_iterator<iterator>;
+
+	/// const_reverse_iterator type
+	using const_reverse_iterator = std::reverse_iterator<const_iterator>;
+
+	/**
+	 * \brief ContiguousRange's constructor.
+	 *
+	 * \param [in] beginn is an iterator to first element in the range
+	 * \param [in] endd is an iterator to "one past the last" element in the range
+	 */
+
+	constexpr ContiguousRange(const iterator beginn, const iterator endd) noexcept :
+			begin_{beginn},
+			end_{endd}
+	{
+
+	}
+
+	/**
+	 * \brief Empty ContiguousRange's constructor.
+	 */
+
+	constexpr explicit ContiguousRange() noexcept :
+			ContiguousRange{nullptr, nullptr}
+	{
+
+	}
+
+	/**
+	 * \brief ContiguousRange's constructor using C-style array.
+	 *
+	 * \tparam N is the number of elements in the array
+	 *
+	 * \param [in] array is the array used to initialize the range
+	 */
+
+	template<size_t N>
+	constexpr explicit ContiguousRange(T (& array)[N]) noexcept :
+			ContiguousRange{array, array + N}
+	{
+
+	}
+
+	/**
+	 * \brief ContiguousRange's constructor using single value
+	 *
+	 * \param [in] value is a reference to variable used to initialize the range
+	 */
+
+	constexpr explicit ContiguousRange(T& value) noexcept :
+			ContiguousRange{&value, &value + 1}
+	{
+
+	}
+
+	/**
+	 * \return iterator to first element in the range
+	 */
+
+	constexpr iterator begin() const noexcept
+	{
+		return begin_;
+	}
+
+	/**
+	 * \return iterator to "one past the last" element in the range
+	 */
+
+	constexpr iterator end() const noexcept
+	{
+		return end_;
+	}
+
+	/**
+	 * \return number of elements in the range
+	 */
+
+	constexpr size_type size() const noexcept
+	{
+		return end_ - begin_;
+	}
+
+	/**
+	 * \param [in] i is the index of element that will be accessed
+	 *
+	 * \return reference to element at given index
+	 */
+
+	reference operator[](const size_type i) const noexcept
+	{
+		return begin_[i];
+	}
+
+private:
+
+	/// iterator to first element in the range
+	iterator begin_;
+
+	/// iterator to "one past the last" element in the range
+	iterator end_;
+};
+
+}	// namespace estd
+
+#endif	// ESTD_CONTIGUOUSRANGE_HPP_