Can you add a unittest for find() on an empty container? I sense problems....

is rotate the right thing to do? It affects all other entries and might send the "previously most recently used" entry all the way to the back of the list, no?

Shouldn't this be a remove-and-prepend?

remove it = since the value isn't used?

I don't see any :) can you elaborate? when it's empty, mNumEntries == 0 and then begin == end?

rotate is a remove-and-prepend, no?

see the test for QCOMPARE(contents(), expected); in both loops, this checks that it does the right thing, no?

OK. I thought calling rbegin() on an empty container was invalid, but I was wrong.

https://en.cppreference.com/w/cpp/algorithm/rotate

 // simple rotation to the left
std::rotate(v.begin(), v.begin() + 1, v.end());

(value before):       0 1 2 2 3 4 5 7 7 10 
simple rotate left : 1 2 2 3 4 5 7 7 10 0