Assignment Pass


What is PASS?
The PostalOne! Assignment Support System (PASS) is a new program for existing and prospective PostalOne! partners and PostalOne! Transportation Assignment System vendors. The objective of the program is to maximize the benefits through standardization, process improvement, and quality control. PostalOne! partners who demonstrate through testing that their facilities or systems have attained the optimal operating conditions are awarded PASS Certification.
What are the benefits of PASS?
If you are a major First-Class Mail® business mailer, attaining certification means that you have optimized your use of the PostalOne! Transportation Assignment System and are enjoying the maximum return on your investment in equipment. It means that you have maximized the value-added work your employees perform and demonstrates the return on your investment in training. And it is a way to demonstrate to your customers that you are doing your best to find new ways to leverage technology and better serve them.

If you are a PostalOne! Transportation Assignment System manufacturer or vendor, certification assures your customers that your system has been tested and proven to meet all PostalOne! requirements and standards.

Whether you are a mailer or vendor, certification means you are maximizing your potential.

Major mailers participating in the PostalOne! program are required to obtain certification within three months of entering the program. Mailers who were in the program before March 2002 are also required to obtain certification. Certification of mailers is necessary to ensure that the scarce resources of the S-AMS system are utilized to their fullest potential to the benefit of the mailers, and is required under authority from the PostalOne! program office.
What types of PASS certification are offered?
The Postal Service™ offers two types of PASS Certification:

Mailer Certification is granted to PostalOne! participating plants which have met the certification standards. Certification applies to individual plants, rather than the entire company. Major changes in staff or equipment may require recertification.

Mailer Certification is achieved in phases. Phase 1 is pre-qualification; its purpose is to ensure that the mailer is qualified and capable of participating. Passing Phase 1 permits the mailer to install a PostalOne! Transportation Assignment System.

The mailer then enters Phase 2, post-installation testing. Passing Phase 2 indicates that the system has been installed, operates correctly and meets PostalOne! standards. Upon the successful conclusion of Phase 2 testing, the mailer has satisfied the requirements and is effectively utilizing the shipping system. The mailer is then awarded PASS Mailer Certification.

On an ongoing basis, the mailer is periodically recertified. In Phase 3 the mailer is tested to verify that they are continuing to use the system correctly, that the staff understands the PostalOne! program, and are able to use the transportation assignment system to its fullest potential. Upon passing Phase 3 testing, the facility's certification is renewed.
Certification Criteria
The overall objective of Mailer Certification is to ensure that the mailer's facility is in compliance with PostalOne! regulations and standards.

The Phase 1 Pre-Qualification Interview seeks to ensure that:

The Phase 2 Post-Installation Test seeks to ensure that:

the system has been installed properly,
the system is operating correctly,
the system is able to dial in and connect to the USPS® Transaction Concentrator,
the system is able to assign transportation correctly,
the mailer is adhering to the PostalOne! implementation guidelines,
the mailer is maintaining the system log consistently and accurately,
the mailer's staff are adequately trained,
the mailer has sufficient contingencies to handle system failures,
the mailer operates the equipment properly, and
the mailer maximizes its use of the PostalOne! Transportation Assignment System.

Phase 3 Post-Implementation Follow-up seeks to ensure that:

Applying for Certification
After you complete the Mailer Certification application form, you will be contacted by your local PostalOne! coordinator and an interview date will be arranged. If you are already a PostalOne! participant, you are automatically Phase 1 qualified. If you pass the Phase 1 interview, you may proceed with the installation of your PostalOne! system. After installation and at least one month of experience operating the system, you may schedule the Phase 2 installation test. Depending on the level of certification awarded, the mailer may opt to retake the test. After successful completion of the test, the mailer will be awarded PASS Mailer Certification. Phase 3 provides periodic ongoing certification to verify that the mailer is effectively and properly utilizing the PostalOne! Transportation Assignment System.
Certification Renewal
Certification automatically expires based on the results of your last certification test. Prior to the expiration date, you should submit an application for certification renewal along with your log book detailing maintenance, upgrades, and any other changes to the system or facility. The PostalOne! program office will review your application and documentation and decide the extent of retesting required and arrange a test date.
Recertification of your facility may be required if any of the following occur:

