source: doc/theses/mike_brooks_MMath/programs/lst-issues-wrapped-byref.run.cpp @ 76425bc

#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;


req r1 = {1, 42}, r2 = {2, 42};

reqs.push_front(&r2);
reqs.push_front(&r1);














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

}