As long as you don't need to search for the element to remove using its
value, removal in a linked list should be O(1). A linked list that does
not allow O(1) removal and O(1) insertion given a topological reference
is a failure (yes, that includes the current version of SList).
Well, thank god
On 11/2/2011 2:41 PM, Steven Schveighoffer wrote:
On Wed, 02 Nov 2011 09:17:39 -0400, Ary Manzana
wrote:
On 11/2/11 10:12 AM, Steven Schveighoffer wrote:
On Wed, 02 Nov 2011 08:40:19 -0400, Ary Manzana
wrote:
On 11/2/11 8:48 AM, Steven Schveighoffer wrote:
The basic response to this is,
On 10/30/2011 9:28 PM, Jonathan M Davis wrote:
On Sunday, October 30, 2011 20:53:02 Max Wolter wrote:
Hello there.
Thank you very much for the explanation.
However, while I really liked the concept of ranges in Andrei's book and
a lot of it seems intuitive and faster than using iterato
On 10/30/2011 6:45 PM, Jonathan M Davis wrote:
On Sunday, October 30, 2011 11:38:30 Max Wolter wrote:
Hello there.
I seem to be having problems wrapping my head around how to use the
ranges in the context of containers in phobos. Specifically, I can't
seem to figure out how to remo
Hello there.
I seem to be having problems wrapping my head around how to use the
ranges in the context of containers in phobos. Specifically, I can't
seem to figure out how to remove an element from a linked list.
foreach(cell; organism)
{
if(cell.x == x && cell.
