this post was submitted on 04 Oct 2023
12 points (100.0% liked)

Python

6339 readers
5 users here now

Welcome to the Python community on the programming.dev Lemmy instance!

πŸ“… Events

PastNovember 2023

October 2023

July 2023

August 2023

September 2023

🐍 Python project:
πŸ’“ Python Community:
✨ Python Ecosystem:
🌌 Fediverse
Communities
Projects
Feeds

founded 1 year ago
MODERATORS
jnovinger@programming.dev
erlingur@programming.dev
norambna@programming.dev
12
Clearing The Deque (exploring Python's deque data structure through a picture story) (thepythoncodingstack.substack.com)
submitted 1 year ago by learnbyexample@programming.dev to c/python@programming.dev
3 comments fedilink hide all child comments
you are viewing a single comment's thread
view the rest of the comments
[–] fr0g@feddit.de -1 points 1 year ago (2 children)

When you need a doubly-linked list in Python, you can use the deque data structure, which is in the collections module

When do I need a doubly-linked list in Python? Whenever I have something where I can often expect to interact with the first and last element of it? Always, because it's more efficient than shifting the entire list around? Something else entirely?

[–] wosat@lemmy.world 4 points 1 year ago

You can use a deque as a stack (First In, Last Out) or as a queue (First In, First Out). Lists are especially inefficient when adding/removing from the beginning of the list, but, for deques, it's a O(1) operation.