| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_input.py | 19 def transform(self, node, results):
21 if context.match(node.parent.parent):
24 new = node.clone()
26 return Call(Name(u"eval"), [new], prefix=node.prefix)
|
| fix_xrange.py | 27 def transform(self, node, results):
30 return self.transform_xrange(node, results)
32 return self.transform_range(node, results)
36 def transform_xrange(self, node, results):
40 self.transformed_xranges.add(id(node))
42 def transform_range(self, node, results):
43 if (id(node) not in self.transformed_xranges and
44 not self.in_special_context(node)):
48 prefix=node.prefix)
54 P1 = "power< func=NAME trailer< '(' node=any ')' > any* >
[all...] |
| fix_map.py | 59 def transform(self, node, results):
60 if self.should_skip(node):
63 if node.parent.type == syms.simple_stmt:
64 self.warning(node, "You should use a for loop here")
65 new = node.clone()
81 self.warning(node, "cannot convert map(None, ...) "
85 if in_special_context(node):
87 new = node.clone()
90 new.prefix = node.prefix
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/data/fixers/myfixes/ |
| fix_first.py | 6 def match(self, node): return False
|
| fix_last.py | 7 def match(self, node): return False
|
| fix_preorder.py | 6 def match(self, node): return False
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/ |
| EditTextRule.java | 40 public void onCreate(@NonNull INode node, @NonNull INode parent,
42 super.onCreate(node, parent, insertType);
48 node.appendChild(REQUEST_FOCUS);
52 node.setAttribute(ANDROID_URI, ATTR_EMS, "10"); //$NON-NLS-1$
79 public void handle(@NonNull INode node) {
80 INode focus = findFocus(findRoot(node));
85 node.appendChild(REQUEST_FOCUS);
97 /** Returns true if the given node currently has focus */
98 private static boolean hasFocus(INode node) {
99 INode focus = findFocus(node);
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| Node.java | 3 package com.google.clearsilver.jsilver.syntax.node;
8 public abstract class Node implements Switchable, Cloneable
10 private Node parent;
15 public Node parent()
20 void parent(@SuppressWarnings("hiding") Node parent)
25 abstract void removeChild(Node child);
26 abstract void replaceChild(Node oldChild, Node newChild);
28 public void replaceBy(Node node)
[all...] |
| /external/libxml2/doc/examples/ |
| tree2.c | 29 xmlNodePtr root_node = NULL, node = NULL, node1 = NULL;/* node pointers */ local
37 * Creates a new document, a node and set it as a root node
49 * xmlNewChild() creates a new node, which is "attached" as child node
50 * of root_node node.
53 BAD_CAST "content of node 1");
55 * The same as above, but the new child node doesn't have a content
60 * xmlNewProp() creates attributes, which is "attached" to an node
[all...] |
| /external/v8/src/compiler/ |
| graph-replay.cc | 10 #include "src/compiler/node.h"
22 PrintF(" Node* nil = graph()->NewNode(common()->Dead());\n");
27 for (Node* node : nodes.live) {
28 PrintReplayOpCreator(node->op());
29 PrintF(" Node* n%d = graph()->NewNode(op", node->id());
30 for (int i = 0; i < node->InputCount(); ++i) {
33 PrintF("); USE(n%d);\n", node->id());
37 for (Node* node : nodes.live)
[all...] |
| instruction-selector.h | 14 #include "src/compiler/node.h"
34 PushParameter(Node* node, MachineType type) : node_(node), type_(type) {}
36 Node* node() const { return node_; } function in class:v8::internal::compiler::PushParameter
40 Node* node_;
136 // Check if {node} can be covered while generating code for the current
137 // instruction. A node can be covered if the {user} of the node has the onl
[all...] |
| /frameworks/av/media/libstagefright/include/ |
| OMX.h | 34 virtual bool livesLocally(node_id node, pid_t pid);
41 node_id *node);
43 virtual status_t freeNode(node_id node);
46 node_id node, OMX_COMMANDTYPE cmd, OMX_S32 param);
49 node_id node, OMX_INDEXTYPE index,
53 node_id node, OMX_INDEXTYPE index,
57 node_id node, OMX_INDEXTYPE index,
61 node_id node, OMX_INDEXTYPE index,
65 node_id node, OMX_STATETYPE* state);
68 node_id node, OMX_U32 port_index, OMX_BOOL graphic, OMX_BOOL enable)
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/fixes/ |
| fix_map.py | 59 def transform(self, node, results):
60 if self.should_skip(node):
63 if node.parent.type == syms.simple_stmt:
64 self.warning(node, "You should use a for loop here")
65 new = node.clone()
81 self.warning(node, "cannot convert map(None, ...) "
85 if in_special_context(node):
87 new = node.clone()
90 new.prefix = node.prefix
|
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/fixes/ |
| fix_map.py | 59 def transform(self, node, results):
60 if self.should_skip(node):
63 if node.parent.type == syms.simple_stmt:
64 self.warning(node, "You should use a for loop here")
65 new = node.clone()
81 self.warning(node, "cannot convert map(None, ...) "
85 if in_special_context(node):
87 new = node.clone()
90 new.prefix = node.prefix
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_map.py | 59 def transform(self, node, results):
60 if self.should_skip(node):
63 if node.parent.type == syms.simple_stmt:
64 self.warning(node, "You should use a for loop here")
65 new = node.clone()
81 self.warning(node, "cannot convert map(None, ...) "
85 if in_special_context(node):
87 new = node.clone()
90 new.prefix = node.prefix
|
| /external/libdrm/amdgpu/ |
| util_hash.c | 105 static void util_free_node(struct util_node *node)
107 free(node);
115 struct util_node *node = util_data_allocate_node(hash->data.d); local
117 if (!node)
120 node->key = akey;
121 node->value = avalue;
123 node->next = (struct util_node*)(*anextNode);
124 *anextNode = node;
126 return node;
208 struct util_node **node; local
228 struct util_node *node = util_hash_create_node(hash, key, data, nextNode); local
350 struct util_node **node = util_hash_find_node(hash, akey); local
373 struct util_node *node = iter.node; local
[all...] |
| /external/selinux/libsepol/cil/src/ |
| cil_verify.c | 371 int __cil_verify_ordered_node_helper(struct cil_tree_node *node, __attribute__((unused)) uint32_t *finished, void *extra_args)
376 if (node->flavor == *flavor) {
377 if (node->flavor == CIL_SID) {
378 struct cil_sid *sid = node->data;
380 cil_log(CIL_ERR, "SID %s not in sidorder statement at line %d of %s\n", sid->datum.name, node->line, node->path);
383 } else if (node->flavor == CIL_CLASS) {
384 struct cil_class *class = node->data;
386 cil_log(CIL_ERR, "Class %s not in classorder statement at line %d of %s\n", class->datum.name, node->line, node->path)
432 struct cil_tree_node *node = sid->datum.nodes->head->data; local
1569 struct cil_tree_node *node; member in struct:cil_verify_map_args
[all...] |
| /external/selinux/libsepol/src/ |
| node_record.c | 265 ERR(handle, "could not create node key for (%s, %s, %s)",
284 const sepol_node_t * node,
293 tmp_key->addr = malloc(node->addr_sz);
294 tmp_key->mask = malloc(node->mask_sz);
299 memcpy(tmp_key->addr, node->addr, node->addr_sz);
300 memcpy(tmp_key->mask, node->mask, node->mask_sz);
301 tmp_key->addr_sz = node->addr_sz;
302 tmp_key->mask_sz = node->mask_sz
[all...] |
| /external/libxml2/ |
| debugXML.c | 46 xmlNodePtr node; /* current node */ member in struct:_xmlDebugCtxt
54 static void xmlCtxtDumpNodeList(xmlDebugCtxtPtr ctxt, xmlNodePtr node);
66 ctxt->node = NULL;
83 * @node: the node
84 * @ns: the namespace node
86 * Check that a given namespace is in scope on a node.
90 * an ancestor node.
93 xmlNsCheckScope(xmlNodePtr node, xmlNsPtr ns
2687 xmlNodePtr node; local
[all...] |
| /external/chromium-trace/catapult/devil/devil/android/ |
| app_ui_test.py | 22 <node bounds="[0,50][1536,178]" content-desc="Loading"
31 <node bounds="[0,50][1536,178]" content-desc=""
33 <node bounds="[0,58][112,170]" content-desc="Open navigation drawer"/>
34 <node bounds="[121,50][1536,178]"
36 <node bounds="[121,50][1424,178]"
38 <node bounds="[1424,50][1536,178]" content-desc="Search"
40 </node>
41 </node>
42 <node bounds="[0,178][576,1952]" resource-id="com.example.app:id/drawer">
43 <node bounds="[0,178][144,1952]
[all...] |
| /external/droiddriver/src/io/appium/droiddriver/uiautomation/ |
| UiAutomationElement.java | 54 private final AccessibilityNodeInfo node; field in class:UiAutomationElement
69 protected UiAutomationElement(UiAutomationContext context, AccessibilityNodeInfo node,
71 this.node = Preconditions.checkNotNull(node);
76 put(attribs, Attribute.PACKAGE, charSequenceToString(node.getPackageName()));
77 put(attribs, Attribute.CLASS, charSequenceToString(node.getClassName()));
78 put(attribs, Attribute.TEXT, charSequenceToString(node.getText()));
79 put(attribs, Attribute.CONTENT_DESC, charSequenceToString(node.getContentDescription()));
80 put(attribs, Attribute.RESOURCE_ID, charSequenceToString(node.getViewIdResourceName()));
81 put(attribs, Attribute.CHECKABLE, node.isCheckable())
[all...] |
| /external/jemalloc/include/jemalloc/internal/ |
| rb.h | 6 * bit of right-child pointers (if RB_COMPACT is defined), thus making node
26 /* Node structure. */
82 /* Node initializer. */
84 /* Bookkeeping bit cannot be used by node pointer. */ \
111 /* Node initializer. */
173 a_prefix##next(a_rbt_type *rbtree, a_type *node); \
175 a_prefix##prev(a_rbt_type *rbtree, a_type *node); \
183 a_prefix##insert(a_rbt_type *rbtree, a_type *node); \
185 a_prefix##remove(a_rbt_type *rbtree, a_type *node); \
205 * a_type : Type for red-black tree node data structure (ex: ex_node_t)
[all...] |
| /toolchain/binutils/binutils-2.25/gold/ |
| arm-reloc-property.cc | 40 // Parse an S-expression S and build a tree and return the root node.
58 // Remember the node stack position for start of a new internal node.
63 // children to build a new internal node. Push internal node back.
67 Tree_node* node = local
71 node_stack.push_back(node);
74 // Just push a leaf node to node_stack.
83 // contain the root node.
165 Tree_node* node = root_node local
[all...] |
| /frameworks/base/core/java/android/animation/ |
| AnimatorSet.java | 74 * to a single node representing that Animator, not create a new Node
77 private ArrayMap<Animator, Node> mNodeMap = new ArrayMap<Animator, Node>();
84 private ArrayList<Node> mNodes = new ArrayList<Node>();
123 private Node mRootNode = new Node(mDelayAnim);
248 Node node = mNodes.get(i) local
267 Node node = mNodes.get(i); local
415 Node node = mNodeMap.get(anim); local
442 Node node = mNodes.get(i); local
492 Node node = mNodes.get(i); local
545 Node node = mNodes.get(i); local
556 Node node = mNodes.get(i); local
574 Node node = mNodes.get(i); local
594 Node node = mNodes.get(i); local
619 Node node = mNodes.get(i); local
626 Node node = mNodes.get(i); local
665 Node node = mNodes.get(i); local
706 final Node node = mNodes.get(n); local
730 Node node = mNodes.get(i); local
851 Node node = mNodes.get(i); local
867 Node node = mNodes.get(i); local
878 Node node = mNodes.get(i); local
894 Node node = list.get(index); local
935 Node node = mNodes.get(i); local
964 Node node = mNodes.get(i); local
979 Node node = mNodes.get(i); local
1001 Node node = mNodes.get(i); local
1086 Node node = mNodeMap.get(anim); local
1159 Node node = (Node) super.clone(); local
1298 Node node = getNodeForAnimation(anim); local
1313 Node node = getNodeForAnimation(anim); local
1328 Node node = getNodeForAnimation(anim); local
[all...] |
| /external/bison/src/ |
| symlist.c | 132 | Prepend NODE to the LIST. |
136 symbol_list_prepend (symbol_list *list, symbol_list *node)
138 node->next = list;
139 return node;
150 symbol_list *node, *next; local
151 for (node = list; node; node = next)
153 next = node->next;
154 named_ref_free (node->named_ref)
[all...] |
