Init

cppdraft/unord/multimap/cnstr.md

@@ -0,0 +1,77 @@
+[unord.multimap.cnstr]
+
+# 23 Containers library [[containers]](./#containers)
+
+## 23.5 Unordered associative containers [[unord]](unord#multimap.cnstr)
+
+### 23.5.4 Class template unordered_multimap [[unord.multimap]](unord.multimap#cnstr)
+
+#### 23.5.4.2 Constructors [unord.multimap.cnstr]
+
+[🔗](#lib:unordered_multimap,constructor)
+
+`constexpr unordered_multimap() : unordered_multimap(size_type(see below)) { }
+constexpr explicit unordered_multimap(size_type n, const hasher& hf = hasher(),
+                                      const key_equal& eql = key_equal(),
+                                      const allocator_type& a = allocator_type());
+`
+
+[1](#1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/containers.tex#L14508)
+
+*Effects*: Constructs an empty unordered_multimap using the
+specified hash function, key equality predicate, and allocator, and
+using at least n buckets[.](#1.sentence-1)
+
+For the default constructor,
+the number of buckets is implementation-defined[.](#1.sentence-2)
+
+max_load_factor() returns 1.0[.](#1.sentence-3)
+
+[2](#2)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/containers.tex#L14517)
+
+*Complexity*: Constant[.](#2.sentence-1)
+
+[🔗](#lib:unordered_multimap,constructor_)
+
+`template<class InputIterator>
+  constexpr unordered_multimap(InputIterator f, InputIterator l,
+                               size_type n = see below, const hasher& hf = hasher(),
+                               const key_equal& eql = key_equal(),
+                               const allocator_type& a = allocator_type());
+template<[container-compatible-range](container.intro.reqmts#concept:container-compatible-range "23.2.2.1 Introduction [container.intro.reqmts]")<value_type> R>
+  constexpr unordered_multimap(from_range_t, R&& rg,
+                               size_type n = see below, const hasher& hf = hasher(),
+                               const key_equal& eql = key_equal(),
+                               const allocator_type& a = allocator_type());
+constexpr unordered_multimap(initializer_list<value_type> il,
+                             size_type n = see below, const hasher& hf = hasher(),
+                             const key_equal& eql = key_equal(),
+                             const allocator_type& a = allocator_type());
+`
+
+[3](#3)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/containers.tex#L14541)
+
+*Effects*: Constructs an empty unordered_multimap using the
+specified hash function, key equality predicate, and allocator, and
+using at least n buckets[.](#3.sentence-1)
+
+If n is not
+provided, the number of buckets is implementation-defined[.](#3.sentence-2)
+
+Then
+inserts elements from the range [f, l), rg, or il,
+respectively[.](#3.sentence-3)
+
+max_load_factor() returns 1.0[.](#3.sentence-4)
+
+[4](#4)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/containers.tex#L14552)
+
+*Complexity*: Average case linear, worst case quadratic[.](#4.sentence-1)

cppdraft/unord/multimap/erasure.md

@@ -0,0 +1,22 @@
+[unord.multimap.erasure]
+
+# 23 Containers library [[containers]](./#containers)
+
+## 23.5 Unordered associative containers [[unord]](unord#multimap.erasure)
+
+### 23.5.4 Class template unordered_multimap [[unord.multimap]](unord.multimap#erasure)
+
+#### 23.5.4.4 Erasure [unord.multimap.erasure]
+
+[🔗](#lib:erase_if,unordered_multimap)
+
+`template<class K, class T, class H, class P, class A, class Predicate>
+  constexpr typename unordered_multimap<K, T, H, P, A>::size_type
+    erase_if(unordered_multimap<K, T, H, P, A>& c, Predicate pred);
+`
+
+[1](#1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/containers.tex#L14602)
+
+*Effects*: Equivalent to:auto original_size = c.size();for (auto i = c.begin(), last = c.end(); i != last; ) {if (pred(*i)) { i = c.erase(i); } else {++i; }}return original_size - c.size();

cppdraft/unord/multimap/modifiers.md

@@ -0,0 +1,45 @@
+[unord.multimap.modifiers]
+
+# 23 Containers library [[containers]](./#containers)
+
+## 23.5 Unordered associative containers [[unord]](unord#multimap.modifiers)
+
+### 23.5.4 Class template unordered_multimap [[unord.multimap]](unord.multimap#modifiers)
+
+#### 23.5.4.3 Modifiers [unord.multimap.modifiers]
+
+[🔗](#lib:unordered_multimap,insert)
+
+`template<class P>
+  constexpr iterator insert(P&& obj);
+`
+
+[1](#1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/containers.tex#L14566)
+
+*Constraints*: is_constructible_v<value_type, P&&> is true[.](#1.sentence-1)
+
+[2](#2)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/containers.tex#L14570)
+
+*Effects*: Equivalent to: return emplace(std​::​forward<P>(obj));
+
+[🔗](#lib:unordered_multimap,insert_)
+
+`template<class P>
+  constexpr iterator insert(const_iterator hint, P&& obj);
+`
+
+[3](#3)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/containers.tex#L14582)
+
+*Constraints*: is_constructible_v<value_type, P&&> is true[.](#3.sentence-1)
+
+[4](#4)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/containers.tex#L14586)
+
+*Effects*: Equivalent to:return emplace_hint(hint, std​::​forward<P>(obj));