Working on making a hash-table. Trying to figure out how to better optimize my table. Found this interesting code, and can not seem to find any C++ documentation explaining how the bottom two lines of this code operate, or why this works. Can someone please explain? Additionally, are there alternative ways to do this same thing and offer more readability?
class Table {
public:
explicit Table(const int s);
~Table();
Table(const Table&) = delete;
Table &operator = (const Table&) = delete;