Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:Should (Results 76 - 88 of 88) sorted by null

1 2 34

/external/protobuf/js/
message.js	73 * isRepeated should be 0 or 1. 384 // TODO(jshneier): Should we just treat extension fields the same as 671 * Note: the returned array should be treated as immutable. 686 * Note: the returned array should be treated as immutable.     [all...]
/external/golang-protobuf/protoc-gen-go/descriptor/
descriptor.pb.go	43 // implementations should still be able to parse the group wire format and     [all...]
/external/syzkaller/vendor/github.com/golang/protobuf/protoc-gen-go/descriptor/
descriptor.pb.go	41 // implementations should still be able to parse the group wire format and     [all...]
/build/make/core/
main.mk	234 Code should be written to work regardless of a device being Treble or \ 235 variables like PRODUCT_SEPOLICY_SPLIT should be used until that is \ 257 # Device board config should override the value to /product when needed by: 361 # TODO: this should be eng I think. Since the sdk is built from the eng 375 # non-empty if that module should be installed in /system. 377 # For most goals, anything not tagged with the "tests" tag should 379 define should-install-to-system 384 # For the sdk goal, anything with the "samples" tag should be 386 define should-install-to-system 831 # This should be called after calling resolve-shared-libs-depes for HOST_2ND_ARCH     [all...]
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/pydoc_data/
topics.py	4 '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', 7 'attribute-access': u'\nCustomizing attribute access\n****************************\n\nThe following methods can be defined to customize the meaning of\nattribute access (use of, assignment to, or deletion of "x.name") for\nclass instances.\n\nobject.__getattr__(self, name)\n\n Called when an attribute lookup has not found the attribute in the\n usual places (i.e. it is not an instance attribute nor is it found\n in the class tree for "self"). "name" is the attribute name. This\n method should return the (computed) attribute value or raise an\n "AttributeError" exception.\n\n Note that if the attribute is found through the normal mechanism,\n "__getattr__()" is not called. (This is an intentional asymmetry\n between "__getattr__()" and "__setattr__()".) This is done both for\n efficiency reasons and because otherwise "__getattr__()" would have\n no way to access other attributes of the instance. Note that at\n least for instance variables, you can fake total control by not\n inserting any values in the instance attribute dictionary (but\n instead inserting them in another object). See the\n "__getattribute__()" method below for a way to actually get total\n control in new-style classes.\n\nobject.__setattr__(self, name, value)\n\n Called when an attribute assignment is attempted. This is called\n instead of the normal mechanism (i.e. store the value in the\n instance dictionary). *name* is the attribute name, *value* is the\n value to be assigned to it.\n\n If "__setattr__()" wants to assign to an instance attribute, it\n should not simply execute "self.name = value" --- this would cause\n a recursive call to itself. Instead, it should insert the value in\n the dictionary of instance attributes, e.g., "self.__dict__[name] =\n value". For new-style classes, rather than accessing the instance\n dictionary, it should call the base class method with the same\n name, for example, "object.__setattr__(self, name, value)".\n\nobject.__delattr__(self, name)\n\n Like "__setattr__()" but for attribute deletion instead of\n assignment. This should only be implemented if "del obj.name" is\n meaningful for the object.\n\n\nMore attribute access (…)     [all...]
/external/python/cpython2/Lib/pydoc_data/
topics.py	135 ' the reference is evaluated. It should yield an object with\n' 173 ' reference is evaluated. It should yield either a mutable ' 208 ' reference is evaluated. It should yield a mutable sequence ' 210 ' (such as a list). The assigned object should be a sequence ' 216 " sequence's length. The bounds should evaluate to (small) " 401 ' method should return the (computed) attribute value ' 436 ' should not simply execute "self.name = value" --- ' 438 ' a recursive call to itself. Instead, it should ' 444 ' dictionary, it should call the base class method with ' 453 ' assignment. This should only be implemented if "del     [all...]
/external/syzkaller/vendor/golang.org/x/net/http2/
server.go	55 firstSettingsTimeout = 2 * time.Second // should be in-flight with preface anyway 109 // IdleTimeout specifies how long until idle clients should be 249 // we accept a connection. Ideally this should be done 686 // readMore should be called once the consumer no longer needs or     [all...]
/external/llvm/test/MC/ARM/
basic-thumb2-instructions.s	723 @ Should also work for UPPER CASE condition codes.     [all...]
/external/swiftshader/third_party/llvm-7.0/llvm/test/MC/ARM/
basic-thumb2-instructions.s	732 @ Should also work for UPPER CASE condition codes.     [all...]
/external/e2fsprogs/doc/
texinfo.tex	22 % You should have received a copy of the GNU General Public License 190 % @| inserts a changebar to the left of the current line. It should 286 % the headline as they should be, not taken literally (outputting ''code). 383 % the input line (except we remove a trailing comment). #1 should be a 465 % should produce a line of output anyway. 470 % therein should become regular spaces in the raw index file, not the 702 % should appear on a line by itself (according to the Texinfo 805 % That's how much \exdent should take out.     [all...]
/external/e2fsprogs/lib/et/
texinfo.tex	22 % You should have received a copy of the GNU General Public License 190 % @| inserts a changebar to the left of the current line. It should 286 % the headline as they should be, not taken literally (outputting ''code). 383 % the input line (except we remove a trailing comment). #1 should be a 465 % should produce a line of output anyway. 470 % therein should become regular spaces in the raw index file, not the 702 % should appear on a line by itself (according to the Texinfo 805 % That's how much \exdent should take out.     [all...]
/external/libffi/
texinfo.tex	22 % You should have received a copy of the GNU General Public License 324 % the headline as they should be, not taken literally (outputting ''code). 423 % the input line (except we remove a trailing comment). #1 should be a 504 % should produce a line of output anyway. 509 % therein should become regular spaces in the raw index file, not the 662 % should appear on a line by itself (according to the Texinfo 756 % That's how much \exdent should take out. 815 % @| inserts a changebar to the left of the current line. It should     [all...]
/external/python/cpython2/Modules/_ctypes/libffi/
texinfo.tex	22 % You should have received a copy of the GNU General Public License 324 % the headline as they should be, not taken literally (outputting ''code). 423 % the input line (except we remove a trailing comment). #1 should be a 504 % should produce a line of output anyway. 509 % therein should become regular spaces in the raw index file, not the 662 % should appear on a line by itself (according to the Texinfo 756 % That's how much \exdent should take out. 815 % @| inserts a changebar to the left of the current line. It should     [all...]

Completed in 242 milliseconds

1 2 34