Shmuel (Seymour J.) Metz writes:
> In , on 03/12/2012
>at 11:27 AM, Albert van der Horst said:
>
>>You're confused.
>
> No, s/h/it is just an acephalic troll with delusions of adequacy.
Another way to put it is to say that Xah is a legend in his
own mind.
--
http://mail.python.or
Hans Georg Schaathun writes:
> ["Followup-To:" header set to comp.lang.python.]
> On Wed, 18 May 2011 21:09:15 +0200, Raymond Wiker
>wrote:
> : > In the sense that the tree itself is a stack, yes. But if we
> : > consider the tree (or one of its branches
Hans Georg Schaathun writes:
> ["Followup-To:" header set to comp.lang.python.]
> On Wed, 18 May 2011 20:20:01 +0200, Raymond Wiker
>wrote:
> : I don't think anybody mentioned *binary* trees. The context was
> : directory traversal, in which cas
Hans Georg Schaathun writes:
> ["Followup-To:" header set to comp.lang.python.]
> On 18 May 2011 09:16:26 -0700, Thomas A. Russ
>wrote:
> : Well, unless you have a tree with backpointers, you have to keep the
> : entire parent chain of nodes visited. Otherwise, you won't be able to
> : fi
Roedy Green writes:
> On Fri, 5 Jun 2009 18:15:00 + (UTC), Kaz Kylheku
> wrote, quoted or indirectly quoted someone who
> said :
>
>>Even for problems where it appears trivial, there can be hidden
>>issues, like false cache coherency communication where no actual
>>sharing is taking place. O
Richard Riley writes:
> Tamas K Papp writes:
>
>> On Thu, 01 Jan 2009 23:28:08 +0100, Richard Riley wrote:
>>
>>> posts controversial but always interesting. His ELisp tutorial is far
>>> and away better than anything else out there for the programmer moving
>>> to Elisp IMO. He backs up his poi
