/////////////////////////////////////////////////////////////////////////////// // // 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 #include #include #include #include #include #include #include #include #include #include namespace gsl { // [views.constants], constants constexpr const std::ptrdiff_t dynamic_extent = -1; template class span; // implementation details namespace details { template struct is_span_oracle : std::false_type { }; template struct is_span_oracle> : std::true_type { }; template struct is_span : public is_span_oracle> { }; template struct is_std_array_oracle : std::false_type { }; template struct is_std_array_oracle> : std::true_type { }; template struct is_std_array : public is_std_array_oracle> { }; template struct is_allowed_extent_conversion : public std::integral_constant { }; template struct is_allowed_element_type_conversion : public std::integral_constant::value> { }; template class span_iterator { using element_type_ = typename Span::element_type; public: using iterator_category = std::random_access_iterator_tag; using value_type = std::remove_cv_t; using difference_type = typename Span::index_type; using reference = std::conditional_t&; using pointer = std::add_pointer_t; span_iterator() = default; constexpr span_iterator(const Span* span, typename Span::index_type index) GSL_NOEXCEPT : span_(span), index_(index) { Expects(span == nullptr || (0 <= index_ && index <= span_->length())); } friend span_iterator; template* = nullptr> constexpr span_iterator(const span_iterator& other) GSL_NOEXCEPT : span_iterator(other.span_, other.index_) { } constexpr reference operator*() const GSL_NOEXCEPT { Expects(index_ != span_->length()); return *(span_->data() + index_); } constexpr pointer operator->() const GSL_NOEXCEPT { Expects(index_ != span_->length()); return span_->data() + index_; } constexpr span_iterator& operator++() GSL_NOEXCEPT { Expects(0 <= index_ && index_ != span_->length()); ++index_; return *this; } constexpr span_iterator operator++(int) GSL_NOEXCEPT { auto ret = *this; ++(*this); return ret; } constexpr span_iterator& operator--() GSL_NOEXCEPT { Expects(index_ != 0 && index_ <= span_->length()); --index_; return *this; } constexpr span_iterator operator--(int) GSL_NOEXCEPT { auto ret = *this; --(*this); return ret; } constexpr span_iterator operator+(difference_type n) const GSL_NOEXCEPT { auto ret = *this; return ret += n; } constexpr span_iterator& operator+=(difference_type n) GSL_NOEXCEPT { Expects((index_ + n) >= 0 && (index_ + n) <= span_->length()); index_ += n; return *this; } constexpr span_iterator operator-(difference_type n) const GSL_NOEXCEPT { auto ret = *this; return ret -= n; } constexpr span_iterator& operator-=(difference_type n) GSL_NOEXCEPT { return *this += -n; } constexpr difference_type operator-(const span_iterator& rhs) const GSL_NOEXCEPT { Expects(span_ == rhs.span_); return index_ - rhs.index_; } constexpr reference operator[](difference_type n) const GSL_NOEXCEPT { return *(*this + n); } constexpr friend bool operator==(const span_iterator& lhs, const span_iterator& rhs) GSL_NOEXCEPT { return lhs.span_ == rhs.span_ && lhs.index_ == rhs.index_; } constexpr friend bool operator!=(const span_iterator& lhs, const span_iterator& rhs) GSL_NOEXCEPT { return !(lhs == rhs); } constexpr friend bool operator<(const span_iterator& lhs, const span_iterator& rhs) GSL_NOEXCEPT { Expects(lhs.span_ == rhs.span_); return lhs.index_ < rhs.index_; } constexpr friend bool operator<=(const span_iterator& lhs, const span_iterator& rhs) GSL_NOEXCEPT { return !(rhs < lhs); } constexpr friend bool operator>(const span_iterator& lhs, const span_iterator& rhs) GSL_NOEXCEPT { return rhs < lhs; } constexpr friend bool operator>=(const span_iterator& lhs, const span_iterator& rhs) GSL_NOEXCEPT { return !(rhs > lhs); } protected: const Span* span_ = nullptr; std::ptrdiff_t index_ = 0; }; template inline constexpr span_iterator operator+(typename span_iterator::difference_type n, const span_iterator& rhs) GSL_NOEXCEPT { return rhs + n; } template inline constexpr span_iterator operator-(typename span_iterator::difference_type n, const span_iterator& rhs) GSL_NOEXCEPT { return rhs - n; } template class extent_type { public: using index_type = std::ptrdiff_t; static_assert(Ext >= 0, "A fixed-size span must be >= 0 in size."); constexpr extent_type() GSL_NOEXCEPT {} template constexpr extent_type(extent_type ext) { static_assert(Other == Ext || Other == dynamic_extent, "Mismatch between fixed-size extent and size of initializing data."); Expects(ext.size() == Ext); } constexpr extent_type(index_type size) { Expects(size == Ext); } constexpr index_type size() const GSL_NOEXCEPT { return Ext; } }; template <> class extent_type { public: using index_type = std::ptrdiff_t; template explicit constexpr extent_type(extent_type ext) : size_(ext.size()) { } explicit constexpr extent_type(index_type size) : size_(size) { Expects(size >= 0); } constexpr index_type size() const GSL_NOEXCEPT { return size_; } private: index_type size_; }; } // namespace details // [span], class template span template class span { public: // constants and types using element_type = ElementType; using value_type = std::remove_cv_t; using index_type = std::ptrdiff_t; using pointer = element_type*; using reference = element_type&; using iterator = details::span_iterator, false>; using const_iterator = details::span_iterator, true>; using reverse_iterator = std::reverse_iterator; using const_reverse_iterator = std::reverse_iterator; using size_type = index_type; constexpr static const index_type extent = Extent; // [span.cons], span constructors, copy, assignment, and destructor template " SFINAE, // since "std::enable_if_t" is ill-formed when Extent is greater than 0. class = std::enable_if_t<(Dependent || Extent <= 0)>> constexpr span() GSL_NOEXCEPT : storage_(nullptr, details::extent_type<0>()) { } constexpr span(std::nullptr_t) GSL_NOEXCEPT : span() {} constexpr span(pointer ptr, index_type count) : storage_(ptr, count) {} constexpr span(pointer firstElem, pointer lastElem) : storage_(firstElem, std::distance(firstElem, lastElem)) { } template constexpr span(element_type (&arr)[N]) GSL_NOEXCEPT : storage_(&arr[0], details::extent_type()) { } template > constexpr span(std::array& arr) GSL_NOEXCEPT : storage_(&arr[0], details::extent_type()) { } template constexpr span(const std::array, N>& arr) GSL_NOEXCEPT : storage_(&arr[0], details::extent_type()) { } template > constexpr span(const std::unique_ptr& ptr, index_type count) : storage_(ptr.get(), count) { } constexpr span(const std::unique_ptr& ptr) : storage_(ptr.get(), ptr.get() ? 1 : 0) { } constexpr span(const std::shared_ptr& ptr) : storage_(ptr.get(), ptr.get() ? 1 : 0) { } // NB: the SFINAE here uses .data() as a incomplete/imperfect proxy for the requirement // on Container to be a contiguous sequence container. template ::value && !details::is_std_array::value && std::is_convertible::value && std::is_convertible().data())>::value>> constexpr span(Container& cont) : span(cont.data(), narrow(cont.size())) { } template ::value && !details::is_span::value && std::is_convertible::value && std::is_convertible().data())>::value>> constexpr span(const Container& cont) : span(cont.data(), narrow(cont.size())) { } constexpr span(const span& other) GSL_NOEXCEPT = default; constexpr span(span&& other) GSL_NOEXCEPT = default; template < class OtherElementType, std::ptrdiff_t OtherExtent, class = std::enable_if_t< details::is_allowed_extent_conversion::value && details::is_allowed_element_type_conversion::value>> constexpr span(const span& other) : storage_(other.data(), details::extent_type(other.size())) { } template < class OtherElementType, std::ptrdiff_t OtherExtent, class = std::enable_if_t< details::is_allowed_extent_conversion::value && details::is_allowed_element_type_conversion::value>> constexpr span(span&& other) : storage_(other.data(), details::extent_type(other.size())) { } ~span() GSL_NOEXCEPT = default; constexpr span& operator=(const span& other) GSL_NOEXCEPT = default; constexpr span& operator=(span&& other) GSL_NOEXCEPT = default; // [span.sub], span subviews template constexpr span first() const { Expects(Count >= 0 && Count <= size()); return {data(), Count}; } template constexpr span last() const { Expects(Count >= 0 && size() - Count >= 0); return {data() + (size() - Count), Count}; } template constexpr span subspan() const { Expects((Offset >= 0 && size() - Offset >= 0) && (Count == dynamic_extent || (Count >= 0 && Offset + Count <= size()))); return {data() + Offset, Count == dynamic_extent ? size() - Offset : Count}; } constexpr span first(index_type count) const { Expects(count >= 0 && count <= size()); return {data(), count}; } constexpr span last(index_type count) const { return make_subspan(size() - count, dynamic_extent, subspan_selector{}); } constexpr span subspan(index_type offset, index_type count = dynamic_extent) const { return make_subspan(offset, count, subspan_selector{}); } // [span.obs], span observers constexpr index_type length() const GSL_NOEXCEPT { return size(); } constexpr index_type size() const GSL_NOEXCEPT { return storage_.size(); } constexpr index_type length_bytes() const GSL_NOEXCEPT { return size_bytes(); } constexpr index_type size_bytes() const GSL_NOEXCEPT { return size() * narrow_cast(sizeof(element_type)); } constexpr bool empty() const GSL_NOEXCEPT { return size() == 0; } // [span.elem], span element access constexpr reference operator[](index_type idx) const { Expects(idx >= 0 && idx < storage_.size()); return data()[idx]; } constexpr reference at(index_type idx) const { return this->operator[](idx); } constexpr reference operator()(index_type idx) const { return this->operator[](idx); } constexpr pointer data() const GSL_NOEXCEPT { return storage_.data(); } // [span.iter], span iterator support iterator begin() const GSL_NOEXCEPT { return {this, 0}; } iterator end() const GSL_NOEXCEPT { return {this, length()}; } const_iterator cbegin() const GSL_NOEXCEPT { return {this, 0}; } const_iterator cend() const GSL_NOEXCEPT { return {this, length()}; } reverse_iterator rbegin() const GSL_NOEXCEPT { return reverse_iterator{end()}; } reverse_iterator rend() const GSL_NOEXCEPT { return reverse_iterator{begin()}; } const_reverse_iterator crbegin() const GSL_NOEXCEPT { return const_reverse_iterator{cend()}; } const_reverse_iterator crend() const GSL_NOEXCEPT { return const_reverse_iterator{cbegin()}; } private: // this implementation detail class lets us take advantage of the // empty base class optimization to pay for only storage of a single // pointer in the case of fixed-size spans template class storage_type : public ExtentType { public: // checked parameter is needed to remove unnecessary null check in subspans template constexpr storage_type(pointer data, OtherExtentType ext, bool checked = false) : ExtentType(ext), data_(data) { Expects(((checked || !data) && ExtentType::size() == 0) || ((checked || data) && ExtentType::size() >= 0)); } constexpr pointer data() const GSL_NOEXCEPT { return data_; } private: pointer data_; }; storage_type> storage_; // The rest is needed to remove unnecessary null check in subspans constexpr span(pointer ptr, index_type count, bool checked) : storage_(ptr, count, checked) {} template class subspan_selector {}; template span make_subspan(index_type offset, index_type count, subspan_selector) const GSL_NOEXCEPT { span tmp(*this); return tmp.subspan(offset, count); } span make_subspan(index_type offset, index_type count, subspan_selector) const GSL_NOEXCEPT { Expects(offset >= 0 && size() - offset >= 0); if (count == dynamic_extent) { return { data() + offset, size() - offset, true }; } Expects(count >= 0 && size() - offset >= count); return { data() + offset, count, true }; } }; // [span.comparison], span comparison operators template inline constexpr bool operator==(const span& l, const span& r) { return std::equal(l.begin(), l.end(), r.begin(), r.end()); } template inline constexpr bool operator!=(const span& l, const span& r) { return !(l == r); } template inline constexpr bool operator<(const span& l, const span& r) { return std::lexicographical_compare(l.begin(), l.end(), r.begin(), r.end()); } template inline constexpr bool operator<=(const span& l, const span& r) { return !(l > r); } template inline constexpr bool operator>(const span& l, const span& r) { return r < l; } template inline constexpr bool operator>=(const span& l, const span& r) { return !(l < r); } namespace details { // if we only supported compilers with good constexpr support then // this pair of classes could collapse down to a constexpr function // we should use a narrow_cast<> to go to std::size_t, but older compilers may not see it as // constexpr // and so will fail compilation of the template template struct calculate_byte_size : std::integral_constant(sizeof(ElementType) * static_cast(Extent))> { }; template struct calculate_byte_size : std::integral_constant { }; } // [span.objectrep], views of object representation template span::value> as_bytes(span s) GSL_NOEXCEPT { return {reinterpret_cast(s.data()), s.size_bytes()}; } template ::value>> span::value> as_writeable_bytes(span s) GSL_NOEXCEPT { return {reinterpret_cast(s.data()), s.size_bytes()}; } // // make_span() - Utility functions for creating spans // template span make_span(ElementType* ptr, typename span::index_type count) { return span(ptr, count); } template span make_span(ElementType* firstElem, ElementType* lastElem) { return span(firstElem, lastElem); } template span make_span(ElementType (&arr)[N]) { return span(arr); } template span make_span(Container& cont) { return span(cont); } template span make_span(const Container& cont) { return span(cont); } template span make_span(Ptr& cont, std::ptrdiff_t count) { return span(cont, count); } template span make_span(Ptr& cont) { return span(cont); } // Specialization of gsl::at for span template inline constexpr ElementType& at(const span& s, std::ptrdiff_t index) { // No bounds checking here because it is done in span::operator[] called below return s[index]; } } // namespace gsl #undef GSL_NOEXCEPT #include #endif // GSL_SPAN_H