| /external/webkit/Source/WebCore/dom/ |
| StaticNodeList.h | 39 class Node;
44 static PassRefPtr<StaticNodeList> adopt(Vector<RefPtr<Node> >& nodes)
50 virtual Node* item(unsigned index) const;
51 virtual Node* itemWithName(const AtomicString&) const;
54 StaticNodeList(Vector<RefPtr<Node> >& nodes)
58 Vector<RefPtr<Node> > m_nodes;
|
| NodeIterator.h | 39 static PassRefPtr<NodeIterator> create(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> filter, bool expandEntityReferences)
45 PassRefPtr<Node> nextNode(ScriptState*, ExceptionCode&);
46 PassRefPtr<Node> previousNode(ScriptState*, ExceptionCode&);
49 Node* referenceNode() const { return m_referenceNode.node.get(); }
52 // This function is called before any node is removed from the document tree.
53 void nodeWillBeRemoved(Node*);
57 PassRefPtr<Node> nextNode(ExceptionCode& ec) { return nextNode(scriptStateFromNode(mainThreadNormalWorld(), referenceNode()), ec); }
58 PassRefPtr<Node> previousNode(ExceptionCode& ec) { return previousNode(scriptStateFromNode(mainThreadNormalWorld(), referenceNode()), ec); }
61 NodeIterator(PassRefPtr<Node>, unsigned whatToShow, PassRefPtr<NodeFilter>, bool expandEntityReferences)
64 RefPtr<Node> node; member in struct:WebCore::NodeIterator::NodePointer
[all...] |
| NodeFilterCondition.h | 37 class Node;
42 virtual short acceptNode(ScriptState*, Node*) const = 0;
|
| NodeIterator.idl | 27 readonly attribute Node root;
31 readonly attribute Node referenceNode;
34 [CallWith=ScriptState] Node nextNode()
36 [CallWith=ScriptState] Node previousNode()
|
| SelectorNodeList.h | 37 class Node;
40 PassRefPtr<StaticNodeList> createSelectorNodeList(Node* rootNode, const CSSSelectorList&);
|
| NodeRenderStyle.h | 30 #include "Node.h"
34 inline RenderStyle* Node::renderStyle() const
|
| /external/webkit/Source/WebCore/editing/ |
| SpellChecker.h | 37 class Node;
46 bool canCheckAsynchronously(Node*) const;
49 bool isCheckable(Node*) const;
50 void requestCheckingFor(TextCheckingTypeMask, Node*);
54 bool initRequest(Node*);
60 RefPtr<Node> m_requestNode;
|
| ModifySelectionListLevel.h | 40 void appendSiblingNodeRange(Node* startNode, Node* endNode, Element* newParent);
41 void insertSiblingNodeRangeBefore(Node* startNode, Node* endNode, Node* refNode);
42 void insertSiblingNodeRangeAfter(Node* startNode, Node* endNode, Node* refNode);
52 static PassRefPtr<Node> increaseSelectionListLevel(Document*);
53 static PassRefPtr<Node> increaseSelectionListLevelOrdered(Document*)
[all...] |
| /libcore/luni/src/main/java/java/util/prefs/ |
| NodeSet.java | 5 import org.w3c.dom.Node;
10 ArrayList<Node> list = new ArrayList<Node>();
12 public NodeSet(Iterator<Node> nodes) {
22 public Node item(int index) {
23 Node result = null;
|
| /libcore/luni/src/main/java/javax/xml/transform/dom/ |
| DOMSource.java | 23 import org.w3c.dom.Node;
41 * <p><code>Node</code> to serve as DOM source.</p>
43 private Node node; field in class:DOMSource
60 * no DOM source is set using {@link #setNode(Node node)} , then the
70 * Create a new input source with a DOM node. The operation
71 * will be applied to the subtree rooted at this node. In XSLT,
74 * from the root node also.
76 * @param n The DOM node that will contain the Source tree
[all...] |
| DOMResult.java | 23 import org.w3c.dom.Node;
28 * <p>If no output DOM source is set, the transformation will create a Document node as the holder for the result of the transformation,
45 * <p><code>node</code>,
57 * <p>Use a DOM node to create a new output target.</p>
59 * <p>In practice, the node should be
60 * a {@link org.w3c.dom.Document} node,
61 * a {@link org.w3c.dom.DocumentFragment} node, or
62 * a {@link org.w3c.dom.Element} node.
63 * In other words, a node that accepts children.</p>
69 * @param node The DOM node that will contain the result tree
337 private Node node = null; field in class:DOMResult
[all...] |
| DOMLocator.java | 23 import org.w3c.dom.Node;
27 * Indicates the position of a node in a source DOM, intended
32 * to indicate the source node that originated a result node.
37 * Return the node where the event occurred.
39 * @return The node that is the location for the event.
41 public Node getOriginatingNode();
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGSDNodes.h | 50 /// isPassiveNode - Return true if the node is a non-scheduled leaf.
52 static bool isPassiveNode(SDNode *Node) {
53 if (isa<ConstantSDNode>(Node)) return true;
54 if (isa<ConstantFPSDNode>(Node)) return true;
55 if (isa<RegisterSDNode>(Node)) return true;
56 if (isa<GlobalAddressSDNode>(Node)) return true;
57 if (isa<BasicBlockSDNode>(Node)) return true;
58 if (isa<FrameIndexSDNode>(Node)) return true;
59 if (isa<ConstantPoolSDNode>(Node)) return true;
60 if (isa<JumpTableSDNode>(Node)) return true
[all...] |
| /external/v8/src/ |
| unbound-queue-inl.h | 37 struct UnboundQueue<Record>::Node: public Malloced {
38 explicit Node(const Record& value)
43 Node* next;
49 first_ = new Node(Record());
62 Node* tmp = first_;
71 Node* next = reinterpret_cast<Node*>(divider_)->next;
79 Node*& next = reinterpret_cast<Node*>(last_)->next;
80 next = new Node(rec)
[all...] |
| /external/webkit/Source/JavaScriptCore/API/tests/ |
| Node.c | 26 #include "Node.h"
30 Node* Node_new(void)
32 Node* node = (Node*)malloc(sizeof(Node)); local
33 node->refCount = 0;
34 node->nodeType = "Node";
35 node->childNodesTail = NULL
[all...] |
| /external/webkit/Source/WebCore/page/ |
| DOMSelection.h | 41 class Node;
55 Node* baseNode() const;
56 Node* extentNode() const;
60 void setBaseAndExtent(Node* baseNode, int baseOffset, Node* extentNode, int extentOffset, ExceptionCode&);
61 void setPosition(Node*, int offset, ExceptionCode&);
70 Node* anchorNode() const;
72 Node* focusNode() const;
76 void collapse(Node*, int offset, ExceptionCode&);
79 void extend(Node*, int offset, ExceptionCode&)
[all...] |
| PluginHalterClient.h | 33 class Node;
39 virtual bool shouldHaltPlugin(Node*, bool isWindowed, const String& pluginName) const = 0;
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMNodeListBase.java | 22 import org.w3c.dom.Node;
66 * @return The node at the <code>index</code>th position in the
70 public Node item(int index) {
75 * The number of nodes in the list. The range of valid child node indices
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| DOMSerializer.java | 25 import org.w3c.dom.Node;
65 * Serializes the DOM node. Throws an exception only if an I/O
70 * @param node the DOM node to serialize
73 public void serialize(Node node) throws IOException;
|
| TransformStateSetter.java | 25 import org.w3c.dom.Node;
43 * Set the current node.
45 * @param n The current node.
47 void setCurrentNode(Node n);
|
| /external/llvm/unittests/ADT/ |
| ilistTest.cpp | 19 struct Node : ilist_node<Node> {
22 Node() {}
23 Node(int _Value) : Value(_Value) {}
27 ilist<Node> List;
28 List.push_back(Node(1));
33 List.push_back(Node(2));
38 const ilist<Node> &ConstList = List;
|
| /external/webkit/Source/WebCore/bindings/generic/ |
| BindingSecurityBase.h | 38 class Node;
46 static Frame* getFrame(Node*);
|
| /external/webkit/Source/WebKit/android/ |
| RenderSkinRadio.h | 39 class Node;
56 static void Draw(SkCanvas* canvas, Node* element, const IntRect&,
|
| /libcore/luni/src/main/java/org/w3c/dom/ |
| 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 i
[all...] |
| /external/clang/test/CodeGenCXX/ |
| constructor-template.cpp | 28 template <typename T> class Node {
31 Node(){ } // Node<BinomialNode<int>*>::Node() remains undefined.
32 ~Node() {}
36 template<typename T> class BinomialNode : Node<BinomialNode<T>*> {
44 BinomialNode<int> *node = new BinomialNode<int>(1); local
45 delete node;
|
