mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2025-07-12 14:54:10 +00:00
add doc: basic_string (array compatible)
This commit is contained in:
parent
260291ea69
commit
7b0f0541e3
68 changed files with 4688 additions and 50 deletions
|
@ -22,7 +22,7 @@ Examples
|
|||
using namespace sprout;
|
||||
|
||||
SPROUT_STATIC_CONSTEXPR auto input = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
|
||||
static_assert(*(input.cbegin() - 1) == 1, "input last element is 10.");
|
||||
static_assert(*(input.cbegin() - 1) == 10, "input last element is 10.");
|
||||
|
||||
Complexity
|
||||
========================================
|
||||
|
|
|
@ -12,7 +12,7 @@ Interface
|
|||
Returns
|
||||
========================================
|
||||
|
||||
| true if the array size is 0, false otherwise.
|
||||
| true if the string size is 0, false otherwise.
|
||||
|
||||
Examples
|
||||
========================================
|
||||
|
@ -22,7 +22,7 @@ Examples
|
|||
using namespace sprout;
|
||||
|
||||
SPROUT_STATIC_CONSTEXPR auto input = array<int, 0>{{}};
|
||||
static_assert(input.empty() == 10, "input is empty.");
|
||||
static_assert(input.empty(), "input is empty.");
|
||||
|
||||
Complexity
|
||||
========================================
|
||||
|
|
|
@ -7,12 +7,12 @@ Interface
|
|||
========================================
|
||||
.. sourcecode:: c++
|
||||
|
||||
void swap(array& y) SPROUT_NOEXCEPT_EXPR(SPROUT_NOEXCEPT_EXPR(std::swap(std::declval<T&>(), std::declval<T&>())));
|
||||
void swap(array& other) SPROUT_NOEXCEPT_EXPR(SPROUT_NOEXCEPT_EXPR(std::swap(std::declval<T&>(), std::declval<T&>())));
|
||||
|
||||
Effects
|
||||
========================================
|
||||
|
||||
| ``swap_ranges(begin(), end(), y.begin())``.
|
||||
| ``swap_ranges(begin(), end(), other.begin())``.
|
||||
|
||||
Throws
|
||||
========================================
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue