Message198657
| Author | pitrou |
|---|
| Recipients | pitrou, serhiy.storchaka, vstinner |
|---|
| Date | 2013-09-29.21:51:14 |
|---|
| SpamBayes Score | -1.0 |
|---|
| Marked as misclassified | Yes |
|---|
| Message-id | <1380491472.2489.7.camel@fsol> |
|---|
| In-reply-to | <1380491383.51.0.329282138305.issue19087@psf.upfronthosting.co.za> |
|---|
| Content |
|---|
> Deleting a slice at the front of a bytearray have linear complexity> from the size of a bytearray (in any case del b[:1] is a little faster> than b[:1] = b''). I doubt than any performance critical code do it> instead of increasing an index in constant time.Increasing an index requires that you compact the bytearray from time totime, lest it fills the whole memory. |
|