Search

Home

Sort by

Searched refs:n5 (Results 1 - 24 of 24) sorted by relevance

/external/v8/src/compiler/
H A D	graph.h	83 Node* n5) { 84 Node* nodes[] = {n1, n2, n3, n4, n5}; 88 Node* n5, Node* n6) { 89 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; 93 Node* n5, Node* n6, Node* n7) { 94 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7}; 98 Node* n5, Node* n6, Node* n7, Node* n8) { 99 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7, n8}; 103 Node* n5, Node* n6, Node* n7, Node* n8, Node* n9) { 104 Node* nodes[] = {n1, n2, n3, n4, n5, n 82 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5) argument 87 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6) argument 92 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7) argument 97 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8) argument 102 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9) argument 107 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10) argument 112 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10, Node* n11) argument 118 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10, Node* n11, Node* n12) argument 124 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10, Node* n11, Node* n12, Node* n13) argument 130 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10, Node* n11, Node* n12, Node* n13, Node* n14) argument 137 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10, Node* n11, Node* n12, Node* n13, Node* n14, Node* n15) argument 144 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10, Node* n11, Node* n12, Node* n13, Node* n14, Node* n15, Node* n16) argument 152 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10, Node* n11, Node* n12, Node* n13, Node* n14, Node* n15, Node* n16, Node* n17) argument [all...]
H A D	ast-graph-builder.h	`191 Node* n5) { 192 Node* buffer[] = {n1, n2, n3, n4, n5}; 197 Node* n5, Node* n6) { 198 Node* nodes[] = {n1, n2, n3, n4, n5, n6}; 190 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5) argument 196 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6) argument`
/external/dtc/tests/
H A D	references.c	`79 int n1, n2, n3, n4, n5; local 97 n5 = fdt_path_offset(fdt, "/node5"); 98 if (n5 < 0) 99 FAIL("fdt_path_offset(/node5): %s", fdt_strerror(n5)); 104 h5 = fdt_get_phandle(fdt, n5);`
/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/
H A D	p6.cpp	`15 alignas(8) extern int n5; 16 extern int n5;`
H A D	p5.cpp	`7 alignas(1) alignas(2) int n5 alignas(4); // ok`
/external/libvpx/libvpx/vpx_dsp/mips/
H A D	idct32x32_msa.c	15 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local 19 LD_SH8((input + 8), 32, m4, n4, m5, n5, m6, n6, m7, n7); 22 TRANSPOSE8x8_SH_SH(m4, n4, m5, n5, m6, n6, m7, n7, m4, n4, m5, n5, m6, n6, m7, 25 ST_SH4(m4, n4, m5, n5, (tmp_buf + 8 * 8), 8); 30 LD_SH8((input + 24), 32, m4, n4, m5, n5, m6, n6, m7, n7); 33 TRANSPOSE8x8_SH_SH(m4, n4, m5, n5, m6, n6, m7, n7, m4, n4, m5, n5, m6, n6, m7, 37 ST_SH4(m4, n4, m5, n5, (tmp_buf + 24 * 8), 8); 243 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n local 542 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local [all...]
/external/syslinux/gpxe/src/drivers/net/
H A D	wlan_compat.h	292 #define WLAN_LOG_INFO5(x,n1,n2,n3,n4,n5) printk(KERN_INFO x, (n1), (n2), (n3), (n4), (n5)); 312 #define WLAN_LOG_DEBUG5(l,x,n1,n2,n3,n4,n5) if ( WLAN_DBVAR >= (l)) printk(KERN_DEBUG "%s: " x , __FUNCTION__ , (n1), (n2), (n3), (n4), (n5)); 313 #define WLAN_LOG_DEBUG6(l,x,n1,n2,n3,n4,n5,n6) if ( WLAN_DBVAR >= (l)) printk(KERN_DEBUG "%s: " x , __FUNCTION__ , (n1), (n2), (n3), (n4), (n5), (n6)); 326 #define WLAN_LOG_DEBUG5(l, s,n1,n2,n3,n4,n5) 358 #define WLAN_LOG_INFO5(s,n1,n2,n3,n4,n5) 365 #define WLAN_LOG_DEBUG5(l, s,n1,n2,n3,n4,n5)
/external/boringssl/src/crypto/fipsmodule/ec/
H A D	simple.c	`310 BIGNUM n0, n1, n2, n3, n4, n5, n6; local 340 n5 = BN_CTX_get(ctx); 395 // n5, n6 396 if (!BN_mod_sub_quick(n5, n1, n3, p) \|\| 400 // n5 = n1 - n3 403 if (BN_is_zero(n5)) { 428 if (!BN_copy(&r->Z, n5)) { 443 if (!field_mul(group, &r->Z, n0, n5, ctx)) { 448 // Z_r = Z_a Z_b * n5 452 !field_sqr(group, n4, n5, ct [all...]`
/external/clang/test/CXX/expr/expr.const/
H A D	p2-0x.cpp	234 constexpr int n5 = -65536 * 32768; // ok member in namespace:UndefinedBehavior::Overflow 242 constexpr int n13 = n5 + n5; // expected-error {{constant expression}} expected-note {{value -4294967296 is outside the range of }} 243 constexpr int n14 = n3 - n5; // expected-error {{constant expression}} expected-note {{value 4294967295 is outside the range of }} 244 constexpr int n15 = n5 * n5; // expected-error {{constant expression}} expected-note {{value 4611686018427387904 is outside the range of }}
/external/tensorflow/tensorflow/python/framework/
H A D	graph_util_test.py	`167 n1.input.extend(["n5"]) 181 n5 = graph_def.node.add() 182 n5.name = "n5" 183 n5.input.extend(["n1"]) 189 self.assertEqual("n5", sub_graph.node[3].name)`
/external/google-breakpad/android/
H A D	run-checks.sh	`474 head -n5 $TESTAPP.sym`
/external/sonivox/jet_tools/JetCreator/
H A D	img_Redo.py	22 \xee\xc3\x02\xcd\xf0\x03\xfaZ\xaa`\x13\x01\x9e\x86\xc4\\\n5\xaf)\xf0>\x86\
H A D	img_splash.py	`17 \x1fp\x8d\x86\n5\xc4d\xbd\x84-Dm\x01\xea-\x14\xe3\xbbX\x16e\xccNX\x80\xfc\`
/external/protobuf/gtest/test/
H A D	gtest_unittest.cc	`2165 const char* e5, int n1, int n2, int n3, int n4, int n5) { 2166 const int sum = n1 + n2 + n3 + n4 + n5; 2174 << n1 << " + " << n2 << " + " << n3 << " + " << n4 << " + " << n5 2284 int n5 = 0; local 2286 n1++, n2++, n3++, n4++, n5++) local 2292 EXPECT_EQ(1, n5) << "Argument 5 is not evaluated exactly once."; 2163 operator ()( const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, int n1, int n2, int n3, int n4, int n5) argument`
/external/clang/test/SemaCXX/
H A D	constant-expression-cxx11.cpp	`77 constexpr const int * const n5 = const_cast<const int const>(&n3); member in namespace:ConstCast 79 constexpr int n7 = *n5; 284 constexpr bool n5 = 0 < &y; // expected-error {{must be initialized by a constant expression}} member in namespace:PointerComparison`
/external/google-breakpad/src/testing/gtest/test/
H A D	gtest_unittest.cc	`2332 const char* e5, int n1, int n2, int n3, int n4, int n5) { 2333 const int sum = n1 + n2 + n3 + n4 + n5; 2341 << n1 << " + " << n2 << " + " << n3 << " + " << n4 << " + " << n5 2451 int n5 = 0; local 2453 n1++, n2++, n3++, n4++, n5++) local 2459 EXPECT_EQ(1, n5) << "Argument 5 is not evaluated exactly once."; 2330 operator ()( const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, int n1, int n2, int n3, int n4, int n5) argument`
/external/googletest/googletest/test/
H A D	gtest_unittest.cc	2194 const char* e5, int n1, int n2, int n3, int n4, int n5) { 2195 const int sum = n1 + n2 + n3 + n4 + n5; 2203 << n1 << " + " << n2 << " + " << n3 << " + " << n4 << " + " << n5 2313 int n5 = 0; local 2315 n1++, n2++, n3++, n4++, n5++) local 2321 EXPECT_EQ(1, n5) << "Argument 5 is not evaluated exactly once."; 3583 "1\\n2XXX\\n3\\n5\\n6\\n7\\n8\\n9\\n10\\n11\\n12XXX\\n13\\n14\\n15"); 3585 "1\\n2\\n3\\n4\\n5\\n6\\n7\\n8\\n9\\n11\\n12\\n13\\n14"); 3592 "1\\n2XXX\\n3\\n5\\n6\\n7\\n8\\n9\\n10\\n11\\n12XXX\\n13\\n14\\n15\n" 3594 " Which is: 1\\n2\\n3\\n4\\n5\\n 2192 operator ()( const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, int n1, int n2, int n3, int n4, int n5) argument [all...]
/external/v8/testing/gtest/test/
H A D	gtest_unittest.cc	2194 const char* e5, int n1, int n2, int n3, int n4, int n5) { 2195 const int sum = n1 + n2 + n3 + n4 + n5; 2203 << n1 << " + " << n2 << " + " << n3 << " + " << n4 << " + " << n5 2313 int n5 = 0; local 2315 n1++, n2++, n3++, n4++, n5++) local 2321 EXPECT_EQ(1, n5) << "Argument 5 is not evaluated exactly once."; 3576 "1\\n2XXX\\n3\\n5\\n6\\n7\\n8\\n9\\n10\\n11\\n12XXX\\n13\\n14\\n15"); 3578 "1\\n2\\n3\\n4\\n5\\n6\\n7\\n8\\n9\\n11\\n12\\n13\\n14"); 3583 " Actual: 1\\n2\\n3\\n4\\n5\\n6\\n7\\n8\\n9\\n11\\n12\\n13\\n14\n" 3586 "1\\n2XXX\\n3\\n5\\n 2192 operator ()( const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, int n1, int n2, int n3, int n4, int n5) argument [all...]
/external/vulkan-validation-layers/tests/gtest-1.7.0/test/
H A D	gtest_unittest.cc	`2187 const char* e5, int n1, int n2, int n3, int n4, int n5) { 2188 const int sum = n1 + n2 + n3 + n4 + n5; 2196 << n1 << " + " << n2 << " + " << n3 << " + " << n4 << " + " << n5 2306 int n5 = 0; local 2308 n1++, n2++, n3++, n4++, n5++) local 2314 EXPECT_EQ(1, n5) << "Argument 5 is not evaluated exactly once."; 2185 operator ()( const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, int n1, int n2, int n3, int n4, int n5) argument`
/external/clang/test/CXX/drs/
H A D	dr0xx.cpp	`669 int n5 = convert_to<const volatile int&>(); member in namespace:dr59`
/external/python/cpython2/Lib/pydoc_data/
H A D	topics.py	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 "="\nexpression, 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\nDefault 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\nProgrammer\'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\nProgrammer\'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 classes, 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', 67 'strings': u'\nString literals\n**************\n\nString literals are described by the following lexical definitions:\n\n stringliteral ::= [stringprefix](shortstring \| longstring)\n stringprefix ::= "r" \| "u" \| "ur" \| "R" \| "U" \| "UR" \| "Ur" \| "uR"\n \| "b" \| "B" \| "br" \| "Br" \| "bR" \| "BR"\n shortstring ::= "\'" shortstringitem "\'" \| \'"\' shortstringitem* \'"\'\n longstring ::= "\'\'\'" longstringitem* "\'\'\'"\n \| \'"""\' longstringitem* \'"""\'\n shortstringitem ::= shortstringchar \| escapeseq\n longstringitem ::= longstringchar \| escapeseq\n shortstringchar ::= <any source character except "\\" or newline or the quote>\n longstringchar ::= <any source character except "\\">\n escapeseq ::= "\\" <any ASCII character>\n\nOne syntactic restriction not indicated by these productions is that\nwhitespace is not allowed between the "stringprefix" and the rest of\nthe string literal. The source character set is defined by the\nencoding declaration; it is ASCII if no encoding declaration is given\nin the source file; see section Encoding declarations.\n\nIn plain English: String literals can be enclosed in matching single\nquotes ("\'") or double quotes ("""). They can also be enclosed in\nmatching groups of three single or double quotes (these are generally\nreferred to as triple-quoted strings). The backslash ("\\")\ncharacter is used to escape characters that otherwise have a special\nmeaning, such as newline, backslash itself, or the quote character.\nString literals may optionally be prefixed with a letter "\'r\'" or\n"\'R\'"; such strings are called raw strings and use different rules\nfor interpreting backslash escape sequences. A prefix of "\'u\'" or\n"\'U\'" makes the string a Unicode string. Unicode strings use the\nUnicode character set as defined by the Unicode Consortium and ISO\n10646. Some additional escape sequences, described below, are\navailable in Unicode strings. A prefix of "\'b\'" or "\'B\'" is ignored in\nPython 2; it indicates that the literal should become a bytes literal\nin Python 3 (e.g. when code is automatically converted with 2to3). A\n"\'u\'" or "\'b\'" prefix may be followed by an "\'r\'" prefix.\n\nIn triple-quoted strings, unescaped newlines and quotes are allowed\n(and are retained), except that three unescaped quotes in a row\nterminate the string. (A "quote" is the character used to open the\nstring, i.e. either "\'" or """.)\n\nUnless an "\'r\'" or "\'R\'" prefix is present, escape sequences in\nstrings are interpreted according to rules similar to those used by\nStandard C. The recognized escape sequences are:\n\n+-------------------+-----------------------------------+---------+\n\| Escape Sequence \| Meaning \| Notes \|\n+===================+===================================+=========+\n\| "\\newline" \| Ignored \| \|\n+-------------------+-----------------------------------+---------+\n\| "\\\\" \| Backslash ("\\") \| \|\n+-------------------+-----------------------------------+---------+\n\| "\\\'" \| Single quote ("\'") \| \|\n+-------------------+-----------------------------------+---------+\n\| "\\"" \| Double quote (""") \| \|\n+-------------------+-----------------------------------+---------+\n\| "\\a" \| ASCII Bell (BEL) \| \|\n+-------------------+-----------------------------------+---------+\n\| "\\b" \| ASCII Backspace (BS) \| \|\n+-------------------+-----------------------------------+---------+\n\| "\\f" \| ASCII Formfeed (FF) \| \|\n+-------------------+-----------------------------------+---------+\n\| "\\n" \| ASCII Linefeed (LF) \| \|\n+-------------------+-----------------------------------+---------+\n\| "\\N{name}" \| Character named name in the \| \|\n\| \| Unicode database (Unicode only) \| \|\n+-------------------+-----------------------------------+---------+\n\| "\\r" \| ASCII Carriage Return (CR) \| \|\n+-------------------+-----------------------------------+---------+\n\| "\\t" \| ASCII Horizontal Tab (TAB) \| \|\n+-------------------+-----------------------------------+---------+\n\| "\\uxxxx" \| Character with 16-bit hex value \| (1) \|\n\| \| xxxx (Unicode only) \| \|\n+-------------------+-----------------------------------+---------+\n\| "\\Uxxxxxxxx" \| Character with 32-bit hex value \| (2) \|\n\| \| xxxxxxxx (Unicode only) \| \|\n+-------------------+-----------------------------------+---------+\n\| "\\v" \| ASCII Vertical Tab (VT) \| \|\n+-------------------+-----------------------------------+---------+\n\| "\\ooo" \| Character with octal value ooo \| (3,5) \|\n+-------------------+-----------------------------------+---------+\n\| "\\xhh" \| Character with hex value hh \| (4,5) \|\n+-------------------+-----------------------------------+---------+\n\nNotes:\n\n1. Individual code units which form parts of a surrogate pair can\n be encoded using this escape sequence.\n\n2. Any Unicode character can be encoded this way, but characters\n outside the Basic Multilingual Plane (BMP) will be encoded using a\n surrogate pair if Python is compiled to use 16-bit code units (the\n default).\n\n3. As in Standard C, up to three octal digits are accepted.\n\n4. Unlike in Standard C, exactly two hex digits are required.\n\n5. In a string literal, hexadecimal and octal escapes denote the\n byte with the given value; it is not necessary that the byte\n encodes a character in the source character set. In a Unicode\n literal, these escapes denote a Unicode character with the given\n value.\n\nUnlike Standard C, all unrecognized escape sequences are left in the\nstring unchanged, i.e., the backslash is left in the string. (This\nbehavior is useful when debugging: if an escape sequence is mistyped,\nthe resulting output is more easily recognized as broken.) It is also\nimportant to note that the escape sequences marked as "(Unicode only)"\nin the table above fall into the category of unrecognized escapes for\nnon-Unicode string literals.\n\nWhen an "\'r\'" or "\'R\'" prefix is present, a character following a\nbackslash is included in the string without change, and all\nbackslashes are left in the string. For example, the string literal\n"r"\\n"" consists of two characters: a backslash and a lowercase "\'n\'".\nString quotes can be escaped with a backslash, but the backslash\nremains in the string; for example, "r"\\""" is a valid string literal\nconsisting of two characters: a backslash and a double quote; "r"\\""\nis not a valid string literal (even a raw string cannot end in an odd\nnumber of backslashes). Specifically, a raw string cannot end in a\nsingle backslash (since the backslash would escape the following\nquote character). Note also that a single backslash followed by a\nnewline is interpreted as those two characters as part of the string,\nnot as a line continuation.\n\nWhen an "\'r\'" or "\'R\'" prefix is used in conjunction with a "\'u\'" or\n"\'U\'" prefix, then the "\\uXXXX" and "\\UXXXXXXXX" escape sequences are\nprocessed while all other backslashes are left in the string. For\nexample, the string literal "ur"\\u0062\\n"" consists of three Unicode\ncharacters: \'LATIN SMALL LETTER B\', \'REVERSE SOLIDUS\', and \'LATIN\nSMALL LETTER N\'. Backslashes can be escaped with a preceding\nbackslash; however, both remain in the string. As a result, "\\uXXXX"\nescape sequences are only recognized when there are an odd number of\nbackslashes.\n', 76 'typesseq': u'\nSequence Types --- "str", "unicode", "list", "tuple", "bytearray", "buffer", "xrange"\n************************************************************************************\n\nThere are seven sequence types: strings, Unicode strings, lists,\ntuples, bytearrays, buffers, and xrange objects.\n\nFor other containers see the built in "dict" and "set" classes, and\nthe "collections" module.\n\nString literals are written in single or double quotes: "\'xyzzy\'",\n""frobozz"". See String literals for more about string literals.\nUnicode strings are much like strings, but are specified in the syntax\nusing a preceding "\'u\'" character: "u\'abc\'", "u"def"". In addition to\nthe functionality described here, there are also string-specific\nmethods described in the String Methods section. Lists are constructed\nwith square brackets, separating items with commas: "[a, b, c]".\nTuples are constructed by the comma operator (not within square\nbrackets), with or without enclosing parentheses, but an empty tuple\nmust have the enclosing parentheses, such as "a, b, c" or "()". A\nsingle item tuple must have a trailing comma, such as "(d,)".\n\nBytearray objects are created with the built-in function\n"bytearray()".\n\nBuffer objects are not directly supported by Python syntax, but can be\ncreated by calling the built-in function "buffer()". They don\'t\nsupport concatenation or repetition.\n\nObjects of type xrange are similar to buffers in that there is no\nspecific syntax to create them, but they are created using the\n"xrange()" function. They don\'t support slicing, concatenation or\nrepetition, and using "in", "not in", "min()" or "max()" on them is\ninefficient.\n\nMost sequence types support the following operations. The "in" and\n"not in" operations have the same priorities as the comparison\noperations. The "+" and "" operations have the same priority as the\ncorresponding numeric operations. [3] Additional methods are provided\nfor Mutable Sequence Types.\n\nThis table lists the sequence operations sorted in ascending priority.\nIn the table, s and t are sequences of the same type; n, i and\nj are integers:\n\n+--------------------+----------------------------------+------------+\n\| Operation \| Result \| Notes \|\n+====================+==================================+============+\n\| "x in s" \| "True" if an item of s is \| (1) \|\n\| \| equal to x, else "False" \| \|\n+--------------------+----------------------------------+------------+\n\| "x not in s" \| "False" if an item of s is \| (1) \|\n\| \| equal to x, else "True" \| \|\n+--------------------+----------------------------------+------------+\n\| "s + t" \| the concatenation of s and t \| (6) \|\n+--------------------+----------------------------------+------------+\n\| "s * n, n * s" \| equivalent to adding s to \| (2) \|\n\| \| itself n times \| \|\n+--------------------+----------------------------------+------------+\n\| "s[i]" \| ith item of s, origin 0 \| (3) \|\n+--------------------+----------------------------------+------------+\n\| "s[i:j]" \| slice of s from i to j \| (3)(4) \|\n+--------------------+----------------------------------+------------+\n\| "s[i:j:k]" \| slice of s from i to j \| (3)(5) \|\n\| \| with step k \| \|\n+--------------------+----------------------------------+------------+\n\| "len(s)" \| length of s \| \|\n+--------------------+----------------------------------+------------+\n\| "min(s)" \| smallest item of s \| \|\n+--------------------+----------------------------------+------------+\n\| "max(s)" \| largest item of s \| \|\n+--------------------+----------------------------------+------------+\n\| "s.index(x)" \| index of the first occurrence of \| \|\n\| \| x in s \| \|\n+--------------------+----------------------------------+------------+\n\| "s.count(x)" \| total number of occurrences of \| \|\n\| \| x in s \| \|\n+--------------------+----------------------------------+------------+\n\nSequence types also support comparisons. In particular, tuples and\nlists are compared lexicographically by comparing corresponding\nelements. This means that to compare equal, every element must compare\nequal and the two sequences must be of the same type and have the same\nlength. (For full details see Comparisons in the language reference.)\n\nNotes:\n\n1. When s is a string or Unicode string object the "in" and "not\n in" operations act like a substring test. In Python versions\n before 2.3, x had to be a string of length 1. In Python 2.3 and\n beyond, x may be a string of any length.\n\n2. Values of n less than "0" are treated as "0" (which yields an\n empty sequence of the same type as s). Note that items in the\n sequence s are not copied; they are referenced multiple times.\n This often haunts new Python programmers; consider:\n\n >>> lists = [[]] * 3\n >>> lists\n [[], [], []]\n >>> lists[0].append(3)\n >>> lists\n [[3], [3], [3]]\n\n What has happened is that "[[]]" is a one-element list containing\n an empty list, so all three elements of "[[]] * 3" are references\n to this single empty list. Modifying any of the elements of\n "lists" modifies this single list. You can create a list of\n different lists this way:\n\n >>> lists = [[] for i in range(3)]\n >>> lists[0].append(3)\n >>> lists[1].append(5)\n >>> lists[2].append(7)\n >>> lists\n [[3], [5], [7]]\n\n Further explanation is available in the FAQ entry How do I create a\n multidimensional list?.\n\n3. If i or j is negative, the index is relative to the end of\n the string: "len(s) + i" or "len(s) + j" is substituted. But note\n that "-0" is still "0".\n\n4. The slice of s from i to j is defined as the sequence of\n items with index k such that "i <= k < j". If i or j is\n greater than "len(s)", use "len(s)". If i is omitted or "None",\n use "0". If j is omitted or "None", use "len(s)". If i is\n greater than or equal to j, the slice is empty.\n\n5. The slice of s from i to j with step k is defined as the\n sequence of items with index "x = i + nk" such that "0 <= n <\n (j-i)/k". In other words, the indices are "i", "i+k", "i+2k",\n "i+3k" and so on, stopping when j* is reached (but never\n including j). If i or j is greater than "len(s)", use\n "len(s)". If i or j are omitted or "None", they become "end"\n values (which end depends on the sign of k). Note, k cannot be\n zero. If k is "None", it is treated like "1".\n\n6. CPython implementation detail: If s and t are both\n strings, some Python implementations such as CPython can usually\n perform an in-place optimization for assignments of the form "s = s\n + t" or "s += t". When applicable, this optimization makes\n quadratic run-time much less likely. This optimization is both\n version and implementation dependent. For performance sensitive\n code, it is preferable to use the "str.join()" method which assures\n consistent linear concatenation performance across versions and\n implementations.\n\n Changed in version 2.4: Formerly, string concatenation never\n occurred in-place.\n\n\nString Methods\n==============\n\nBelow are listed the string methods which both 8-bit strings and\nUnicode objects support. Some of them are also available on\n"bytearray" objects.\n\nIn addition, Python\'s strings support the sequence type methods\ndescribed in the Sequence Types --- str, unicode, list, tuple,\nbytearray, buffer, xrange section. To output formatted strings use\ntemplate strings or the "%" operator described in the String\nFormatting Operations section. Also, see the "re" module for string\nfunctions based on regular expressions.\n\nstr.capitalize()\n\n Return a copy of the string with its first character capitalized\n and the rest lowercased.\n\n For 8-bit strings, this method is locale-dependent.\n\nstr.center(width[, fillchar])\n\n Return centered in a string of length width. Padding is done\n using the specified fillchar (default is a space).\n\n Changed in version 2.4: Support for the fillchar argument.\n\nstr.count(sub[, start[, end]])\n\n Return the number of non-overlapping occurrences of substring sub\n in the range [start, end]. Optional arguments start and\n end are interpreted as in slice notation.\n\nstr.decode([encoding[, errors]])\n\n Decodes the string using the codec registered for encoding.\n encoding defaults to the default string encoding. errors may\n be given to set a different error handling scheme. The default is\n "\'strict\'", meaning that encoding errors raise "UnicodeError".\n Other possible values are "\'ignore\'", "\'replace\'" and any other\n name registered via "codecs.register_error()", see section Codec\n Base Classes.\n\n New in version 2.2.\n\n Changed in version 2.3: Support for other error handling schemes\n added.\n\n Changed in version 2.7: Support for keyword arguments added.\n\nstr.encode([encoding[, errors]])\n\n Return an encoded version of the string. Default encoding is the\n current default string encoding. errors may be given to set a\n different error handling scheme. The default for errors is\n "\'strict\'", meaning that encoding errors raise a "UnicodeError".\n Other possible values are "\'ignore\'", "\'replace\'",\n "\'xmlcharrefreplace\'", "\'backslashreplace\'" and any other name\n registered via "codecs.register_error()", see section Codec Base\n Classes. For a list of possible encodings, see section Standard\n Encodings.\n\n New in version 2.0.\n\n Changed in version 2.3: Support for "\'xmlcharrefreplace\'" and\n "\'backslashreplace\'" and other error handling schemes added.\n\n Changed in version 2.7: Support for keyword arguments added.\n\nstr.endswith(suffix[, start[, end]])\n\n Return "True" if the string ends with the specified suffix,\n otherwise return "False". suffix can also be a tuple of suffixes\n to look for. With optional start, test beginning at that\n position. With optional end, stop comparing at that position.\n\n Changed in version 2.5: Accept tuples as suffix.\n\nstr.expandtabs([tabsize])\n\n Return a copy of the string where all tab characters are replaced\n by one or more spaces, depending on the current column and the\n given tab size. Tab positions occur every tabsize characters\n (default is 8, giving tab positions at columns 0, 8, 16 and so on).\n To expand the string, the current column is set to zero and the\n string is examined character by character. If the character is a\n tab ("\\t"), one or more space characters are inserted in the result\n until the current column is equal to the next tab position. (The\n tab character itself is not copied.) If the character is a newline\n ("\\n") or return ("\\r"), it is copied and the current column is\n reset to zero. Any other character is copied unchanged and the\n current column is incremented by one regardless of how the\n character is represented when printed.\n\n >>> \'01\\t012\\t0123\\t01234\'.expandtabs()\n \'01 012 0123 01234\'\n >>> \'01\\t012\\t0123\\t01234\'.expandtabs(4)\n \'01 012 0123 01234\'\n\nstr.find(sub[, start[, end]])\n\n Return the lowest index in the string where substring sub is\n found within the slice "s[start:end]". Optional arguments start\n and end are interpreted as in slice notation. Return "-1" if\n sub is not found.\n\n Note: The "find()" method should be used only if you need to know\n the position of sub. To check if sub is a substring or not,\n use the "in" operator:\n\n >>> \'Py\' in \'Python\'\n True\n\nstr.format(args, kwargs)\n\n Perform a string formatting operation. The string on which this\n method is called can contain literal text or replacement fields\n delimited by braces "{}". Each replacement field contains either\n the numeric index of a positional argument, or the name of a\n keyword argument. Returns a copy of the string where each\n replacement field is replaced with the string value of the\n corresponding argument.\n\n >>> "The sum of 1 + 2 is {0}".format(1+2)\n \'The sum of 1 + 2 is 3\'\n\n See Format String Syntax for a description of the various\n formatting options that can be specified in format strings.\n\n This method of string formatting is the new standard in Python 3,\n and should be preferred to the "%" formatting described in String\n Formatting Operations in new code.\n\n New in version 2.6.\n\nstr.index(sub[, start[, end]])\n\n Like "find()", but raise "ValueError" when the substring is not\n found.\n\nstr.isalnum()\n\n Return true if all characters in the string are alphanumeric and\n there is at least one character, false otherwise.\n\n For 8-bit strings, this method is locale-dependent.\n\nstr.isalpha()\n\n Return true if all characters in the string are alphabetic and\n there is at least one character, false otherwise.\n\n For 8-bit strings, this method is locale-dependent.\n\nstr.isdigit()\n\n Return true if all characters in the string are digits and there is\n at least one character, false otherwise.\n\n For 8-bit strings, this method is locale-dependent.\n\nstr.islower()\n\n Return true if all cased characters [4] in the string are lowercase\n and there is at least one cased character, false otherwise.\n\n For 8-bit strings, this method is locale-dependent.\n\nstr.isspace()\n\n Return true if there are only whitespace characters in the string\n and there is at least one character, false otherwise.\n\n For 8-bit strings, this method is locale-dependent.\n\nstr.istitle()\n\n Return true if the string is a titlecased string and there is at\n least one character, for example uppercase characters may only\n follow uncased characters and lowercase characters only cased ones.\n Return false otherwise.\n\n For 8-bit strings, this method is locale-dependent.\n\nstr.isupper()\n\n Return true if all cased characters [4] in the string are uppercase\n and there is at least one cased character, false otherwise.\n\n For 8-bit strings, this method is locale-dependent.\n\nstr.join(iterable)\n\n Return a string which is the concatenation of the strings in the\n iterable* iterable. The separator between elements is the\n string providing this method.\n\nstr.ljust(width[, fillchar])\n\n Return the string left justified in a string of length width.\n Padding is done using the specified fillchar (default is a\n space). The original string is returned if width is less than or\n equal to "len(s)".\n\n Changed in version 2.4: Support for the fillchar argument.\n\nstr.lower()\n\n Return a copy of the string with all the cased characters [4]\n converted to lowercase.\n\n For 8-bit strings, this method is locale-dependent.\n\nstr.lstrip([chars])\n\n Return a copy of the string with leading characters removed. The\n chars argument is a string specifying the set of characters to be\n removed. If omitted or "None", the chars argument defaults to\n removing whitespace. The chars argument is not a prefix; rather,\n all combinations of its values are stripped:\n\n >>> \' spacious \'.lstrip()\n \'spacious \'\n >>> \'www.example.com\'.lstrip(\'cmowz.\')\n \'example.com\'\n\n Changed in version 2.2.2: Support for the chars argument.\n\nstr.partition(sep)\n\n Split the string at the first occurrence of sep, and return a\n 3-tuple containing the part before the separator, the separator\n itself, and the part after the separator. If the separator is not\n found, return a 3-tuple containing the string itself, followed by\n two empty strings.\n\n New in version 2.5.\n\nstr.replace(old, new[, count])\n\n Return a copy of the string with all occurrences of substring old\n replaced by new. If the optional argument count is given, only\n the first count occurrences are replaced.\n\nstr.rfind(sub[, start[, end]])\n\n Return the highest index in the string where substring sub is\n found, such that sub is contained within "s[start:end]".\n Optional arguments start and end are interpreted as in slice\n notation. Return "-1" on failure.\n\nstr.rindex(sub[, start[, end]])\n\n Like "rfind()" but raises "ValueError" when the substring sub is\n not found.\n\nstr.rjust(width[, fillchar])\n\n Return the string right justified in a string of length width.\n Padding is done using the specified fillchar (default is a\n space). The original string is returned if width is less than or\n equal to "len(s)".\n\n Changed in version 2.4: Support for the fillchar argument.\n\nstr.rpartition(sep)\n\n Split the string at the last occurrence of sep, and return a\n 3-tuple containing the part before the separator, the separator\n itself, and the part after the separator. If the separator is not\n found, return a 3-tuple containing two empty strings, followed by\n the string itself.\n\n New in version 2.5.\n\nstr.rsplit([sep[, maxsplit]])\n\n Return a list of the words in the string, using sep as the\n delimiter string. If maxsplit is given, at most maxsplit splits\n are done, the rightmost ones. If sep is not specified or\n "None", any whitespace string is a separator. Except for splitting\n from the right, "rsplit()" behaves like "split()" which is\n described in detail below.\n\n New in version 2.4.\n\nstr.rstrip([chars])\n\n Return a copy of the string with trailing characters removed. The\n chars argument is a string specifying the set of characters to be\n removed. If omitted or "None", the chars argument defaults to\n removing whitespace. The chars argument is not a suffix; rather,\n all combinations of its values are stripped:\n\n >>> \' spacious \'.rstrip()\n \' spacious\'\n >>> \'mississippi\'.rstrip(\'ipz\')\n \'mississ\'\n\n Changed in version 2.2.2: Support for the chars argument.\n\nstr.split([sep[, maxsplit]])\n\n Return a list of the words in the string, using sep as the\n delimiter string. If maxsplit is given, at most maxsplit\n splits are done (thus, the list will have at most "maxsplit+1"\n elements). If maxsplit is not specified or "-1", then there is\n no limit on the number of splits (all possible splits are made).\n\n If sep is given, consecutive delimiters are not grouped together\n and are deemed to delimit empty strings (for example,\n "\'1,,2\'.split(\',\')" returns "[\'1\', \'\', \'2\']"). The sep argument\n may consist of multiple characters (for example,\n "\'1<>2<>3\'.split(\'<>\')" returns "[\'1\', \'2\', \'3\']"). Splitting an\n empty string with a specified separator returns "[\'\']".\n\n If sep is not specified or is "None", a different splitting\n algorithm is applied: runs of consecutive whitespace are regarded\n as a single separator, and the result will contain no empty strings\n at the start or end if the string has leading or trailing\n whitespace. Consequently, splitting an empty string or a string\n consisting of just whitespace with a "None" separator returns "[]".\n\n For example, "\' 1 2 3 \'.split()" returns "[\'1\', \'2\', \'3\']", and\n "\' 1 2 3 \'.split(None, 1)" returns "[\'1\', \'2 3 \']".\n\nstr.splitlines([keepends])\n\n Return a list of the lines in the string, breaking at line\n boundaries. This method uses the universal newlines approach to\n splitting lines. Line breaks are not included in the resulting list\n unless keepends is given and true.\n\n Python recognizes ""\\r"", ""\\n"", and ""\\r\\n"" as line boundaries\n for 8-bit strings.\n\n For example:\n\n >>> \'ab c\\n\\nde fg\\rkl\\r\\n\'.splitlines()\n [\'ab c\', \'\', \'de fg\', \'kl\']\n >>> \'ab c\\n\\nde fg\\rkl\\r\\n\'.splitlines(True)\n [\'ab c\\n\', \'\\n\', \'de fg\\r\', \'kl\\r\\n\']\n\n Unlike "split()" when a delimiter string sep is given, this\n method returns an empty list for the empty string, and a terminal\n line break does not result in an extra line:\n\n >>> "".splitlines()\n []\n >>> "One line\\n".splitlines()\n [\'One line\']\n\n For comparison, "split(\'\\n\')" gives:\n\n >>> \'\'.split(\'\\n\')\n [\'\']\n >>> \'Two lines\\n\'.split(\'\\n\')\n [\'Two lines\', \'\']\n\nunicode.splitlines([keepends])\n\n Return a list of the lines in the string, like "str.splitlines()".\n However, the Unicode method splits on the following line\n boundaries, which are a superset of the universal newlines\n recognized for 8-bit strings.\n\n +-------------------------+-------------------------------+\n \| Representation \| Description \|\n +=========================+===============================+\n \| "\\n" \| Line Feed \|\n +-------------------------+-------------------------------+\n \| "\\r" \| Carriage Return \|\n +-------------------------+-------------------------------+\n \| "\\r\\n" \| Carriage Return + Line Feed \|\n +-------------------------+-------------------------------+\n \| "\\v" or "\\x0b" \| Line Tabulation \|\n +-------------------------+-------------------------------+\n \| "\\f" or "\\x0c" \| Form Feed \|\n +-------------------------+-------------------------------+\n \| "\\x1c" \| File Separator \|\n +-------------------------+-------------------------------+\n \| "\\x1d" \| Group Separator \|\n +-------------------------+-------------------------------+\n \| "\\x1e" \| Record Separator \|\n +-------------------------+-------------------------------+\n \| "\\x85" \| Next Line (C1 Control Code) \|\n +-------------------------+-------------------------------+\n \| "\\u2028" \| Line Separator \|\n +-------------------------+-------------------------------+\n \| "\\u2029" \| Paragraph Separator \|\n +-------------------------+-------------------------------+\n\n Changed in version 2.7: "\\v" and "\\f" added to list of line\n boundaries.\n\nstr.startswith(prefix[, start[, end]])\n\n Return "True" if string starts with the prefix, otherwise return\n "False". prefix can also be a tuple of prefixes to look for.\n With optional start, test string beginning at that position.\n With optional end, stop comparing string at that position.\n\n Changed in version 2.5: Accept tuples as prefix.\n\nstr.strip([chars])\n\n Return a copy of the string with the leading and trailing\n characters removed. The chars argument is a string specifying the\n set of characters to be removed. If omitted or "None", the chars\n argument defaults to removing whitespace. The chars argument is\n not a prefix or suffix; rather, all combinations of its values are\n stripped:\n\n >>> \' spacious \'.strip()\n \'spacious\'\n >>> \'www.example.com\'.strip(\'cmowz.\')\n \'example\'\n\n Changed in version 2.2.2: Support for the chars argument.\n\nstr.swapcase()\n\n Return a copy of the string with uppercase characters converted to\n lowercase and vice versa.\n\n For 8-bit strings, this method is locale-dependent.\n\nstr.title()\n\n Return a titlecased version of the string where words start with an\n uppercase character and the remaining characters are lowercase.\n\n The algorithm uses a simple language-independent definition of a\n word as groups of consecutive letters. The definition works in\n many contexts but it means that apostrophes in contractions and\n possessives form word boundaries, which may not be the desired\n result:\n\n >>> "they\'re bill\'s friends from the UK".title()\n "They\'Re Bill\'S Friends From The Uk"\n\n A workaround for apostrophes can be constructed using regular\n expressions:\n\n >>> import re\n >>> def titlecase(s):\n ... return re.sub(r"[A-Za-z]+(\'[A-Za-z]+)?",\n ... lambda mo: mo.group(0)[0].upper() +\n ... mo.group(0)[1:].lower(),\n ... s)\n ...\n >>> titlecase("they\'re bill\'s friends.")\n "They\'re Bill\'s Friends."\n\n For 8-bit strings, this method is locale-dependent.\n\nstr.translate(table[, deletechars])\n\n Return a copy of the string where all characters occurring in the\n optional argument deletechars are removed, and the remaining\n characters have been mapped through the given translation table,\n which must be a string of length 256.\n\n You can use the "maketrans()" helper function in the "string"\n module to create a translation table. For string objects, set the\n table argument to "None" for translations that only delete\n characters:\n\n >>> \'read this short text\'.translate(None, \'aeiou\')\n \'rd ths shrt txt\'\n\n New in version 2.6: Support for a "None" table argument.\n\n For Unicode objects, the "translate()" method does not accept the\n optional deletechars argument. Instead, it returns a copy of the\n s where all characters have been mapped through the given\n translation table which must be a mapping of Unicode ordinals to\n Unicode ordinals, Unicode strings or "None". Unmapped characters\n are left untouched. Characters mapped to "None" are deleted. Note,\n a more flexible approach is to create a custom character mapping\n codec using the "codecs" module (see "encodings.cp1251" for an\n example).\n\nstr.upper()\n\n Return a copy of the string with all the cased characters [4]\n converted to uppercase. Note that "str.upper().isupper()" might be\n "False" if "s" contains uncased characters or if the Unicode\n category of the resulting character(s) is not "Lu" (Letter,\n uppercase), but e.g. "Lt" (Letter, titlecase).\n\n For 8-bit strings, this method is locale-dependent.\n\nstr.zfill(width)\n\n Return the numeric string left filled with zeros in a string of\n length width. A sign prefix is handled correctly. The original\n string is returned if width is less than or equal to "len(s)".\n\n New in version 2.2.2.\n\nThe following methods are present only on unicode objects:\n\nunicode.isnumeric()\n\n Return "True" if there are only numeric characters in S, "False"\n otherwise. Numeric characters include digit characters, and all\n characters that have the Unicode numeric value property, e.g.\n U+2155, VULGAR FRACTION ONE FIFTH.\n\nunicode.isdecimal()\n\n Return "True" if there are only decimal characters in S, "False"\n otherwise. Decimal characters include digit characters, and all\n characters that can be used to form decimal-radix numbers, e.g.\n U+0660, ARABIC-INDIC DIGIT ZERO.\n\n\nString Formatting Operations\n============================\n\nString and Unicode objects have one unique built-in operation: the "%"\noperator (modulo). This is also known as the string formatting or\ninterpolation operator. Given "format % values" (where format is\na string or Unicode object), "%" conversion specifications in format\nare replaced with zero or more elements of values. The effect is\nsimilar to the using "sprintf()" in the C language. If format is a\nUnicode object, or if any of the objects being converted using the\n"%s" conversion are Unicode objects, the result will also be a Unicode\nobject.\n\nIf format requires a single argument, values may be a single non-\ntuple object. [5] Otherwise, values must be a tuple with exactly\nthe number of items specified by the format string, or a single\nmapping object (for example, a dictionary).\n\nA conversion specifier contains two or more characters and has the\nfollowing components, which must occur in this order:\n\n1. The "\'%\'" character, which marks the start of the specifier.\n\n2. Mapping key (optional), consisting of a parenthesised sequence\n of characters (for example, "(somename)").\n\n3. Conversion flags (optional), which affect the result of some\n conversion types.\n\n4. Minimum field width (optional). If specified as an "\'\'"\n (asterisk), the actual width is read from the next element of the\n tuple in values, and the object to convert comes after the\n minimum field width and optional precision.\n\n5. Precision (optional), given as a "\'.\'" (dot) followed by the\n precision. If specified as "\'\'" (an asterisk), the actual width\n is read from the next element of the tuple in values, and the\n value to convert comes after the precision.\n\n6. Length modifier (optional).\n\n7. Conversion type.\n\nWhen the right argument is a dictionary (or other mapping type), then\nthe formats in the string must include a parenthesised mapping key\ninto that dictionary inserted immediately after the "\'%\'" character.\nThe mapping key selects the value to be formatted from the mapping.\nFor example:\n\n>>> print \'%(language)s has %(number)03d quote types.\' % \\\n... {"language": "Python", "number": 2}\nPython has 002 quote types.\n\nIn this case no "" specifiers may occur in a format (since they\nrequire a sequential parameter list).\n\nThe conversion flag characters are:\n\n+-----------+-----------------------------------------------------------------------+\n\| Flag \| Meaning \|\n+===========+=======================================================================+\n\| "\'#\'" \| The value conversion will use the "alternate form" (where defined \|\n\| \| below). \|\n+-----------+-----------------------------------------------------------------------+\n\| "\'0\'" \| The conversion will be zero padded for numeric values. \|\n+-----------+-----------------------------------------------------------------------+\n\| "\'-\'" \| The converted value is left adjusted (overrides the "\'0\'" conversion \|\n\| \| if both are given). \|\n+-----------+-----------------------------------------------------------------------+\n\| "\' \'" \| (a space) A blank should be left before a positive number (or empty \|\n\| \| string) produced by a signed conversion. \|\n+-----------+-----------------------------------------------------------------------+\n\| "\'+\'" \| A sign character ("\'+\'" or "\'-\'") will precede the conversion \|\n\| \| (overrides a "space" flag). \|\n+-----------+-----------------------------------------------------------------------+\n\nA length modifier ("h", "l", or "L") may be present, but is ignored as\nit is not necessary for Python -- so e.g. "%ld" is identical to "%d".\n\nThe conversion types are:\n\n+--------------+-------------------------------------------------------+---------+\n\| Conversion \| Meaning \| Notes \|\n+==============+=======================================================+=========+\n\| "\'d\'" \| Signed integer decimal. \| \|\n+--------------+-------------------------------------------------------+---------+\n\| "\'i\'" \| Signed integer decimal. \| \|\n+--------------+-------------------------------------------------------+---------+\n\| "\'o\'" \| Signed octal value. \| (1) \|\n+--------------+-------------------------------------------------------+---------+\n\| "\'u\'" \| Obsolete type -- it is identical to "\'d\'". \| (7) \|\n+--------------+-------------------------------------------------------+---------+\n\| "\'x\'" \| Signed hexadecimal (lowercase). \| (2) \|\n+--------------+-------------------------------------------------------+---------+\n\| "\'X\'" \| Signed hexadecimal (uppercase). \| (2) \|\n+--------------+-------------------------------------------------------+---------+\n\| "\'e\'" \| Floating point exponential format (lowercase). \| (3) \|\n+--------------+-------------------------------------------------------+---------+\n\| "\'E\'" \| Floating point exponential format (uppercase). \| (3) \|\n+--------------+-------------------------------------------------------+---------+\n\| "\'f\'" \| Floating point decimal format. \| (3) \|\n+--------------+-------------------------------------------------------+---------+\n\| "\'F\'" \| Floating point decimal format. \| (3) \|\n+--------------+-------------------------------------------------------+---------+\n\| "\'g\'" \| Floating point format. Uses lowercase exponential \| (4) \|\n\| \| format if exponent is less than -4 or not less than \| \|\n\| \| precision, decimal format otherwise. \| \|\n+--------------+-------------------------------------------------------+---------+\n\| "\'G\'" \| Floating point format. Uses uppercase exponential \| (4) \|\n\| \| format if exponent is less than -4 or not less than \| \|\n\| \| precision, decimal format otherwise. \| \|\n+--------------+-------------------------------------------------------+---------+\n\| "\'c\'" \| Single character (accepts integer or single character \| \|\n\| \| string). \| \|\n+--------------+-------------------------------------------------------+---------+\n\| "\'r\'" \| String (converts any Python object using repr()). \| (5) \|\n+--------------+-------------------------------------------------------+---------+\n\| "\'s\'" \| String (converts any Python object using "str()"). \| (6) \|\n+--------------+-------------------------------------------------------+---------+\n\| "\'%\'" \| No argument is converted, results in a "\'%\'" \| \|\n\| \| character in the result. \| \|\n+--------------+-------------------------------------------------------+---------+\n\nNotes:\n\n1. The alternate form causes a leading zero ("\'0\'") to be inserted\n between left-hand padding and the formatting of the number if the\n leading character of the result is not already a zero.\n\n2. The alternate form causes a leading "\'0x\'" or "\'0X\'" (depending\n on whether the "\'x\'" or "\'X\'" format was used) to be inserted\n between left-hand padding and the formatting of the number if the\n leading character of the result is not already a zero.\n\n3. The alternate form causes the result to always contain a decimal\n point, even if no digits follow it.\n\n The precision determines the number of digits after the decimal\n point and defaults to 6.\n\n4. The alternate form causes the result to always contain a decimal\n point, and trailing zeroes are not removed as they would otherwise\n be.\n\n The precision determines the number of significant digits before\n and after the decimal point and defaults to 6.\n\n5. The "%r" conversion was added in Python 2.0.\n\n The precision determines the maximal number of characters used.\n\n6. If the object or format provided is a "unicode" string, the\n resulting string will also be "unicode".\n\n The precision determines the maximal number of characters used.\n\n7. See PEP 237.\n\nSince Python strings have an explicit length, "%s" conversions do not\nassume that "\'\\0\'" is the end of the string.\n\nChanged in version 2.7: "%f" conversions for numbers whose absolute\nvalue is over 1e50 are no longer replaced by "%g" conversions.\n\nAdditional string operations are defined in standard modules "string"\nand "re".\n\n\nXRange Type\n===========\n\nThe "xrange" type is an immutable sequence which is commonly used for\nlooping. The advantage of the "xrange" type is that an "xrange"\nobject will always take the same amount of memory, no matter the size\nof the range it represents. There are no consistent performance\nadvantages.\n\nXRange objects have very little behavior: they only support indexing,\niteration, and the "len()" function.\n\n\nMutable Sequence Types\n======================\n\nList and "bytearray" objects support additional operations that allow\nin-place modification of the object. Other mutable sequence types\n(when added to the language) should also support these operations.\nStrings and tuples are immutable sequence types: such objects cannot\nbe modified once created. The following operations are defined on\nmutable sequence types (where x* is an arbitrary object):\n\n+--------------------------------+----------------------------------+-----------------------+\n\| Operation \| Result \| Notes \|\n+================================+==================================+=======================+\n\| "s[i] = x" \| item i of s is replaced by \| \|\n\| \| x \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s[i:j] = t" \| slice of s from i to j is \| \|\n\| \| replaced by the contents of the \| \|\n\| \| iterable t \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "del s[i:j]" \| same as "s[i:j] = []" \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s[i:j:k] = t" \| the elements of "s[i:j:k]" are \| (1) \|\n\| \| replaced by those of t \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "del s[i:j:k]" \| removes the elements of \| \|\n\| \| "s[i:j:k]" from the list \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.append(x)" \| same as "s[len(s):len(s)] = [x]" \| (2) \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.extend(t)" or "s += t" \| for the most part the same as \| (3) \|\n\| \| "s[len(s):len(s)] = t" \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s = n" \| updates s* with its contents \| (11) \|\n\| \| repeated n times \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.count(x)" \| return number of i\'s for which \| \|\n\| \| "s[i] == x" \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.index(x[, i[, j]])" \| return smallest k such that \| (4) \|\n\| \| "s[k] == x" and "i <= k < j" \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.insert(i, x)" \| same as "s[i:i] = [x]" \| (5) \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.pop([i])" \| same as "x = s[i]; del s[i]; \| (6) \|\n\| \| return x" \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.remove(x)" \| same as "del s[s.index(x)]" \| (4) \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.reverse()" \| reverses the items of s in \| (7) \|\n\| \| place \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.sort([cmp[, key[, \| sort the items of s in place \| (7)(8)(9)(10) \|\n\| reverse]]])" \| \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\nNotes:\n\n1. t must have the same length as the slice it is replacing.\n\n2. The C implementation of Python has historically accepted\n multiple parameters and implicitly joined them into a tuple; this\n no longer works in Python 2.0. Use of this misfeature has been\n deprecated since Python 1.4.\n\n3. t can be any iterable object.\n\n4. Raises "ValueError" when x is not found in s. When a\n negative index is passed as the second or third parameter to the\n "index()" method, the list length is added, as for slice indices.\n If it is still negative, it is truncated to zero, as for slice\n indices.\n\n Changed in version 2.3: Previously, "index()" didn\'t have arguments\n for specifying start and stop positions.\n\n5. When a negative index is passed as the first parameter to the\n "insert()" method, the list length is added, as for slice indices.\n If it is still negative, it is truncated to zero, as for slice\n indices.\n\n Changed in version 2.3: Previously, all negative indices were\n truncated to zero.\n\n6. The "pop()" method\'s optional argument i defaults to "-1", so\n that by default the last item is removed and returned.\n\n7. The "sort()" and "reverse()" methods modify the list in place\n for economy of space when sorting or reversing a large list. To\n remind you that they operate by side effect, they don\'t return the\n sorted or reversed list.\n\n8. The "sort()" method takes optional arguments for controlling the\n comparisons.\n\n cmp specifies a custom comparison function of two arguments (list\n items) which should return a negative, zero or positive number\n depending on whether the first argument is considered smaller than,\n equal to, or larger than the second argument: "cmp=lambda x,y:\n cmp(x.lower(), y.lower())". The default value is "None".\n\n key specifies a function of one argument that is used to extract\n a comparison key from each list element: "key=str.lower". The\n default value is "None".\n\n reverse is a boolean value. If set to "True", then the list\n elements are sorted as if each comparison were reversed.\n\n In general, the key and reverse conversion processes are much\n faster than specifying an equivalent cmp function. This is\n because cmp is called multiple times for each list element while\n key and reverse touch each element only once. Use\n "functools.cmp_to_key()" to convert an old-style cmp function to\n a key function.\n\n Changed in version 2.3: Support for "None" as an equivalent to\n omitting cmp was added.\n\n Changed in version 2.4: Support for key and reverse was added.\n\n9. Starting with Python 2.3, the "sort()" method is guaranteed to\n be stable. A sort is stable if it guarantees not to change the\n relative order of elements that compare equal --- this is helpful\n for sorting in multiple passes (for example, sort by department,\n then by salary grade).\n\n10. CPython implementation detail: While a list is being\n sorted, the effect of attempting to mutate, or even inspect, the\n list is undefined. The C implementation of Python 2.3 and newer\n makes the list appear empty for the duration, and raises\n "ValueError" if it can detect that the list has been mutated\n during a sort.\n\n11. The value n is an integer, or an object implementing\n "__index__()". Zero and negative values of n clear the\n sequence. Items in the sequence are not copied; they are\n referenced multiple times, as explained for "s * n" under Sequence\n Types --- str, unicode, list, tuple, bytearray, buffer, xrange.\n', 77 'typesseq-mutable': u'\nMutable Sequence Types\n*********************\n\nList and "bytearray" objects support additional operations that allow\nin-place modification of the object. Other mutable sequence types\n(when added to the language) should also support these operations.\nStrings and tuples are immutable sequence types: such objects cannot\nbe modified once created. The following operations are defined on\nmutable sequence types (where x* is an arbitrary object):\n\n+--------------------------------+----------------------------------+-----------------------+\n\| Operation \| Result \| Notes \|\n+================================+==================================+=======================+\n\| "s[i] = x" \| item i of s is replaced by \| \|\n\| \| x \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s[i:j] = t" \| slice of s from i to j is \| \|\n\| \| replaced by the contents of the \| \|\n\| \| iterable t \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "del s[i:j]" \| same as "s[i:j] = []" \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s[i:j:k] = t" \| the elements of "s[i:j:k]" are \| (1) \|\n\| \| replaced by those of t \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "del s[i:j:k]" \| removes the elements of \| \|\n\| \| "s[i:j:k]" from the list \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.append(x)" \| same as "s[len(s):len(s)] = [x]" \| (2) \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.extend(t)" or "s += t" \| for the most part the same as \| (3) \|\n\| \| "s[len(s):len(s)] = t" \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s = n" \| updates s* with its contents \| (11) \|\n\| \| repeated n times \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.count(x)" \| return number of i\'s for which \| \|\n\| \| "s[i] == x" \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.index(x[, i[, j]])" \| return smallest k such that \| (4) \|\n\| \| "s[k] == x" and "i <= k < j" \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.insert(i, x)" \| same as "s[i:i] = [x]" \| (5) \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.pop([i])" \| same as "x = s[i]; del s[i]; \| (6) \|\n\| \| return x" \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.remove(x)" \| same as "del s[s.index(x)]" \| (4) \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.reverse()" \| reverses the items of s in \| (7) \|\n\| \| place \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\| "s.sort([cmp[, key[, \| sort the items of s in place \| (7)(8)(9)(10) \|\n\| reverse]]])" \| \| \|\n+--------------------------------+----------------------------------+-----------------------+\n\nNotes:\n\n1. t must have the same length as the slice it is replacing.\n\n2. The C implementation of Python has historically accepted\n multiple parameters and implicitly joined them into a tuple; this\n no longer works in Python 2.0. Use of this misfeature has been\n deprecated since Python 1.4.\n\n3. t can be any iterable object.\n\n4. Raises "ValueError" when x is not found in s. When a\n negative index is passed as the second or third parameter to the\n "index()" method, the list length is added, as for slice indices.\n If it is still negative, it is truncated to zero, as for slice\n indices.\n\n Changed in version 2.3: Previously, "index()" didn\'t have arguments\n for specifying start and stop positions.\n\n5. When a negative index is passed as the first parameter to the\n "insert()" method, the list length is added, as for slice indices.\n If it is still negative, it is truncated to zero, as for slice\n indices.\n\n Changed in version 2.3: Previously, all negative indices were\n truncated to zero.\n\n6. The "pop()" method\'s optional argument i defaults to "-1", so\n that by default the last item is removed and returned.\n\n7. The "sort()" and "reverse()" methods modify the list in place\n for economy of space when sorting or reversing a large list. To\n remind you that they operate by side effect, they don\'t return the\n sorted or reversed list.\n\n8. The "sort()" method takes optional arguments for controlling the\n comparisons.\n\n cmp specifies a custom comparison function of two arguments (list\n items) which should return a negative, zero or positive number\n depending on whether the first argument is considered smaller than,\n equal to, or larger than the second argument: "cmp=lambda x,y:\n cmp(x.lower(), y.lower())". The default value is "None".\n\n key specifies a function of one argument that is used to extract\n a comparison key from each list element: "key=str.lower". The\n default value is "None".\n\n reverse is a boolean value. If set to "True", then the list\n elements are sorted as if each comparison were reversed.\n\n In general, the key and reverse conversion processes are much\n faster than specifying an equivalent cmp function. This is\n because cmp is called multiple times for each list element while\n key and reverse touch each element only once. Use\n "functools.cmp_to_key()" to convert an old-style cmp function to\n a key function.\n\n Changed in version 2.3: Support for "None" as an equivalent to\n omitting cmp was added.\n\n Changed in version 2.4: Support for key and reverse was added.\n\n9. Starting with Python 2.3, the "sort()" method is guaranteed to\n be stable. A sort is stable if it guarantees not to change the\n relative order of elements that compare equal --- this is helpful\n for sorting in multiple passes (for example, sort by department,\n then by salary grade).\n\n10. CPython implementation detail: While a list is being\n sorted, the effect of attempting to mutate, or even inspect, the\n list is undefined. The C implementation of Python 2.3 and newer\n makes the list appear empty for the duration, and raises\n "ValueError" if it can detect that the list has been mutated\n during a sort.\n\n11. The value n is an integer, or an object implementing\n "__index__()". Zero and negative values of n clear the\n sequence. Items in the sequence are not copied; they are\n referenced multiple times, as explained for "s * n" under Sequence\n Types --- str, unicode, list, tuple, bytearray, buffer, xrange.\n', 80 'with': u'\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',
/external/llvm/unittests/IR/
H A D	MetadataTest.cpp	`193 MDNode *n5 = MDNode::getIfExists(Context, c1); local 198 EXPECT_EQ(n5, n2);`
/external/webrtc/data/voice_engine/stereo_rtp_files/
H A D	toggling_stereo_g729_pt18_pt125.rtp	14 �M��ڽTRr�$��I��X�s�Y�6G�G�\|�%�%I��X�"�vʐ��&�uI��Xp�C!랇P_��'��I��X�k�^g΀H��(�I��X�R�4x� p�p��)�eI��X�((����I��X�r͞m��C�s��+� I��X貑<!n5�1�,� UI��X��$��3�̀-� �I��Xh"�g�YPt�:ր.� �I��X��&��/�!EI��X=�J�Hqd;��0�!�I��X� T� �5a�1�!�I��X1�Ⱥ?��2�"5I��X��C,E�3�"�I��X�rإw[��4�"�I��X��Z�@��5�#%I��Xp�D��H&�6�#uI��Xq��a�0�7�#�I��X��o��ǆ��:�8�$I��XyN�q7(�$D�9�$eI��X��MԮ�F��N�:�$�I��X��d��2�OX�;�%I��X��T8%�� >b�<�%UI��X)��{t�S9��l�=�%�I��X�� v�>�%�I��XM��#1��?�&EI��XM��@�0�BY��@�&�I��X�3��y�>s��A�&�I��X��֛����B�'5I��X!2�<��q�$��C�'�I��XN��6 ��D�'�I��X'R��)�C��E�(%I��X�;Y� 1966 �( c��},�1�I��Xؚe�1fc�ؚe�1fc�( c�},�2I��Xp��w��&\|p��w��&\|( d�},�2eI��X��U�Ew��U�Ew�( d�},�2�I��X\53�F�r.p\53�F�r.p( d�},�3I��X\|�n5p��\|�n5p��( d"�},�3UI��Xi��Z�{i��Z�{( d,�},�3�I��X�'���.�'���.�( d6�},�3�I��X�],��d8�],��d8( d@�},�4EI��X͗,��;W
/external/v8/tools/profviz/
H A D	gnuplot-4.6.3-emscripten.js	`[all...]`

Completed in 1006 milliseconds

Full Search
Definition
Symbol
File Path
History

art
bionic
bootable
build
compatibility
cts
dalvik
developers
development
device
external
frameworks
hardware
kernel
libcore
libnativehelper
packages
pdk
platform_testing
prebuilts
sdk
system
test
toolchain
tools