| /external/webkit/Source/JavaScriptCore/API/tests/ |
| Node.h | 29 typedef struct __Node Node;
33 Node* node; member in struct:__NodeLink
43 extern Node* Node_new(void);
44 extern void Node_ref(Node* node);
45 extern void Node_deref(Node* node);
46 extern void Node_appendChild(Node* node, Node* child)
[all...] |
| NodeList.h | 29 #include "Node.h"
33 Node* parentNode;
36 extern NodeList* NodeList_new(Node* parentNode);
38 extern Node* NodeList_item(NodeList*, unsigned);
|
| /external/webkit/Source/JavaScriptCore/wtf/ |
| SinglyLinkedList.h | 31 template <typename Node> class SinglyLinkedList {
37 void push(Node*);
38 Node* pop();
41 Node* m_head;
44 template <typename Node> inline SinglyLinkedList<Node>::SinglyLinkedList()
49 template <typename Node> inline bool SinglyLinkedList<Node>::isEmpty()
54 template <typename Node> inline void SinglyLinkedList<Node>::push(Node* node
[all...] |
| SentinelLinkedList.h | 30 // Requires: Node is a concrete class with:
31 // Node(SentinelTag);
32 // void setPrev(Node*);
33 // Node* prev();
34 // void setNext(Node*);
35 // Node* next();
44 template <typename Node> class SentinelLinkedList {
46 typedef Node* iterator;
50 void push(Node*);
51 static void remove(Node*);
[all...] |
| DoublyLinkedList.h | 31 template <typename Node> class DoublyLinkedList {
37 Node* head();
39 void append(Node*);
40 void remove(Node*);
43 Node* m_head;
44 Node* m_tail;
47 template <typename Node> inline DoublyLinkedList<Node>::DoublyLinkedList()
53 template <typename Node> inline bool DoublyLinkedList<Node>::isEmpty(
[all...] |
| /external/webkit/Source/WebCore/dom/ |
| EntityReference.idl | 22 interface EntityReference : Node {
|
| ContainerNode.h | 27 #include "Node.h"
33 typedef void (*NodeCallback)(Node*);
40 class ContainerNode : public Node {
44 Node* firstChild() const { return m_firstChild; }
45 Node* lastChild() const { return m_lastChild; }
47 bool insertBefore(PassRefPtr<Node> newChild, Node* refChild, ExceptionCode&, bool shouldLazyAttach = false);
48 bool replaceChild(PassRefPtr<Node> newChild, Node* oldChild, ExceptionCode&, bool shouldLazyAttach = false);
49 bool removeChild(Node* child, ExceptionCode&)
[all...] |
| TreeWalker.h | 39 static PassRefPtr<TreeWalker> create(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> filter, bool expandEntityReferences)
44 Node* currentNode() const { return m_current.get(); }
45 void setCurrentNode(PassRefPtr<Node>, ExceptionCode&);
47 Node* parentNode(ScriptState*);
48 Node* firstChild(ScriptState*);
49 Node* lastChild(ScriptState*);
50 Node* previousSibling(ScriptState*);
51 Node* nextSibling(ScriptState*);
52 Node* previousNode(ScriptState*);
53 Node* nextNode(ScriptState*)
[all...] |
| DynamicNodeList.h | 35 class Node;
44 Node* lastItem;
58 virtual Node* item(unsigned index) const;
59 virtual Node* itemWithName(const AtomicString&) const;
63 Node* rootNode() const { return m_rootNode.get(); }
66 DynamicNodeList(PassRefPtr<Node> rootNode);
67 DynamicNodeList(PassRefPtr<Node> rootNode, Caches*);
71 RefPtr<Node> m_rootNode;
77 Node* itemForwardsFromCurrent(Node* start, unsigned offset, int remainingOffset) const
[all...] |
| NamedNodeMap.idl | 30 Node getNamedItem(in DOMString name);
32 Node setNamedItem(in Node node)
35 Node removeNamedItem(in DOMString name)
38 Node item(in unsigned long index);
45 [OldStyleObjC] Node getNamedItemNS(in [ConvertNullToNullString] DOMString namespaceURI,
50 Node setNamedItemNS(in Node node)
[all...] |
| StaticHashSetNodeList.h | 40 class Node;
48 static PassRefPtr<StaticHashSetNodeList> adopt(const ListHashSet<RefPtr<Node> >& nodes)
50 return adopt(const_cast<ListHashSet<RefPtr<Node> >&>(nodes));
53 static PassRefPtr<StaticHashSetNodeList> adopt(ListHashSet<RefPtr<Node> >& nodes)
59 virtual Node* item(unsigned index) const;
60 virtual Node* itemWithName(const AtomicString&) const;
63 StaticHashSetNodeList(ListHashSet<RefPtr<Node> >& nodes);
65 ListHashSet<RefPtr<Node> > m_nodes;
|
| /ndk/sources/host-tools/nawk-20071023/ |
| proto.h | 30 extern int constnode(Node *);
31 extern char *strnode(Node *);
32 extern Node *notnull(Node *);
47 extern void penter(Node *);
48 extern void freetr(Node *);
53 extern void cfoll(fa *, Node *);
54 extern int first(Node *);
55 extern void follow(Node *);
60 extern Node *reparse(const char *)
[all...] |
| parse.c | 32 Node *nodealloc(int n)
34 Node *x;
36 x = (Node *) malloc(sizeof(Node) + (n-1)*sizeof(Node *));
44 Node *exptostat(Node *a)
50 Node *node1(int a, Node *b)
52 Node *x
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachinePassRegistry.cpp | 22 void MachinePassRegistry::Add(MachinePassRegistryNode *Node) {
23 Node->setNext(List);
24 List = Node;
25 if (Listener) Listener->NotifyAdd(Node->getName(),
26 Node->getCtor(),
27 Node->getDescription());
33 void MachinePassRegistry::Remove(MachinePassRegistryNode *Node) {
35 if (*I == Node) {
36 if (Listener) Listener->NotifyRemove(Node->getName());
|
| /libcore/luni/src/main/java/org/w3c/dom/ |
| NamedNodeMap.java | 29 * Retrieves a node specified by name.
30 * @param name The <code>nodeName</code> of a node to retrieve.
31 * @return A <code>Node</code> (of any type) with the specified
33 * any node in this map.
35 public Node getNamedItem(String name);
38 * Adds a node using its <code>nodeName</code> attribute. If a node with
40 * one. Replacing a node by itself has no effect.
42 * which the node must be stored under, multiple nodes of certain types
46 * @param arg A node to store in this map. The node will later b
[all...] |
| DocumentFragment.java | 21 * which can hold such fragments and it is quite natural to use a Node for
28 * of another <code>Node</code> -- may take <code>DocumentFragment</code>
30 * <code>DocumentFragment</code> being moved to the child list of this node.
31 * <p>The children of a <code>DocumentFragment</code> node are zero or more
37 * child and that child node could be a <code>Text</code> node. Such a
41 * <code>Document</code> (or indeed any other <code>Node</code> that may
44 * <code>Node</code>. This makes the <code>DocumentFragment</code> very
47 * the user can use the standard methods from the <code>Node</code>
48 * interface, such as <code>Node.insertBefore</code> an
[all...] |
| EntityReference.java | 24 * <code>EntityReference</code> node that represents a reference to a known
26 * <code>EntityReference</code> node is a copy of the <code>Entity</code>
27 * node subtree. However, the latter may not be true when an entity contains
30 * the <code>EntityReference</code> node may be bound to different namespace
31 * URIs. When an <code>EntityReference</code> node represents a reference to
32 * an unknown entity, the node has no children and its replacement value,
42 public interface EntityReference extends Node {
|
| /external/webkit/Source/WebCore/xml/ |
| XPathUtil.h | 37 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*);
|
| XPathUtil.cpp | 37 bool isRootDomNode(Node* node)
39 return node && !node->parentNode();
42 String stringValue(Node* node)
44 switch (node->nodeType()) {
45 case Node::ATTRIBUTE_NODE:
46 case Node::PROCESSING_INSTRUCTION_NODE:
47 case Node::COMMENT_NODE
[all...] |
| /external/webkit/Source/WebCore/inspector/ |
| DOMNodeHighlighter.h | 35 class Node;
39 void DrawNodeHighlight(GraphicsContext&, Node*);
|
| /external/skia/include/xml/ |
| SkDOM.h | 33 typedef SkDOMNode Node;
38 const Node* build(const char doc[], size_t len);
39 const Node* copy(const SkDOM& dom, const Node* node);
41 const Node* getRootNode() const;
47 Type getType(const Node*) const;
49 const char* getName(const Node*) const;
50 const Node* getFirstChild(const Node*, const char elem[] = NULL) const
[all...] |
| /packages/apps/Email/emailcommon/src/org/apache/james/mime4j/field/address/parser/ |
| Node.java | 1 /* Generated By:JJTree: Do not edit this line. Node.java */
9 public interface Node {
11 /** This method is called after the node has been made the current
12 node. It indicates that child nodes can now be added to it. */
19 /** This pair of methods are used to inform the node of its
21 public void jjtSetParent(Node n);
22 public Node jjtGetParent();
24 /** This method tells the node to add its argument to the node's
26 public void jjtAddChild(Node n, int i)
[all...] |
| /external/clang/test/CXX/expr/expr.post/expr.ref/ |
| p3.cpp | 3 template<typename T> struct Node {
7 Node<T> n[1];
13 Node<int> n;
|
| /external/webkit/Source/WebCore/editing/ |
| InsertNodeBeforeCommand.h | 35 static PassRefPtr<InsertNodeBeforeCommand> create(PassRefPtr<Node> childToInsert, PassRefPtr<Node> childToInsertBefore)
41 InsertNodeBeforeCommand(PassRefPtr<Node> childToInsert, PassRefPtr<Node> childToInsertBefore);
46 RefPtr<Node> m_insertChild;
47 RefPtr<Node> m_refChild;
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| NodeConsumer.java | 23 import org.w3c.dom.Node;
35 * Set the node that is originating the SAX event.
37 * @param n Reference to node that originated the current event.
39 public void setOriginatingNode(Node n);
|
