Why is b.pop(0) over 200 times slower than del b[0] for bytearray?

Subscribers:
4,130
Published on ● Video Link: https://www.youtube.com/watch?v=rHiugmILAEQ



Duration: 3:54
5 views
0


Why is b.pop(0) over 200 times slower than del b[0] for bytearray?
I hope you found a solution that worked for you :)
The Content (except music & images) is licensed under (https://meta.stackexchange.com/help/licensing)CC BY-SA |
Thanks to all those great people for their contributions!

(stackoverflow.com/users/12671057/kelly-bundy)Kelly Bundy |
(stackoverflow.com/users/189205/interjay)interjay |
(stackoverflow.com/users/6221024/dillon-davis)Dillon Davis |
(stackoverflow.com/users/21150270/nibedan)Nibedan |
A special thanks goes out to the (https://stackoverflow.com/questions/75354384/why-is-b-pop0-over-200-times-slower-than-del-b0-for-bytearray)Stackexchange community |

I wish you all a wonderful day! Stay safe :)

python python-internals cpython arrays performance







Tags:
python
python-internals
cpython
arrays
performance