Hi,
how can I access the nth element in a std::list?? Or should I use a
deque/queue instead?
Thank you,
--
-Gernot
int main(int argc, char** argv) {printf
("%silto%c%cf%cgl%ssic%ccom%c", "ma", 58, 'g', 64, "ba", 46, 10);}
________________________________________
Looking for a good game? Do it yourself!
GLBasic - you can do www.GLBasic.com 3 51554
Hi,
You cannot access list element by index. If you want to do it you have to
use vector or deque. You can only access list elements via iterators, or by
front() and back() members.
Cheers,
Marcin
Użytkownik "Gernot Frisch" <Me@Privacy.net> napisał w wiadomo¶ci
news:2m************@uni-berlin.de... Hi,
how can I access the nth element in a std::list?? Or should I use a deque/queue instead?
Thank you, -- -Gernot int main(int argc, char** argv) {printf ("%silto%c%cf%cgl%ssic%ccom%c", "ma", 58, 'g', 64, "ba", 46, 10);}
________________________________________ Looking for a good game? Do it yourself! GLBasic - you can do www.GLBasic.com
"Gernot Frisch" <Me@Privacy.net> wrote in message
news:2m************@uni-berlin.de... Hi,
how can I access the nth element in a std::list?? Or should I use a deque/queue instead?
You can't do it efficiently.
#include <iterator>
list<int> x;
....
list<int>::iterator i = x.begin();
std::advance(i, n);
// now i points to the nth member of the list (counting from zero)
Wrap this up in a function and you'll get the same functionality as the MFC
classes you are porting. I would imagine that MFC was doing something
equally inefficient behind the scenes.
john
> You can't do it efficiently.
Yes, I know. #include <iterator>
list<int> x; ... list<int>::iterator i = x.begin(); std::advance(i, n); // now i points to the nth member of the list (counting from zero)
Ah. "std::advance", that was what I was looking for. I need to use
list, so the pointers to my elements stay after insertion of new
elements, thus I can't use vector. I don't care about speed, since I
only have one function where I have to find an element at given index,
and it's not a very important one.
Thank you very much,
Gernot This thread has been closed and replies have been disabled. Please start a new discussion. Similar topics
by: scooter |
last post by:
std::list::clear() can slow down the performance of a method
considerably if it is called many times a second. I have countered
this problem a little by assigning a fixed size to a list when...
|
by: Kyle Teague |
last post by:
I have a list of pointers to structs as a private member of a class.
If I call begin() in the same function as I added the data then no
access violation occurs. However, if I try to call begin() in...
|
by: Dave |
last post by:
Hello all,
After perusing the Standard, I believe it is true to say that once you
insert an element into a std::list<>, its location in memory never changes.
This makes a std::list<> ideal for...
|
by: JustSomeGuy |
last post by:
Can you access elements of the std::list like they were an array?
eg.
std::list<int> xlist;
int y;
....
y = xlist; // Returns the 10th element of a list.
|
by: velthuijsen |
last post by:
I tried taking a list and pass it through std::sort like the following:
sort(Unsorted.begin(), Unsorted.end());
I got an error back stating that the list iterator doesn't have a
binary...
|
by: Eric Lilja |
last post by:
Hello, consider this complete program (sorry, it's not minimal but I hope
it's readable at least):
#include <algorithm>
#include <iostream>
#include <vector>
class Row
{
public:
|
by: Josh Mcfarlane |
last post by:
Just out of curiosity:
When would using std::list be more efficient / effective than using
other containers such as vector, deque, etc?
As far as I'm aware, list doesn't appear to be...
|
by: desktop |
last post by:
If I have a sorted std::list with 1.000.000 elements it takes 1.000.000
operations to find element with value = 1.000.000 (need to iterator
through the whole list).
In comparison, if I have a...
|
by: TBass |
last post by:
So I have a class:
class Client
{
unsigned int ClientID;
....
};
class MyListenSocket
|
by: taylorcarr |
last post by:
A Canon printer is a smart device known for being advanced, efficient, and reliable. It is designed for home, office, and hybrid workspace use and can also be used for a variety of purposes. However,...
|
by: aa123db |
last post by:
Variable and constants
Use var or let for variables and const fror constants.
Var foo ='bar';
Let foo ='bar';const baz ='bar';
Functions
function $name$ ($parameters$) {
}
...
|
by: ryjfgjl |
last post by:
If we have dozens or hundreds of excel to import into the database, if we use the excel import function provided by database editors such as navicat, it will be extremely tedious and time-consuming...
|
by: BarryA |
last post by:
What are the essential steps and strategies outlined in the Data Structures and Algorithms (DSA) roadmap for aspiring data scientists? How can individuals effectively utilize this roadmap to progress...
|
by: nemocccc |
last post by:
hello, everyone, I want to develop a software for my android phone for daily needs, any suggestions?
|
by: Hystou |
last post by:
There are some requirements for setting up RAID:
1. The motherboard and BIOS support RAID configuration.
2. The motherboard has 2 or more available SATA protocol SSD/HDD slots (including MSATA, M.2...
|
by: Hystou |
last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can...
|
by: Oralloy |
last post by:
Hello folks,
I am unable to find appropriate documentation on the type promotion of bit-fields when using the generalised comparison operator "<=>".
The problem is that using the GNU compilers,...
|
by: jinu1996 |
last post by:
In today's digital age, having a compelling online presence is paramount for businesses aiming to thrive in a competitive landscape. At the heart of this digital strategy lies an intricately woven...
| |