It is the responsibility of the mailer to maintain a system log and notify its national account manager or business center if any of these events occur. The PostalOne! program office will decide if recertification will be required and the extent of retesting necessary.
Mailer Certification Testing Version 1.0 (PDF)
Mailer Certification Testing Version 1.0 (RTF)

PASS Mailer Application Form (PDF)
PASS Mailer Application Form (RTF)

Download Adobe Reader

6. Simple statements¶

Simple statements are comprised within a single logical line. Several simple statements may occur on a single line separated by semicolons. The syntax for simple statements is:

simple_stmt ::= | | | | | | | | | | | | | |

6.1. Expression statements¶

Expression statements are used (mostly interactively) to compute and write a value, or (usually) to call a procedure (a function that returns no meaningful result; in Python, procedures return the value ). Other uses of expression statements are allowed and occasionally useful. The syntax for an expression statement is:

expression_stmt ::=

An expression statement evaluates the expression list (which may be a single expression).

In interactive mode, if the value is not , it is converted to a string using the built-in function and the resulting string is written to standard output (see section The print statement) on a line by itself. (Expression statements yielding are not written, so that procedure calls do not cause any output.)

6.2. Assignment statements¶

Assignment statements are used to (re)bind names to values and to modify attributes or items of mutable objects:

assignment_stmt ::= ( "=")+ ( | ) target_list ::= ("," )* [","] target ::= | "(" ")" | "[" [] "]" | | |

(See section Primaries for the syntax definitions for the last three symbols.)

An assignment statement evaluates the expression list (remember that this can be a single expression or a comma-separated list, the latter yielding a tuple) and assigns the single resulting object to each of the target lists, from left to right.

Assignment is defined recursively depending on the form of the target (list). When a target is part of a mutable object (an attribute reference, subscription or slicing), the mutable object must ultimately perform the assignment and decide about its validity, and may raise an exception if the assignment is unacceptable. The rules observed by various types and the exceptions raised are given with the definition of the object types (see section The standard type hierarchy).

Assignment of an object to a target list is recursively defined as follows.

  • If the target list is a single target: The object is assigned to that target.
  • If the target list is a comma-separated list of targets: The object must be an iterable with the same number of items as there are targets in the target list, and the items are assigned, from left to right, to the corresponding targets.

