Re: Trees

From	Marko Rauhamaa <marko@pacujo.net>
Newsgroups	comp.lang.python
Subject	Re: Trees
Date	2015-01-20 22:25 +0200
Organization	A noiseless patient Spider
Message-ID	<87a91di4ht.fsf@elektro.pacujo.net> (permalink)
References	<CAG=hEY1L-39EmuWpdEh_n-BNfs=qG9nL=MrMT0ar72yGBrkoUA@mail.gmail.com> <mailman.17865.1421708518.18130.python-list@python.org> <87k30ihvvx.fsf@elektro.pacujo.net> <87fvb5bb84.fsf@jester.gateway.sonic.net>

Show all headers | View raw

Paul Rubin <no.email@nospam.invalid>:

> Marko Rauhamaa <marko@pacujo.net> writes:
>> So in my Python software (both at work and at home) needs, I use a
>> Python AVL tree implementation of my own. My use case is timers. (GvR
>> uses heapq for the purpose.)
>
> Have you benchmarked your version against heapq or even the builtin
> sorting functions?

Yes, I did (as I mentioned in an earlier posting). For the use case I
was interested in (timers in a busy server), heapq beefed with the
"garbage collection" trick came out about the same as my AVL tree
(native module).

Marko

Back to comp.lang.python | Previous | Next — Previous in thread | Find similar | Unroll thread

Thread

Re: Trees Mark Lawrence <breamoreboy@yahoo.co.uk> - 2015-01-19 23:01 +0000
  Re: Trees Marko Rauhamaa <marko@pacujo.net> - 2015-01-20 07:19 +0200
    Re: Trees Mark Lawrence <breamoreboy@yahoo.co.uk> - 2015-01-20 14:21 +0000
    Re: Trees Paul Rubin <no.email@nospam.invalid> - 2015-01-20 09:42 -0800
      Re: Trees Marko Rauhamaa <marko@pacujo.net> - 2015-01-20 22:25 +0200

csiph-web