Shmuel (Seymour J.) Metz spamt...@library.lspace.org.invalid writes:
In m0rrtp@spenarnc.xs4all.nl, on 03/12/2012
at 11:27 AM, Albert van der Horst alb...@spenarnc.xs4all.nl said:
You're confused.
No, s/h/it is just an acephalic troll with delusions of adequacy.
Another way to
Hans Georg Schaathun h...@schaathun.net writes:
[Followup-To: header set to comp.lang.python.]
On 18 May 2011 09:16:26 -0700, Thomas A. Russ
t...@sevak.isi.edu wrote:
: Well, unless you have a tree with backpointers, you have to keep the
: entire parent chain of nodes visited.
Hans Georg Schaathun h...@schaathun.net writes:
[Followup-To: header set to comp.lang.python.]
On Wed, 18 May 2011 20:20:01 +0200, Raymond Wiker
raw@RAWMBP-2.local wrote:
: I don't think anybody mentioned *binary* trees. The context was
: directory traversal, in which case you would
Hans Georg Schaathun h...@schaathun.net writes:
[Followup-To: header set to comp.lang.python.]
On Wed, 18 May 2011 21:09:15 +0200, Raymond Wiker
raw@RAWMBP-2.local wrote:
: In the sense that the tree itself is a stack, yes. But if we
: consider the tree (or one of its branches
Roedy Green see_webs...@mindprod.com.invalid writes:
On Fri, 5 Jun 2009 18:15:00 + (UTC), Kaz Kylheku
kkylh...@gmail.com 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
Richard Riley rileyrg...@gmail.com writes:
Tamas K Papp tkp...@gmail.com 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