Assignment of an object to a single target is recursively defined as follows.

  • If the target is an identifier (name):

    • If the name does not occur in a statement in the current code block: the name is bound to the object in the current local namespace.
    • Otherwise: the name is bound to the object in the current global namespace.

    The name is rebound if it was already bound. This may cause the reference count for the object previously bound to the name to reach zero, causing the object to be deallocated and its destructor (if it has one) to be called.

  • If the target is a target list enclosed in parentheses or in square brackets: The object must be an iterable with the same number of items as there are targets in the target list, and its items are assigned, from left to right, to the corresponding targets.

  • If the target is an attribute reference: The primary expression in the reference is evaluated. It should yield an object with assignable attributes; if this is not the case, is raised. That object is then asked to assign the assigned object to the given attribute; if it cannot perform the assignment, it raises an exception (usually but not necessarily ).

    Note: If the object is a class instance and the attribute reference occurs on both sides of the assignment operator, the RHS expression, can access either an instance attribute or (if no instance attribute exists) a class attribute. The LHS target is always set as an instance attribute, creating it if necessary. Thus, the two occurrences of do not necessarily refer to the same attribute: if the RHS expression refers to a class attribute, the LHS creates a new instance attribute as the target of the assignment:

    This description does not necessarily apply to descriptor attributes, such as properties created with .

    classCls:x=3# class variableinst=Cls()inst.x=inst.x+1# writes inst.x as 4 leaving Cls.x as 3
  • If the target is a subscription: The primary expression in the reference is evaluated. It should yield either a mutable sequence object (such as a list) or a mapping object (such as a dictionary). Next, the subscript expression is evaluated.

    If the primary is a mutable sequence object (such as a list), the subscript must yield a plain integer. If it is negative, the sequence’s length is added to it. The resulting value must be a nonnegative integer less than the sequence’s length, and the sequence is asked to assign the assigned object to its item with that index. If the index is out of range, is raised (assignment to a subscripted sequence cannot add new items to a list).

    If the primary is a mapping object (such as a dictionary), the subscript must have a type compatible with the mapping’s key type, and the mapping is then asked to create a key/datum pair which maps the subscript to the assigned object. This can either replace an existing key/value pair with the same key value, or insert a new key/value pair (if no key with the same value existed).

  • If the target is a slicing: The primary expression in the reference is evaluated. It should yield a mutable sequence object (such as a list). The assigned object should be a sequence object of the same type. Next, the lower and upper bound expressions are evaluated, insofar they are present; defaults are zero and the sequence’s length. The bounds should evaluate to (small) integers. If either bound is negative, the sequence’s length is added to it. The resulting bounds are clipped to lie between zero and the sequence’s length, inclusive. Finally, the sequence object is asked to replace the slice with the items of the assigned sequence. The length of the slice may be different from the length of the assigned sequence, thus changing the length of the target sequence, if the object allows it.

CPython implementation detail: In the current implementation, the syntax for targets is taken to be the same as for expressions, and invalid syntax is rejected during the code generation phase, causing less detailed error messages.

WARNING: Although the definition of assignment implies that overlaps between the left-hand side and the right-hand side are ‘safe’ (for example swaps two variables), overlaps within the collection of assigned-to variables are not safe! For instance, the following program prints :

6.2.1. Augmented assignment statements¶

Augmented assignment is the combination, in a single statement, of a binary operation and an assignment statement:

augmented_assignment_stmt ::= ( | ) augtarget ::= | | | augop ::= "+=" | "-=" | "*=" | "/=" | "//=" | "%=" | "**=" | ">>=" | "<<=" | "&=" | "^=" | "|="

(See section Primaries for the syntax definitions for the last three symbols.)

An augmented assignment evaluates the target (which, unlike normal assignment statements, cannot be an unpacking) and the expression list, performs the binary operation specific to the type of assignment on the two operands, and assigns the result to the original target. The target is only evaluated once.

An augmented assignment expression like can be rewritten as to achieve a similar, but not exactly equal effect. In the augmented version, is only evaluated once. Also, when possible, the actual operation is performed in-place, meaning that rather than creating a new object and assigning that to the target, the old object is modified instead.

With the exception of assigning to tuples and multiple targets in a single statement, the assignment done by augmented assignment statements is handled the same way as normal assignments. Similarly, with the exception of the possible in-place behavior, the binary operation performed by augmented assignment is the same as the normal binary operations.

For targets which are attribute references, the same caveat about class and instance attributes applies as for regular assignments.


6.3. The statement¶

Assert statements are a convenient way to insert debugging assertions into a program:

assert_stmt ::= "assert" ["," ]

The simple form, , is equivalent to

The extended form, , is equivalent to

These equivalences assume that and refer to the built-in variables with those names. In the current implementation, the built-in variable is under normal circumstances, when optimization is requested (command line option -O). The current code generator emits no code for an assert statement when optimization is requested at compile time. Note that it is unnecessary to include the source code for the expression that failed in the error message; it will be displayed as part of the stack trace.

Assignments to are illegal. The value for the built-in variable is determined when the interpreter starts.


6.4. The statement¶

pass_stmt ::= "pass"

