RetroSearch Browse

Tue Oct 14 12:55:54 EDT 2003 · https://mail.python.org/pipermail/python-dev/2003-October/038705.html

> Why not use a special tuple type for the DSU algorithm that ignores its 
> last element when doing a comparison? It eliminates the problem of 
> creating a zillion int objects, and <speculation>it would be easy to 
> implement.</speculation>

If we're going to do a custom object, it should be a fixed-length
struct containing (1) the key, (2) a C int of sufficient size to hold
the record index; (3) a pointer to the record, and its comparison
should only use (1) and (2).

--Guido van Rossum (home page: http://www.python.org/~guido/)

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

Showing content from https://mail.python.org/pipermail/python-dev/2003-October/038705.html below:

[Python-Dev] decorate-sort-undecorate