Merge 2018-03 LWG Motion 7

Author: zygoloid

source/atomics.tex

@@ -1146,6 +1146,8 @@
 \begin{codeblock}
 namespace std {
   template<> struct atomic<@\placeholder{floating-point}@> {
+    using value_type = @\placeholdernc{floating-point}@;
+    using difference_type = value_type;
     static constexpr bool is_always_lock_free = @\impdefx{whether a given \tcode{atomic} type's operations are always lock free}@;
     bool is_lock_free() const volatile noexcept;
     bool is_lock_free() const noexcept;

source/containers.tex

@@ -853,7 +853,10 @@
  \tcode{T} is also
  \tcode{MoveInsertable} into \tcode{X} and \tcode{MoveAssignable}.
  \effects\ Inserts an object of type \tcode{T} constructed with
- \tcode{std::forward<\brk{}Args\brk{}>(\brk{}args)...} before \tcode{p}.   \\ \rowsep
+ \tcode{std::forward<\brk{}Args\brk{}>(\brk{}args)...} before \tcode{p}.
+ \begin{note} \tcode{args} may directly or indirectly refer to
+ a value in \tcode{a}. \end{note}
+ \\ \rowsep
 
 \tcode{a.insert(p,t)}   &
  \tcode{iterator}       &
@@ -4237,7 +4240,7 @@
 \requires \tcode{position} is \tcode{before_begin()} or is a dereferenceable
 iterator in the range \range{begin()}{end()}.
 \tcode{get_allocator() == x.get_allocator()}.
-\tcode{\&x != this}.
+\tcode{addressof(x) != this}.
 
 \pnum
 \effects Inserts the contents of \tcode{x} after
@@ -4834,7 +4837,7 @@
 \begin{itemdescr}
 \pnum
 \requires
-\tcode{\&x != this}.
+\tcode{addressof(x) != this}.
 
 \pnum
 \effects
@@ -5038,7 +5041,7 @@
 
 \pnum
 \effects
-If \tcode{(\&x == this)} does nothing; otherwise, merges the two sorted ranges \tcode{[begin(),
+If \tcode{addressof(x) == this}, does nothing; otherwise, merges the two sorted ranges \tcode{[begin(),
 end())} and \tcode{[x.\brk{}begin(), x.end())}. The result is a range in which the elements
 will be sorted in non-decreasing order according to the ordering defined by \tcode{comp}; that
 is, for every iterator \tcode{i}, in the range other than the first, the condition
@@ -5049,7 +5052,7 @@
 \tcode{x}.
 
 \pnum
-\remarks Stable\iref{algorithm.stable}. If \tcode{(\&x != this)} the range \tcode{[x.begin(), x.end())}
+\remarks Stable\iref{algorithm.stable}. If \tcode{addressof(x) != this}, the range \tcode{[x.begin(), x.end())}
 is empty after the merge.
 No elements are copied by this operation. The behavior is undefined if
 \tcode{get_allocator() != x.get_allocator()}.
@@ -5059,7 +5062,7 @@
 At most
 \tcode{size() + x.size() - 1}
 applications of \tcode{comp} if
-\tcode{(\&x != this)};
+\tcode{addressof(x) != this};
 otherwise, no applications of \tcode{comp} are performed.
 If an exception is thrown other than by a comparison there are no effects.
 \end{itemdescr}
@@ -5369,6 +5372,9 @@
 \returns
 The total number of elements that the vector can hold
 without requiring reallocation.
+
+\pnum
+\complexity Constant time.
 \end{itemdescr}
 
 \indexlibrary{\idxcode{reserve}!\idxcode{vector}}%

source/future.tex

@@ -2159,7 +2159,7 @@
 \begin{codeblock}
 namespace std {
   template<class T> struct is_literal_type;
-  template<class T> constexpr bool is_literal_type_v = is_literal_type<T>::value;
+  template<class T> inline constexpr bool is_literal_type_v = is_literal_type<T>::value;
 
   template<class> struct result_of;    // not defined
   template<class Fn, class... ArgTypes> struct result_of<Fn(ArgTypes...)>;