| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/fixes/ |
| fix_future.py | 19 def transform(self, node, results):
21 new.prefix = node.prefix
|
| fix_reduce.py | 34 def transform(self, node, results):
35 touch_import(u'functools', u'reduce', node)
|
| fix_standarderror.py | 17 def transform(self, node, results):
18 return Name(u"Exception", prefix=node.prefix)
|
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/fixes/ |
| fix_basestring.py | 13 def transform(self, node, results):
14 return Name(u"str", prefix=node.prefix)
|
| fix_future.py | 19 def transform(self, node, results):
21 new.prefix = node.prefix
|
| fix_reduce.py | 34 def transform(self, node, results):
35 touch_import(u'functools', u'reduce', node)
|
| fix_standarderror.py | 17 def transform(self, node, results):
18 return Name(u"Exception", prefix=node.prefix)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_basestring.py | 13 def transform(self, node, results):
14 return Name(u"str", prefix=node.prefix)
|
| fix_future.py | 19 def transform(self, node, results):
21 new.prefix = node.prefix
|
| fix_reduce.py | 34 def transform(self, node, results):
35 touch_import(u'functools', u'reduce', node)
|
| fix_standarderror.py | 17 def transform(self, node, results):
18 return Name(u"Exception", prefix=node.prefix)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_basestring.py | 13 def transform(self, node, results):
14 return Name(u"str", prefix=node.prefix)
|
| fix_future.py | 19 def transform(self, node, results):
21 new.prefix = node.prefix
|
| fix_reduce.py | 34 def transform(self, node, results):
35 touch_import(u'functools', u'reduce', node)
|
| fix_standarderror.py | 17 def transform(self, node, results):
18 return Name(u"Exception", prefix=node.prefix)
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| BytesTrie.java | 183 int node; local
184 return (remainingMatchLength_<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ?
185 valueResults_[node&kValueIsFinal] : Result.NO_VALUE;
220 // Remaining part of a linear-match node.
224 int node; local
225 return (length<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ?
226 valueResults_[node&kValueIsFinal] : Result.NO_VALUE;
262 // Continue a linear-match node.
268 int node; local
269 return (length<0 && (node=(bytes_[pos]&0xff))>=kMinValueLead)
285 int node=bytes_[pos++]&0xff; local
375 int node=bytes_[pos++]&0xff; local
572 int node=bytes_[pos++]&0xff; local
634 int node=bytes_[pos++]&0xff; local
767 int node=bytes_[pos]&0xff; local
805 int node=bytes_[pos]&0xff; local
816 int node=bytes_[pos++]&0xff; local
864 int node=bytes[pos++]&0xff; local
892 int node=bytes[pos++]&0xff; local
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| BytesTrie.java | 198 int node; local
199 return (remainingMatchLength_<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ?
200 valueResults_[node&kValueIsFinal] : Result.NO_VALUE;
237 // Remaining part of a linear-match node.
241 int node; local
242 return (length<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ?
243 valueResults_[node&kValueIsFinal] : Result.NO_VALUE;
280 // Continue a linear-match node.
286 int node; local
287 return (length<0 && (node=(bytes_[pos]&0xff))>=kMinValueLead)
303 int node=bytes_[pos++]&0xff; local
396 int node=bytes_[pos++]&0xff; local
606 int node=bytes_[pos++]&0xff; local
669 int node=bytes_[pos++]&0xff; local
802 int node=bytes_[pos]&0xff; local
840 int node=bytes_[pos]&0xff; local
851 int node=bytes_[pos++]&0xff; local
899 int node=bytes[pos++]&0xff; local
927 int node=bytes[pos++]&0xff; local
[all...] |
| /external/freetype/include/ |
| ftlist.h | 84 /* Find the list node for a given listed object. */
91 /* List node. NULL if it wasn't found. */
108 /* node :: The node to append. */
112 FT_ListNode node );
125 /* node :: The node to insert. */
129 FT_ListNode node );
138 /* Remove a node from a list. This function doesn't check whether */
139 /* the node is in the list! *
[all...] |
| /external/libchrome/crypto/ |
| scoped_test_nss_db.cc | 35 for (CERTCertListNode* node = CERT_LIST_HEAD(cert_list);
36 !CERT_LIST_END(node, cert_list);
37 node = CERT_LIST_NEXT(node)) {
39 if (CERT_ChangeCertTrust(CERT_GetDefaultCertDB(), node->cert, &trust) !=
|
| /external/pdfium/third_party/freetype/include/freetype/ |
| ftlist.h | 84 /* Find the list node for a given listed object. */
91 /* List node. NULL if it wasn't found. */
108 /* node :: The node to append. */
112 FT_ListNode node );
125 /* node :: The node to insert. */
129 FT_ListNode node );
138 /* Remove a node from a list. This function doesn't check whether */
139 /* the node is in the list! *
[all...] |
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/nodes/ |
| NodeTest.java | 29 assertEquals("value in a Node is required.", e.getMessage());
35 ScalarNode node = new ScalarNode(new Tag("!foo"), "Value1", null, null, '"'); local
36 node.setTag((Tag) null);
39 assertEquals("tag in a Node is required.", e.getMessage());
46 Node node = new ScalarNode(new Tag("!foo"), "bla-bla", mark1, mark2, '"'); local
47 assertEquals(mark1, node.getStartMark());
48 assertEquals(mark2, node.getEndMark());
|
| /external/v8/src/compiler/ |
| control-flow-optimizer.h | 8 #include "src/compiler/node-marker.h"
19 class Node;
30 void Enqueue(Node* node);
31 void VisitNode(Node* node);
32 void VisitBranch(Node* node);
34 bool TryBuildSwitch(Node* node);
[all...] |
| js-generic-lowering.h | 30 Reduction Reduce(Node* node) final;
33 #define DECLARE_LOWER(x) void Lower##x(Node* node);
39 void ReplaceWithCompareIC(Node* node, Token::Value token, Strength strength);
40 void ReplaceWithStubCall(Node* node, Callable c, CallDescriptor::Flags flags);
41 void ReplaceWithRuntimeCall(Node* node, Runtime::FunctionId f, int args = -1)
[all...] |
| node-matchers.h | 12 #include "src/compiler/node.h"
21 explicit NodeMatcher(Node* node) : node_(node) {}
23 Node* node() const { return node_; } function in struct:v8::internal::compiler::NodeMatcher
24 const Operator* op() const { return node()->op(); }
25 IrOpcode::Value opcode() const { return node()->opcode(); }
30 Node* InputAt(int index) const { return node()->InputAt(index);
[all...] |
| /external/v8/test/cctest/ |
| test-ast.cc | 44 AstNode* node = factory.NewEmptyStatement(RelocInfo::kNoPosition); local
45 list->Add(node);
47 CHECK_EQ(node, list->at(0));
48 CHECK_EQ(node, list->last());
52 list->Add(node);
|
