mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-11-29 01:03:45 +00:00
38 lines
967 B
ReStructuredText
38 lines
967 B
ReStructuredText
|
.. _sprout-string-basic_string-cbegin:
|
||
|
|
###############################################################################
|
||
|
|
cbegin
|
||
|
|
###############################################################################
|
||
|
|
|
||
|
|
Interface
|
||
|
|
========================================
|
||
|
|
.. sourcecode:: c++
|
||
|
|
|
||
|
|
SPROUT_CONSTEXPR const_iterator cbegin() const SPROUT_NOEXCEPT;
|
||
|
|
|
||
|
|
Returns
|
||
|
|
========================================
|
||
|
|
|
||
|
|
| iterator for position after the last element always const.
|
||
|
|
|
||
|
|
Examples
|
||
|
|
========================================
|
||
|
|
.. sourcecode:: c++
|
||
|
|
|
||
|
|
#include <sprout/string.hpp>
|
||
|
|
using namespace sprout;
|
||
|
|
|
||
|
|
SPROUT_STATIC_CONSTEXPR auto input = string<8>("homuhomu");
|
||
|
|
static_assert(*(input.cbegin() - 1) == 'u', "input last element is u.");
|
||
|
|
|
||
|
|
Complexity
|
||
|
|
========================================
|
||
|
|
|
||
|
|
| Recursive function invocations in *O(1)* (constant) depth.
|
||
|
|
|
||
|
|
Header
|
||
|
|
========================================
|
||
|
|
|
||
|
|
| ``sprout/string/string.hpp``
|
||
|
|
| Convenience header: ``sprout/string.hpp``
|
||
|
|
|