void push_back(T const& value);     (1)
void push_back(T&& value);          (2)

Insert the element at the end of the container.
    (1) The new element is initialized as a copy of value
    (2) value is moved into the new element

All iterators past-the-end, end included, are invalidated. No reference are invalidated. If the container is full, i.e. size() == max_size() then the behaviour is undefined.

T must meet the requirements of CopyInsertable in order to use overload (1).
T must meet the requirements of MoveInsertable in order to use overload (2).

(none)

Constant.

If an exception is thrown, this function has no effect (strong exception guarantee).

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

int main() {
    haz::SharedQueue<std::string, 10> queue;
    
    queue.push_back("abc");
    
    std::string s = "def";
    queue.push_back(std::move(s));

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

Output:

Contents:
"abc"
"def"