| /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/skia/include/views/ |
| SkViewInflate.h | 29 SkView* inflate(const SkDOM& dom, const SkDOM::Node* node, SkView* root = NULL);
46 virtual SkView* createView(const SkDOM& dom, const SkDOM::Node* node);
47 /** Base implementation calls view->inflate(dom, node). Subclasses may override this
51 virtual void inflateView(SkView* view, const SkDOM& dom, const SkDOM::Node* node);
68 void rInflate(const SkDOM& dom, const SkDOM::Node* node, SkView* parent);
|
| /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/ |
| js-context-relaxation.h | 25 Reduction Reduce(Node* node) final;
|
| js-context-specialization.h | 27 Reduction Reduce(Node* node) final;
30 Reduction ReduceJSLoadContext(Node* node);
31 Reduction ReduceJSStoreContext(Node* node);
33 // Returns the {Context} to specialize {node} to (if any).
34 MaybeHandle<Context> GetSpecializationContext(Node* node);
|
| simplified-operator-reducer.h | 25 Reduction Reduce(Node* node) final;
28 Reduction ReduceReferenceEqual(Node* node);
30 Reduction Change(Node* node, const Operator* op, Node* a);
|
| graph-reducer.cc | 10 #include "src/compiler/node.h"
11 #include "src/compiler/node-properties.h"
29 GraphReducer::GraphReducer(Zone* zone, Graph* graph, Node* dead)
46 void GraphReducer::ReduceNode(Node* node) {
49 Push(node);
52 // Process the node on the top of the stack, potentially pushing more or
53 // popping the node off the stack.
57 Node* const node = revisit_.top() local
111 Node* node = entry.node; local
241 Node* node = stack_.top().node; local
[all...] |
| schedule.h | 19 class Node;
23 typedef ZoneVector<Node*> NodeVector;
27 // node. Note that if a basic block has phis, then all phis must appear as the
78 typedef Node* value_type;
81 Node* NodeAt(size_t index) { return nodes_[index]; }
99 void AddNode(Node* node);
110 Node* control_input() const { return control_input_; }
111 void set_control_input(Node* control_input);
162 Node* control_input_; // Input value for control
[all...] |
| js-generic-lowering.cc | 11 #include "src/compiler/node-matchers.h"
12 #include "src/compiler/node-properties.h"
19 static CallDescriptor::Flags AdjustFrameStatesForCall(Node* node) {
20 int count = OperatorProperties::GetFrameStateInputCount(node->op());
22 int index = NodeProperties::FirstFrameStateIndex(node) + 1;
24 node->RemoveInput(index);
39 Reduction JSGenericLowering::Reduce(Node* node) {
40 switch (node->opcode())
[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 | 27 class Node {
29 allocator::set<Node<T>*> references_in;
30 allocator::set<Node<T>*> references_out;
36 Node(T* ptr, Allocator<Node> allocator) : references_in(allocator), references_out(allocator),
38 Node(Node&& rhs) = default;
39 void Edge(Node<T>* ref) {
45 for (auto& node: references_out) {
46 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...] |
| /external/skia/src/xml/ |
| SkDOM.cpp | 17 bool SkXMLParser::parse(const SkDOM& dom, const SkDOMNode* node)
19 const char* elemName = dom.getName(node);
24 SkDOM::AttrIter iter(dom, node);
31 if ((node = dom.getFirstChild(node)) != nullptr)
33 if (!this->parse(dom, node))
35 } while ((node = dom.getNextSibling(node)) != nullptr);
77 const SkDOM::Node* SkDOM::getRootNode() const
82 const SkDOM::Node* SkDOM::getFirstChild(const Node* node, const char name[]) cons
221 SkDOM::Node* node = (SkDOM::Node*)fAlloc->alloc(sizeof(SkDOM::Node) + attrCount * sizeof(SkDOM::Attr), local
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-js-typed-lowering.cc | 9 #include "src/compiler/node-properties.h"
62 Node* context_node;
65 Node* Parameter(Type* t, int32_t index = 0) {
66 Node* n = graph.NewNode(common.Parameter(index), graph.start());
71 Node* UndefinedConstant() {
76 Node* HeapConstant(Handle<HeapObject> constant) {
80 Node* EmptyFrameState(Node* context) {
81 Node* parameters = graph.NewNode(common.StateValues(0));
82 Node* locals = graph.NewNode(common.StateValues(0))
[all...] |
