serializing heap memory.

[CoDE++]

I want to create memory dynamically on heap but somehow want to keep
the pointers to the heap memory allocated in the contiguous stack
memory so as to traverse heap memory in an ordered fashion by
traversing stack memory and accessing the pointers stored there. Can
his be be done somehow? A small piece of code will be of a great help.

 

[Salt_Peter]

I want to create memory dynamically on heap but somehow want to keep
the pointers to the heap memory allocated in the contiguous stack
memory so as to traverse heap memory in an ordered fashion by
traversing stack memory and accessing the pointers stored there. Can
his be be done somehow? A small piece of code will be of a great help.

It can be done in so many ways that one would require a book to cover
basic details and various options available. Assuming some user type A
you could perhaps consider a std::vector<A*> since contiguous memory
was specified as a requirement.

Typically, a stack is a LIFO (Last in first Out) container. The idea
is that one pops and pushes elements from one end only. Stacks aren't
meant to be -traversed- as you might do with a primitive array.

You may want to consider a std::deque if you need a stack with 2 ends
but organized in blocks or in the case -ordered fashion- means some
specific sequenced arrangement, a sequenced container like a std::set
might do (or std::multiset if the allocations are organized by
priorities).