➜

This issue tracker has been migrated to GitHub, and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.

classification
Title: merging sorted sequences
Type: Stage:
Components: Library (Lib) Versions: Python 2.3
process
Status: closed Resolution: rejected
Dependencies: Superseder:
Assigned To: Nosy List: gvanrossum, s_keim
Priority: normal Keywords: patch

Created on 2002-04-15 11:42 by s_keim, last changed 2022-04-10 16:05 by admin. This issue is now closed.

Files
File name Uploaded Description Edit
bisect.dif s_keim, 2002-04-15 11:42 patch for code, test and doc
Messages (3)
msg39596 - (view) Author: Sebastien Keim (s_keim) Date: 2002-04-15 11:42 
This patch is intended to add to the bisect module a function witch permit to merge several sorted sequences into an ordered list.
msg39597 - (view) Author: Guido van Rossum (gvanrossum) * (Python committer) Date: 2002-07-27 22:23 
Logged In: YES 
user_id=6380

Thanks.

This doesn't strike me as a "fundamental" algorithm like
bisection or heap sort. I don't think I've ever needed this,
except perhaps in situations where the amount of data was
small enough that simply concatenating the lists and sorting
them was an acceptable 3-line solution.

Therefore I'm rejecting this unless you get someone of
importance to plead for it.
msg39598 - (view) Author: Sebastien Keim (s_keim) Date: 2002-07-30 12:31 
Logged In: YES 
user_id=498191

I must agree that it's not something that is needed everyday, I will put it in the Cookbook.
History
Date User Action Args
2022-04-10 16:05:13adminsetgithub: 36435
2002-04-15 11:42:34s_keimcreate