Searched defs:standard (Results 1 - 25 of 35) sorted by relevance

12

/external/skia/src/gpu/gl/win/
H A DGrGLCreateNativeInterface_win.cpp80 GrGLStandard standard = GrGLGetStandardInUseFromString(verStr); local
82 if (kGLES_GrGLStandard == standard) {
84 } else if (kGL_GrGLStandard == standard) {
/external/skia/src/gpu/gl/
H A DGrGLAssembleInterface.cpp29 GrGLStandard standard = GrGLGetStandardInUseFromString(verStr); local
31 if (kGLES_GrGLStandard == standard) {
33 } else if (kGL_GrGLStandard == standard) {
H A DGrGLContext.h28 GrGLStandard standard() const { return fInterface->fStandard; } function in class:GrGLContextInfo
H A DGrGLExtensions.cpp65 bool GrGLExtensions::init(GrGLStandard standard, argument
H A DGrGLUtil.cpp95 void GrGLGetDriverInfo(GrGLStandard standard, argument
123 if (standard == kGL_GrGLStandard) {
H A DGrGLCaps.cpp22 fStandard = ctxInfo.standard();
74 GrGLStandard standard = ctxInfo.standard(); local
77 if (kGLES_GrGLStandard == standard) {
81 SkASSERT(kGL_GrGLStandard == standard);
93 if (kGL_GrGLStandard == standard) {
108 fTextureUsageSupport = (kGLES_GrGLStandard == standard) &&
111 if (kGL_GrGLStandard == standard) {
119 if (kGL_GrGLStandard == standard) {
129 if (kGL_GrGLStandard == standard) {
660 get_glsl_version_decl_string(GrGLStandard standard, GrGLSLGeneration generation, bool isCoreProfile) argument
722 GrGLStandard standard = ctxInfo.standard(); local
1555 GrGLStandard standard = ctxInfo.standard(); local
[all...]
H A DGrGLTestInterface.h336 void init(GrGLStandard standard) { argument
337 fStandard = standard;
338 fExtensions.init(standard, fFunctions.fGetString, fFunctions.fGetStringi,
/external/guice/extensions/struts2/lib/
H A Djsp-api-2.1.jar ... standard/tei/ org/apache/taglibs/standard/tlv/ org/apache/taglibs/standard/functions/ org/apache/taglibs/standard/extra/ org/apache/taglibs/standard ...
/external/fmtlib/support/
H A Dtravis-build.py81 standard = os.environ['STANDARD'] variable
92 if standard != '0x':
94 '-DCMAKE_CXX_FLAGS=-std=c++' + standard, '-DFMT_USE_CPP11=OFF'
115 check_call(['cmake', '-DCMAKE_CXX_FLAGS=-std=c++' + standard,
/external/icu/icu4c/source/test/cintltst/
H A Dstdnmtst.c39 static int dotestname(const char *name, const char *standard, const char *expected) { argument
46 tag = ucnv_getStandardName(name, standard, &error);
48 log_err_status(error, "FAIL: could not find %s standard name for %s\n", standard, name);
51 log_err("FAIL: expected %s for %s standard name for %s, got %s\n", expected, standard, name, tag);
67 const char *standard; local
70 standard = ucnv_getStandard(i, &err);
74 } else if (!standard || !*standard) {
115 dotestconv(const char *name, const char *standard, const char *expected) argument
171 doTestNames(const char *name, const char *standard, const char **expected, int32_t size) argument
223 doTestUCharNames(const char *name, const char *standard, const char **expected, int32_t size) argument
[all...]
/external/libopus/celt/dump_modes/
H A Ddump_modes.c77 int standard, framerate; local
80 standard = (mode->Fs == 400*(opus_int32)mode->shortMdctSize);
83 if (!standard)
104 if (!standard)
234 if (standard)
244 if (standard)
/external/swiftshader/third_party/LLVM/lib/CodeGen/
H A DSpiller.cpp32 enum SpillerName { trivial, standard, inline_ }; enumerator in enum:__anon19881::SpillerName
37 cl::desc("Spiller to use: (default: standard)"),
40 clEnumVal(standard, "default spiller"),
43 cl::init(standard));
238 case standard: return new StandardSpiller(pass, mf, vrm);
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/shaping/
H A DArabicShapingRegTest.java64 public static TestData standard(String source, int flags, String result) { method in class:ArabicShapingRegTest.TestData
85 private static final String[] typenames = { "standard", "preflight", "error" };
204 TestData.standard(lamAlefSpecialVLTR,
213 TestData.standard(lamAlefSpecialVLTR,
222 TestData.standard(lamAlefSpecialVLTR,
231 TestData.standard(lamAlefSpecialVLTR,
241 TestData.standard(lamAlefSpecialVLTR,
250 TestData.standard(lamAlefSpecialVLTR,
259 TestData.standard(lamAlefSpecialVLTR,
268 TestData.standard(lamAlefSpecialVLT
[all...]
/external/icu/icu4j/main/classes/charset/src/com/ibm/icu/charset/
H A DUConverterAlias.java477 // char *standard, UErrorCode *pErrorCode)
478 static final String getStandardName(String alias, String standard)throws IOException { argument
480 int listOffset = findTaggedAliasListsOffset(alias, standard);
523 // char *standard, UErrorCode *pErrorCode) {
524 static String getCanonicalName(String alias, String standard) throws IOException{ argument
526 int convNum = findTaggedConverterNum(alias, standard);
545 // const char *standard, UErrorCode *pErrorCode)
546 /* static final UConverterAliasesEnumeration openStandardNames(String convName, String standard)throws IOException {
549 int listOffset = findTaggedAliasListsOffset(convName, standard);
553 * name and standard ar
582 findTaggedAliasListsOffset(String alias, String standard) argument
639 findTaggedConverterNum(String alias, String standard) argument
[all...]
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/shaping/
H A DArabicShapingRegTest.java63 public static TestData standard(String source, int flags, String result) { method in class:ArabicShapingRegTest.TestData
84 private static final String[] typenames = { "standard", "preflight", "error" };
203 TestData.standard(lamAlefSpecialVLTR,
212 TestData.standard(lamAlefSpecialVLTR,
221 TestData.standard(lamAlefSpecialVLTR,
230 TestData.standard(lamAlefSpecialVLTR,
240 TestData.standard(lamAlefSpecialVLTR,
249 TestData.standard(lamAlefSpecialVLTR,
258 TestData.standard(lamAlefSpecialVLTR,
267 TestData.standard(lamAlefSpecialVLT
[all...]
/external/mesa3d/src/gallium/state_trackers/vdpau/
H A Dmixer.c1003 VdpColorStandard standard,
1012 switch (standard) {
1002 vlVdpGenerateCSCMatrix(VdpProcamp *procamp, VdpColorStandard standard, VdpCSCMatrix *csc_matrix) argument
/external/skia/src/core/
H A DSkColorSpace.cpp94 * @param standard 3x3 canonical transformation matrix
96 static bool xyz_almost_equal(const SkMatrix44& toXYZD50, const float* standard) { argument
97 return color_space_almost_equal(toXYZD50.getFloat(0, 0), standard[0]) &&
98 color_space_almost_equal(toXYZD50.getFloat(0, 1), standard[1]) &&
99 color_space_almost_equal(toXYZD50.getFloat(0, 2), standard[2]) &&
100 color_space_almost_equal(toXYZD50.getFloat(1, 0), standard[3]) &&
101 color_space_almost_equal(toXYZD50.getFloat(1, 1), standard[4]) &&
102 color_space_almost_equal(toXYZD50.getFloat(1, 2), standard[5]) &&
103 color_space_almost_equal(toXYZD50.getFloat(2, 0), standard[6]) &&
104 color_space_almost_equal(toXYZD50.getFloat(2, 1), standard[
[all...]
H A DSkICC.cpp234 SkEndian_SwapBE32(0x0000f6d6), // D50 standard illuminant (X)
235 SkEndian_SwapBE32(0x00010000), // D50 standard illuminant (Y)
236 SkEndian_SwapBE32(0x0000d32d), // D50 standard illuminant (Z)
340 static bool nearly_equal(const SkMatrix44& toXYZD50, const float standard[9]) { argument
341 return nearly_equal(toXYZD50.getFloat(0, 0), standard[0])
342 && nearly_equal(toXYZD50.getFloat(0, 1), standard[1])
343 && nearly_equal(toXYZD50.getFloat(0, 2), standard[2])
344 && nearly_equal(toXYZD50.getFloat(1, 0), standard[3])
345 && nearly_equal(toXYZD50.getFloat(1, 1), standard[4])
346 && nearly_equal(toXYZD50.getFloat(1, 2), standard[
[all...]
/external/autotest/client/site_tests/camera_V4L2/src/
H A Dmedia_v4l2_device.cc561 v4l2_standard standard; local
574 memset(&standard, 0, sizeof(standard));
575 standard.index = 0;
576 while (0 == DoIoctl(VIDIOC_ENUMSTD, &standard)) {
577 if (standard.id & input.std)
578 printf("%s\n", standard.name);
579 standard.index++;
583 if (errno != EINVAL || standard.index == 0) {
/external/icu/icu4c/source/common/
H A Ducnv_io.cpp28 * depending on the specified standard.
145 * a standard, or they are really old converters that the
146 * standard doesn't recognize anymore.
639 * Search for an standard name of an alias (what is the default name
640 * that this standard uses?)
645 findTaggedAliasListsOffset(const char *alias, const char *standard, UErrorCode *pErrorCode) { argument
650 uint32_t tagNum = getTagNumber(standard);
666 at the highest standard affinity.
684 /* The standard doesn't know about the alias */
696 findTaggedConverterNum(const char *alias, const char *standard, UErrorCod argument
835 ucnv_openStandardNames(const char *convName, const char *standard, UErrorCode *pErrorCode) argument
961 ucnv_getStandardName(const char *alias, const char *standard, UErrorCode *pErrorCode) argument
1007 ucnv_getCanonicalName(const char *alias, const char *standard, UErrorCode *pErrorCode) argument
[all...]
/external/icu/icu4c/source/tools/gencnval/
H A Dgencnval.c62 /* The maximum number of aliases that a standard tag/converter combination can have.
137 /* Were the standard tags declared before the aliases. */
169 addAlias(const char *alias, uint16_t standard, uint16_t converter, UBool defaultName);
379 fprintf(stderr, "%s:%d: error: alias table needs to start a list of standard tags\n", path, lineNum);
662 @param standard When standard is 0, then it's the "empty" tag.
665 addAlias(const char *alias, uint16_t standard, uint16_t converter, UBool defaultName) { argument
670 if(standard>=MAX_TAG_COUNT) {
671 fprintf(stderr, "%s:%d: error: too many standard tags\n", path, lineNum);
678 aliasList = &tags[standard]
[all...]
/external/freetype/include/freetype/internal/
H A Dpsaux.h784 FT_CMap_Class standard; member in struct:T1_CMap_ClassesRec_
/external/pdfium/third_party/freetype/include/freetype/internal/
H A Dpsaux.h782 FT_CMap_Class standard; member in struct:T1_CMap_ClassesRec_
/external/webrtc/webrtc/p2p/base/
H A Dport_unittest.cc1298 // This test case verifies standard ICE features in STUN messages. Currently it
1540 Port* standard = ports[0].get(); local
1545 ExpectPortsCanConnect(false, link_local1, standard);
1546 ExpectPortsCanConnect(false, standard, link_local1);
1551 ExpectPortsCanConnect(true, localhost, standard);
1552 ExpectPortsCanConnect(true, standard, localhost);
/external/python/cpython2/Lib/pydoc_data/
H A Dtopics.py4 'assignment': u'\nAssignment statements\n*********************\n\nAssignment statements are used to (re)bind names to values and to\nmodify attributes or items of mutable objects:\n\n assignment_stmt ::= (target_list "=")+ (expression_list | yield_expression)\n target_list ::= target ("," target)* [","]\n target ::= identifier\n | "(" target_list ")"\n | "[" [target_list] "]"\n | attributeref\n | subscription\n | slicing\n\n(See section Primaries for the syntax definitions for the last three\nsymbols.)\n\nAn assignment statement evaluates the expression list (remember that\nthis can be a single expression or a comma-separated list, the latter\nyielding a tuple) and assigns the single resulting object to each of\nthe target lists, from left to right.\n\nAssignment is defined recursively depending on the form of the target\n(list). When a target is part of a mutable object (an attribute\nreference, subscription or slicing), the mutable object must\nultimately perform the assignment and decide about its validity, and\nmay raise an exception if the assignment is unacceptable. The rules\nobserved by various types and the exceptions raised are given with the\ndefinition of the object types (see section The standard type\nhierarchy).\n\nAssignment of an object to a target list is recursively defined as\nfollows.\n\n* If the target list is a single target: The object is assigned to\n that target.\n\n* If the target list is a comma-separated list of targets: The\n object must be an iterable with the same number of items as there\n are targets in the target list, and the items are assigned, from\n left to right, to the corresponding targets.\n\nAssignment of an object to a single target is recursively defined as\nfollows.\n\n* If the target is an identifier (name):\n\n * If the name does not occur in a "global" statement in the\n current code block: the name is bound to the object in the current\n local namespace.\n\n * Otherwise: the name is bound to the object in the current global\n namespace.\n\n The name is rebound if it was already bound. This may cause the\n reference count for the object previously bound to the name to reach\n zero, causing the object to be deallocated and its destructor (if it\n has one) to be called.\n\n* If the target is a target list enclosed in parentheses or in\n square brackets: The object must be an iterable with the same number\n of items as there are targets in the target list, and its items are\n assigned, from left to right, to the corresponding targets.\n\n* If the target is an attribute reference: The primary expression in\n the reference is evaluated. It should yield an object with\n assignable attributes; if this is not the case, "TypeError" is\n raised. That object is then asked to assign the assigned object to\n the given attribute; if it cannot perform the assignment, it raises\n an exception (usually but not necessarily "AttributeError").\n\n Note: If the object is a class instance and the attribute reference\n occurs on both sides of the assignment operator, the RHS expression,\n "a.x" can access either an instance attribute or (if no instance\n attribute exists) a class attribute. The LHS target "a.x" is always\n set as an instance attribute, creating it if necessary. Thus, the\n two occurrences of "a.x" do not necessarily refer to the same\n attribute: if the RHS expression refers to a class attribute, the\n LHS creates a new instance attribute as the target of the\n assignment:\n\n class Cls:\n x = 3 # class variable\n inst = Cls()\n inst.x = inst.x + 1 # writes inst.x as 4 leaving Cls.x as 3\n\n This description does not necessarily apply to descriptor\n attributes, such as properties created with "property()".\n\n* If the target is a subscription: The primary expression in the\n reference is evaluated. It should yield either a mutable sequence\n object (such as a list) or a mapping object (such as a dictionary).\n Next, the subscript expression is evaluated.\n\n If the primary is a mutable sequence object (such as a list), the\n subscript must yield a plain integer. If it is negative, the\n sequence\'s length is added to it. The resulting value must be a\n nonnegative integer less than the sequence\'s length, and the\n sequence is asked to assign the assigned object to its item with\n that index. If the index is out of range, "IndexError" is raised\n (assignment to a subscripted sequence cannot add new items to a\n list).\n\n If the primary is a mapping object (such as a dictionary), the\n subscript must have a type compatible with the mapping\'s key type,\n and the mapping is then asked to create a key/datum pair which maps\n the subscript to the assigned object. This can either replace an\n existing key/value pair with the same key value, or insert a new\n key/value pair (if no key with the same value existed).\n\n* If the target is a slicing: The primary expression in the\n reference is evaluated. It should yield a mutable sequence object\n (such as a list). The assigned object should be a sequence object\n of the same type. Next, the lower and upper bound expressions are\n evaluated, insofar they are present; defaults are zero and the\n sequence\'s length. The bounds should evaluate to (small) integers.\n If either bound is negative, the sequence\'s length is added to it.\n The resulting bounds are clipped to lie between zero and the\n sequence\'s length, inclusive. Finally, the sequence object is asked\n to replace the slice with the items of the assigned sequence. The\n length of the slice may be different from the length of the assigned\n sequence, thus changing the length of the target sequence, if the\n object allows it.\n\n**CPython implementation detail:** In the current implementation, the\nsyntax for targets is taken to be the same as for expressions, and\ninvalid syntax is rejected during the code generation phase, causing\nless detailed error messages.\n\nWARNING: Although the definition of assignment implies that overlaps\nbetween the left-hand side and the right-hand side are \'safe\' (for\nexample "a, b = b, a" swaps two variables), overlaps *within* the\ncollection of assigned-to variables are not safe! For instance, the\nfollowing program prints "[0, 2]":\n\n x = [0, 1]\n i = 0\n i, x[i] = 1, 2\n print x\n\n\nAugmented assignment statements\n===============================\n\nAugmented assignment is the combination, in a single statement, of a\nbinary operation and an assignment statement:\n\n augmented_assignment_stmt ::= augtarget augop (expression_list | yield_expression)\n augtarget ::= identifier | attributeref | subscription | slicing\n augop ::= "+=" | "-=" | "*=" | "/=" | "//=" | "%=" | "**="\n | ">>=" | "<<=" | "&=" | "^=" | "|="\n\n(See section Primaries for the syntax definitions for the last three\nsymbols.)\n\nAn augmented assignment evaluates the target (which, unlike normal\nassignment statements, cannot be an unpacking) and the expression\nlist, performs the binary operation specific to the type of assignment\non the two operands, and assigns the result to the original target.\nThe target is only evaluated once.\n\nAn augmented assignment expression like "x += 1" can be rewritten as\n"x = x + 1" to achieve a similar, but not exactly equal effect. In the\naugmented version, "x" is only evaluated once. Also, when possible,\nthe actual operation is performed *in-place*, meaning that rather than\ncreating a new object and assigning that to the target, the old object\nis modified instead.\n\nWith the exception of assigning to tuples and multiple targets in a\nsingle statement, the assignment done by augmented assignment\nstatements is handled the same way as normal assignments. Similarly,\nwith the exception of the possible *in-place* behavior, the binary\noperation performed by augmented assignment is the same as the normal\nbinary operations.\n\nFor targets which are attribute references, the same caveat about\nclass and instance attributes applies as for regular assignments.\n',
12 'bltin-code-objects': u'\nCode Objects\n************\n\nCode objects are used by the implementation to represent "pseudo-\ncompiled" executable Python code such as a function body. They differ\nfrom function objects because they don\'t contain a reference to their\nglobal execution environment. Code objects are returned by the built-\nin "compile()" function and can be extracted from function objects\nthrough their "func_code" attribute. See also the "code" module.\n\nA code object can be executed or evaluated by passing it (instead of a\nsource string) to the "exec" statement or the built-in "eval()"\nfunction.\n\nSee The standard type hierarchy for more information.\n',
16 'bltin-type-objects': u'\nType Objects\n************\n\nType objects represent the various object types. An object\'s type is\naccessed by the built-in function "type()". There are no special\noperations on types. The standard module "types" defines names for\nall standard built-in types.\n\nTypes are written like this: "<type \'int\'>".\n',
21 'class': u'\nClass definitions\n*****************\n\nA class definition defines a class object (see section The standard\ntype hierarchy):\n\n classdef ::= "class" classname [inheritance] ":" suite\n inheritance ::= "(" [expression_list] ")"\n classname ::= identifier\n\nA class definition is an executable statement. It first evaluates the\ninheritance list, if present. Each item in the inheritance list\nshould evaluate to a class object or class type which allows\nsubclassing. The class\'s suite is then executed in a new execution\nframe (see section Naming and binding), using a newly created local\nnamespace and the original global namespace. (Usually, the suite\ncontains only function definitions.) When the class\'s suite finishes\nexecution, its execution frame is discarded but its local namespace is\nsaved. [4] A class object is then created using the inheritance list\nfor the base classes and the saved local namespace for the attribute\ndictionary. The class name is bound to this class object in the\noriginal local namespace.\n\n**Programmer\'s note:** Variables defined in the class definition are\nclass variables; they are shared by all instances. To create instance\nvariables, they can be set in a method with "self.name = value". Both\nclass and instance variables are accessible through the notation\n""self.name"", and an instance variable hides a class variable with\nthe same name when accessed in this way. Class variables can be used\nas defaults for instance variables, but using mutable values there can\nlead to unexpected results. For *new-style class*es, descriptors can\nbe used to create instance variables with different implementation\ndetails.\n\nClass definitions, like function definitions, may be wrapped by one or\nmore *decorator* expressions. The evaluation rules for the decorator\nexpressions are the same as for functions. The result must be a class\nobject, which is then bound to the class name.\n\n-[ Footnotes ]-\n\n[1] The exception is propagated to the invocation stack unless\n there is a "finally" clause which happens to raise another\n exception. That new exception causes the old one to be lost.\n\n[2] Currently, control "flows off the end" except in the case of\n an exception or the execution of a "return", "continue", or\n "break" statement.\n\n[3] A string literal appearing as the first statement in the\n function body is transformed into the function\'s "__doc__"\n attribute and therefore the function\'s *docstring*.\n\n[4] A string literal appearing as the first statement in the class\n body is transformed into the namespace\'s "__doc__" item and\n therefore the class\'s *docstring*.\n',
23 'compound': u'\nCompound statements\n*******************\n\nCompound statements contain (groups of) other statements; they affect\nor control the execution of those other statements in some way. In\ngeneral, compound statements span multiple lines, although in simple\nincarnations a whole compound statement may be contained in one line.\n\nThe "if", "while" and "for" statements implement traditional control\nflow constructs. "try" specifies exception handlers and/or cleanup\ncode for a group of statements. Function and class definitions are\nalso syntactically compound statements.\n\nCompound statements consist of one or more \'clauses.\' A clause\nconsists of a header and a \'suite.\' The clause headers of a\nparticular compound statement are all at the same indentation level.\nEach clause header begins with a uniquely identifying keyword and ends\nwith a colon. A suite is a group of statements controlled by a\nclause. A suite can be one or more semicolon-separated simple\nstatements on the same line as the header, following the header\'s\ncolon, or it can be one or more indented statements on subsequent\nlines. Only the latter form of suite can contain nested compound\nstatements; the following is illegal, mostly because it wouldn\'t be\nclear to which "if" clause a following "else" clause would belong:\n\n if test1: if test2: print x\n\nAlso note that the semicolon binds tighter than the colon in this\ncontext, so that in the following example, either all or none of the\n"print" statements are executed:\n\n if x < y < z: print x; print y; print z\n\nSummarizing:\n\n compound_stmt ::= if_stmt\n | while_stmt\n | for_stmt\n | try_stmt\n | with_stmt\n | funcdef\n | classdef\n | decorated\n suite ::= stmt_list NEWLINE | NEWLINE INDENT statement+ DEDENT\n statement ::= stmt_list NEWLINE | compound_stmt\n stmt_list ::= simple_stmt (";" simple_stmt)* [";"]\n\nNote that statements always end in a "NEWLINE" possibly followed by a\n"DEDENT". Also note that optional continuation clauses always begin\nwith a keyword that cannot start a statement, thus there are no\nambiguities (the \'dangling "else"\' problem is solved in Python by\nrequiring nested "if" statements to be indented).\n\nThe formatting of the grammar rules in the following sections places\neach clause on a separate line for clarity.\n\n\nThe "if" statement\n==================\n\nThe "if" statement is used for conditional execution:\n\n if_stmt ::= "if" expression ":" suite\n ( "elif" expression ":" suite )*\n ["else" ":" suite]\n\nIt selects exactly one of the suites by evaluating the expressions one\nby one until one is found to be true (see section Boolean operations\nfor the definition of true and false); then that suite is executed\n(and no other part of the "if" statement is executed or evaluated).\nIf all expressions are false, the suite of the "else" clause, if\npresent, is executed.\n\n\nThe "while" statement\n=====================\n\nThe "while" statement is used for repeated execution as long as an\nexpression is true:\n\n while_stmt ::= "while" expression ":" suite\n ["else" ":" suite]\n\nThis repeatedly tests the expression and, if it is true, executes the\nfirst suite; if the expression is false (which may be the first time\nit is tested) the suite of the "else" clause, if present, is executed\nand the loop terminates.\n\nA "break" statement executed in the first suite terminates the loop\nwithout executing the "else" clause\'s suite. A "continue" statement\nexecuted in the first suite skips the rest of the suite and goes back\nto testing the expression.\n\n\nThe "for" statement\n===================\n\nThe "for" statement is used to iterate over the elements of a sequence\n(such as a string, tuple or list) or other iterable object:\n\n for_stmt ::= "for" target_list "in" expression_list ":" suite\n ["else" ":" suite]\n\nThe expression list is evaluated once; it should yield an iterable\nobject. An iterator is created for the result of the\n"expression_list". The suite is then executed once for each item\nprovided by the iterator, in the order of ascending indices. Each\nitem in turn is assigned to the target list using the standard rules\nfor assignments, and then the suite is executed. When the items are\nexhausted (which is immediately when the sequence is empty), the suite\nin the "else" clause, if present, is executed, and the loop\nterminates.\n\nA "break" statement executed in the first suite terminates the loop\nwithout executing the "else" clause\'s suite. A "continue" statement\nexecuted in the first suite skips the rest of the suite and continues\nwith the next item, or with the "else" clause if there was no next\nitem.\n\nThe suite may assign to the variable(s) in the target list; this does\nnot affect the next item assigned to it.\n\nThe target list is not deleted when the loop is finished, but if the\nsequence is empty, it will not have been assigned to at all by the\nloop. Hint: the built-in function "range()" returns a sequence of\nintegers suitable to emulate the effect of Pascal\'s "for i := a to b\ndo"; e.g., "range(3)" returns the list "[0, 1, 2]".\n\nNote: There is a subtlety when the sequence is being modified by the\n loop (this can only occur for mutable sequences, i.e. lists). An\n internal counter is used to keep track of which item is used next,\n and this is incremented on each iteration. When this counter has\n reached the length of the sequence the loop terminates. This means\n that if the suite deletes the current (or a previous) item from the\n sequence, the next item will be skipped (since it gets the index of\n the current item which has already been treated). Likewise, if the\n suite inserts an item in the sequence before the current item, the\n current item will be treated again the next time through the loop.\n This can lead to nasty bugs that can be avoided by making a\n temporary copy using a slice of the whole sequence, e.g.,\n\n for x in a[:]:\n if x < 0: a.remove(x)\n\n\nThe "try" statement\n===================\n\nThe "try" statement specifies exception handlers and/or cleanup code\nfor a group of statements:\n\n try_stmt ::= try1_stmt | try2_stmt\n try1_stmt ::= "try" ":" suite\n ("except" [expression [("as" | ",") identifier]] ":" suite)+\n ["else" ":" suite]\n ["finally" ":" suite]\n try2_stmt ::= "try" ":" suite\n "finally" ":" suite\n\nChanged in version 2.5: In previous versions of Python,\n"try"..."except"..."finally" did not work. "try"..."except" had to be\nnested in "try"..."finally".\n\nThe "except" clause(s) specify one or more exception handlers. When no\nexception occurs in the "try" clause, no exception handler is\nexecuted. When an exception occurs in the "try" suite, a search for an\nexception handler is started. This search inspects the except clauses\nin turn until one is found that matches the exception. An expression-\nless except clause, if present, must be last; it matches any\nexception. For an except clause with an expression, that expression\nis evaluated, and the clause matches the exception if the resulting\nobject is "compatible" with the exception. An object is compatible\nwith an exception if it is the class or a base class of the exception\nobject, or a tuple containing an item compatible with the exception.\n\nIf no except clause matches the exception, the search for an exception\nhandler continues in the surrounding code and on the invocation stack.\n[1]\n\nIf the evaluation of an expression in the header of an except clause\nraises an exception, the original search for a handler is canceled and\na search starts for the new exception in the surrounding code and on\nthe call stack (it is treated as if the entire "try" statement raised\nthe exception).\n\nWhen a matching except clause is found, the exception is assigned to\nthe target specified in that except clause, if present, and the except\nclause\'s suite is executed. All except clauses must have an\nexecutable block. When the end of this block is reached, execution\ncontinues normally after the entire try statement. (This means that\nif two nested handlers exist for the same exception, and the exception\noccurs in the try clause of the inner handler, the outer handler will\nnot handle the exception.)\n\nBefore an except clause\'s suite is executed, details about the\nexception are assigned to three variables in the "sys" module:\n"sys.exc_type" receives the object identifying the exception;\n"sys.exc_value" receives the exception\'s parameter;\n"sys.exc_traceback" receives a traceback object (see section The\nstandard type hierarchy) identifying the point in the program where\nthe exception occurred. These details are also available through the\n"sys.exc_info()" function, which returns a tuple "(exc_type,\nexc_value, exc_traceback)". Use of the corresponding variables is\ndeprecated in favor of this function, since their use is unsafe in a\nthreaded program. As of Python 1.5, the variables are restored to\ntheir previous values (before the call) when returning from a function\nthat handled an exception.\n\nThe optional "else" clause is executed if and when control flows off\nthe end of the "try" clause. [2] Exceptions in the "else" clause are\nnot handled by the preceding "except" clauses.\n\nIf "finally" is present, it specifies a \'cleanup\' handler. The "try"\nclause is executed, including any "except" and "else" clauses. If an\nexception occurs in any of the clauses and is not handled, the\nexception is temporarily saved. The "finally" clause is executed. If\nthere is a saved exception, it is re-raised at the end of the\n"finally" clause. If the "finally" clause raises another exception or\nexecutes a "return" or "break" statement, the saved exception is\ndiscarded:\n\n >>> def f():\n ... try:\n ... 1/0\n ... finally:\n ... return 42\n ...\n >>> f()\n 42\n\nThe exception information is not available to the program during\nexecution of the "finally" clause.\n\nWhen a "return", "break" or "continue" statement is executed in the\n"try" suite of a "try"..."finally" statement, the "finally" clause is\nalso executed \'on the way out.\' A "continue" statement is illegal in\nthe "finally" clause. (The reason is a problem with the current\nimplementation --- this restriction may be lifted in the future).\n\nThe return value of a function is determined by the last "return"\nstatement executed. Since the "finally" clause always executes, a\n"return" statement executed in the "finally" clause will always be the\nlast one executed:\n\n >>> def foo():\n ... try:\n ... return \'try\'\n ... finally:\n ... return \'finally\'\n ...\n >>> foo()\n \'finally\'\n\nAdditional information on exceptions can be found in section\nExceptions, and information on using the "raise" statement to generate\nexceptions may be found in section The raise statement.\n\n\nThe "with" statement\n====================\n\nNew in version 2.5.\n\nThe "with" statement is used to wrap the execution of a block with\nmethods defined by a context manager (see section With Statement\nContext Managers). This allows common "try"..."except"..."finally"\nusage patterns to be encapsulated for convenient reuse.\n\n with_stmt ::= "with" with_item ("," with_item)* ":" suite\n with_item ::= expression ["as" target]\n\nThe execution of the "with" statement with one "item" proceeds as\nfollows:\n\n1. The context expression (the expression given in the "with_item")\n is evaluated to obtain a context manager.\n\n2. The context manager\'s "__exit__()" is loaded for later use.\n\n3. The context manager\'s "__enter__()" method is invoked.\n\n4. If a target was included in the "with" statement, the return\n value from "__enter__()" is assigned to it.\n\n Note: The "with" statement guarantees that if the "__enter__()"\n method returns without an error, then "__exit__()" will always be\n called. Thus, if an error occurs during the assignment to the\n target list, it will be treated the same as an error occurring\n within the suite would be. See step 6 below.\n\n5. The suite is executed.\n\n6. The context manager\'s "__exit__()" method is invoked. If an\n exception caused the suite to be exited, its type, value, and\n traceback are passed as arguments to "__exit__()". Otherwise, three\n "None" arguments are supplied.\n\n If the suite was exited due to an exception, and the return value\n from the "__exit__()" method was false, the exception is reraised.\n If the return value was true, the exception is suppressed, and\n execution continues with the statement following the "with"\n statement.\n\n If the suite was exited for any reason other than an exception, the\n return value from "__exit__()" is ignored, and execution proceeds\n at the normal location for the kind of exit that was taken.\n\nWith more than one item, the context managers are processed as if\nmultiple "with" statements were nested:\n\n with A() as a, B() as b:\n suite\n\nis equivalent to\n\n with A() as a:\n with B() as b:\n suite\n\nNote: In Python 2.5, the "with" statement is only allowed when the\n "with_statement" feature has been enabled. It is always enabled in\n Python 2.6.\n\nChanged in version 2.7: Support for multiple context expressions.\n\nSee also:\n\n **PEP 343** - The "with" statement\n The specification, background, and examples for the Python "with"\n statement.\n\n\nFunction definitions\n====================\n\nA function definition defines a user-defined function object (see\nsection The standard type hierarchy):\n\n decorated ::= decorators (classdef | funcdef)\n decorators ::= decorator+\n decorator ::= "@" dotted_name ["(" [argument_list [","]] ")"] NEWLINE\n funcdef ::= "def" funcname "(" [parameter_list] ")" ":" suite\n dotted_name ::= identifier ("." identifier)*\n parameter_list ::= (defparameter ",")*\n ( "*" identifier ["," "**" identifier]\n | "**" identifier\n | defparameter [","] )\n defparameter ::= parameter ["=" expression]\n sublist ::= parameter ("," parameter)* [","]\n parameter ::= identifier | "(" sublist ")"\n funcname ::= identifier\n\nA function definition is an executable statement. Its execution binds\nthe function name in the current local namespace to a function object\n(a wrapper around the executable code for the function). This\nfunction object contains a reference to the current global namespace\nas the global namespace to be used when the function is called.\n\nThe function definition does not execute the function body; this gets\nexecuted only when the function is called. [3]\n\nA function definition may be wrapped by one or more *decorator*\nexpressions. Decorator expressions are evaluated when the function is\ndefined, in the scope that contains the function definition. The\nresult must be a callable, which is invoked with the function object\nas the only argument. The returned value is bound to the function name\ninstead of the function object. Multiple decorators are applied in\nnested fashion. For example, the following code:\n\n @f1(arg)\n @f2\n def func(): pass\n\nis equivalent to:\n\n def func(): pass\n func = f1(arg)(f2(func))\n\nWhen one or more top-level *parameters* have the form *parameter* "="\n*expression*, the function is said to have "default parameter values."\nFor a parameter with a default value, the corresponding *argument* may\nbe omitted from a call, in which case the parameter\'s default value is\nsubstituted. If a parameter has a default value, all following\nparameters must also have a default value --- this is a syntactic\nrestriction that is not expressed by the grammar.\n\n**Default parameter values are evaluated when the function definition\nis executed.** This means that the expression is evaluated once, when\nthe function is defined, and that the same "pre-computed" value is\nused for each call. This is especially important to understand when a\ndefault parameter is a mutable object, such as a list or a dictionary:\nif the function modifies the object (e.g. by appending an item to a\nlist), the default value is in effect modified. This is generally not\nwhat was intended. A way around this is to use "None" as the\ndefault, and explicitly test for it in the body of the function, e.g.:\n\n def whats_on_the_telly(penguin=None):\n if penguin is None:\n penguin = []\n penguin.append("property of the zoo")\n return penguin\n\nFunction call semantics are described in more detail in section Calls.\nA function call always assigns values to all parameters mentioned in\nthe parameter list, either from position arguments, from keyword\narguments, or from default values. If the form ""*identifier"" is\npresent, it is initialized to a tuple receiving any excess positional\nparameters, defaulting to the empty tuple. If the form\n""**identifier"" is present, it is initialized to a new dictionary\nreceiving any excess keyword arguments, defaulting to a new empty\ndictionary.\n\nIt is also possible to create anonymous functions (functions not bound\nto a name), for immediate use in expressions. This uses lambda\nexpressions, described in section Lambdas. Note that the lambda\nexpression is merely a shorthand for a simplified function definition;\na function defined in a ""def"" statement can be passed around or\nassigned to another name just like a function defined by a lambda\nexpression. The ""def"" form is actually more powerful since it\nallows the execution of multiple statements.\n\n**Programmer\'s note:** Functions are first-class objects. A ""def""\nform executed inside a function definition defines a local function\nthat can be returned or passed around. Free variables used in the\nnested function can access the local variables of the function\ncontaining the def. See section Naming and binding for details.\n\n\nClass definitions\n=================\n\nA class definition defines a class object (see section The standard\ntype hierarchy):\n\n classdef ::= "class" classname [inheritance] ":" suite\n inheritance ::= "(" [expression_list] ")"\n classname ::= identifier\n\nA class definition is an executable statement. It first evaluates the\ninheritance list, if present. Each item in the inheritance list\nshould evaluate to a class object or class type which allows\nsubclassing. The class\'s suite is then executed in a new execution\nframe (see section Naming and binding), using a newly created local\nnamespace and the original global namespace. (Usually, the suite\ncontains only function definitions.) When the class\'s suite finishes\nexecution, its execution frame is discarded but its local namespace is\nsaved. [4] A class object is then created using the inheritance list\nfor the base classes and the saved local namespace for the attribute\ndictionary. The class name is bound to this class object in the\noriginal local namespace.\n\n**Programmer\'s note:** Variables defined in the class definition are\nclass variables; they are shared by all instances. To create instance\nvariables, they can be set in a method with "self.name = value". Both\nclass and instance variables are accessible through the notation\n""self.name"", and an instance variable hides a class variable with\nthe same name when accessed in this way. Class variables can be used\nas defaults for instance variables, but using mutable values there can\nlead to unexpected results. For *new-style class*es, descriptors can\nbe used to create instance variables with different implementation\ndetails.\n\nClass definitions, like function definitions, may be wrapped by one or\nmore *decorator* expressions. The evaluation rules for the decorator\nexpressions are the same as for functions. The result must be a class\nobject, which is then bound to the class name.\n\n-[ Footnotes ]-\n\n[1] The exception is propagated to the invocation stack unless\n there is a "finally" clause which happens to raise another\n exception. That new exception causes the old one to be lost.\n\n[2] Currently, control "flows off the end" except in the case of\n an exception or the execution of a "return", "continue", or\n "break" statement.\n\n[3] A string literal appearing as the first statement in the\n function body is transformed into the function\'s "__doc__"\n attribute and therefore the function\'s *docstring*.\n\n[4] A string literal appearing as the first statement in the class\n body is transformed into the namespace\'s "__doc__" item and\n therefore the class\'s *docstring*.\n',
26 'conversions': u'\nArithmetic conversions\n**********************\n\nWhen a description of an arithmetic operator below uses the phrase\n"the numeric arguments are converted to a common type," the arguments\nare coerced using the coercion rules listed at Coercion rules. If\nboth arguments are standard numeric types, the following coercions are\napplied:\n\n* If either argument is a complex number, the other is converted to\n complex;\n\n* otherwise, if either argument is a floating point number, the\n other is converted to floating point;\n\n* otherwise, if either argument is a long integer, the other is\n converted to long integer;\n\n* otherwise, both must be plain integers and no conversion is\n necessary.\n\nSome additional rules apply for certain operators (e.g., a string left\nargument to the \'%\' operator). Extensions can define their own\ncoercions.\n',
30 'dict': u'\nDictionary displays\n*******************\n\nA dictionary display is a possibly empty series of key/datum pairs\nenclosed in curly braces:\n\n dict_display ::= "{" [key_datum_list | dict_comprehension] "}"\n key_datum_list ::= key_datum ("," key_datum)* [","]\n key_datum ::= expression ":" expression\n dict_comprehension ::= expression ":" expression comp_for\n\nA dictionary display yields a new dictionary object.\n\nIf a comma-separated sequence of key/datum pairs is given, they are\nevaluated from left to right to define the entries of the dictionary:\neach key object is used as a key into the dictionary to store the\ncorresponding datum. This means that you can specify the same key\nmultiple times in the key/datum list, and the final dictionary\'s value\nfor that key will be the last one given.\n\nA dict comprehension, in contrast to list and set comprehensions,\nneeds two expressions separated with a colon followed by the usual\n"for" and "if" clauses. When the comprehension is run, the resulting\nkey and value elements are inserted in the new dictionary in the order\nthey are produced.\n\nRestrictions on the types of the key values are listed earlier in\nsection The standard typ
43 'identifiers': u'\\nIdentifiers and keywords\\n************************\\n\\nIdentifiers (also referred to as *names*) are described by the\\nfollowing lexical definitions:\\n\\n identifier ::= (letter|"_") (letter | digit | "_")*\\n letter ::= lowercase | uppercase\\n lowercase ::= "a"..."z"\\n uppercase ::= "A"..."Z"\\n digit ::= "0"..."9"\\n\\nIdentifiers are unlimited in length. Case is significant.\\n\\n\\nKeywords\\n========\\n\\nThe following identifiers are used as reserved words, or *keywords* of\\nthe language, and cannot be used as ordinary identifiers. They must\\nbe spelled exactly as written here:\\n\\n and del from not while\\n as elif global or with\\n assert else if pass yield\\n break except import print\\n class exec in raise\\n continue finally is return\\n def for lambda try\\n\\nChanged in version 2.4: "None" became a constant and is now recognized\\nby the compiler as a name for the built-in object "None". Although it\\nis not a keyword, you cannot assign a different object to it.\\n\\nChanged in version 2.5: Using "as" and "with" as identifiers triggers\\na warning. To use them as keywords, enable the "with_statement"\\nfuture feature .\\n\\nChanged in version 2.6: "as" and "with" are full keywords.\\n\\n\\nReserved classes of identifiers\\n===============================\\n\\nCertain classes of identifiers (besides keywords) have special\\nmeanings. These classes are identified by the patterns of leading and\\ntrailing underscore characters:\\n\\n"_*"\\n Not imported by "from module import *". The special identifier "_"\\n is used in the interactive interpreter to store the result of the\\n last evaluation; it is stored in the "__builtin__" module. When\\n not in interactive mode, "_" has no special meaning and is not\\n defined. See section The import statement.\\n\\n Note: The name "_" is often used in conjunction with\\n internationalization; refer to the documentation for the\\n "gettext" module for more information on this convention.\\n\\n"__*__"\\n System-defined names. These names are defined by the interpreter\\n and its implementation (including the standard library). Current\\n system names are discussed in the Special method names section and\\n elsewhere. More will likely be defined in future versions of\\n Python. *Any* use of "__*__" names, in any context, that does not\\n follow explicitly documented use, is subject to breakage without\\n warning.\\n\\n"__*"\\n Class-private names. Names in this category, when used within the\\n context of a class definition, are re-written to use a mangled form\\n to help avoid name clashes between "private" attributes of base and\\n derived classes. See section Identifiers (Names).\\n', namespace
[all...]

Completed in 755 milliseconds

12