| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| DOMHelper.java | 42 import org.w3c.dom.Node;
84 // create a DOM Document node to contain the result.
140 * from the node. Literal elements from template elements should
142 * @param textNode A text node from the source tree.
143 * @return true if the text node should be stripped of extra whitespace.
148 public boolean shouldStripSourceNode(Node textNode)
158 * identifier string for any given DOM Node.
160 * Warning: The base implementation uses the Node object's hashCode(),
166 * that represent a single Node in the data structure (eg via proxying),
174 * (DOM Level 3 is investigating providing a unique node "key", bu
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| NodeCreator.java | 30 Iterable<Node> getNodes(Iterable<Binding<?>> bindings);
|
| /external/ksoap2/ksoap2-base/src/main/java/org/ksoap2/ |
| SoapFault12.java | 26 import org.ksoap2.kdom.Node;
43 public Node Code;
44 public Node Reason;
45 public Node Node;
46 public Node Role;
47 public Node Detail;
77 this.Code = new Node();
80 this.Reason = new Node();
82 } else if (name.equals("Node")) {
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 107 class Node;
127 /// edges referencing them are updated to point to the graph \c Node objects
130 /// node of the graph and providing a reference back to the graph in order to
134 /// edges. The edges are stored in the source node and point at the target
135 /// node. This allows the edge structure itself to be a very compact data
144 explicit Edge(Node &N, Kind K);
160 /// have built a graph node for the function yet or not.
163 /// Get the call graph node referenced by this edge if one exists.
165 /// This requires that the edge is not null. If we have built a graph node
166 /// for the function this edge points to, this will return that node,
[all...] |
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/nodes/ |
| NodeTupleTest.java | 23 Node node = new ScalarNode(new Tag("!tag"), "value1", null, null, null); local
25 new NodeTuple(null, node);
26 fail("Node must be provided.");
33 Node node = new ScalarNode(new Tag("!tag"), "value1", null, null, null); local
35 new NodeTuple(node, null);
36 fail("Node must be provided.");
43 Node key = new ScalarNode(Tag.STR, "key1", null, null, null);
44 Node value = new ScalarNode(Tag.STR, "value1", null, null, null)
[all...] |
| /external/v8/src/compiler/ |
| checkpoint-elimination.cc | 7 #include "src/compiler/node-properties.h"
21 bool IsRedundantCheckpoint(Node* node) {
22 Node* effect = NodeProperties::GetEffectInput(node);
33 Reduction CheckpointElimination::ReduceCheckpoint(Node* node) {
34 DCHECK_EQ(IrOpcode::kCheckpoint, node->opcode());
35 if (IsRedundantCheckpoint(node)) {
36 return Replace(NodeProperties::GetEffectInput(node));
[all...] |
| graph-trimmer.cc | 23 // Mark end node as live.
27 Node* const live = live_[i];
28 for (Node* const input : live->inputs()) MarkAsLive(input);
31 for (Node* const live : live_) {
34 Node* const user = edge.from();
|
| node.cc | 5 #include "src/compiler/node.h"
11 Node::OutOfLineInputs* Node::OutOfLineInputs::New(Zone* zone, int capacity) {
13 sizeof(OutOfLineInputs) + capacity * (sizeof(Node*) + sizeof(Use));
15 Node::OutOfLineInputs* outline =
23 void Node::OutOfLineInputs::ExtractFrom(Use* old_use_ptr, Node** old_input_ptr,
28 Node** new_input_ptr = inputs_;
34 Node* old_to = *old_input_ptr;
52 Node* Node::New(Zone* zone, NodeId id, const Operator* op, int input_count
56 Node* node; local
[all...] |
| select-lowering.cc | 10 #include "src/compiler/node.h"
11 #include "src/compiler/node-properties.h"
23 Reduction SelectLowering::Reduce(Node* node) {
24 if (node->opcode() != IrOpcode::kSelect) return NoChange();
25 SelectParameters const p = SelectParametersOf(node->op());
27 Node* cond = node->InputAt(0);
28 Node* vthen = node->InputAt(1)
[all...] |
| simplified-operator-reducer.h | 32 Reduction Reduce(Node* node) final;
35 Reduction ReduceReferenceEqual(Node* node);
37 Reduction Change(Node* node, const Operator* op, Node* a);
|
| value-numbering-reducer.cc | 10 #include "src/compiler/node-properties.h"
11 #include "src/compiler/node.h"
19 size_t HashCode(Node* node) {
20 size_t h = base::hash_combine(node->op()->HashCode(), node->InputCount());
21 for (Node* input : node->inputs()) {
28 bool Equals(Node* a, Node* b)
[all...] |
| /libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
| hc_nodeclonefalsenocopytext.java | 36 * duplicate node returned by the method should not copy
37 * any text data contained in this node.
65 Node employeeNode;
67 Node childNode;
68 Node clonedNode;
69 Node lastChildNode;
|
| nodeclonefalsenocopytext.java | 36 * duplicate node returned by the method should not copy
37 * any text data contained in this node.
66 Node employeeNode;
68 Node childNode;
69 Node clonedNode;
70 Node lastChildNode;
|
| nodegetfirstchildnull.java | 34 * Retrieve the Text node form the second child of the first
65 Node employeeNode;
67 Node secondChildNode;
68 Node textNode;
69 Node noChildNode;
|
| nodegetlastchildnull.java | 34 * Retrieve the Text node from the second child of the first
65 Node employeeNode;
67 Node secondChildNode;
68 Node textNode;
69 Node noChildNode;
|
| nodeinsertbeforenomodificationallowederrEE.java | 33 * if the node is readonly.
67 Node entRef;
68 Node createdNode;
69 Node insertedNode;
70 Node refChild = null;
|
| nodereplacechildnomodificationallowederrEE.java | 33 * if the node is readonly.
67 Node entRef;
68 Node entText;
69 Node createdNode;
70 Node replacedChild;
|
| /libcore/luni/src/main/java/org/w3c/dom/ |
| Attr.java | 19 * <p><code>Attr</code> objects inherit the <code>Node</code> interface, but
22 * <code>Node</code> attributes <code>parentNode</code>,
34 * common with other objects inheriting the <code>Node</code> interface, but
42 * has been explicitly added. Note that the <code>Node.nodeValue</code>
47 * the document, an attribute node will be created with
50 * attribute node with the default value and <code>specified</code> set to
56 * attribute node is discarded.
58 * the child nodes of the <code>Attr</code> node may be either
68 * <code>nodeValue</code> attributes of an <code>Attr</code> node initially
157 public interface Attr extends Node {
[all...] |
| DocumentType.java | 26 public interface DocumentType extends Node {
43 * declaration of <code>bar</code> or <code>baz</code>. Every node in
52 * DTD. Duplicates are discarded. Every node in this map also implements
|
| Entity.java | 19 * <code>Node</code> contains the name of the entity.
28 * replacement text</a> is available, the corresponding <code>Entity</code> node's child list
33 * every related <code>EntityReference</code> node has to be replaced in the
37 * <p>An <code>Entity</code> node does not have any parent.
39 * <code>namespaceURI</code> of the corresponding node in the
40 * <code>Entity</code> node subtree is <code>null</code>. The same is true
46 public interface Entity extends Node {
|
| /packages/apps/Gallery2/src/com/android/photos/data/ |
| SparseArrayBitmapPool.java | 33 private SparseArray<Node> mStore = new SparseArray<Node>();
36 private Pool<Node> mNodePool;
37 private Node mPoolNodesHead = null;
38 private Node mPoolNodesTail = null;
40 protected static class Node {
43 // Each node is part of two doubly linked lists:
48 Node prevInBucket;
49 Node nextInBucket;
50 Node nextInPool
[all...] |
| /system/core/libmemunreachable/ |
| Tarjan.h | 30 class Node {
32 allocator::set<Node<T>*> references_in;
33 allocator::set<Node<T>*> references_out;
39 Node(T* ptr, Allocator<Node> allocator)
41 Node(Node&& rhs) = default;
42 void Edge(Node<T>* ref) {
48 for (auto& node : references_out) {
49 f(node->ptr)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMNamedNodeMap.java | 27 import org.w3c.dom.Node;
47 /** The DTM for this node. */
57 * Create a getAttributes NamedNodeMap for a given DTM element node
93 * Retrieves a node specified by name.
94 * @param name The <code>nodeName</code> of a node to retrieve.
95 * @return A <code>Node</code> (of any type) with the specified
97 * any node in this map.
99 public Node getNamedItem(String name)
117 * @return The node at the <code>index</code>th position in the map, or
120 public Node item(int i
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| LinkedList.java | 90 * Pointer to first node.
94 transient Node<E> first;
97 * Pointer to last node.
101 transient Node<E> last;
126 final Node<E> f = first;
127 final Node<E> newNode = new Node<>(null, e, f);
141 final Node<E> l = last;
142 final Node<E> newNode = new Node<>(l, e, null)
566 Node<E> node(int index) { method in class:LinkedList
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| DOM3Serializer.java | 27 import org.w3c.dom.Node;
117 * Serializes the Level 3 DOM node. Throws an exception only if an I/O
122 * @param node the Level 3 DOM node to serialize
125 public void serializeDOM3(Node node) throws IOException;
|
