Reference for Python (version 3)

Here you can browse Queues and Stacks for Python (version 3).

Spot something incorrect? You can open an issue or use the "Want to add or correct" link at the bottom of each column.

 

Creating and Destroying Simple Queues

Concept

Python's Implementation

Concept

Import statement to add simple queue

Python (version 3)

from queue import Queue

Concept

Queue data type name

Python (version 3)

queue.Queue

Concept

Create a queue

Python (version 3)

queue = Queue()

Concept

Create a queue from existing queue

Python (version 3)

new_queue = queue

Concept

Create a queue from a list of items

Python (version 3)

Not implemented in this language

Concept

Destroy/delete a queue

Python (version 3)

del(queue)

Concept

Data structure that backs the simple queue

Python (version 3)

linear data structure
 

Creating and Destroying Circular Queues

Concept

Python's Implementation

Concept

Import statement to add circular queue

Python (version 3)

Not implemented in this language

Concept

Queue data type name

Python (version 3)

Not implemented in this language

Concept

Create a queue

Python (version 3)

Not implemented in this language

Concept

Create a queue from existing queue

Python (version 3)

Not implemented in this language

Concept

Create a queue from a list of items

Python (version 3)

Not implemented in this language

Concept

Destroy/delete a queue

Python (version 3)

Not implemented in this language

Concept

Data structure that backs the simple queue

Python (version 3)

Not implemented in this language

 

Creating and Destroying Priority Queues

Concept

Python's Implementation

Concept

Import statement to add priority queue

Python (version 3)

from queue import PriorityQueue

Concept

Queue data type name

Python (version 3)

queue.PriorityQueue

Concept

Create a queue

Python (version 3)

queue = PriorityQueue()

Concept

Create a queue from existing queue

Python (version 3)

new_queue = queue

Concept

Create a queue from a list of items

Python (version 3)

Not implemented in this language

Concept

Destroy/delete a queue

Python (version 3)

del(queue)

Concept

Data structure that backs the simple queue

Python (version 3)

heap data structure
 

Creating and Destroying Double Ended Queues

Concept

Python's Implementation

Concept

Import statement to add double-ended queue

Python (version 3)

from collections import deque

Concept

Queue data type name

Python (version 3)

collections.deque

Concept

Create a queue

Python (version 3)

queue = deque(['One','Two','Three'])

Concept

Create a queue from existing queue

Python (version 3)

new_queue = queue

Concept

Create a queue from a list

Python (version 3)

mylist = ['One','Two','Three']
queue = deque(mylist)

Concept

Destroy/delete a queue

Python (version 3)

del(queue)

Concept

Data structure that backs the simple queue

Python (version 3)

linear data structure
 

Creating and Destroying Stacks

Concept

Python's Implementation

Concept

Import statement to add stacks

Python (version 3)

from queue import LifoQueue

Concept

Stack data type name

Python (version 3)

queue.LifoQueue

Concept

Create a stack

Python (version 3)

stack = LifoQueue()

Concept

Create a stack from existing stack

Python (version 3)

new_stack = stack

Concept

Create a stack from a list

Python (version 3)

Not implemented in this language

Concept

Destroy/delete a stack

Python (version 3)

del(stack)

Concept

Data structure that backs the simple queue

Python (version 3)

linear data structure
 

Queue Operations

Concept

Python's Implementation

Concept

Enqueue an item (add to end)

Python (version 3)

deque.append('Four')
queue.put('Four')
lifoqueue.put('Four')
simplequeue.put('Four')

Concept

Enqueue a high priority item (add to end of priority queue)

Python (version 3)

Not implemented in this language

Concept

Enqueue items from a list into queue (add list to end)

Python (version 3)

queue + mylist

Concept

Enqueue priority items from a list (add list to end of priority queue)

Python (version 3)

Not implemented in this language

Concept

Dequeue an item (remove from front, return item)

Python (version 3)

print(dequeue.pop())
print(queue.get())
print(lifoqueue.get())
print(simplequeue.get())

Concept

Dequeue an item (remove from front, don't return)

Python (version 3)

queue.pop()
queue.get()
lifoqueue.get()
simplequeue.get()

Concept

Look/peek at next available element (from front)

Python (version 3)

print(queue[-1])

Concept

Look/peek at last element (from back)

Python (version 3)

print(queue[0])

Concept

Duplicate next item

Python (version 3)

queue.append(queue[-1])

Concept

Swap two items

Python (version 3)

Not implemented in this language

Concept

Get size (number of items) in the queue

Python (version 3)

print(len(queue))

Concept

Check capacity of queue

Python (version 3)

Not implemented in this language

Concept

Export a list of all queue items

Python (version 3)

mylist = queue

Concept

Clear out all queue items

Python (version 3)

dequeue.clear()
Note
Queues, SimpleQueues, and LifoQueues don't have a clear function.
 

Stack Operations

Concept

Python's Implementation

Concept

Push an item (add to top)

Python (version 3)

stack.append('Four')

Concept

Pop an item (remove from top, return item)

Python (version 3)

print(stack.pop())

Concept

Pop an item (remove from top, don't return)

Python (version 3)

stack.pop()

Concept

Look/peek at next element (from top)

Python (version 3)

print(stack[-1])

Concept

Look/peek at last element (from bottom)

Python (version 3)

print(stack[0])

Concept

Duplicate top item

Python (version 3)

stack.append(stack[-1])

Concept

Swap two items

Python (version 3)

Not implemented in this language

Concept

Get size (number of items) on the stack

Python (version 3)

print(len(stack))

Concept

Check capacity of stack

Python (version 3)

Not implemented in this language

Concept

Export a list of all stack items

Python (version 3)

mylist = stack

Concept

Clear all stack items

Python (version 3)

stack.clear()
 

Iterating

Concept

Python's Implementation

Concept

Data type of a iterator pointer

Python (version 3)

Not implemented in this language

Concept

Create iterator

Python (version 3)

Not implemented in this language

Concept

Move pointer to next item

Python (version 3)

Not implemented in this language

Concept

Move pointer to previous item

Python (version 3)

Not implemented in this language

Concept

Move pointer to beginning of queue/stack

Python (version 3)

Not implemented in this language

Concept

Move pointer to end of queue/stack

Python (version 3)

Not implemented in this language

 
 
Want to add or correct information for Python?
or get the complete template. queues_stacks.json