[Python-Dev] decorate-sort-undecorate
Guido van Rossum
guido at python.org
Tue Oct 14 12:55:54 EDT 2003
More information about the Python-Dev mailing list
Tue Oct 14 12:55:54 EDT 2003
- Previous message: [Python-Dev] decorate-sort-undecorate
- Next message: [Python-Dev] decorate-sort-undecorate
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
> 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/)
- Previous message: [Python-Dev] decorate-sort-undecorate
- Next message: [Python-Dev] decorate-sort-undecorate
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Python-Dev mailing list