22 for (
auto it =
l.begin(); it !=
l.end(); ++it) {
28 return l.push_back(data);
32 if (
l.end()->prior ==
nullptr)
return false;
33 data = *(
l.end()->prior);
37 bool dequeue(T &data) {
return l.pop_front(data); }
39 size_t size() {
return l.size(); }