#ifndef SPROUT_STRING_STRING_HPP #define SPROUT_STRING_STRING_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include #include HDR_ALGORITHM_SSCRISK_CEL_OR_SPROUT #include HDR_ITERATOR_SSCRISK_CEL_OR_SPROUT #if SPROUT_USE_INDEX_ITERATOR_IMPLEMENTATION # include #endif namespace sprout { // // basic_string // template > class basic_string { public: typedef T value_type; #if SPROUT_USE_INDEX_ITERATOR_IMPLEMENTATION typedef sprout::index_iterator iterator; typedef sprout::index_iterator const_iterator; #else typedef T* iterator; typedef T const* const_iterator; #endif typedef T& reference; typedef T const& const_reference; typedef std::size_t size_type; typedef std::ptrdiff_t difference_type; typedef T* pointer; typedef T const* const_pointer; typedef sprout::reverse_iterator reverse_iterator; typedef sprout::reverse_iterator const_reverse_iterator; typedef Traits traits_type; typedef sprout::char_traits_helper traits_helper_type; #if SPROUT_USE_INDEX_ITERATOR_IMPLEMENTATION private: template class is_string_iterator : public std::false_type {}; template class is_string_iterator : public is_string_iterator {}; template class is_string_iterator : public is_string_iterator {}; template class is_string_iterator : public is_string_iterator {}; template class is_string_iterator&> > : public std::true_type {}; template class is_string_iterator const&> > : public std::true_type {}; #endif public: SPROUT_STATIC_CONSTEXPR size_type npos = sprout::npos; SPROUT_STATIC_CONSTEXPR size_type static_size = N; private: template static SPROUT_CONSTEXPR size_type find_impl_1(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) { return pos <= len - n ? traits_type::eq(data[pos], *s) && traits_type::compare(data + (pos + 1), s + 1, n - 1) == 0 ? pos : find_impl_1(data, len, s, pos + 1, n) : npos ; } template static SPROUT_CONSTEXPR size_type find_impl(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) { return n == 0 ? (pos <= len ? pos : npos) : n <= len ? find_impl_1(data, len, s, pos, n) : npos ; } static SPROUT_CONSTEXPR size_type find_c_impl(const_iterator p, const_iterator first, const_iterator last) { return traits_helper_type::is_found(p, last) ? p - first : npos ; } template static SPROUT_CONSTEXPR size_type rfind_impl_1(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) { return traits_type::compare(data + pos, s, n) == 0 ? pos : pos > 0 ? rfind_impl_1(data, len, s, pos - 1, n) : npos ; } template static SPROUT_CONSTEXPR size_type rfind_impl(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) { return n <= len ? rfind_impl_1(data, len, s, NS_SSCRISK_CEL_OR_SPROUT::min(size_type(len - n), pos), n) : npos ; } static SPROUT_CONSTEXPR size_type rfind_c_impl(const_iterator data, size_type len, value_type c) { return len > 0 ? traits_type::eq(data[len - 1], c) ? len - 1 : rfind_c_impl(data, len - 1, c) : npos ; } template static SPROUT_CONSTEXPR size_type find_first_of_impl(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) { return n && pos < len ? traits_helper_type::is_found(traits_helper_type::find(s, n, data[pos]), s + n) ? pos : find_first_of_impl(data, len, s, pos + 1, n) : npos ; } template static SPROUT_CONSTEXPR size_type find_last_of_impl_1(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) { return traits_helper_type::is_found(traits_helper_type::find(s, n, data[len]), s + n) ? len : len ? find_last_of_impl_1(data, len - 1, s, pos, n) : npos ; } template static SPROUT_CONSTEXPR size_type find_last_of_impl(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) { return len && n ? find_last_of_impl_1(data, len - 1 > pos ? pos : len - 1, s, pos, n) : npos ; } template static SPROUT_CONSTEXPR size_type find_first_not_of_impl(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) { return pos < len ? !traits_helper_type::is_found(traits_helper_type::find(s, n, data[pos]), s + n) ? pos : find_first_not_of_impl(data, len, s, pos + 1, n) : npos ; } template static SPROUT_CONSTEXPR size_type find_last_not_of_impl_1(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) { return !traits_helper_type::is_found(traits_helper_type::find(s, n, data[len]), s + n) ? len : len ? find_last_not_of_impl_1(data, len - 1, s, pos, n) : npos ; } template static SPROUT_CONSTEXPR size_type find_last_not_of_impl(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) { return len ? find_last_not_of_impl_1(data, len - 1 > pos ? pos : len - 1, s, pos, n) : npos ; } static SPROUT_CONSTEXPR size_type find_last_not_of_c_impl(const_iterator data, size_type len, value_type c, size_type pos) { return !traits_type::eq(data[len], c) ? len : len ? find_last_not_of_c_impl(data, len - 1, c, pos) : npos ; } static SPROUT_CONSTEXPR int compare_impl_1(int compared, size_type n1, size_type n2) { return compared != 0 ? compared : n1 < n2 ? -1 : n2 < n1 ? 1 : 0 ; } template static SPROUT_CONSTEXPR int compare_impl(const_iterator dest, size_type pos1, size_type n1, ConstIterator s, size_type n2) { return compare_impl_1( traits_type::compare(dest + pos1, s, NS_SSCRISK_CEL_OR_SPROUT::min(n1, n2)), n1, n2 ); } template static SPROUT_CONSTEXPR basic_string from_c_str_impl(value_type const* s, size_type n, sprout::index_tuple) { return basic_string{{(Indexes < n ? s[Indexes] : T())...}, n}; } template static SPROUT_CONSTEXPR basic_string implicit_conversion_impl(T const(& elems)[M], size_type len, sprout::index_tuple) { return sprout::basic_string{{(Indexes < M - 1 ? elems[Indexes] : T())...}, len}; } public: static SPROUT_CONSTEXPR basic_string from_c_str(value_type const* s, size_type n) { return !(N < n) ? from_c_str_impl(s, n, sprout::index_range<0, N>::make()) : throw std::out_of_range("basic_string<>: index out of range") ; } static SPROUT_CONSTEXPR basic_string from_c_str(value_type const* s) { return from_c_str(s, traits_type::length(s)); } public: value_type elems[static_size + 1]; size_type len; public: // construct/copy/destroy: template basic_string& operator=(basic_string const& rhs) { return assign(rhs); } basic_string& operator=(value_type const* rhs) { return assign(rhs); } basic_string& operator=(value_type rhs) { return assign(1, rhs); } // iterators: #if SPROUT_USE_INDEX_ITERATOR_IMPLEMENTATION iterator begin() SPROUT_NOEXCEPT { return iterator(*this, 0); } SPROUT_CONSTEXPR const_iterator begin() const SPROUT_NOEXCEPT { return const_iterator(*this, 0); } iterator end() SPROUT_NOEXCEPT { return iterator(*this, size()); } SPROUT_CONSTEXPR const_iterator end() const SPROUT_NOEXCEPT { return const_iterator(*this, size()); } #else iterator begin() SPROUT_NOEXCEPT { return &elems[0]; } SPROUT_CONSTEXPR const_iterator begin() const SPROUT_NOEXCEPT { return &elems[0]; } iterator end() SPROUT_NOEXCEPT { return &elems[0] + size(); } SPROUT_CONSTEXPR const_iterator end() const SPROUT_NOEXCEPT { return &elems[0] + size(); } #endif reverse_iterator rbegin() SPROUT_NOEXCEPT { return const_reverse_iterator(end()); } SPROUT_CONSTEXPR const_reverse_iterator rbegin() const SPROUT_NOEXCEPT { return const_reverse_iterator(end()); } reverse_iterator rend() SPROUT_NOEXCEPT { return const_reverse_iterator(begin()); } SPROUT_CONSTEXPR const_reverse_iterator rend() const SPROUT_NOEXCEPT { return const_reverse_iterator(begin()); } #if SPROUT_USE_INDEX_ITERATOR_IMPLEMENTATION SPROUT_CONSTEXPR const_iterator cbegin() const SPROUT_NOEXCEPT { return const_iterator(*this, 0); } SPROUT_CONSTEXPR const_iterator cend() const SPROUT_NOEXCEPT { return const_iterator(*this, size()); } #else SPROUT_CONSTEXPR const_iterator cbegin() const SPROUT_NOEXCEPT { return &elems[0]; } SPROUT_CONSTEXPR const_iterator cend() const SPROUT_NOEXCEPT { return &elems[0] + size(); } #endif SPROUT_CONSTEXPR const_reverse_iterator crbegin() const SPROUT_NOEXCEPT { return const_reverse_iterator(end()); } SPROUT_CONSTEXPR const_reverse_iterator crend() const SPROUT_NOEXCEPT { return const_reverse_iterator(begin()); } // capacity: SPROUT_CONSTEXPR size_type size() const SPROUT_NOEXCEPT { return len; } SPROUT_CONSTEXPR size_type length() const SPROUT_NOEXCEPT { return size(); } SPROUT_CONSTEXPR size_type max_size() const SPROUT_NOEXCEPT { return static_size; } void resize(size_type n, value_type c) { maxcheck(n); if (n > size()) { traits_type::assign(end(), n - size(), c); } traits_type::assign(begin() + n, max_size() - n, value_type()); len = n; } void resize(size_type n) { resize(n, value_type()); } void clear() { traits_type::assign(begin(), max_size(), value_type()); len = 0; } SPROUT_CONSTEXPR bool empty() const SPROUT_NOEXCEPT { return size() == 0; } // element access: reference operator[](size_type i) { return elems[i]; } SPROUT_CONSTEXPR const_reference operator[](size_type i) const { return elems[i]; } reference at(size_type i) { return i < size() ? elems[i] : (throw std::out_of_range("basic_string<>: index out of range"), elems[i]) ; } SPROUT_CONSTEXPR const_reference at(size_type i) const { return i < size() ? elems[i] : (throw std::out_of_range("basic_string<>: index out of range"), elems[i]) ; } reference front() { return elems[0]; } SPROUT_CONSTEXPR const_reference front() const { return elems[0]; } reference back() { return elems[size() - 1]; } SPROUT_CONSTEXPR const_reference back() const { return elems[size() - 1]; } // modifiers: template basic_string& assign(basic_string const& str) { return assign(str.begin(), str.size()); } template basic_string& assign(basic_string const& str, size_type pos, size_type n) { if (str.size() < pos + n) { throw std::out_of_range("basic_string<>: index out of range"); } return assign(str.begin() + pos, n); } basic_string& assign(value_type const* s, size_type n) { maxcheck(n); for (size_type i = 0; i < n; ++i) { traits_type::assign(elems[i], s[i]); } for (size_type i = n; i < max_size(); ++i) { traits_type::assign(elems[i], value_type()); } len = n; return *this; } basic_string& assign(value_type const* s) { return assign(s, traits_type::length(s)); } basic_string& assign(size_type n, value_type c) { maxcheck(n); traits_type::assign(begin(), n, c); traits_type::assign(begin() + n, max_size() - n, value_type()); len = n; return *this; } template basic_string& assign(Iterator first, Iterator last) { size_type n = 0; for (; n < max_size() || first != last; ++n, ++first) { traits_type::assign(elems[n], *first); } for (size_type i = n; i < max_size(); ++i) { traits_type::assign(elems[i], value_type()); } len = n; return *this; } void swap(basic_string& other) SPROUT_NOEXCEPT_EXPR(SPROUT_NOEXCEPT_EXPR(std::swap(std::declval(), std::declval()))) { std::swap_ranges(other.begin(), other.begin() + other.max_size(), begin()); sprout::swap(len, other.len); } // string operations: SPROUT_CONSTEXPR const_pointer c_str() const SPROUT_NOEXCEPT { return &elems[0]; } pointer data() SPROUT_NOEXCEPT { return &elems[0]; } SPROUT_CONSTEXPR const_pointer data() const SPROUT_NOEXCEPT { return &elems[0]; } template SPROUT_CONSTEXPR size_type find(basic_string const& str, size_type pos = 0) const SPROUT_NOEXCEPT { return find_impl(begin(), len, str.begin(), pos, str.size()); } SPROUT_CONSTEXPR size_type find(value_type const* s, size_type pos, size_type n) const { return find_impl(begin(), len, s, pos, n); } SPROUT_CONSTEXPR size_type find(value_type const* s, size_type pos = 0) const { return find(s, pos, traits_type::length(s)); } SPROUT_CONSTEXPR size_type find(value_type c, size_type pos = 0) const { return pos < len ? find_c_impl(traits_helper_type::find(begin() + pos, len - pos, c), begin(), end()) : npos ; } SPROUT_CONSTEXPR size_type rfind(basic_string const& str, size_type pos = npos) const SPROUT_NOEXCEPT { return rfind_impl(begin(), len, str.begin(), pos, str.size()); } SPROUT_CONSTEXPR size_type rfind(value_type const* s, size_type pos, size_type n) const { return rfind_impl(begin(), len, s, pos, n); } SPROUT_CONSTEXPR size_type rfind(value_type const* s, size_type pos = npos) const { return rfind(s, pos, traits_type::length(s)); } SPROUT_CONSTEXPR size_type rfind(value_type c, size_type pos = npos) const { return len ? rfind_c_impl(begin(), len - 1 > pos ? pos + 1 : len, c) : npos ; } SPROUT_CONSTEXPR size_type find_first_of(basic_string const& str, size_type pos = 0) const SPROUT_NOEXCEPT { return find_first_of_impl(begin(), len, str.begin(), pos, str.size()); } SPROUT_CONSTEXPR size_type find_first_of(value_type const* s, size_type pos, size_type n) const { return find_first_of_impl(begin(), len, s, pos, n); } SPROUT_CONSTEXPR size_type find_first_of(value_type const* s, size_type pos = 0) const { return find_first_of(s, pos, traits_type::length(s)); } SPROUT_CONSTEXPR size_type find_first_of(value_type c, size_type pos = 0) const { return find(c, pos); } SPROUT_CONSTEXPR size_type find_last_of(basic_string const& str, size_type pos = npos) const SPROUT_NOEXCEPT { return find_last_of_impl(begin(), len, str.begin(), pos, str.size()); } SPROUT_CONSTEXPR size_type find_last_of(value_type const* s, size_type pos, size_type n) const { return find_last_of_impl(begin(), len, s, pos, n); } SPROUT_CONSTEXPR size_type find_last_of(value_type const* s, size_type pos = npos) const { return find_last_of(s, pos, traits_type::length(s)); } SPROUT_CONSTEXPR size_type find_last_of(value_type c, size_type pos = npos) const { return rfind(c, pos); } SPROUT_CONSTEXPR size_type find_first_not_of(basic_string const& str, size_type pos = 0) const SPROUT_NOEXCEPT { return find_first_not_of_impl(begin(), len, str.begin(), pos, str.size()); } SPROUT_CONSTEXPR size_type find_first_not_of(value_type const* s, size_type pos, size_type n) const { return find_first_not_of_impl(begin(), len, s, pos, n); } SPROUT_CONSTEXPR size_type find_first_not_of(value_type const* s, size_type pos = 0) const { return find_first_not_of(s, pos, traits_type::length(s)); } SPROUT_CONSTEXPR size_type find_first_not_of(value_type c, size_type pos = 0) const { return pos < len ? !traits_type::eq(elems[pos], c) ? pos : find_first_not_of(c, pos + 1) : npos ; } SPROUT_CONSTEXPR size_type find_last_not_of(basic_string const& str, size_type pos = npos) const SPROUT_NOEXCEPT { return find_last_not_of_impl(begin(), len, str.begin(), pos, str.size()); } SPROUT_CONSTEXPR size_type find_last_not_of(value_type const* s, size_type pos, size_type n) const { return find_last_not_of_impl(begin(), len, s, pos, n); } SPROUT_CONSTEXPR size_type find_last_not_of(value_type const* s, size_type pos = npos) const { return find_last_not_of(s, pos, traits_type::length(s)); } SPROUT_CONSTEXPR size_type find_last_not_of(value_type c, size_type pos = npos) const { return len ? find_last_not_of_c_impl(begin(), len - 1 > pos ? pos : len - 1, c, pos) : npos ; } SPROUT_CONSTEXPR basic_string substr(size_type pos = 0, size_type n = npos) const { return !(size() < pos) ? n == npos ? substr(pos, size() - pos) : from_c_str(c_str() + pos, n) : throw std::out_of_range("basic_string<>: index out of range") ; } template SPROUT_CONSTEXPR int compare(basic_string const& str) const { return compare(0, size(), str.begin(), str.size()); } SPROUT_CONSTEXPR int compare(value_type const* s) const { return compare(0, size(), s, traits_type::length(s)); } template SPROUT_CONSTEXPR int compare(size_type pos1, size_type n1, basic_string const& str) const { return compare(pos1, n1, str, 0, npos); } SPROUT_CONSTEXPR int compare(size_type pos1, size_type n1, value_type const* s) const { return compare(pos1, n1, s, traits_type::length(s)); } template SPROUT_CONSTEXPR int compare(size_type pos1, size_type n1, basic_string const& str, size_type pos2, size_type n2) const { return !(str.size() < pos2) ? compare(pos1, n1, str.begin() + pos2, NS_SSCRISK_CEL_OR_SPROUT::min(n2, str.size() - pos2)) : throw std::out_of_range("basic_string<>: index out of range") ; } SPROUT_CONSTEXPR int compare(size_type pos1, size_type n1, value_type const* s, size_type n2) const { return !(size() < pos1) ? compare_impl(begin(), pos1, NS_SSCRISK_CEL_OR_SPROUT::min(n1, size() - pos1), s, n2) : throw std::out_of_range("basic_string<>: index out of range") ; } // others: template N)>::type> SPROUT_CONSTEXPR operator basic_string() const { return implicit_conversion_impl( elems, len, sprout::index_range<0, N2>::make() ); } pointer c_array() SPROUT_NOEXCEPT { return &elems[0]; } void rangecheck(size_type i) const { if (i >= size()) { throw std::out_of_range("basic_string<>: index out of range"); } } void maxcheck(size_type n) const { if (n > max_size()) { throw std::out_of_range("basic_string<>: index out of range"); } } #if SPROUT_USE_INDEX_ITERATOR_IMPLEMENTATION template typename std::enable_if< is_string_iterator::value, basic_string& >::type assign(ConstIterator s, size_type n) { maxcheck(n); for (size_type i = 0; i < n; ++i) { traits_type::assign(elems[i], s[i]); } for (size_type i = n; i < max_size(); ++i) { traits_type::assign(elems[i], value_type()); } len = n; return *this; } template typename std::enable_if< is_string_iterator::value, basic_string& >::type assign(ConstIterator s) { return assign(s, traits_type::length(s)); } template typename std::enable_if< is_string_iterator::value, basic_string& >::type operator=(ConstIterator rhs) { return assign(rhs); } template SPROUT_CONSTEXPR typename std::enable_if< is_string_iterator::value, size_type >::type find(ConstIterator s, size_type pos, size_type n) const { return find_impl(begin(), len, s, pos, n); } template SPROUT_CONSTEXPR typename std::enable_if< is_string_iterator::value, size_type >::type find(ConstIterator s, size_type pos = 0) const { return find(s, pos, traits_type::length(s)); } template SPROUT_CONSTEXPR typename std::enable_if< is_string_iterator::value, size_type >::type rfind(ConstIterator s, size_type pos, size_type n) const { return rfind_impl(begin(), len, s, pos, n); } template SPROUT_CONSTEXPR typename std::enable_if< is_string_iterator::value, size_type >::type rfind(ConstIterator s, size_type pos = npos) const { return rfind(s, pos, traits_type::length(s)); } template SPROUT_CONSTEXPR typename std::enable_if< is_string_iterator::value, size_type >::type find_first_of(ConstIterator s, size_type pos, size_type n) const { return find_first_of_impl(begin(), len, s, pos, n); } template SPROUT_CONSTEXPR typename std::enable_if< is_string_iterator::value, size_type >::type find_first_of(ConstIterator s, size_type pos = 0) const { return find_first_of(s, pos, traits_type::length(s)); } template SPROUT_CONSTEXPR typename std::enable_if< is_string_iterator::value, size_type >::type find_last_of(ConstIterator s, size_type pos, size_type n) const { return find_last_of_impl(begin(), len, s, pos, n); } template SPROUT_CONSTEXPR typename std::enable_if< is_string_iterator::value, size_type >::type find_last_of(ConstIterator s, size_type pos = 0) const { return find_last_of(s, pos, traits_type::length(s)); } template SPROUT_CONSTEXPR typename std::enable_if< is_string_iterator::value, size_type >::type find_first_not_of(ConstIterator s, size_type pos, size_type n) const { return find_first_not_of_impl(begin(), len, s, pos, n); } template SPROUT_CONSTEXPR typename std::enable_if< is_string_iterator::value, size_type >::type find_first_not_of(ConstIterator s, size_type pos = 0) const { return find_first_not_of_impl(s, pos, traits_type::length(s)); } template SPROUT_CONSTEXPR typename std::enable_if< is_string_iterator::value, size_type >::type find_last_not_of(ConstIterator s, size_type pos, size_type n) const { return find_last_not_of_impl(begin(), len, s, pos, n); } template SPROUT_CONSTEXPR typename std::enable_if< is_string_iterator::value, size_type >::type find_last_not_of(ConstIterator s, size_type pos = npos) const { return find_last_not_of_impl(s, pos, traits_type::length(s)); } template SPROUT_CONSTEXPR typename std::enable_if< is_string_iterator::value, int >::type compare(ConstIterator s) const { return compare(0, size(), s, traits_type::length(s)); } template SPROUT_CONSTEXPR typename std::enable_if< is_string_iterator::value, int >::type compare(size_type pos1, size_type n1, ConstIterator s) const { return compare(pos1, n1, s, traits_type::length(s)); } template SPROUT_CONSTEXPR typename std::enable_if< is_string_iterator::value, int >::type compare(size_type pos1, size_type n1, ConstIterator s, size_type n2) const { return !(size() < pos1) ? compare_impl(begin(), pos1, NS_SSCRISK_CEL_OR_SPROUT::min(n1, size() - pos1), s, n2) : throw std::out_of_range("basic_string<>: index out of range") ; } #endif }; template SPROUT_CONSTEXPR_OR_CONST typename sprout::basic_string::size_type sprout::basic_string::npos; template SPROUT_CONSTEXPR_OR_CONST typename sprout::basic_string::size_type sprout::basic_string::static_size; // // swap // template inline void swap(sprout::basic_string& lhs, sprout::basic_string& rhs) SPROUT_NOEXCEPT_EXPR(SPROUT_NOEXCEPT_EXPR(lhs.swap(rhs))) { lhs.swap(rhs); } namespace detail { template struct make_construct_impl; template struct make_construct_impl > { private: typedef sprout::basic_string copied_type; private: template static SPROUT_CONSTEXPR typename copied_type::size_type length_impl(sprout::array const& arr) { return NS_SSCRISK_CEL_OR_SPROUT::distance( arr.begin(), NS_SSCRISK_CEL_OR_SPROUT::find(arr.begin(), arr.end(), T()) ); } template static SPROUT_CONSTEXPR copied_type make_impl(typename copied_type::size_type size, sprout::index_tuple, Args&&... args) { return copied_type{ {(Indexes < size ? sprout::forward(args) : T())...}, size }; } public: template static SPROUT_CONSTEXPR typename copied_type::size_type length(Args&&... args) { return length_impl(sprout::make_array(sprout::forward(args)...)); } template static SPROUT_CONSTEXPR copied_type make(Args&&... args) { return make_impl( length(args...), sprout::index_range<0, sizeof...(Args)>::make(), sprout::forward(args)... ); } template static SPROUT_CONSTEXPR copied_type make(typename copied_type::size_type size, Args&&... args) { return make_impl( size, sprout::index_range<0, sizeof...(Args)>::make(), sprout::forward(args)... ); } }; } // namespace detail namespace detail { template inline SPROUT_CONSTEXPR sprout::basic_string to_string_impl_1( T const(& arr)[N], typename sprout::basic_string::size_type n, sprout::index_tuple ) { return sprout::basic_string{{(Indexes < n ? arr[Indexes] : T())...}, n}; } template inline SPROUT_CONSTEXPR sprout::basic_string to_string_impl(T const(& arr)[N], sprout::index_tuple) { typedef sprout::char_traits_helper > traits_type; return to_string_impl_1(arr, traits_type::length(arr, N - 1), sprout::index_tuple()); } } // namespace detail // // to_string // template inline SPROUT_CONSTEXPR sprout::basic_string to_string(sprout::basic_string const& s) { return s; } template inline SPROUT_CONSTEXPR sprout::basic_string to_string(T const(& arr)[N]) { return sprout::detail::to_string_impl(arr, sprout::index_range<0, N - 1>::make()); } // // string_from_c_str // template inline SPROUT_CONSTEXPR sprout::basic_string string_from_c_str(T const* s, std::size_t n) { return sprout::basic_string::from_c_str(s, n); } template inline SPROUT_CONSTEXPR sprout::basic_string string_from_c_str(T const* s) { return sprout::basic_string::from_c_str(s); } } // namespace sprout #endif // #ifndef SPROUT_STRING_STRING_HPP