is a null operation — when it is executed, nothing happens. It is useful as a placeholder when a statement is required syntactically, but no code needs to be executed, for example:

deff(arg):pass# a function that does nothing (yet)classC:pass# a class with no methods (yet)

6.5. The statement¶

del_stmt ::= "del"

Deletion is recursively defined very similar to the way assignment is defined. Rather than spelling it out in full details, here are some hints.

Deletion of a target list recursively deletes each target, from left to right.

Deletion of a name removes the binding of that name from the local or global namespace, depending on whether the name occurs in a statement in the same code block. If the name is unbound, a exception will be raised.

It is illegal to delete a name from the local namespace if it occurs as a free variable in a nested block.

Deletion of attribute references, subscriptions and slicings is passed to the primary object involved; deletion of a slicing is in general equivalent to assignment of an empty slice of the right type (but even this is determined by the sliced object).

6.6. The statement¶

print_stmt ::= "print" ([ ("," )* [","]] | ">>" [("," )+ [","]])

evaluates each expression in turn and writes the resulting object to standard output (see below). If an object is not a string, it is first converted to a string using the rules for string conversions. The (resulting or original) string is then written. A space is written before each object is (converted and) written, unless the output system believes it is positioned at the beginning of a line. This is the case (1) when no characters have yet been written to standard output, (2) when the last character written to standard output is a whitespace character except , or (3) when the last write operation on standard output was not a statement. (In some cases it may be functional to write an empty string to standard output for this reason.)


Objects which act like file objects but which are not the built-in file objects often do not properly emulate this aspect of the file object’s behavior, so it is best not to rely on this.

A character is written at the end, unless the statement ends with a comma. This is the only action if the statement contains just the keyword .

Standard output is defined as the file object named in the built-in module . If no such object exists, or if it does not have a method, a exception is raised.

also has an extended form, defined by the second portion of the syntax described above. This form is sometimes referred to as “ chevron.” In this form, the first expression after the must evaluate to a “file-like” object, specifically an object that has a method as described above. With this extended form, the subsequent expressions are printed to this file object. If the first expression evaluates to , then is used as the file for output.

6.7. The statement¶

return_stmt ::= "return" []

may only occur syntactically nested in a function definition, not within a nested class definition.

If an expression list is present, it is evaluated, else is substituted.

leaves the current function call with the expression list (or ) as return value.

When passes control out of a statement with a clause, that clause is executed before really leaving the function.

In a generator function, the statement is not allowed to include an . In that context, a bare indicates that the generator is done and will cause to be raised.

6.8. The statement¶

yield_stmt ::=

The statement is only used when defining a generator function, and is only used in the body of the generator function. Using a statement in a function definition is sufficient to cause that definition to create a generator function instead of a normal function.

When a generator function is called, it returns an iterator known as a generator iterator, or more commonly, a generator. The body of the generator function is executed by calling the generator’s method repeatedly until it raises an exception.

When a statement is executed, the state of the generator is frozen and the value of is returned to ’s caller. By “frozen” we mean that all local state is retained, including the current bindings of local variables, the instruction pointer, and the internal evaluation stack: enough information is saved so that the next time is invoked, the function can proceed exactly as if the statement were just another external call.

As of Python version 2.5, the statement is now allowed in the clause of a … construct. If the generator is not resumed before it is finalized (by reaching a zero reference count or by being garbage collected), the generator-iterator’s method will be called, allowing any pending clauses to execute.

For full details of semantics, refer to the Yield expressions section.


In Python 2.2, the statement was only allowed when the feature has been enabled. This import statement was used to enable the feature:


See also

PEP 255 - Simple Generators
The proposal for adding generators and the statement to Python.
PEP 342 - Coroutines via Enhanced Generators
The proposal that, among other generator enhancements, proposed allowing to appear inside a … block.

6.9. The statement¶

raise_stmt ::= "raise" [ ["," ["," ]]]

