[numarray] - C++11 → C++14

Files changed (1) hide show

tmp/tmpw4clx1__/{from.md → to.md} +15 -11

tmp/tmpw4clx1__/{from.md → to.md} RENAMED Viewed

@@ -138,12 +138,13 @@ not add more than two levels of template nesting over the most deeply
 nested argument type.[^7]
 Implementations introducing such replacement types shall provide
 additional functions and operators as follows:
-- for every function taking a `const valarray<T>&`, identical functions
- taking the replacement types shall be added;
 - for every function taking two `const valarray<T>&` arguments,
   identical functions taking every combination of `const valarray<T>&`
   and replacement types shall be added.
 In particular, an implementation shall allow a `valarray<T>` to be
@@ -352,16 +353,14 @@ the assignment.
 ``` cpp
 valarray<T>& operator=(valarray<T>&& v) noexcept;
 ```
-*Effects:* `*this` obtains the value of `v`. If the length of `v` is not
-equal to the length of `*this`, resizes `*this` to make the two arrays
-the same length, as if by calling `resize(v.size())`, before performing
-the assignment.
-*Complexity:* Constant.
 ``` cpp
 valarray& operator=(initializer_list<T> il);
 ```
@@ -415,12 +414,12 @@ Likewise, the expression `&a[i] != &b[j]` evaluates as `true` for any
 two arrays `a` and `b` and for any `size_t i` and `size_t j` such that
 `i` is less than the length of `a` and `j` is less than the length of
 `b`. This property indicates an absence of aliasing and may be used to
 advantage by optimizing compilers.[^13]
-The reference returned by the subscript operator for an array is
-guaranteed to be valid until the member function
 `resize(size_t, T)` ([[valarray.members]]) is called for that array or
 until the lifetime of that array ends, whichever happens first.
 If the subscript operator is invoked with a `size_t` argument whose
 value is not less than the length of the array, the behavior is
@@ -645,11 +644,11 @@ void swap(valarray& v) noexcept;
 size_t size() const;
 ```
 *Returns:* The number of elements in the array.
-*Complexity:* constant time.
 ``` cpp
 T sum() const;
 ```
@@ -919,11 +918,11 @@ size_t size() const;
 size_t stride() const;
 ```
 *Returns:* The start, length, or stride specified by a `slice` object.
-*Complexity:* constant time.
 ### Class template `slice_array` <a id="template.slice.array">[[template.slice.array]]</a>
 #### Class template `slice_array` overview <a id="template.slice.array.overview">[[template.slice.array.overview]]</a>
@@ -1371,10 +1370,15 @@ iterator ([[random.access.iterators]]) whose `value_type` is the
 template parameter `T` and whose `reference` type is `T&`.
 *unspecified*2 is a type that meets the requirements of a constant
 random access iterator ([[random.access.iterators]]) whose `value_type`
 is the template parameter `T` and whose `reference` type is `const T&`.
 ``` cpp
 template <class T> unspecified{1} begin(valarray<T>& v);
 template <class T> unspecified{2} begin(const valarray<T>& v);
 ```

 nested argument type.[^7]
 Implementations introducing such replacement types shall provide
 additional functions and operators as follows:
+- for every function taking a `const valarray<T>&` other than `begin`
+ and `end` ([[valarray.range]]), identical functions taking the
+  replacement types shall be added;
 - for every function taking two `const valarray<T>&` arguments,
   identical functions taking every combination of `const valarray<T>&`
   and replacement types shall be added.
 In particular, an implementation shall allow a `valarray<T>` to be
 ``` cpp
 valarray<T>& operator=(valarray<T>&& v) noexcept;
 ```
+*Effects:* `*this` obtains the value of `v`. The value of `v` after the
+assignment is not specified.
+*Complexity:* Linear.
 ``` cpp
 valarray& operator=(initializer_list<T> il);
 ```
 two arrays `a` and `b` and for any `size_t i` and `size_t j` such that
 `i` is less than the length of `a` and `j` is less than the length of
 `b`. This property indicates an absence of aliasing and may be used to
 advantage by optimizing compilers.[^13]
+The reference returned by the subscript operator for an array shall be
+valid until the member function
 `resize(size_t, T)` ([[valarray.members]]) is called for that array or
 until the lifetime of that array ends, whichever happens first.
 If the subscript operator is invoked with a `size_t` argument whose
 value is not less than the length of the array, the behavior is
 size_t size() const;
 ```
 *Returns:* The number of elements in the array.
+*Complexity:* Constant time.
 ``` cpp
 T sum() const;
 ```
 size_t stride() const;
 ```
 *Returns:* The start, length, or stride specified by a `slice` object.
+*Complexity:* Constant time.
 ### Class template `slice_array` <a id="template.slice.array">[[template.slice.array]]</a>
 #### Class template `slice_array` overview <a id="template.slice.array.overview">[[template.slice.array.overview]]</a>
 template parameter `T` and whose `reference` type is `T&`.
 *unspecified*2 is a type that meets the requirements of a constant
 random access iterator ([[random.access.iterators]]) whose `value_type`
 is the template parameter `T` and whose `reference` type is `const T&`.
+The iterators returned by `begin` and `end` for an array are guaranteed
+to be valid until the member function `resize(size_t, T)` (
+[[valarray.members]]) is called for that array or until the lifetime of
+that array ends, whichever happens first.
 ``` cpp
 template <class T> unspecified{1} begin(valarray<T>& v);
 template <class T> unspecified{2} begin(const valarray<T>& v);
 ```

Diff to HTML by rtfpessoa