| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/ |
| pytree.py | 57 Compare two nodes for equality.
69 Compare two nodes for inequality.
79 Compare two nodes for equality.
81 This is called by __eq__ and __ne__. It is only called if the two nodes
83 Nodes should be considered equal if they have the same structure,
241 """Concrete implementation for interior nodes."""
251 child nodes, and an optional context keyword argument.
286 """Compare two nodes for equality."""
353 """Concrete implementation for leaf nodes."""
397 """Compare two nodes for equality.""
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/ |
| pytree.py | 57 Compare two nodes for equality.
69 Compare two nodes for inequality.
79 Compare two nodes for equality.
81 This is called by __eq__ and __ne__. It is only called if the two nodes
83 Nodes should be considered equal if they have the same structure,
241 """Concrete implementation for interior nodes."""
251 child nodes, and an optional context keyword argument.
286 """Compare two nodes for equality."""
353 """Concrete implementation for leaf nodes."""
397 """Compare two nodes for equality.""
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/ |
| pytree.py | 57 Compare two nodes for equality.
69 Compare two nodes for inequality.
79 Compare two nodes for equality.
81 This is called by __eq__ and __ne__. It is only called if the two nodes
83 Nodes should be considered equal if they have the same structure,
241 """Concrete implementation for interior nodes."""
251 child nodes, and an optional context keyword argument.
286 """Compare two nodes for equality."""
353 """Concrete implementation for leaf nodes."""
397 """Compare two nodes for equality.""
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| NodeCreator.java | 22 * Creator of graph nodes.
29 /** Returns nodes for the given dependency graph. */
|
| /external/libchrome/base/trace_event/ |
| heap_profiler_stack_frame_deduplicator.cc | 30 std::map<StackFrame, int>* nodes = &roots_; local
36 auto node = nodes->find(frame);
37 if (node == nodes->end()) {
47 nodes->insert(std::make_pair(frame, frame_index));
49 // Append the node after modifying |nodes|, because the |frames_| vector
50 // might need to resize, and this invalidates the |nodes| pointer.
57 nodes = &frames_[frame_index].children;
100 // overhead of the tree nodes for the map, but as an estimate this should be
|
| /external/libxml2/result/XPath/tests/ |
| chaptersprefol | 5 Set contains 0 nodes:
10 Set contains 0 nodes:
15 Set contains 0 nodes:
20 Set contains 0 nodes:
25 Set contains 10 nodes:
49 Set contains 6 nodes:
66 Set contains 4 nodes:
75 Set contains 13 nodes:
|
| /external/llvm/include/llvm/IR/ |
| Metadata.def | 28 // Handler for leaf nodes in the class hierarchy.
33 // Handler for non-leaf nodes in the class hierarchy.
38 // Handler for specialized and uniquable leaf nodes under MDNode. Defers to
51 // Handler for leaf nodes under MDNode.
56 // Handler for leaf nodes under MDNode.
61 // Handler for non-leaf nodes under MDNode.
66 // Handler for specialized leaf nodes under MDNode.
71 // Handler for specialized non-leaf nodes under MDNode.
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| PhiBlockMerge2.ll | 1 ; Test merging of blocks that only have PHI nodes in them. This tests the case
2 ; where the mergedinto block doesn't have any PHI nodes, and is in fact
|
| /external/selinux/libsepol/include/sepol/ |
| nodes.h | 11 /* Return the number of nodes */
32 /* Iterate the nodes
|
| /external/v8/src/compiler/ |
| all-nodes.h | 15 // A helper utility that traverses the graph and gathers all nodes reachable
28 NodeVector live; // Nodes reachable from end.
|
| /frameworks/data-binding/compiler/src/main/kotlin/android/databinding/tool/writer/ |
| KCode.kt | 27 private val nodes = arrayListOf<Any>()
46 fun isNull(kcode : KCode?) = kcode == null || (kcode.nodes.isEmpty() && (kcode.s == null || kcode.s.trim() == ""))
70 nodes.add(c)
78 nodes.add(c)
95 nodes.add(Appendix(glue, c!!))
117 val newlineFirstNode = s != null || (nodes.isNotEmpty() && nodes.first() is Appendix)
119 nodes.forEach { when(it) {
|
| /hardware/ti/omap3/omx/core_plugin/omx_core_plugin/ |
| Android.mk | 19 $(PV_TOP)/nodes/pvmediaoutputnode/include \
20 $(PV_TOP)/nodes/pvdownloadmanagernode/config/opencore \
|
| /device/lge/bullhead/sepolicy/ |
| device.te | 10 #device type for rmnet device nodes, ie /dev/rmnet_ctrl*
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| TreeRuleReturnScope.js | 2 * the start property is a tree nodes not Token object
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ |
| DTMFilter.java | 35 * Show all <code>Nodes</code>.
40 * Show <code>Element</code> nodes.
45 * Show <code>Attr</code> nodes. This is meaningful only when creating an
49 * Since attributes are never children of other nodes, they do not
55 * Show <code>Text</code> nodes.
60 * Show <code>CDATASection</code> nodes.
65 * Show <code>EntityReference</code> nodes. Note that if Entity References
67 * nodes will not appear and this mask has no effect.
72 * Show <code>Entity</code> nodes. This is meaningful only when creating
82 * Show <code>ProcessingInstruction</code> nodes
[all...] |
| DTMWSFilter.java | 25 * stripping of whitespace nodes.
30 * Do not strip whitespace child nodes of this element.
35 * Strip whitespace child nodes of this element.
45 * Test whether whitespace-only text nodes are visible in the logical
|
| /external/autotest/server/site_tests/audio_InternalCardNodes/ |
| audio_InternalCardNodes.py | 5 """This is a server side test to check nodes created for internal card."""
19 """Server side test to check audio nodes for internal card.
22 audio nodes created for internal cards are correct.
60 # Modify expected nodes for special boards.
|
| /external/chromium-trace/catapult/telemetry/telemetry/internal/testing/ |
| dom_counter_sample.html | 7 counters. The test expects there to be exactly 1 document, 14 nodes,
|
| /external/clang/test/CodeGen/ |
| 2002-03-14-BrokenPHINode.c | 3 /* GCC was generating PHI nodes with an arity < #pred of the basic block the
|
| /external/libxml2/result/XInclude/ |
| nodes.xml | 3 <!-- Simple test of including a set of nodes from an XML document -->
|
| nodes2.xml | 3 <!-- Simple test of including a set of nodes from an XML document -->
|
| /external/libxml2/result/XPath/xptr/ |
| chaptersparts | 9 Set contains 1 nodes:
18 Set contains 1 nodes:
31 Set contains 1 nodes:
40 Set contains 1 nodes:
|
| /external/opencv3/3rdparty/jinja2/ |
| parser.py | 11 from jinja2 import nodes
107 """Return a new free identifier as :class:`~jinja2.nodes.InternalName`."""
109 rv = object.__new__(nodes.InternalName)
110 nodes.Node.__init__(rv, 'fi%d' % self._last_identifier, lineno=lineno)
174 return nodes.Assign(target, expr, lineno=lineno)
192 return nodes.For(target, iter, body, else_, test,
197 node = result = nodes.If(lineno=self.stream.expect('name:if').lineno)
204 new_node = nodes.If(lineno=self.stream.current.lineno)
217 node = nodes.Block(lineno=next(self.stream).lineno)
234 node = nodes.Extends(lineno=next(self.stream).lineno
[all...] |
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/constructor/ |
| AbstractConstructTest.java | 20 import org.yaml.snakeyaml.nodes.Node;
21 import org.yaml.snakeyaml.nodes.SequenceNode;
22 import org.yaml.snakeyaml.nodes.Tag;
39 assertEquals("Unexpected recursive structure for Node: <org.yaml.snakeyaml.nodes.SequenceNode (tag=tag:yaml.org,2002:seq, value=[])>", e.getMessage());
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue9/ |
| BeanConstructor.java | 19 import org.yaml.snakeyaml.nodes.Node;
20 import org.yaml.snakeyaml.nodes.NodeId;
21 import org.yaml.snakeyaml.nodes.ScalarNode;
22 import org.yaml.snakeyaml.nodes.Tag;
|