If no expressions are present, re-raises the last exception that was active in the current scope. If no exception is active in the current scope, a exception is raised indicating that this is an error (if running under IDLE, a exception is raised instead).

Otherwise, evaluates the expressions to get three objects, using as the value of omitted expressions. The first two objects are used to determine the type and value of the exception.

If the first object is an instance, the type of the exception is the class of the instance, the instance itself is the value, and the second object must be .

If the first object is a class, it becomes the type of the exception. The second object is used to determine the exception value: If it is an instance of the class, the instance becomes the exception value. If the second object is a tuple, it is used as the argument list for the class constructor; if it is , an empty argument list is used, and any other object is treated as a single argument to the constructor. The instance so created by calling the constructor is used as the exception value.

If a third object is present and not , it must be a traceback object (see section The standard type hierarchy), and it is substituted instead of the current location as the place where the exception occurred. If the third object is present and not a traceback object or , a exception is raised. The three-expression form of is useful to re-raise an exception transparently in an except clause, but with no expressions should be preferred if the exception to be re-raised was the most recently active exception in the current scope.

Additional information on exceptions can be found in section Exceptions, and information about handling exceptions is in section The try statement.

6.10. The statement¶

break_stmt ::= "break"

may only occur syntactically nested in a or loop, but not nested in a function or class definition within that loop.

It terminates the nearest enclosing loop, skipping the optional clause if the loop has one.

If a loop is terminated by , the loop control target keeps its current value.

When passes control out of a statement with a clause, that clause is executed before really leaving the loop.

6.11. The statement¶

continue_stmt ::= "continue"

may only occur syntactically nested in a or loop, but not nested in a function or class definition or clause within that loop. It continues with the next cycle of the nearest enclosing loop.

When passes control out of a statement with a clause, that clause is executed before really starting the next loop cycle.

6.12. The statement¶

import_stmt ::= "import" ["as" ] ( "," ["as" ] )* | "from" "import" ["as" ] ( "," ["as" ] )* | "from" "import" "(" ["as" ] ( "," ["as" ] )* [","] ")" | "from" "import" "*" module ::= ( ".")* relative_module ::= "."* | "."+ name ::=

Import statements are executed in two steps: (1) find a module, and initialize it if necessary; (2) define a name or names in the local namespace (of the scope where the statement occurs). The statement comes in two forms differing on whether it uses the keyword. The first form (without ) repeats these steps for each identifier in the list. The form with performs step (1) once, and then performs step (2) repeatedly.

To understand how step (1) occurs, one must first understand how Python handles hierarchical naming of modules. To help organize modules and provide a hierarchy in naming, Python has a concept of packages. A package can contain other packages and modules while modules cannot contain other modules or packages. From a file system perspective, packages are directories and modules are files.

Once the name of the module is known (unless otherwise specified, the term “module” will refer to both packages and modules), searching for the module or package can begin. The first place checked is , the cache of all modules that have been imported previously. If the module is found there then it is used in step (2) of import.

If the module is not found in the cache, then is searched (the specification for can be found in PEP 302). The object is a list of finder objects which are queried in order as to whether they know how to load the module by calling their method with the name of the module. If the module happens to be contained within a package (as denoted by the existence of a dot in the name), then a second argument to is given as the value of the attribute from the parent package (everything up to the last dot in the name of the module being imported). If a finder can find the module it returns a loader (discussed later) or returns .

If none of the finders on are able to find the module then some implicitly defined finders are queried. Implementations of Python vary in what implicit meta path finders are defined. The one they all do define, though, is one that handles , , and .

The implicit finder searches for the requested module in the “paths” specified in one of two places (“paths” do not have to be file system paths). If the module being imported is supposed to be contained within a package then the second argument passed to , on the parent package, is used as the source of paths. If the module is not contained in a package then is used as the source of paths.

