<br><br>
<div><span class="gmail_quote">On 9/18/08, <b class="gmail_sendername">Yoshiki Ohshima</b> <<a href="mailto:yoshiki@vpri.org">yoshiki@vpri.org</a>> wrote:</span>
<blockquote class="gmail_quote" style="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">At Thu, 18 Sep 2008 10:00:15 +0100,<br>Marcin Tustin wrote:<br>><br>> Would this be O(n^2) to remove all nils?<br>
<br>Not in a way it matters. OrderedCollection moves items not eagarly.</blockquote>
<div> </div>
<div>Do you mean that it will do a lazy delete?</div>
<div> </div><br>
<blockquote class="gmail_quote" style="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">> In any case, if this is a conveyor belt, then you should almost certainly be using a linke data structure, and iterate<br>
> over the structure to delete the unwanted links.<br><br>No in two reasons; 1) he wasn't talking about removing items in the<br>middle</blockquote>
<div> </div>
<div>Look at the original example.</div><br>
<blockquote class="gmail_quote" style="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid"> and 2) OrderedCollection is usually more efficient than the<br>naive LinkedList, as less dereferencing. (And, it could get more<br>
benefits from using array manipulation primitives like<br>replaceFrom:to:, but it can't at least for addFirst:.)</blockquote>
<div> </div>
<div>I think this would be an empirical question.</div>
<div> </div><br>
<blockquote class="gmail_quote" style="PADDING-LEFT: 1ex; MARGIN: 0px 0px 0px 0.8ex; BORDER-LEFT: #ccc 1px solid">-- Yoshiki<br>_______________________________________________<br>Beginners mailing list<br><a href="mailto:Beginners@lists.squeakfoundation.org">Beginners@lists.squeakfoundation.org</a><br>
<a href="http://lists.squeakfoundation.org/mailman/listinfo/beginners">http://lists.squeakfoundation.org/mailman/listinfo/beginners</a><br></blockquote></div><br>