From: Stephen C. Gilardi (squeegee_at_[hidden])
Date: 2000-01-31 00:05:36
> > I think the test has to be "if (left == this && right == this)" or
> > something equivalent.
>If you're talking about the circular list implementation, then the
>simple test should suffice. If the list is unique, both left and right
>pointers point to this. If the list has two members, both left and
>right point to the other member, in this case, the leftmost element is
>the rightmost as well - so if the leftmost disappears, so does the
OK, I see it now. Thanks.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk