| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/composer/ |
| ComposerImplTest.java | 24 import org.yaml.snakeyaml.nodes.Node;
32 Node node = yaml.compose(new StringReader(data)); local
33 assertNotNull(node);
34 assertTrue(node instanceof MappingNode);
36 Node node2 = yaml.compose(new StringReader(data2));
38 assertFalse(node.equals(node2));
44 Node node = yaml.compose(new StringReader(data)); local
45 assertNotNull(node);
[all...] |
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/partialconstruct/ |
| FragmentComposer.java | 20 import org.yaml.snakeyaml.nodes.Node;
35 public Node getSingleNode() {
36 Node node = super.getSingleNode(); local
37 if (!MappingNode.class.isAssignableFrom(node.getClass())) {
41 MappingNode root = (MappingNode) node;
43 Node keyNode = tuple.getKeyNode();
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| SelectionDAGPrinter.cpp | 45 static unsigned numEdgeDestLabels(const void *Node) {
46 return ((const SDNode *) Node)->getNumValues();
49 static std::string getEdgeDestLabel(const void *Node, unsigned i) {
50 return ((const SDNode *) Node)->getValueType(i).getEVTString();
54 static std::string getEdgeSourceLabel(const void *Node, EdgeIter I) {
55 return itostr(I - SDNodeIterator::begin((SDNode *) Node));
59 /// should actually target another edge source, not a node. If this method
62 static bool edgeTargetsEdgeSource(const void *Node, EdgeIter I) {
67 /// called to determine which outgoing edge of Node is the target of this
70 static EdgeIter getEdgeTarget(const void *Node, EdgeIter I)
[all...] |
| /external/v8/src/compiler/ |
| all-nodes.cc | 20 AllNodes::AllNodes(Zone* local_zone, Node* end, const Graph* graph,
28 void AllNodes::Mark(Zone* local_zone, Node* end, const Graph* graph) {
34 for (Node* const input : reachable[i]->inputs()) {
45 for (Node* use : reachable[i]->uses()) {
|
| node-marker.h | 8 #include "src/compiler/node.h"
23 V8_INLINE Mark Get(const Node* node) {
24 Mark mark = node->mark();
31 V8_INLINE void Set(Node* node, Mark mark) {
33 DCHECK_LT(node->mark(), mark_max_);
34 node->set_mark(mark + mark_min_);
44 // A NodeMarker assigns a local "state" to every node of a graph in constant
47 // were created earlier. Internally, the local state is stored in the Node
[all...] |
| select-lowering.h | 25 Reduction Reduce(Node* node) override;
|
| /libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
| characterdataappenddatanomodificationallowederr.java | 32 * DOMException if the node is readonly.
68 Node genderNode;
69 Node entElement;
70 Node entElementContent;
71 Node entReference;
92 ((CharacterData) /*Node */entElementContent).appendData("newString");
|
| characterdatadeletedatanomodificationallowederr.java | 32 * DOMException if the node is readonly.
68 Node genderNode;
69 Node entElement;
70 Node entElementContent;
72 Node entReference;
92 ((CharacterData) /*Node */entElementContent).deleteData(1, 3);
|
| characterdatainsertdatanomodificationallowederr.java | 32 * DOMException if the node is readonly.
68 Node genderNode;
69 Node entElement;
71 Node entElementContent;
72 Node entReference;
92 ((CharacterData) /*Node */entElementContent).insertData(1, "newArg");
|
| characterdatareplacedatanomodificationallowederr.java | 32 * DOMException if the node is readonly.
69 Node genderNode;
70 Node entElement;
71 Node entElementContent;
72 Node entReference;
93 ((CharacterData) /*Node */entElementContent).replaceData(1, 3, "newArg");
|
| characterdatasetdatanomodificationallowederr.java | 32 * DOMException if the node is readonly.
68 Node genderNode;
69 Node entElement;
70 Node entElementContent;
71 Node entReference;
92 ((CharacterData) /*Node */entElementContent).setData("newData");
|
| hc_attrappendchild2.java | 60 Node testNode;
64 Node newChild;
65 Node retval;
66 Node lastChild;
|
| hc_attrappendchild4.java | 64 Node testNode;
68 Node textNode;
69 Node retval;
70 Node lastChild;
|
| hc_attrappendchild5.java | 31 * Attempt to append a node from another document to an attribute which should result
62 Node testNode;
66 Node textNode;
67 Node retval;
68 Node lastChild;
|
| hc_attrinsertbefore5.java | 64 Node testNode;
68 Node textNode;
69 Node retval;
70 Node refChild = null;
|
| hc_attrinsertbefore6.java | 31 * Attempt to append a text node from another document to an attribute which should result
62 Node testNode;
66 Node textNode;
67 Node retval;
68 Node refChild = null;
|
| hc_attrnormalize.java | 31 * Appends a text node to an attribute, normalizes the attribute
32 * and checks for a single child node.
61 Node testNode;
66 Node retval;
67 Node firstChild;
68 Node secondChild;
78 ((Element) /*Node */testNode).normalize();
|
| hc_attrsetvalue1.java | 59 Node testNode;
63 Node retval;
64 Node firstChild;
65 Node otherChild;
74 firstChild.setNodeValue("impl reused node");
|
| hc_attrsetvalue2.java | 59 Node testNode;
64 Node retval;
65 Node firstChild;
66 Node otherChild;
77 firstChild.setNodeValue("impl reused node");
|
| hc_nodeappendchild.java | 32 * node to the list of children. The last node in the list
63 Node employeeNode;
65 Node createdNode;
66 Node lchild;
68 Node appendedChild;
|
| hc_nodeappendchildnodeancestor.java | 32 * HIERARCHY_REQUEST_ERR DOMException if the node to
33 * append is one of this node's ancestors.
36 * an ancestor node(root node) to it.
68 Node newChild;
70 Node employeeNode;
72 Node oldChild;
73 Node appendedChild;
|
| hc_nodecloneattributescopied.java | 33 * duplicate node returned by the method should copy the
34 * attributes associated with this node.
64 Node addressNode;
65 Node clonedNode;
67 Node attributeNode;
86 attributeNode = (Node) attributes.item(indexN10076);
|
| hc_nodeinsertbeforenewchilddiffdocument.java | 34 * created this node.
72 Node refChild;
73 Node newChild;
75 Node elementNode;
76 Node insertedNode;
|
| hc_nodeinsertbeforenodeancestor.java | 32 * HIERARCHY_REQUEST_ERR DOMException if the node to be
36 * node that is one of its ancestors(root node). An
37 * attempt to insert such a node should raise the
68 Node newChild;
70 Node employeeNode;
72 Node refChild;
73 Node insertedNode;
|
| hc_nodeinsertbeforenodename.java | 32 * the node being inserted.
34 * Insert an Element node before the fourth
35 * child of the second employee and check the node
37 * method. The node returned should be "newChild".
67 Node employeeNode;
69 Node refChild;
70 Node newChild;
71 Node insertedNode;
|
