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.
| Author | habnabit |
|---|---|
| Recipients | habnabit, jcea, pitrou |
| Date | 2008年07月02日.20:43:52 |
| SpamBayes Score | 0.0 |
| Marked as misclassified | No |
| Message-id | <1215031433.43.0.601447838555.issue3119@psf.upfronthosting.co.za> |
| In-reply-to |
| Content | |
|---|---|
Ah, I didn't know that a list would be as fast for appending and popping. I knew that lists were optimized for .append() and .pop(), but I didn't know that a list would be just as fast as a deque if it was just used as a stack. And I'll be happy to write unit tests if it can be pointed out to me how exactly they can be written. Should it just test to make sure pickling a deeply nested object hierarchy can be pickled without raising a RuntimeError? I tried to make this as transparent as possible of a change. |
|
| History | |||
|---|---|---|---|
| Date | User | Action | Args |
| 2008年07月08日 09:07:43 | georg.brandl | set | spambayes_score: 0.129371 -> 0.0 |
| 2008年07月02日 20:43:53 | habnabit | set | spambayes_score: 0.129371 -> 0.129371 recipients: + habnabit, jcea, pitrou |
| 2008年07月02日 20:43:53 | habnabit | set | spambayes_score: 0.129371 -> 0.129371 messageid: <1215031433.43.0.601447838555.issue3119@psf.upfronthosting.co.za> |
| 2008年07月02日 20:43:52 | habnabit | link | issue3119 messages |
| 2008年07月02日 20:43:52 | habnabit | create | |