K
Kevin
Hi,
How can I enumerate a linked list while being hable to delete any number of
elements while enumerating ?
I was using:
struct st {
...
struct st *prev;
struct st *next;
} ;
struct st *fst; // First element of the linked list
for(struct st *cst = fst, *nst; cst != NULL; cst = nst)
{
nst = cst->next;
....
delete any number of element anywhere...
....
}
This works fine in every case but one, when nst (the next element) is
deleted ...
That's why I'm deseperately looking for a safe way to enumerate the linked
list while being able to remove any element while doing it...
I'm stuck on this for while, Thanks for any help !
How can I enumerate a linked list while being hable to delete any number of
elements while enumerating ?
I was using:
struct st {
...
struct st *prev;
struct st *next;
} ;
struct st *fst; // First element of the linked list
for(struct st *cst = fst, *nst; cst != NULL; cst = nst)
{
nst = cst->next;
....
delete any number of element anywhere...
....
}
This works fine in every case but one, when nst (the next element) is
deleted ...
That's why I'm deseperately looking for a safe way to enumerate the linked
list while being able to remove any element while doing it...
I'm stuck on this for while, Thanks for any help !