source: doc/theses/mike_brooks_MMath/programs/lst-issues-wrapped-emplaced.run.cpp@ 566cc33

#include <cstdio>

#if defined INTERPOSED_LIST_NS
using namespace INTERPOSED_LIST_NS;
#else
#include <list>
using namespace std;
#endif

int main() {









// C++

struct req {
        int pri, rqr;
};




list<req> reqs;






reqs.emplace_front(
        2, 42);
reqs.emplace_front(
        1, 42);














for (auto const& cur : reqs)
        printf("{%d %d} ", cur.pri, cur.rqr);
printf("\n");

}