Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.lang.python > #106737 > unrolled thread

Re: how to convert code that uses cmp to python3

Started byAntoon Pardon <antoon.pardon@rece.vub.ac.be>
First post2016-04-09 17:24 +0200
Last post2016-04-09 17:24 +0200
Articles 1 — 1 participant

Back to article view | Back to comp.lang.python

This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by below is the oldest one visible, not the original post.


Contents

  Re: how to convert code that uses cmp to python3 Antoon Pardon <antoon.pardon@rece.vub.ac.be> - 2016-04-09 17:24 +0200

#106737 — Re: how to convert code that uses cmp to python3

FromAntoon Pardon <antoon.pardon@rece.vub.ac.be>
Date2016-04-09 17:24 +0200
SubjectRe: how to convert code that uses cmp to python3
Message-ID<mailman.122.1460215489.2253.python-list@python.org>
Op 09-04-16 om 16:41 schreef Chris Angelico:

> 
> In this case, you're likely to end up with large branches of your tree
> that have the same prefix. (And if you don't, your iterations are all
> going to end early anyway, so the comparison is cheap.) A data
> structure that takes this into account will out-perform the naive
> comparison model every time. In fact, a simple dict will probably
> out-perform your tree;

So? I need a structure that can easily give me an answer to the
following: Given key1 and key2 what are the the keys between them
with their corresponding values. As long as a dict can't provide
me with that answer, it doesn't matter that it will out perform
lookups in my trees.

-- 
Antoon Pardon

[toc] | [standalone]


Back to top | Article view | comp.lang.python


csiph-web