From Jason Turner

[unord.map.cnstr]

C++14 → C++17 2.1 KB 21 lines
Current Draft | LaTeX Source
Archived: C++14 | C++17
Markdown: C++14 | C++17
Explore in Adventure Game

Diff to HTML by rtfpessoa

Files changed (1) hide show
  1. tmp/tmpmv5gp81r/{from.md → to.md} +12 -6
tmp/tmpmv5gp81r/{from.md → to.md} RENAMED
@@ -7,28 +7,34 @@ explicit unordered_map(size_type n,
7
  const key_equal& eql = key_equal(),
8
  const allocator_type& a = allocator_type());
9
  ```
10
 
11
  *Effects:* Constructs an empty `unordered_map` using the specified hash
12
- function, key equality function, and allocator, and using at least *`n`*
13
  buckets. For the default constructor, the number of buckets is
14
- *implementation-defined*. `max_load_factor()` returns 1.0.
15
 
16
  *Complexity:* Constant.
17
 
18
  ``` cpp
19
  template <class InputIterator>
20
  unordered_map(InputIterator f, InputIterator l,
21
  size_type n = see below,
22
  const hasher& hf = hasher(),
23
  const key_equal& eql = key_equal(),
24
  const allocator_type& a = allocator_type());
 
 
 
 
 
25
  ```
26
 
27
  *Effects:* Constructs an empty `unordered_map` using the specified hash
28
- function, key equality function, and allocator, and using at least *`n`*
29
- buckets. If *`n`* is not provided, the number of buckets is
30
- *implementation-defined*. Then inserts elements from the range
31
- `[`*`f`*`, `*`l`*`)`. `max_load_factor()` returns 1.0.
 
32
 
33
  *Complexity:* Average case linear, worst case quadratic.
34
 
 
7
  const key_equal& eql = key_equal(),
8
  const allocator_type& a = allocator_type());
9
  ```
10
 
11
  *Effects:* Constructs an empty `unordered_map` using the specified hash
12
+ function, key equality predicate, and allocator, and using at least `n`
13
  buckets. For the default constructor, the number of buckets is
14
+ *implementation-defined*. `max_load_factor()` returns `1.0`.
15
 
16
  *Complexity:* Constant.
17
 
18
  ``` cpp
19
  template <class InputIterator>
20
  unordered_map(InputIterator f, InputIterator l,
21
  size_type n = see below,
22
  const hasher& hf = hasher(),
23
  const key_equal& eql = key_equal(),
24
  const allocator_type& a = allocator_type());
25
+ unordered_map(initializer_list<value_type> il,
26
+ size_type n = see below,
27
+ const hasher& hf = hasher(),
28
+ const key_equal& eql = key_equal(),
29
+ const allocator_type& a = allocator_type());
30
  ```
31
 
32
  *Effects:* Constructs an empty `unordered_map` using the specified hash
33
+ function, key equality predicate, and allocator, and using at least `n`
34
+ buckets. If `n` is not provided, the number of buckets is
35
+ *implementation-defined*. Then inserts elements from the range \[`f`,
36
+ `l`) for the first form, or from the range \[`il.begin()`, `il.end()`)
37
+ for the second form. `max_load_factor()` returns `1.0`.
38
 
39
  *Complexity:* Average case linear, worst case quadratic.
40