Tutorial: Update 5.1.2. Using Lists as Queues to include appendleft()
#125138
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Apologies if the formatting for this pull request isn't correct. In the description for 5.1.2. Using Lists as Queues, within the Data Structures section of the tutorial, the fact that appending and popping to the left of lists is inefficient is mentioned, and that one should instead use the deque object which was designed to have fast appends and pops from both ends. But then in the example code we only have an example for how to remove elements from the left of the list and not add them. It's relatively straightforward that the method is appendleft(), but on first read I assumed that there was no implementation for this in the deque object as I didn't see it in the examples and it seemed to make intuitive sense that one shouldn't add elements to the start of queue.
|
All commit authors signed the Contributor License Agreement. |
bedevere-app
bot
added
docs
AdityaKrishnaProjects
changed the title
AdityaKrishnaProjects
changed the title
StanFromIreland
changed the title
appendleft()
| 'John' | ||
| >>> queue # Remaining queue in order of arrival | ||
| deque(['Michael', 'Terry', 'Graham']) | ||
| >>> queue.appendleft("John") # John is added to front of queue |
Member
There was a problem hiding this comment.
Suggested change
| >>> queue.appendleft("John") # John is added to front of queue | |
| >>> queue.appendleft("John") # John never actually left, add him back |
The comments describe a situation where people are coming/going.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Apologies if the formatting for this pull request isn't correct (I couldn't find a valid issue to use for the issue number reference in title, and am not sure how to apply the skip-issue label).
In the description for 5.1.2. Using Lists as Queues, within the Data Structures section of the tutorial, the fact that appending and popping to the left of lists is inefficient is mentioned, and that one should instead use the deque object which was designed to have fast appends and pops from both ends.
But then in the example code we only have an example for how to remove elements from the left of the list and not add them. It's relatively straightforward that the method is appendleft(), but on first read I assumed that there was no implementation for this in the deque object as I didn't see it in the examples and it seemed to make intuitive sense that one shouldn't add elements to the start of queue.
📚 Documentation preview 📚: https://cpython-previews--125138.org.readthedocs.build/en/125138/tutorial/datastructures.html#using-lists-as-queues