Once the source of paths is chosen it is iterated over to find a finder that can handle that path. The dict at caches finders for paths and is checked for a finder. If the path does not have a finder cached then is searched by calling each object in the list with a single argument of the path, returning a finder or raises . If a finder is returned then it is cached in and then used for that path entry. If no finder can be found but the path exists then a value of is stored in to signify that an implicit, file-based finder that handles modules stored as individual files should be used for that path. If the path does not exist then a finder which always returns is placed in the cache for the path.

If no finder can find the module then is raised. Otherwise some finder returned a loader whose method is called with the name of the module to load (see PEP 302 for the original definition of loaders). A loader has several responsibilities to perform on a module it loads. First, if the module already exists in (a possibility if the loader is called outside of the import machinery) then it is to use that module for initialization and not a new module. But if the module does not exist in then it is to be added to that dict before initialization begins. If an error occurs during loading of the module and it was added to it is to be removed from the dict. If an error occurs but the module was already in it is left in the dict.

The loader must set several attributes on the module. is to be set to the name of the module. is to be the “path” to the file unless the module is built-in (and thus listed in ) in which case the attribute is not set. If what is being imported is a package then is to be set to a list of paths to be searched when looking for modules and packages contained within the package being imported. is optional but should be set to the name of package that contains the module or package (the empty string is used for module not contained in a package). is also optional but should be set to the loader object that is loading the module.

If an error occurs during loading then the loader raises if some other exception is not already being propagated. Otherwise the loader returns the module that was loaded and initialized.

When step (1) finishes without raising an exception, step (2) can begin.

The first form of statement binds the module name in the local namespace to the module object, and then goes on to import the next identifier, if any. If the module name is followed by , the name following is used as the local name for the module.

The form does not bind the module name: it goes through the list of identifiers, looks each one of them up in the module found in step (1), and binds the name in the local namespace to the object thus found. As with the first form of , an alternate local name can be supplied by specifying “ localname”. If a name is not found, is raised. If the list of identifiers is replaced by a star (), all public names defined in the module are bound in the local namespace of the statement..

The public names defined by a module are determined by checking the module’s namespace for a variable named ; if defined, it must be a sequence of strings which are names defined or imported by that module. The names given in are all considered public and are required to exist. If is not defined, the set of public names includes all names found in the module’s namespace which do not begin with an underscore character (). should contain the entire public API. It is intended to avoid accidentally exporting items that are not part of the API (such as library modules which were imported and used within the module).

The form with may only occur in a module scope. If the wild card form of import — — is used in a function and the function contains or is a nested block with free variables, the compiler will raise a .

When specifying what module to import you do not have to specify the absolute name of the module. When a module or package is contained within another package it is possible to make a relative import within the same top package without having to mention the package name. By using leading dots in the specified module or package after you can specify how high to traverse up the current package hierarchy without specifying exact names. One leading dot means the current package where the module making the import exists. Two dots means up one package level. Three dots is up two levels, etc. So if you execute from a module in the package then you will end up importing . If you execute from within you will import . The specification for relative imports is contained within PEP 328.

is provided to support applications that determine which modules need to be loaded dynamically.

6.12.1. Future statements¶

A future statement is a directive to the compiler that a particular module should be compiled using syntax or semantics that will be available in a specified future release of Python. The future statement is intended to ease migration to future versions of Python that introduce incompatible changes to the language. It allows use of the new features on a per-module basis before the release in which the feature becomes standard.

future_statement ::= "from" "__future__" "import" feature ["as" name] ("," feature ["as" name])* | "from" "__future__" "import" "(" feature ["as" name] ("," feature ["as" name])* [","] ")" feature ::= identifier name ::= identifier

A future statement must appear near the top of the module. The only lines that can appear before a future statement are:

  • the module docstring (if any),
  • comments,
  • blank lines, and
  • other future statements.

The features recognized by Python 2.6 are , , , , , and . , , are redundant in Python version 2.6 and above because they are always enabled.

