Double-ended queues, or deques, can be useful when you need to remove elements in the order : Deque : Collections PYTHON TUTORIALS

Ajax
Ajax Examples Ajax Tutorials Scripts and Programs
Javascript
Javascript Examples Tutorials DHTML Tutorials Javascript References Scripts and Programs
HTML
HTML Tutorials HTML References HTML DOM 0 References HTML DOM 2 References
CSS
CSS Tutorials CSS References
PHP
PHP Source Code PHP References Scripts and Programs
C#
C# Source Code C# Examples

PYTHON TUTORIALS » Collections » Deque »

Double-ended queues, or deques, can be useful when you need to remove elements in the order


from collections import deque
q = deque(range(5))
q.append(5)
q.appendleft(6)
print q
print q.pop()
print q.popleft()
print q.rotate(3)
print q
print q.rotate(-1)
print q

Related Scripts with Example Source Code in same category :

Working with the deque Class

PYTHON TUTORIALS

Collections
» Deque

Deque
Your Dictionary
Queue
Your List
Set
Your Set
Stack
Your Tree

Buildin Function

Buildin Module

CGI Web

Class

Collections

Data Type

Database

Dictionary

File

Function

Introduction

List

Network

Operator

Regular Expressions

Statement

String

Thread

Tkinker

Tuple

Windows

WxPython

XML

Double-ended queues, or deques, can be useful when you need to remove elements in the order : Deque : Collections PYTHON TUTORIALS

PYTHON TUTORIALS » Collections » Deque »

Double-ended queues, or deques, can be useful when you need to remove elements in the order

Leave a Comment / Note

PYTHON TUTORIALS