template<typename InputIt>
constexpr void assign(InputIt first, InputIt last) noexcept(/* see below */);           (1)
constexpr void assign(size_type n, T const& value) noexcept(/* see below */);           (2)
constexpr void assign(std::initilializer_list<T> list) noexcept(/* see below */);       (3)

Replaces the content of the container.
    (1) Copy each element in the range [first, last) to the container
    (2) Replaces the content with n copies of value
    (3) Replaces the content with those in the list

(none)

noexcept specification: noexcept(is_nothrow_constructible_v<decltype(*std::declval<InputIt>)>) for (1)
noexcept(is_nothrow_copy_constructible_v<T>) for (2-3)

    (1) Linear in distance between first and last
    (2) Linear in n
    (3) Linear in list.size()

#include <haz/SharedQueue.hpp>
#include <iostream>

int main() {
    haz::SharedQueue<int, 10> queue{ 0, 1, 2 };

    std::cout << "Contents:\n";
    for(auto i : queue) {
        std::cout << i << ", ";
    }
    std::cout << '\n';

    queue.assign(5, 1337);

    std::cout << "Contents:\n";
    for(auto i : queue) {
        std::cout << i << ", ";
    }
    std::cout << '\n';
}

Output:

Contents:
0, 1, 2,
Contents:
1337, 1337, 1337, 1337, 1337,