A future statement is recognized and treated specially at compile time: Changes to the semantics of core constructs are often implemented by generating different code. It may even be the case that a new feature introduces new incompatible syntax (such as a new reserved word), in which case the compiler may need to parse the module differently. Such decisions cannot be pushed off until runtime.

For any given release, the compiler knows which feature names have been defined, and raises a compile-time error if a future statement contains a feature not known to it.

The direct runtime semantics are the same as for any import statement: there is a standard module , described later, and it will be imported in the usual way at the time the future statement is executed.

The interesting runtime semantics depend on the specific feature enabled by the future statement.

Note that there is nothing special about the statement:

That is not a future statement; it’s an ordinary import statement with no special semantics or syntax restrictions.

Code compiled by an statement or calls to the built-in functions and that occur in a module containing a future statement will, by default, use the new syntax or semantics associated with the future statement. This can, starting with Python 2.2 be controlled by optional arguments to — see the documentation of that function for details.

A future statement typed at an interactive interpreter prompt will take effect for the rest of the interpreter session. If an interpreter is started with the option, is passed a script name to execute, and the script includes a future statement, it will be in effect in the interactive session started after the script is executed.

See also

PEP 236 - Back to the __future__
The original proposal for the __future__ mechanism.

6.13. The statement¶

global_stmt ::= "global" ("," )*

The statement is a declaration which holds for the entire current code block. It means that the listed identifiers are to be interpreted as globals. It would be impossible to assign to a global variable without , although free variables may refer to globals without being declared global.

Names listed in a statement must not be used in the same code block textually preceding that statement.

Names listed in a statement must not be defined as formal parameters or in a loop control target, definition, function definition, or statement.

CPython implementation detail: The current implementation does not enforce the latter two restrictions, but programs should not abuse this freedom, as future implementations may enforce them or silently change the meaning of the program.

Programmer’s note: is a directive to the parser. It applies only to code parsed at the same time as the statement. In particular, a statement contained in an statement does not affect the code block containing the statement, and code contained in an statement is unaffected by statements in the code containing the statement. The same applies to the , and functions.

6.14. The statement¶

exec_stmt ::= "exec" ["in" ["," ]]

This statement supports dynamic execution of Python code. The first expression should evaluate to either a Unicode string, a Latin-1 encoded string, an open file object, a code object, or a tuple. If it is a string, the string is parsed as a suite of Python statements which is then executed (unless a syntax error occurs). [1] If it is an open file, the file is parsed until EOF and executed. If it is a code object, it is simply executed. For the interpretation of a tuple, see below. In all cases, the code that’s executed is expected to be valid as file input (see section File input). Be aware that the and statements may not be used outside of function definitions even within the context of code passed to the statement.

In all cases, if the optional parts are omitted, the code is executed in the current scope. If only the first expression after is specified, it should be a dictionary, which will be used for both the global and the local variables. If two expressions are given, they are used for the global and local variables, respectively. If provided, locals can be any mapping object. Remember that at module level, globals and locals are the same dictionary. If two separate objects are given as globals and locals, the code will be executed as if it were embedded in a class definition.

The first expression may also be a tuple of length 2 or 3. In this case, the optional parts must be omitted. The form is equivalent to , while the form is equivalent to . The tuple form of provides compatibility with Python 3, where is a function rather than a statement.

Changed in version 2.4: Formerly, locals was required to be a dictionary.

As a side effect, an implementation may insert additional keys into the dictionaries given besides those corresponding to variable names set by the executed code. For example, the current implementation may add a reference to the dictionary of the built-in module under the key (!).

Programmer’s hints: dynamic evaluation of expressions is supported by the built-in function . The built-in functions and return the current global and local dictionary, respectively, which may be useful to pass around for use by .


0 thoughts on “Assignment Pass

Leave a Reply

Your email address will not be published. Required fields are marked *