Message189121
Actually, in a program that dynamically creates a class, and then deletes it, you would expect a O(1) complexity. adding children at the end, and searching from the end, is a way to achieve this.
While I admit that I oversaw the exact requirement for __bases__, I think that allowing for a "None" to be sufficient when the class is being deleted is an important improvement. I realize that the therotetical worst case is O(n), but the practical common case is still O(1) |
|
Date |
User |
Action |
Args |
2013-05-13 10:33:19 | kristjan.jonsson | set | recipients:
+ kristjan.jonsson, pitrou, vstinner |
2013-05-13 10:33:19 | kristjan.jonsson | set | messageid: <1368441199.48.0.668113987475.issue17936@psf.upfronthosting.co.za> |
2013-05-13 10:33:19 | kristjan.jonsson | link | issue17936 messages |
2013-05-13 10:33:19 | kristjan.jonsson | create | |
|