| /libcore/luni/src/main/java/org/w3c/dom/ls/ |
| LSSerializerFilter.java | 15 import org.w3c.dom.traversal.NodeFilter;
21 * based on the <code>NodeFilter</code> interface defined in [<a href='http://www.w3.org/TR/2000/REC-DOM-Level-2-Traversal-Range-20001113'>DOM Level 2 Traversal and Range</a>]
47 public interface LSSerializerFilter extends NodeFilter {
51 * is automatically serialized. See <code>NodeFilter</code> for
|
| /external/webkit/Source/WebCore/dom/ |
| NodeFilterCondition.cpp | 28 #include "NodeFilter.h"
34 return NodeFilter::FILTER_ACCEPT;
|
| NodeFilter.h | 34 class NodeFilter : public RefCounted<NodeFilter> {
68 static PassRefPtr<NodeFilter> create(PassRefPtr<NodeFilterCondition> condition)
70 return adoptRef(new NodeFilter(condition));
73 static PassRefPtr<NodeFilter> create()
75 return adoptRef(new NodeFilter());
87 NodeFilter(PassRefPtr<NodeFilterCondition> condition) : m_condition(condition) { }
88 NodeFilter() {}
|
| Traversal.h | 34 class NodeFilter;
40 NodeFilter* filter() const { return m_filter.get(); }
44 Traversal(PassRefPtr<Node>, unsigned whatToShow, PassRefPtr<NodeFilter>, bool expandEntityReferences);
50 RefPtr<NodeFilter> m_filter;
|
| Traversal.cpp | 29 #include "NodeFilter.h"
33 Traversal::Traversal(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> nodeFilter, bool expandEntityReferences)
36 , m_filter(nodeFilter)
48 return NodeFilter::FILTER_SKIP;
50 return NodeFilter::FILTER_ACCEPT;
|
| NodeFilter.cpp | 26 #include "NodeFilter.h"
32 short NodeFilter::acceptNode(ScriptState* state, Node* node) const
|
| TreeWalker.cpp | 30 #include "NodeFilter.h"
36 TreeWalker::TreeWalker(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> filter, bool expandEntityReferences)
67 if (acceptNodeResult == NodeFilter::FILTER_ACCEPT)
80 case NodeFilter::FILTER_ACCEPT:
83 case NodeFilter::FILTER_SKIP:
89 case NodeFilter::FILTER_REJECT:
113 case NodeFilter::FILTER_ACCEPT:
116 case NodeFilter::FILTER_SKIP:
122 case NodeFilter::FILTER_REJECT:
150 case NodeFilter::FILTER_ACCEPT
[all...] |
| NodeIterator.idl | 29 readonly attribute NodeFilter filter;
|
| /external/webkit/Source/WebCore/bindings/cpp/ |
| WebDOMNodeFilterCustom.cpp | 42 RefPtr<WebCore::NodeFilter> listener = WebCore::NodeFilter::create(WebNativeNodeFilterCondition::create(value));
|
| /external/webkit/Source/WebCore/bindings/js/ |
| JSNodeFilterCondition.cpp | 25 #include "NodeFilter.h"
35 JSNodeFilterCondition::JSNodeFilterCondition(JSGlobalData& globalData, NodeFilter* owner, JSValue filter)
45 return NodeFilter::FILTER_ACCEPT;
54 return NodeFilter::FILTER_REJECT;
63 throwError(exec, createTypeError(exec, "NodeFilter object does not have an acceptNode function"));
64 return NodeFilter::FILTER_REJECT;
73 return NodeFilter::FILTER_REJECT;
77 return NodeFilter::FILTER_REJECT;
81 return NodeFilter::FILTER_REJECT;
|
| JSNodeFilterCustom.cpp | 32 #include "NodeFilter.h"
45 PassRefPtr<NodeFilter> toNodeFilter(JSGlobalData& globalData, JSValue value)
50 RefPtr<NodeFilter> result = NodeFilter::create();
|
| JSNodeIteratorCustom.cpp | 25 #include "NodeFilter.h"
36 if (NodeFilter* filter = m_impl->filter())
|
| JSTreeWalkerCustom.cpp | 25 #include "NodeFilter.h"
36 if (NodeFilter* filter = m_impl->filter())
|
| JSNodeFilterCondition.h | 31 class NodeFilter;
35 static PassRefPtr<JSNodeFilterCondition> create(JSC::JSGlobalData& globalData, NodeFilter* owner, JSC::JSValue filter)
41 JSNodeFilterCondition(JSC::JSGlobalData&, NodeFilter* owner, JSC::JSValue filter);
|
| /external/webkit/Source/WebCore/bindings/objc/ |
| ObjCNodeFilterCondition.mm | 34 #import "NodeFilter.h"
43 return NodeFilter::FILTER_REJECT;
|
| DOMInternal.h | 46 class NodeFilter;
83 DOMNodeFilter *kit(WebCore::NodeFilter*);
84 WebCore::NodeFilter* core(DOMNodeFilter *);
|
| /external/webkit/LayoutTests/fast/dom/TreeWalker/script-tests/ |
| acceptNode-filter.js | 12 return NodeFilter.FILTER_SKIP;
13 return NodeFilter.FILTER_ACCEPT;
17 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, filter, false);
22 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, {
26 return NodeFilter.FILTER_SKIP;
27 return NodeFilter.FILTER_ACCEPT;
35 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, null, false);
41 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, undefined, false);
47 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, {}, false);
55 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, { acceptNode: "foo" }, false)
[all...] |
| traversal-reject.js | 10 return NodeFilter.FILTER_REJECT;
12 return NodeFilter.FILTER_ACCEPT;
19 return NodeFilter.FILTER_SKIP;
21 return NodeFilter.FILTER_ACCEPT;
26 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, rejectB1Filter, false);
32 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, rejectB1Filter, false);
37 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, rejectB2Filter, false);
43 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, rejectB1Filter, false);
48 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, rejectB2Filter, false);
53 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, rejectB1Filter, false)
[all...] |
| traversal-skip.js | 10 return NodeFilter.FILTER_SKIP;
12 return NodeFilter.FILTER_ACCEPT;
19 return NodeFilter.FILTER_SKIP;
21 return NodeFilter.FILTER_ACCEPT;
26 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, skipB1Filter, false);
33 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, skipB1Filter, false);
38 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, skipB2Filter, false);
44 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, skipB1Filter, false);
49 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, skipB2Filter, false);
54 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, skipB1Filter, false)
[all...] |
| traversal-skip-most.js | 10 return NodeFilter.FILTER_ACCEPT;
12 return NodeFilter.FILTER_SKIP;
17 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, filter, false);
22 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, filter, false);
|
| filter-throw.js | 8 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, function(node) {
10 return NodeFilter.FILTER_ACCEPT;
19 walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, {
22 return NodeFilter.FILTER_ACCEPT;
|
| previousNodeLastChildReject.js | 9 return NodeFilter.FILTER_REJECT;
10 return NodeFilter.FILTER_ACCEPT;
13 var walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, filter, false);
|
| previousSiblingLastChildSkip.js | 9 return NodeFilter.FILTER_SKIP;
10 return NodeFilter.FILTER_ACCEPT;
13 var walker = document.createTreeWalker(testElement, NodeFilter.SHOW_ELEMENT, filter, false);
|
| /libcore/luni/src/main/java/org/w3c/dom/traversal/ |
| NodeIterator.java | 43 * in the <code>NodeFilter</code> interface. Nodes not accepted by
51 * The <code>NodeFilter</code> used to screen nodes.
53 public NodeFilter getFilter();
|
| NodeFilter.java | 20 * <code>NodeFilter</code>, it applies the filter before it returns the next
24 * <p>The DOM does not provide any filters. <code>NodeFilter</code> is just an
37 public interface NodeFilter {
|
