I need to use Map and queue to do a project. I wonder if I can include those things from C++ and still have no problem to get it to work?
Do you have some examples to show?
I’d be interested to see if you can pull this off. There is very limited RAM (128K) available on the heap. Dynamic data structures like maps and queues will certainly compile, as you have the full g++ feature set at your disposal. minus a few things like exceptions. But I wonder how robust the memory management is to fragmentation considering how tight a space it has to work. Which Map and Queue implementation do you wish to use? Like Boost’s? Are you going to roll your own?
1 Like