From Jason Turner

[set.cons]

Diff to HTML by rtfpessoa

tmp/tmp5wjoo8w4/{from.md → to.md} RENAMED
@@ -1,9 +1,9 @@
1
  #### `set` constructors, copy, and assignment <a id="set.cons">[[set.cons]]</a>
2
 
3
  ``` cpp
4
- explicit set(const Compare& comp = Compare(),
5
  const Allocator& = Allocator());
6
  ```
7
 
8
  *Effects:* Constructs an empty set using the specified comparison
9
  objects and allocator.
@@ -18,11 +18,11 @@ template <class InputIterator>
18
 
19
  *Effects:* Constructs an empty `set` using the specified comparison
20
  object and allocator, and inserts elements from the range \[`first`,
21
  `last`).
22
 
23
- *Requires:* If the iterator’s dereference operator returns an lvalue or
24
- a non-const rvalue, then `Key` shall be `CopyConstructible`.
25
 
26
  *Complexity:* Linear in N if the range \[`first`, `last`) is already
27
  sorted using `comp` and otherwise N log N, where N is `last - first`.
28
 
 
1
  #### `set` constructors, copy, and assignment <a id="set.cons">[[set.cons]]</a>
2
 
3
  ``` cpp
4
+ explicit set(const Compare& comp,
5
  const Allocator& = Allocator());
6
  ```
7
 
8
  *Effects:* Constructs an empty set using the specified comparison
9
  objects and allocator.
 
18
 
19
  *Effects:* Constructs an empty `set` using the specified comparison
20
  object and allocator, and inserts elements from the range \[`first`,
21
  `last`).
22
 
23
+ *Requires:* If the iterator’s indirection operator returns an lvalue or
24
+ a non-const rvalue, then `Key` shall be `CopyInsertable` into `*this`.
25
 
26
  *Complexity:* Linear in N if the range \[`first`, `last`) is already
27
  sorted using `comp` and otherwise N log N, where N is `last - first`.
28