Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #106277
| From | Vito De Tullio <vito.detullio@gmail.com> |
|---|---|
| Newsgroups | comp.lang.python |
| Subject | Re: Drowning in a teacup? |
| Date | 2016-04-02 08:26 +0200 |
| Message-ID | <mailman.358.1459578409.28225.python-list@python.org> (permalink) |
| References | <ndmlj2$pb0$1@gioia.aioe.org> <ndnm9v$j07$1@ger.gmane.org> <CAGgTfkO4HuzoRBgrGJ3ccqcD+VB4_7O-g19NUk9FaYSBpQ2HkA@mail.gmail.com> |
Michael Selik wrote:
>> > I need to scan a list of strings. If one of the elements matches the
>> > beginning of a search keyword, that element needs to snap to the front
>> > of the list.
>>
>> I know this post regards the function passing, but, on you specific
>> problem,
>> can't you just ... sort the list with a custom key?
>
> If the number of matches is small relative to the size of the list, I'd
> expect the sort would be slower than most of the other suggestions.
umm... I take the liberty to set up a little test
$ cat test_sort_prefix.py
#!/usr/bin/env python3
from sys import argv
from timeit import timeit
def sort_in_place(l):
def key(e):
return not e.startswith('yes')
l.sort(key=key)
def original_solution(mylist):
for i in range(len(mylist)):
if(mylist[i].startswith('yes')):
mylist[:] = [mylist[i]] + mylist[:i] + mylist[i+1:]
def main():
if argv[1] == 'sort_in_place':
f = sort_in_place
elif argv[1] == 'original_solution':
f = original_solution
else:
raise Exception()
nomatches = int(argv[2])
matches = int(argv[3])
l = ["no_" for _ in range(nomatches)] + ["yes_" for _ in
range(matches)]
print(timeit("f(l)", number=100, globals={"f": f, "l": l}))
if __name__ == '__main__':
main()
$ ./test_sort_prefix.py sort_in_place 1000000 3
33.260575089996564
$ ./test_sort_prefix.py original_solution 1000000 3
35.93009542999789
$
in my tests there is no sensible difference between the two solutions... and
the number of matches is risible :)
--
By ZeD
Back to comp.lang.python | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Drowning in a teacup? Fillmore <fillmore_remove@hotmail.com> - 2016-04-01 16:27 -0400
Re: Drowning in a teacup? Rob Gaddi <rgaddi@highlandtechnology.invalid> - 2016-04-01 20:39 +0000
Re: Drowning in a teacup? Ian Kelly <ian.g.kelly@gmail.com> - 2016-04-01 14:52 -0600
Re: Drowning in a teacup? MRAB <python@mrabarnett.plus.com> - 2016-04-01 21:45 +0100
Re: Drowning in a teacup? Michael Selik <michael.selik@gmail.com> - 2016-04-01 20:46 +0000
Re: Drowning in a teacup? Steven D'Aprano <steve@pearwood.info> - 2016-04-02 09:46 +1100
Re: Drowning in a teacup? Fillmore <fillmore_remove@hotmail.com> - 2016-04-02 00:03 -0400
Re: Drowning in a teacup? Vito De Tullio <vito.detullio@gmail.com> - 2016-04-02 07:45 +0200
Re: Drowning in a teacup? Michael Selik <michael.selik@gmail.com> - 2016-04-02 05:51 +0000
Re: Drowning in a teacup? Vito De Tullio <vito.detullio@gmail.com> - 2016-04-02 08:26 +0200
Re: Drowning in a teacup? Peter Otten <__peter__@web.de> - 2016-04-02 12:31 +0200
Re: Drowning in a teacup? Mark Lawrence <breamoreboy@yahoo.co.uk> - 2016-04-02 12:53 +0100
Re: Drowning in a teacup? Michael Selik <michael.selik@gmail.com> - 2016-04-02 14:36 +0000
Re: Drowning in a teacup? Ned Batchelder <ned@nedbatchelder.com> - 2016-04-02 12:28 -0700
Re: Drowning in a teacup? Random832 <random832@fastmail.com> - 2016-04-02 15:54 -0400
Re: Drowning in a teacup? Steven D'Aprano <steve@pearwood.info> - 2016-04-03 12:33 +1000
Re: Drowning in a teacup? Ethan Furman <ethan@stoneleaf.us> - 2016-04-02 16:15 -0700
Re: Drowning in a teacup? Random832 <random832@fastmail.com> - 2016-04-02 19:19 -0400
csiph-web