Init

cppdraft/unord/multiset/cnstr.md

@@ -0,0 +1,77 @@
+[unord.multiset.cnstr]
+
+# 23 Containers library [[containers]](./#containers)
+
+## 23.5 Unordered associative containers [[unord]](unord#multiset.cnstr)
+
+### 23.5.7 Class template unordered_multiset [[unord.multiset]](unord.multiset#cnstr)
+
+#### 23.5.7.2 Constructors [unord.multiset.cnstr]
+
+[🔗](#lib:unordered_multiset,constructor)
+
+`constexpr unordered_multiset() : unordered_multiset(size_type(see below)) { }
+constexpr explicit unordered_multiset(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#L15404)
+
+*Effects*: Constructs an empty unordered_multiset 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#L15413)
+
+*Complexity*: Constant[.](#2.sentence-1)
+
+[🔗](#lib:unordered_multiset,constructor_)
+
+`template<class InputIterator>
+  constexpr unordered_multiset(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_multiset(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_multiset(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#L15437)
+
+*Effects*: Constructs an empty unordered_multiset 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#L15448)
+
+*Complexity*: Average case linear, worst case quadratic[.](#4.sentence-1)

cppdraft/unord/multiset/erasure.md

@@ -0,0 +1,22 @@
+[unord.multiset.erasure]
+
+# 23 Containers library [[containers]](./#containers)
+
+## 23.5 Unordered associative containers [[unord]](unord#multiset.erasure)
+
+### 23.5.7 Class template unordered_multiset [[unord.multiset]](unord.multiset#erasure)
+
+#### 23.5.7.3 Erasure [unord.multiset.erasure]
+
+[🔗](#lib:erase_if,unordered_multiset)
+
+`template<class K, class H, class P, class A, class Predicate>
+  constexpr typename unordered_multiset<K, H, P, A>::size_type
+    erase_if(unordered_multiset<K, H, P, A>& c, Predicate pred);
+`
+
+[1](#1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/containers.tex#L15463)
+
+*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();