| /external/webkit/WebCore/dom/ |
| NodeWithIndex.h | 29 #include "Node.h"
33 // For use when you want to get the index for a node repeatedly and
37 NodeWithIndex(Node* node)
38 : m_node(node)
41 ASSERT(node);
44 Node* node() const { return m_node; } function in class:WebCore::NodeWithIndex
57 Node* m_node;
|
| DynamicNodeList.cpp | 31 DynamicNodeList::DynamicNodeList(PassRefPtr<Node> rootNode)
39 DynamicNodeList::DynamicNodeList(PassRefPtr<Node> rootNode, DynamicNodeList::Caches* caches)
59 for (Node* n = m_rootNode->firstChild(); n; n = n->traverseNextNode(m_rootNode.get()))
68 Node* DynamicNodeList::itemForwardsFromCurrent(Node* start, unsigned offset, int remainingOffset) const
71 for (Node* n = start; n; n = n->traverseNextNode(m_rootNode.get())) {
83 return 0; // no matching node in this subtree
86 Node* DynamicNodeList::itemBackwardsFromCurrent(Node* start, unsigned offset, int remainingOffset) const
89 for (Node* n = start; n; n = n->traversePreviousNode(m_rootNode.get()))
125 Element* node = m_rootNode->document()->getElementById(elementId); local
139 Node* node = item(i); local
[all...] |
| Range.idl | 26 readonly attribute Node startContainer
30 readonly attribute Node endContainer
36 readonly attribute Node commonAncestorContainer
39 [OldStyleObjC] void setStart(in Node refNode,
42 [OldStyleObjC] void setEnd(in Node refNode,
45 void setStartBefore(in Node refNode)
47 void setStartAfter(in Node refNode)
49 void setEndBefore(in Node refNode)
51 void setEndAfter(in Node refNode)
55 void selectNode(in Node refNode
[all...] |
| Node.cpp | 26 #include "Node.h"
118 static HashSet<Node*>* gNodesDispatchingSimulatedClicks = 0;
120 bool Node::isSupported(const String& feature, const String& version)
126 static HashSet<Node*> liveNodeSet;
129 void Node::dumpStatistics()
157 for (HashSet<Node*>::iterator it = liveNodeSet.begin(); it != liveNodeSet.end(); ++it) {
158 Node* node = *it; local
160 if (node->hasRareData())
163 switch (node->nodeType())
665 RefPtr<Node> node = this; local
1287 Node *node = previousLeafNode(); local
1298 Node *node = nextLeafNode(); local
1363 Node *node = previousNodeConsideringAtomicNodes(); local
1374 Node *node = nextNodeConsideringAtomicNodes(); local
2226 const Node* node = this; local
[all...] |
| /external/webkit/WebCore/page/ |
| MouseEventWithHitTestResults.cpp | 24 #include "Node.h"
36 Node* MouseEventWithHitTestResults::targetNode() const
38 Node* node = m_hitTestResult.innerNode(); local
39 if (!node)
41 if (node->inDocument())
42 return node;
44 Element* element = node->parentElement();
48 return node;
|
| DOMSelection.cpp | 35 #include "Node.h"
44 static Node* selectionShadowAncestor(Frame* frame)
46 Node* node = frame->selection()->selection().base().anchorNode(); local
47 if (!node)
49 Node* shadowAncestor = node->shadowAncestorNode();
50 if (shadowAncestor == node)
98 Node* DOMSelection::anchorNode() const
102 if (Node* shadowAncestor = selectionShadowAncestor(m_frame)
[all...] |
| /external/webkit/WebCore/xml/ |
| XPathUtil.h | 36 class Node;
41 /* @return whether the given node is the root node */
42 bool isRootDomNode(Node*);
44 /* @return the 'string-value' of the given node as specified by http://www.w3.org/TR/xpath */
45 String stringValue(Node*);
47 /* @return whether the given node is a valid context node */
48 bool isValidContextNode(Node*);
|
| /external/clearsilver/man/man3/ |
| hdf_set_int_value.3 | 14 hdf_set_int_value - Set the value of a named node to a number
27 name -> the named node to walk to
29 value -> the value to set the node to
|
| /external/webkit/WebCore/editing/ |
| InsertLineBreakCommand.cpp | 55 void InsertLineBreakCommand::insertNodeAfterPosition(Node* node, const Position& pos)
60 Element* cb = pos.node()->enclosingBlockFlowElement();
61 if (cb == pos.node())
62 appendNode(node, cb);
64 insertNodeAfter(node, pos.node());
67 void InsertLineBreakCommand::insertNodeBeforePosition(Node* node, const Position& pos)
72 Element* cb = pos.node()->enclosingBlockFlowElement()
[all...] |
| /external/webkit/WebCore/html/ |
| HTMLCollection.h | 37 class Node;
45 static PassRefPtr<HTMLCollection> create(PassRefPtr<Node> base, CollectionType);
50 virtual Node* item(unsigned index) const;
51 virtual Node* nextItem() const;
53 virtual Node* namedItem(const AtomicString& name) const;
54 virtual Node* nextNamedItem(const AtomicString& name) const; // In case of multiple items named the same way
56 Node* firstItem() const;
58 void namedItems(const AtomicString& name, Vector<RefPtr<Node> >&) const;
62 Node* base() const { return m_base.get(); }
66 HTMLCollection(PassRefPtr<Node> base, CollectionType, CollectionCache*)
[all...] |
| /external/webkit/WebKit/chromium/src/ |
| WebEventListenerPrivate.h | 39 class Node;
55 const WebString& eventType, bool useCapture, Node* node);
57 // Gets the ListenerEventWrapper for a specific node.
60 const WebString& eventType, bool useCapture, Node* node);
71 Node* node)
75 , node(node)
82 Node* node; member in struct:WebKit::WebEventListenerPrivate::ListenerInfo
[all...] |
| /packages/apps/Email/src/org/apache/james/mime4j/field/address/parser/ |
| SimpleNode.java | 5 public class SimpleNode extends org.apache.james.mime4j.field.address.parser.BaseNode implements Node {
6 protected Node parent;
7 protected Node[] children;
26 public void jjtSetParent(Node n) { parent = n; }
27 public Node jjtGetParent() { return parent; }
29 public void jjtAddChild(Node n, int i) {
31 children = new Node[i + 1];
33 Node c[] = new Node[i + 1];
40 public Node jjtGetChild(int i)
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/ui/tree/ |
| UiActions.java | 29 import org.w3c.dom.Node;
34 * Performs basic actions on an XML tree: add node, remove node, move up/down.
51 * Utility method to select an outline item based on its model node
53 * @param uiNode The node to select. Can be null (in which case nothing should happen)
72 * Displays a selection dialog that lets the user select which kind of node
78 // If the root node is a document with already a root, use it as the root node
105 * If a sibling is given and that sibling has the same parent, the new node is added
106 * right after that sibling. Otherwise the new node is added at the end of the paren
199 final UiElementNode node = last_node = nodes.get(i); local
280 final UiElementNode node = last_node = nodes.get(i); local
[all...] |
| /dalvik/libcore/xml/src/main/java/org/w3c/dom/ |
| Text.java | 24 * <code>Text</code> node for each block of text. Users may create adjacent
29 * <code>Node.normalize()</code> method merges any such adjacent
30 * <code>Text</code> objects into a single node for each block of text.
31 * <p> No lexical check is done on the content of a <code>Text</code> node
42 * Breaks this node into two nodes at the specified <code>offset</code>,
43 * keeping both in the tree as siblings. After being split, this node
45 * new node of the same type, which contains all the content at and
47 * node had a parent node, the new node is inserted as the next sibling
[all...] |
| UserDataHandler.java | 16 * When associating an object to a key on a node using
17 * <code>Node.setUserData()</code> the application can provide a handler
18 * that gets called when the node the object is associated to is being
28 * The node is cloned, using <code>Node.cloneNode()</code>.
32 * The node is imported, using <code>Document.importNode()</code>.
36 * The node is deleted.
43 * The node is renamed, using <code>Document.renameNode()</code>.
47 * The node is adopted, using <code>Document.adoptNode()</code>.
52 * This method is called whenever the node for which this handler is
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/mock/ |
| MockXmlNode.java | 22 import org.w3c.dom.Node;
30 * A mock XML node with only a minimal set of information.
32 public class MockXmlNode implements Node {
44 // namespace stuff only set in the root node
49 * Constructs a node from a given children list.
51 * @param namespace The namespace of the node or null if none
52 * @param localName The XML local node name.
53 * @param node_type One of Node.xxx_NODE constants, e.g. Node.ELEMENT_NODE
66 * Constructs an attribute node
99 MockXmlNode node = mAttributes.addAttribute(namespaceURI, localName, value); local
[all...] |
| /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...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ |
| DTMAxisTraverser.java | 39 * { ... processing for node indicated by nodeHandle goes here ... }
48 * By the nature of the stateless traversal, the context node can not be
50 * an axis, the first function must be used to get the first node.
53 * the self node. <\p>
55 * @param context The context node of this traversal. This is the point
57 * @return the first node in the traversal.
65 * By the nature of the stateless traversal, the context node can not be
67 * an axis, the first function must be used to get the first node.
70 * the self node. <\p>
72 * @param context The context node of this traversal. This is the poin
[all...] |
| /dalvik/libcore/xml/src/main/java/org/w3c/dom/traversal/ |
| NodeFilter.java | 15 import org.w3c.dom.Node;
21 * node. If the filter says to accept the node, the traversal logic returns
22 * it; otherwise, traversal looks for the next node and pretends that the
23 * node that was rejected was not there.
26 * <p><code>NodeFilters</code> do not need to know how to traverse from node
27 * to node, nor do they need to know anything about the data structure that
29 * only thing they have to know how to do is evaluate a single node. One
40 * Accept the node. Navigation methods defined for
42 * node
[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...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| DOM2DTM.java | 50 import org.w3c.dom.Node;
57 * tree. You can wrap a DOM2DTM around a specific node and its subtree
75 /** The current position in the DOM tree. Last node examined for
77 transient private Node m_pos;
87 transient private Node m_root;
90 synthesis of the implied xml: namespace declaration node. */
98 /** The node objects. The instance part of the handle indexes
99 * directly into this vector. Each DTM node may actually be
102 * single DTM Text node); this table points only to the first in
107 * Construct a DOM2DTM object from a DOM node
781 Node node = lookupNode(identity); local
816 Node node = getNode(nodeHandle); local
871 Node node = getNode(nodeHandle); local
958 Node node = getNode(nodeHandle); local
982 Node node = getNode(nodeHandle); local
1001 Node node = getNode(nodeHandle); local
1060 Node node = getNode(nodeHandle); local
1103 Node node = getNode(nodeHandle); local
1115 Node node = getNode(nodeHandle); local
1164 Node node = getNode(nodeHandle); local
1363 Node node = getNode(identity); local
1621 Node node = getNode(nodeHandle); local
1726 Node node = getNode(nodeHandle); local
[all...] |
| /external/webkit/WebKit/android/nav/ |
| CacheBuilder.h | 48 class Node;
83 static bool ConstructPartRects(Node* node, const IntRect& bounds,
85 Node* currentFocus() const;
96 static void GetGlobalOffset(Node* , int* x, int * y);
115 Node* mFinalNode;
132 Node* mNode;
133 Node* mFinalNode;
188 Node* mLastChild;
191 Node* mNode
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/sax2dtm/ |
| SAX2DTM2.java | 69 * Iterator that returns all immediate children of a given node
80 * or set current node to END, to indicate request-not-honored?
82 * @param node Sets the root of the iteration.
86 public DTMAxisIterator setStartNode(int node)
89 if (node == DTMDefaultBase.ROOTNODE)
90 node = getDocument();
93 _startNode = node;
94 _currentNode = (node == DTM.NULL) ? DTM.NULL
95 : _firstch2(makeNodeIdentity(node));
104 * Get the next node in the iteration
112 int node = _currentNode; local
268 int node = _currentNode; local
313 int node = _currentNode; local
375 final int node = _startNode; local
477 int node = _currentNode; local
536 final int node = _currentNode; local
599 final int node = _currentNode; local
690 final int node = _currentNode; local
727 int node = _currentNode; local
763 int node = _currentNode; local
983 int node = _currentNode; local
1116 int node = _currentNode; local
1169 int node; local
1577 int node = _currentNode; local
1665 int node = _currentNode; local
[all...] |
| /dalvik/libcore/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...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xalan/transformer/ |
| Counter.java | 34 * the node count is based on its position in the cache list
48 * from. In other words, the count of a given node
49 * in the m_countNodes vector is node position +
60 * The node from where the counting starts. This is needed to
61 * find a counter if the node being counted is not immediatly
105 * Try and find a node that was previously counted. If found,
109 * @param node The node to be counted.
111 * @return The count of the node, or -1 if not found.
113 int getPreviouslyCounted(XPathContext support, int node)
[all...] |
