From: John S. <sk...@us...> - 2005-05-28 19:24:51
|
On Sat, 2005-05-28 at 13:44 +0200, Christophe TROESTLER wrote: > On Sat, 28 May 2005, John Skaller <sk...@us...> wrote: > > > > The library supplies the maximally efficient and simplest > > representation by Occam's Razor, and that cannot be empty. > > So it all boils down to efficiency. Well my view is that a *base* library provides simple efficient things -- it is oriented to the computer NOT the user. >From these basic libraries, more abstract and more 'user friendly' interfaces can be implemented. > (Hereafter, Dllist' refers to this > library and Dllist to Extlib one. The Benchmark module is used.) That's kind of confusing .. :) What you have is the same node structure, but have added a 'head' element. The problem with doing that is that you can't so easily chop bits of the list up, or splice bits of a list together. For example, consider two lists A and B, and you join them to create a list C. What happens to A and B? With the current implementation as I understand it, there isn't an issue, A, B, and C are now all the one list. With your implementation the operation is impossible. Joining A to B is a destructive operation: A and B don't exist aftwards. Sorry I am not explaining this well. -- John Skaller, skaller at users.sf.net PO Box 401 Glebe, NSW 2037, Australia Ph:61-2-96600850 Download Felix here: http://felix.sf.net |