```
template<class K> pair<iterator, bool> insert(K&& x);
template<class K> iterator insert(const_iterator hint, K&& x);
```

```
template<class InputIterator>
void insert(InputIterator first, InputIterator last);
```

Then,
sorts the range of newly inserted elements with respect to *compare*;
merges the resulting sorted range and
the sorted range of pre-existing elements into a single sorted range; and
finally erases all but the first element
from each group of consecutive equivalent elements.

```
template<class InputIterator>
void insert(sorted_unique_t, InputIterator first, InputIterator last);
```

`template<`*container-compatible-range*<value_type> R>
void insert_range(R&& rg);

Then,
sorts the range of newly inserted elements with respect to *compare*;
merges the resulting sorted range and
the sorted range of pre-existing elements into a single sorted range; and
finally erases all but the first element
from each group of consecutive equivalent elements.

```
void swap(flat_set& y) noexcept;
```

```
container_type extract() &&;
```

```
void replace(container_type&& cont);
```