|
-
May 16th, 2015, 10:09 AM
#2
Re: How to get the address of 1st node in <list>
You could have a stack of type list<T>::iterator, then iterate the list and push them onto stack. Something like this (not tried)
Code:
list<LT> mylist;
stack<list<LT>::iterator> mystack;
for (list<LT>::iterator li = mylist.begin(); li != mylist.end(); ++li)
mystack.push(li);
Note that if you perform further operations on the list you need to be careful not to invalidate any of the iterators stored in the stack.
All advice is offered in good faith only. All my code is tested (unless stated explicitly otherwise) with the latest version of Microsoft Visual Studio (using the supported features of the latest standard) and is offered as examples only - not as production quality. I cannot offer advice regarding any other c/c++ compiler/IDE or incompatibilities with VS. You are ultimately responsible for the effects of your programs and the integrity of the machines they run on. Anything I post, code snippets, advice, etc is licensed as Public Domain https://creativecommons.org/publicdomain/zero/1.0/ and can be used without reference or acknowledgement. Also note that I only provide advice and guidance via the forums - and not via private messages!
C++23 Compiler: Microsoft VS2022 (17.6.5)
Tags for this Thread
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|