A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from http://mail.python.org/pipermail/python-dev/2003-January/032259.html below:

[Python-Dev] very slow compare of recursive objects

[Python-Dev] very slow compare of recursive objects [Python-Dev] very slow compare of recursive objectsTim Peters tim.one@comcast.net
Mon, 20 Jan 2003 10:57:06 -0500
[Tim]
> That's an example of a tuple *containing* a recursive
> structure; there's still no way, starting at t, to get back to t.

[Barry]
> Except, of course, at the C level.

I'm unclear on your meaning.  In the specific example, you couldn't get from
t to t period.

> Do we care about that?

It may depend on what you really meant <wink>.  If you're talking about
creating recursive tuples via mutation in C, where tuples are the only
container type involved, then 2.2.2 and 2.1.3 are broken now (they may blow
the stack while comparing such beasts).




RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4