| /libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
| NodeImpl.java | 31 import org.w3c.dom.Node;
38 * A straightforward implementation of the corresponding W3C DOM node.
43 * <p>This class represents a Node that has neither a parent nor children.
48 public abstract class NodeImpl implements Node {
71 public Node appendChild(Node newChild) throws DOMException {
75 public final Node cloneNode(boolean deep) {
87 public Node getFirstChild() {
91 public Node getLastChild() {
103 public Node getNextSibling()
[all...] |
| /bionic/libc/stdio/ |
| flockfile.c | 53 /* a node in the hash table */
107 FileLock* node = *pnode; local
108 if (node == NULL || node->file == f)
110 pnode = &node->next;
127 /* create a new node in the hash table */
|
| /build/core/ |
| node_fns.mk | 146 # $(2): name of this node
183 # $(2): makefile representing this node
184 # $(3): list of node variable names
187 define _import-node
219 # $(3): list of node variable names
230 $(call _import-node,$(1),$(strip $(_in)),$(3)) \
241 # $(3): list of node variable names
|
| /build/tools/droiddoc/src/ |
| NavTree.java | 24 ArrayList<Node> children = new ArrayList();
28 Node node = new Node("Reference", dir + "packages.html", children, null); local
32 // if you want a root node
34 node.render(buf);
37 // if you don't want a root node
38 node.renderChildren(buf);
46 private static Node makePackageNode(PackageInfo pkg) {
47 ArrayList<Node> children = new ArrayList()
[all...] |
| /cts/tools/host/src/com/android/cts/ |
| XMLResourceHandler.java | 32 import org.w3c.dom.Node;
40 protected String getElementContent(Node elem) {
45 * Get string from DOM node by attribute name.
47 * @param elem a node from DOM tree.
49 * @return string value of the attribute name from the DOM node.
51 static public String getStringAttributeValue(Node elem, String attrName) {
52 Node node = elem.getAttributes().getNamedItem(attrName); local
53 if (node == null) {
56 return node.getNodeValue().trim()
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| DomFront.java | 84 SsaBasicBlock node = nodes.get(i); local
86 + node.getPredecessors());
127 SsaBasicBlock node = nodes.get(i); local
132 for (SsaBasicBlock child : node.getDomChildren()) {
141 System.out.println("domChildren[" + node + "]: "
148 * is for each node. This sweeps the node list and builds the proper
|
| /development/tools/line_endings/ |
| line_endings.c | 20 typedef struct Node {
21 struct Node *next;
23 } Node;
62 Node* root = malloc(sizeof(Node));
63 Node* node = root; local
64 node->buf[0] = 0;
67 node->next = malloc(sizeof(Node));
[all...] |
| /external/bluetooth/glib/tests/ |
| node-test.c | 69 node_build_string (GNode *node,
76 c[0] = P2C (node->data);
89 GNode *node; local
138 node = g_node_nth_child (node_B, i);
139 TEST (NULL, P2C (node->data) == ('C' + i));
154 * child of 'F', which will cause 'F' to be the last node visited.
197 node = root;
201 g_node_append (node, g_node_new (NULL));
203 node = node->children->next
[all...] |
| /external/chromium/third_party/icu/source/tools/genrb/ |
| rle.c | 300 int32_t node = 0; local
344 * if we could look ahead, but we can't, so we use 'node' to
347 switch (node) {
349 /* Normal idle node */
351 node = 1;
363 node = 0;
367 node = 2;
384 node = 0;
390 if (node != 0){
|
| /external/clearsilver/util/ |
| neo_hash.c | 52 NE_HASHNODE *node, *next; local
62 node = my_hash->nodes[x];
63 while (node)
65 next = node->next;
66 free(node);
67 node = next;
79 NE_HASHNODE **node; local
81 node = _hash_lookup_node(hash, key, &hashv);
83 if (*node)
85 (*node)->value = value
105 NE_HASHNODE *node; local
114 NE_HASHNODE **node, *remove; local
131 NE_HASHNODE *node; local
141 NE_HASHNODE **node = 0; local
189 NE_HASHNODE **node; local
[all...] |
| /external/gtest/samples/ |
| sample3-inl.h | 46 // QueueNode is a node in a Queue, which consists of an element of
47 // type E and a pointer to the next node.
53 // Gets the element in this node.
56 // Gets the next node in the queue.
61 // Creates a node with a given element value. The next pointer is
86 // 1. Deletes every node.
87 QueueNode<E> * node = head_; local
88 QueueNode<E> * next = node->next();
90 delete node;
91 node = next
[all...] |
| /external/icu4c/tools/genrb/ |
| rle.c | 300 int32_t node = 0; local
344 * if we could look ahead, but we can't, so we use 'node' to
347 switch (node) {
349 /* Normal idle node */
351 node = 1;
363 node = 0;
367 node = 2;
384 node = 0;
390 if (node != 0){
|
| /external/protobuf/gtest/samples/ |
| sample3-inl.h | 46 // QueueNode is a node in a Queue, which consists of an element of
47 // type E and a pointer to the next node.
53 // Gets the element in this node.
56 // Gets the next node in the queue.
61 // Creates a node with a given element value. The next pointer is
86 // 1. Deletes every node.
87 QueueNode<E> * node = head_; local
88 QueueNode<E> * next = node->next();
90 delete node;
91 node = next
[all...] |
| /external/skia/src/views/ |
| SkViewInflate.cpp | 13 void SkViewInflate::rInflate(const SkDOM& dom, const SkDOM::Node* node, SkView* parent)
15 const char* str = dom.findAttr(node, "id");
19 const SkDOM::Node* child = dom.getFirstChild(node);
43 this->inflateView(parent, dom, node);
46 void SkViewInflate::inflateView(SkView* view, const SkDOM& dom, const SkDOM::Node* node)
51 view->inflate(dom, node);
54 SkView* SkViewInflate::inflate(const SkDOM& dom, const SkDOM::Node* node, SkView* root
97 const SkDOM::Node* node = dom.build(xml, len); local
[all...] |
| /external/v8/src/ |
| zone-inl.h | 74 // If the tree is empty, insert the new node.
75 root_ = new Node(key, C::kNoValue);
77 // Splay on the key to move the last node on the search path
86 // Insert the new node.
87 Node* node = new Node(key, C::kNoValue); local
89 node->left_ = root_;
90 node->right_ = root_->right_;
93 node->right_ = root_
286 Node* node = nodes_to_visit[pos++]; local
[all...] |
| /external/webkit/JavaScriptCore/API/tests/ |
| JSNode.c | 31 #include "Node.h"
46 JSStringRef message = JSStringCreateWithUTF8CString("TypeError: first argument to appendChild must be a node");
50 Node* node = JSObjectGetPrivate(thisObject); local
51 Node* child = JSObjectGetPrivate(JSValueToObject(context, arguments[0], NULL));
53 Node_appendChild(node, child);
67 Node* node = JSObjectGetPrivate(thisObject); local
68 Node* child = JSObjectGetPrivate(JSValueToObject(context, arguments[0], exception));
70 Node_removeChild(node, child)
86 Node* node = JSObjectGetPrivate(thisObject); local
111 Node* node = JSObjectGetPrivate(object); local
127 Node* node = JSObjectGetPrivate(thisObject); local
152 Node* node = JSObjectGetPrivate(object); local
160 Node* node = JSObjectGetPrivate(object); local
[all...] |
| minidom.c | 53 JSStringRef node = JSStringCreateWithUTF8CString("Node"); local
54 JSObjectSetProperty(context, globalObject, node, JSObjectMakeConstructor(context, JSNode_class(context), JSNode_construct), kJSPropertyAttributeNone, NULL);
55 JSStringRelease(node);
|
| /external/webkit/WebCore/bindings/v8/custom/ |
| V8HTMLDocumentCustom.cpp | 96 Node* node = items->firstItem(); local
98 if (node->hasTagName(HTMLNames::iframeTag) && (frame = static_cast<HTMLIFrameElement*>(node)->contentFrame()))
101 return toV8(node);
|
| /external/webkit/WebCore/editing/ |
| InsertTextCommand.cpp | 60 // It may be necessary to insert a text node to receive characters.
61 if (!pos.node()->isTextNode()) {
62 RefPtr<Node> textNode = document()->createEditingTextNode("");
67 if (isTabSpanTextNode(pos.node())) {
68 RefPtr<Node> textNode = document()->createEditingTextNode("");
89 if (start.node() != end.node() || !start.node()->isTextNode() || isTabSpanTextNode(start.node()))
92 replaceTextInNode(static_cast<Text*>(start.node()), start.deprecatedEditingOffset(), end.deprecatedEditingOffset() - start.deprecatedEditingOffset (…)
222 Node *node = insertPos.node(); local
[all...] |
| ModifySelectionListLevel.cpp | 49 static bool getStartEndListChildren(const VisibleSelection& selection, Node*& start, Node*& end)
55 Node* startListChild = enclosingListChild(selection.start().node());
60 Node* endListChild = selection.isRange() ? enclosingListChild(selection.end().node()) : startListChild;
82 if (r && isListElement(r->node()))
83 endListChild = r->node();
91 void ModifySelectionListLevelCommand::insertSiblingNodeRangeBefore(Node* startNode, Node* endNode, Node* refNode
93 Node* node = startNode; local
108 Node* node = startNode; local
124 Node* node = startNode; local
[all...] |
| /external/webkit/WebCore/html/ |
| HTMLLabelElement.cpp | 58 Node* node = this; local
59 while ((node = node->traverseNextNode(this))) {
60 if (node->isHTMLElement()) {
61 HTMLElement* element = static_cast<HTMLElement*>(node);
|
| /external/webkit/WebCore/platform/graphics/android/ |
| PlatformGraphicsContext.h | 40 Container(WebCore::Node* node, const WebCore::IntRect& r)
41 : m_node(node), m_rect(r), m_state(WebCore::RenderSkinAndroid::kDisabled)
84 bool matches(const WebCore::Node* match) { return m_node == match; }
86 const WebCore::Node* node() const { return m_node; } function in class:Container
106 // corresponds to the focused node passed in. If its state has changed,
127 WebCore::Node* m_node;
155 // nod/rect, and record a new subpicture for this node/button in the current
157 void storeButtonInfo(Node* node, const IntRect& r)
[all...] |
| /external/webkit/WebCore/rendering/ |
| CounterNode.cpp | 110 const CounterNode* node = this; local
112 node->resetRenderer(identifier);
113 node = node->nextInPreOrder(this);
114 } while (node);
119 for (CounterNode* node = this; node; node = node->m_nextSibling) {
120 int oldCount = node->m_countInParent
[all...] |
| /external/webkit/WebCore/xml/ |
| XPathExpressionNode.h | 33 #include "Node.h"
43 RefPtr<Node> node; member in struct:WebCore::XPath::EvaluationContext
|
| XPathPath.cpp | 69 Node* node = nodes[j]; local
71 evaluationContext.node = node;
75 newNodes.append(node);
98 // For absolute location paths, the context node is ignored - the
99 // document's root node is used instead.
100 Node* context = evaluationContext.node.get();
101 if (m_absolute && context->nodeType() != Node::DOCUMENT_NODE)
139 Node* node = matches[nodeIndex]; local
[all...] |
