|   |
Multi-paradigm
|
|   |
1990
|
|   |
Guido Van Rossum
|
|   |
Python Software Foundation
|
|   |
243
|
|   |
March 29 , 2006
|
|   |
Strong, dynamic ( "duck" )
|
|   |
CPython, Jython , IronPython , PyPy
|
|   |
ABC , Modula-3 , Perl , Lisp , Smalltalk , Tcl
|
|   |
Ruby , Boo
|
|   |
Cross-platform
|
|   |
Python Software Foundation License
|
|   |
wwwpythonorg
|
|
is an Interpreted Programming Language created by Guido Van Rossum in 1990 . Python is fully Dynamically Typed and uses Automatic Memory Management ; it is thus similar to Perl , Ruby , Scheme , Smalltalk , and Tcl . Python is developed as an Open Source project, managed by the non-profit Python Software Foundation . Python 2.4.3 was released on March 29 , 2006 .
Python is a . Python is Dynamically Type-checked and uses Garbage Collection for Memory Management . An important feature of Python is dynamic Name Resolution , which binds method and variable names during program execution.
While offering choice in coding methodology, Python's designers reject exuberant syntax, such as in Perl, in favor of a sparser, less cluttered one. As with Perl, Python's developers expressly promote a particular "culture" or ideology based on what they want the language to be, favoring language forms they see as "beautiful", "explicit" and "simple". For the most part, Perl and Python users differ in their interpretation of these terms and how they are best implemented (see TIMTOWTDI and PythonPhilosophy ).
Another important goal of the Python developers is making Python fun to use. This is reflected in the origin of the name (after the television series '' Monty Python's Flying Circus ''), in the common practice of using Monty Python references in example code, and in an occasionally playful approach to tutorials and reference materials. For example, the Metasyntactic Variable s often used in Python literature are ''spam'' And ''eggs'' , instead of the traditional ''foo'' And ''bar'' .
Python is sometimes referred to as a " Scripting Language ". In practice, it is used as a Dynamic Programming Language for both application development and occasional scripting. Python has been used to develop many large software projects such as the Zope application server and the Mnet and BitTorrent file sharing systems. It is also extensively used by Google . {Link without Title}
Another important goal of the language is ease of extensibility. New built-in modules are easily written in C or C++ . Python can also be used as an extension language for existing modules and applications that need a programmable interface.
Though the design of Python is somewhat hostile to Functional Programming and the Lisp tradition, there are significant parallels between the philosophy of Python and that of minimalist Lisp-family languages such as Scheme .
Many past Lisp programmers have found Python appealing for this reason.
Python was created in the early 1990s by Guido Van Rossum at CWI in the Netherlands as a successor of the ABC Programming Language . van Rossum is Python's principal author, and his continuing central role in deciding the direction of Python is jokingly acknowledged by referring to him as its Benevolent Dictator For Life (BDFL).
The last version released from CWI was Python 1.2. In 1995, Guido continued his work on Python at the Corporation For National Research Initiatives (CNRI) in Reston, Virginia where he released several versions of the software. Python 1.6 was the last of the versions released by CNRI. In 2000, Guido and the Python core development team moved to BeOpen.com to form the BeOpen PythonLabs team. Python 2.0 was the first and only release from BeOpen.com.
Python had always been available under a Free Software License , but the license was incompatible with the GNU General Public License (GPL). Following the release of Python 1.6, and after Guido van Rossum left CNRI to work with commercial software developers, it became clear that the ability to use Python with software available under the GPL was very desirable. CNRI and the Free Software Foundation (FSF) interacted to develop enabling wording changes to the Python license which would make Python's license GPL-compatible. That year, Guido was awarded the FSF Award For The Advancement Of Free Software .
Python 1.6.1 is essentially the same as Python 1.6, with a few minor bug fixes, and with the new GPL-compatible license. Python 2.1 also includes this new license and is a derivative work of Python 1.6.1, as well as of Python 2.0. Current versions of the license are called the Python Software Foundation License .
After Python 2.0 was released by BeOpen.com, Guido van Rossum and the other PythonLabs developers joined Digital Creations. All intellectual property added from this point on, starting with Python
2.1 and its alpha and beta releases, is owned by the Python Software Foundation (PSF), a non-profit organization modeled after the Apache Software Foundation .
Python developers have an ongoing discussion of a future "Python 3000" that will break backwards compatibility with the 2.x series in order to repair perceived flaws in the language. The guiding principle is to "reduce feature duplication by removing old ways of doing things". There is no definite schedule for Python 3000, but a PEP (Python Enhancement Proposal) that details planned changes exists. {Link without Title}
Among other changes, Python 3000 plans to:
- move ''map'', ''filter'' and ''reduce'' out of the built-in namespace (the rationale being that ''map'' and ''filter'' are expressed more clearly as List Comprehension s, and ''reduce'' more clearly as an accumulation loop)
- add support for optional type declarations
- unify the
str/unicode types, and introduce a separate mutable bytes type
- convert built-ins to returning iterators (instead of lists), where appropriate
- remove backwards-compatibily features like classic classes, classic division, string exceptions, implicit relative imports
See Also: Python software
The Python programming language is actively used in industry and academia for a wide variety of purposes.
Python was designed to be a highly readable language. It aims toward an uncluttered visual layout, uses English keywords frequently where other languages use punctuation, and has notably fewer syntactic constructions than many structured languages such as C, Perl, or Pascal.
For instance, Python has only two structured loop forms:
#for ''name'' in ''iterable'':, which loops over the contents of a list (or other iterable sequence)
#while ''condition'':, which loops as long as a boolean expression is true.
It thus forgoes the more complex, C-style for (''initialize''; ''condition''; ''increment'') syntax (common in many popular languages)
And it does not have any of the common alternative loop syntaxes such as do...while, repeat until, etc. though of course equivalents can be expressed. Likewise, it has only if...elif...else for branching -- no switch or labeled goto (goto was implemented as a joke for 1 April 2004 , in an add-on module).
One unusual aspect of Python's syntax is its use of Whitespace to delimit program blocks (the Off-side Rule ). Sometimes termed "the whitespace thing", it is one aspect of Python syntax that many programmers otherwise unfamiliar with Python have heard of, since it is nearly unique among currently widespread languages.
In so-called "free-format" languages, that use the block structure ultimately derived from ALGOL , blocks of code are set off with braces ({ }) or keywords. In all these languages, however, programmers conventionally indent the code within a block, to set it off visually from the surrounding code.
Python, instead, borrows a feature from its predecessor ABC — instead of punctuation or keywords, it uses this indentation itself to indicate the run of a block. A brief example will make this clear.
Here are C and Python Recursive Function s which do the same thing—computing the Factorial of an integer:
''Factorial function in C :''
int factorial(int x)
{
if (x == 0) {
return 1;
}
else {
}
''Factorial function in Python:''
def factorial(x):
if x == 0:
return 1
else:
Some programmers used to ALGOL -style languages, in which whitespace is semantically empty, find this confusing or even offensive.
A few have drawn an unflattering comparison to the column-oriented style used on punched-card Fortran systems. When ALGOL was new, it was a major development to have "free-form" languages in which only symbols mattered and not their position on the line.
To Python programmers, however, "the whitespace thing" is simply the enforcement of a convention that programmers in ALGOL-style languages already follow anyway. They also point out that the free-form syntax has the disadvantage that, since indentation is ignored, good indentation cannot be enforced. Thus, incorrectly indented code may be misleading, since a human reader and a compiler could interpret it differently. Here is an example:
''Misleading indentation in C:''
for (i = 0; i < 20; ++i)
a();
b();
c();
This code is intended to call functions a(), b(), and c() 20 times—and at first glance, that's what it appears to do. However, the interpreted code block is just {a();}. The code calls a() 20 times, and then calls b() and c() one time each. This sort of mistake can be very hard to spot when reading code. In Python, if the indentation looks correct, it is correct.
The whitespace thing has minor disadvantages. Both space characters and tab characters are currently accepted as forms of indentation. Since they are not visually distinguishable (in many tools), mixing spaces and tabs can create bugs that take specific efforts to find (a perennial suggestion among Python users has been removing tabs as block markers—except, of course, among those Python users who propound removing spaces instead).
Because whitespace is syntactically significant, it is not always possible for a program to automatically correct the indentation on Python code as can be done with C or Lisp code. Moreover, formatting routines which remove whitespace—for instance, many Internet Forum s—can completely destroy the syntax of a Python program, whereas a program in a bracketed language would merely become more difficult to read.
Since Python is a Dynamically Typed language, Python ''values,'' not variables, carry type. This has implications for many aspects of the way the language functions.
All variables in Python hold references to objects, and these references are passed to functions by value; a function cannot change the value a variable references in its calling function. Some people (including Guido van Rossum himself) have called this parameter-passing scheme "Call by object reference."
Among dynamically typed languages, Python is moderately type-checked. Implicit conversion is defined for numeric types, so one may validly multiply a complex number by a long integer (for instance) without explicit casting. However, there is no implicit conversion between (e.g.) numbers and strings; a string is an invalid argument to a mathematical function expecting a number.
Python has a broad range of basic data types. Alongside conventional integer and floating point arithmetic, it transparently supports Arbitrary-precision Arithmetic and Complex Number s.
Python supports a panoply of string operations. Strings in Python are Immutable , so a string operation such as a substitution of characters, that in other programming languages might alter a string in place, returns a new string in Python. Performance considerations sometimes push for using special techniques in programs that modify strings intensively, such as joining character arrays into strings only as needed.
One of the very useful aspects of Python is the concept of ''collection'' (or ''container'') types. In general a collection is an object that contains other objects in a way that is easily referenced or ''indexed''. Collections come in two basic forms: ''sequences'' and ''mappings''.
The ordered sequential types are lists (dynamic Arrays ), Tuple s, and strings. All sequences are indexed positionally (0 through ''length'' − 1) and all but strings can contain any type of object, including multiple types in the same sequence. Both strings and tuples are immutable, making them perfect candidates for dictionary keys (see below). Lists, on the other hand, are mutable; elements can be inserted, deleted, modified, appended, or sorted In-place .
On the other side of the collections coin are mappings, which are unordered types implemented in the form of ''dictionaries'' which "map" a set of Immutable keys, to corresponding elements much like a mathematical function. The keys in a dictionary must be of an immutable Python type such as an integer or a string.
For example, one could define a dictionary having a string "toast" mapped to the integer 42 or vice versa. This is done under the covers via a Hash Function which makes for faster lookup times, but is also the culprit for a dictionary's lack of order and is the reason mutable objects (i.e. other dictionaries or lists) cannot be used as keys.
Dictionaries are also central to the internals of the language as they reside at the core of all Python objects and classes: the mapping between variable names (strings) and the values which the names reference is stored as a dictionary (see Object System ). Since these dictionaries are directly accessible (via an object's __dict__ attribute), Meta-programming is a straightforward and natural process in Python.
A Set collection type was added to the core language in version 2.4. A set is an unindexed, unordered collection that contains no duplicates, and implements Set Theoretic operations such as Union , Intersection , Difference , Symmetric Difference , and Subset testing. There are two types of sets: set and frozenset, the only difference being that set is mutable and frozenset is immutable. Elements in a set must be hashable and immutable. Thus, for example, a frozenset can be an element of a regular set whereas the opposite is not true.
Python also provides extensive collection manipulating abilities such as built in containment checking and a generic iteration protocol.
In Python, everything is an object, even classes. Classes, as objects, have a class, which is known as their metaclass. Python also supports ).
The language supports extensive Introspection of types and classes. Types can be read and compared— types are instances of type. The attributes of an object can be extracted as a dictionary.
Operators can be overloaded in Python by defining special member functions—for instance, defining __add__ on a class permits one to use the + operator on members of that class.
The basic comparison operators such as ==, <, >=, and so forth, are used on all manner of values. Numbers, strings, sequences, and mappings can all be compared. Although disparate types (such as a str and a int) are defined to have a consistent relative ordering, this is considered a historical design quirk, and will no longer be allowed in Python 3000.
Chained comparison expressions such as a < b < c have roughly the meaning that they have in mathematics, rather than the unusual meaning found in C and similar languages. The terms are evaluated and compared in order. The operation has Short-circuit semantics, meaning that evaluation is guaranteed to stop as soon as a verdict is clear: if a < b is false, c is never evaluated as the expression cannot possibly be true anymore.
For expressions without side effects, a < b < c is equivalent to a < b and b < c. However, there is a substantial difference when the expressions have side effects. a < f(x) < b will evaluate f(x) exactly once, whereas a < f(x) and f(x) < b will evaluate it once if the value of a is less than f(x) and twice otherwise.
Python 2.2 and earlier does not have an explicit boolean type. In all versions of Python, boolean operators treat zero values or empty values such as "", 0, None, 0.0, {Link without Title} , and {} as false, while in general treating non-empty, non-zero values as true. In Python 2.2.1 the boolean constants True and False were added to the language (subclassed from 1 and 0). The binary comparison operators such as == and > return either True or False.
The boolean operators and and or use Minimal Evaluation . For example, y == 0 or x/y > 100 will never raise a divide-by-zero exception. For backward compatibility, these operators return the value of the last operand evaluated. Thus the expression (4 and 5) evaluates to 5, and (4 or 5) evaluates to 4.
As mentioned above, another strength of Python is the availability of a Functional Programming style. As may be expected, this makes working with lists and other collections much more straightforward. One such construction is the List Comprehension , as seen here in calculating the first five powers of two:
numbers = 2, 3, 4, 5
- ---n" class="copylinks" target="_blank">for n in numbers
The Quicksort algorithm can be expressed elegantly using list comprehensions:
def qsort(L):
if L == return [
pivot = L {Link without Title}
return qsort( for x in L[1: if x < pivot]) + [pivot] + \
qsort( for y in L[1: if y >= pivot])
Although execution of this naïve form of Quicksort is less space-efficient than forms which alter the sequence in-place, it is often cited as an example of the expressive power of list comprehensions.
In Python, functions are First-class objects that can be created and passed around dynamically.
Python's lambda construct can be used to create anonymous functions within expressions. Lambdas are however limited to containing expressions; statements can only be used in named functions created with the def statement. (However, any type of control flow can in principle be implemented within lambda expressions {Link without Title} by short-circuiting the and and or operators.)
Python has had support for Lexical Closures since version 2.2. Python's syntax, though, sometimes leads programmers of other languages to think that closures are not supported. Since names are bound locally, the trick to creating a closure is using a mutable container within enclosing scope. Many Python tutorials explain this usage, but it is an atypical style in Python programs.
Introduced in Python 2.2 as an optional feature and finalized in version 2.3, Generators are Python's mechanism for Lazy Evaluation of a function that would otherwise return a space-prohibitive or computationally intensive list.
This is an example to lazily generate the prime numbers:
from itertools import count
def generate_primes(stop_at=None):
primes = {Link without Title}
for n in count(2):
if stop_at is not None and n > stop_at:
return
composite = False
for p in primes:
if not n % p:
composite = True
break
if not composite:
primes.append(n)
yield n
To use this function simply call, e.g.:
for i in generate_primes(): # iterate over ALL primes
if i > 100: break
print i
The definition of a generator appears identical to that of a function, except the keyword yield is used in place of return. However, a generator is an object with persistent state, which can repeatedly enter and leave the same scope. A generator call can then be used in place of a list, or other structure whose elements will be iterated over. Whenever the for loop in the example requires the next item, the generator is called, and yields the next item.
Generators don't have to be infinite like the prime-number example above. When a generator terminates, an internal exception is raised which indicates to any calling context that there are no more values. A for loop or other iteration will then terminate.
Introduced in Python 2.4, generator expressions are the lazy evaluation equivalent of list comprehensions. Using the prime number generator provided in the above section, we might define a lazy, but not quite infinite collection.
from itertools import islice
first_million_primes = (i for i in generate_primes() if i < 1000000)
two_thousandth_prime = list(islice(first_million_primes,2001)) {Link without Title}
Most of the memory and time needed to generate this many primes will not be used until the needed element is actually accessed. Unfortunately, you cannot perform simple indexing and slicing of generators, but must use the ''itertools'' modules or "roll your own" loops. In contrast, a list comprehension is functionally equivalent, but is ''greedy'' in performing all the work:
first_million_primes = for i in generate_primes(2000000) if i < 1000000
two_thousandth_prime = first_million_primes {Link without Title}
The list comprehension will immediately create a large list (with 78498 items, in the example, but transiently creating a list of primes under two million), even if most elements are never accessed. The generator comprehension is more parsimonious.
Python supports most object oriented programming techniques. It allows Polymorphism , not only within a Class Hierarchy but also by Duck Typing . Any object can be used for any type, and it will work so long as it has the proper methods and attributes. And everything in Python is an object, including classes, functions, numbers and modules. Python also has support for Metaclass es, an advanced tool for enhancing classes' functionality. Naturally, Inheritance , including Multiple Inheritance , is supported. It has limited support for private variables using Name Mangling . See the "Classes" section of the tutorial for details.
Many Python users don't feel the need for private variables, though.
The slogan "We're all consenting adults here" is used to describe this attitude.
Some consider Information Hiding to be Unpythonic , in that it suggests that the class in question contains unaesthetic or ill-planned internals.
From the tutorial: ''As is true for modules, classes in Python do not put an absolute barrier between definition and user, but rather rely on the politeness of the user not to "break into the definition."''
OOP doctrines such as the use of accessor methods to read data members are not enforced in Python. Just as Python offers functional-programming constructs but does not attempt to demand Referential Transparency , it offers (and extensively uses!) its object system but does not demand OOP behavior. Moreover, it is always possible to redefine the class using ''properties'' so that when a certain variable is set or retrieved in calling code, it really invokes a function call, so that spam.eggs = toast might really invoke spam.set_eggs(toast). This nullifies the practical advantage of accessor functions, and it remains OOP because the property 'x' becomes a legitimate part of the object's interface: it need not reflect an implementation detail.
In version 2.2 of Python, "new-style" classes were introduced. With new-style classes, objects and types were unified, allowing the subclassing of types.
Even entirely new types can be defined, complete with custom behavior for infix operators. This allows for many radical things to be done syntactically within Python. A new method resolution order for Multiple Inheritance was also adopted with Python 2.3. It is also possible to run custom code while accessing or setting attributes, though the details of those techniques have evolved between Python versions.
Python supports (and extensively uses) Exception Handling as a means of testing for error conditions and other "exceptional" events in a program. Indeed, it is even possible to trap the exception caused by a Syntax Error .
Python style calls for the use of exceptions whenever an error condition might arise. Indeed, rather than testing for access to a file or resource before actually using it, it is conventional in Python to just go ahead and try to use it, catching the exception if access is rejected.
Exceptions can also be used as a more general means of non-local transfer of control, even when an error is not at issue. For instance, the Mailman mailing list software, written in Python, uses exceptions to jump out of deeply-nested message-handling logic when a decision has been made to reject a message or hold it for moderator approval.
Exceptions are often, especially in Threaded situations, used as an alternative to the if-block. A commonly-invoked motto is EAFP, or "It is Easier to Ask for Forgiveness than to ask for Permission." In this first code sample, there is an explicit check for the attribute (i.e., "asks permission"):
if hasattr(spam, 'eggs'):
baz = spam.eggs
else:
handle_error()
This second sample follows the EAFP paradigm:
try:
baz = spam.eggs
except AttributeError:
handle_error()
These two code samples have the same effect, although there will be performance differences. When spam has the attribute eggs, the EAFP sample will run faster. When spam does not have the attribute eggs (the "exceptional" case), the EAFP sample will run significantly slower. The Python programmer usually writes for code readability first, then uses Python's code profiling tools for Performance Analysis to determine if further Optimization is required. In most cases, the EAFP paradigm results in faster and more readable code.
Python has two ways to annotate Python code. One is by using comments to indicate what some part of the code does.
def getline():
return sys.stdin.readline() # Get one line and return it
Comments begin with the hash character ("#") and are terminated by the end of line. Python does not support comments that span more than one line. The other way is to use Docstring s (documentation string), that is a string that is located alone without assignment as the first line within a module, class, method or function. Such strings can be delimited with " or ' for single line strings, or may span multiple lines if delimited with either """ or ''' which is Python's notation for specifying multi-line strings. However, the style guide for the language specifies that triple double quotes (""") are preferred for both single and multi-line docstrings.
Single line docstring:
def getline():
"""Get one line from stdin and return it."""
return sys.stdin.readline()
Multi-line docstring:
def getline():
"""Get one line
from stdin
and return it."""
return sys.stdin.readline()
Docstrings can be as large as the programmer wants and contain Line Break s (if multi-line strings are used). In contrast with comments, docstrings are themselves Python objects and are part of the interpreted code that Python runs. That means that a running program can retrieve its own docstrings and manipulate that information. But the normal usage is to give other programmers information about how to invoke the object being documented in the docstring.
There are tools available that can extract the docstrings to generate an API documentation from the code. Docstring documentation can also be accessed from the interpreter with the help() function, or from the shell with the pydoc command.
The Doctest standard module uses interactions copied from Python shell sessions into docstrings, to create tests.
The standard Python interpreter also supports an ''interactive mode'' in which it acts as a kind of Shell : expressions can be entered one at a time, and the result of their evaluation is seen immediately. This is a boon for those learning the language and experienced developers alike: snippets of code can be tested in interactive mode before integrating them into a proper program.
Python also includes a Unit Testing framework for creating exhaustive test suites. While Static Typing aficionados see this as a replacement for a static type-checking system, Python programmers largely do not share this view.
Standard Python does not support -like functionality is planned, by extending Python's generators {Link without Title} .
Python has a large Standard Library , which makes it well suited to many tasks. This comes from a so-called "batteries included" philosophy for Python modules.
The modules of the standard library can be augmented with custom modules written in either C or Python. The standard library is particularly well tailored to writing Internet-facing applications, with a large number of standard formats and protocols (such as s are also included.
The standard library is one of Python's greatest strengths. The bulk of it is cross-platform compatible, meaning that even heavily leveraged Python programs can often run on Unix, Windows, Macintosh, and other platforms without change.
It is currently being debated whether or not third-party but open source Python modules such as Twisted , NumPy , or WxPython should be included in the standard library, in accordance with the batteries included philosophy.
The most popular (and therefore best maintained) platforms Python runs on are Linux , BSD , Mac OS X , Microsoft Windows . Separate implementations also exist for the Java (called Jython ) and for the .NET Framework or Mono (called IronPython ). Other supported platforms include:
Most of the third-party libraries for Python (and even some first-party ones) are only available on Windows, Linux, BSD, and Mac OS X.
Python was originally developed as a Scripting language for the Amoeba operating system capable of making System Call s; however, that version is no longer maintained.
A few Neologism s have come into common use within the Python community.
One of the most common is , which can have a wide range of meanings related to program style. To say that a piece of code is pythonic is to say that it uses Python idioms well; that it is natural or shows fluency in the language. Likewise, to say of an interface or language feature that it is pythonic is to say that it works well with Python idioms; that its use meshes well with the rest of the language.
In contrast, a mark of code is that it attempts to "write C++ (or Lisp, or Perl) code in Python"—that is, provides a rough transcription rather than an idiomatic translation of forms from another language.
The prefix ''Py-'' can be used to show that something is related to Python. Examples of the use of this prefix in names of Python applications or libraries include Pygame , a binding of SDL to Python (commonly used to create games), PyUI , a GUI encoded entirely in Python, and PySol, a series of solitaire card games programmed in Python.
Users and admirers of Python—most especially those considered knowledgeable or experienced—are often referred to as , '''Pythonistas''', and '''Pythoneers'''.
- ''Py'' , "The Python Online Technical Journal".
|