| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| ExtendedType.java | 29 private int nodetype; field in class:ExtendedType
38 * @param nodetype Type of the node
42 public ExtendedType (int nodetype, String namespace, String localName)
44 this.nodetype = nodetype;
47 this.hash = nodetype + namespace.hashCode() + localName.hashCode();
54 * @param nodetype Type of the node
59 public ExtendedType (int nodetype, String namespace, String localName, int hash)
61 this.nodetype = nodetype;
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| TreeNode.h | 50 typedef T NodeType;
61 NodeType* next() const { return m_next; }
62 NodeType* previous() const { return m_previous; }
63 NodeType* parent() const { return m_parent; }
64 NodeType* firstChild() const { return m_firstChild; }
65 NodeType* lastChild() const { return m_lastChild; }
66 NodeType* here() const { return static_cast<NodeType*>(const_cast<TreeNode*>(this)); }
71 void insertBefore(NodeType* newChild, NodeType* refChild
[all...] |
| /external/llvm/include/llvm/Support/ |
| DataFlow.h | 27 typedef const Value NodeType;
30 static NodeType *getEntryNode(const Value *G) {
34 static inline ChildIteratorType child_begin(NodeType *N) {
38 static inline ChildIteratorType child_end(NodeType *N) {
44 typedef Value NodeType;
47 static NodeType *getEntryNode(Value *G) {
51 static inline ChildIteratorType child_begin(NodeType *N) {
55 static inline ChildIteratorType child_end(NodeType *N) {
61 typedef const Value NodeType;
64 static NodeType *getEntryNode(Inverse<const User*> G)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| TreeShared.h | 31 template<typename NodeType> class TreeShared;
32 template<typename NodeType> void adopted(TreeShared<NodeType>*);
35 template<typename NodeType> class TreeShared {
76 NodeType* thisNode = static_cast<NodeType*>(this);
100 friend void adopted<>(TreeShared<NodeType>*);
107 template<typename NodeType> inline void adopted(TreeShared<NodeType>* object)
|
| CDATASection.h | 38 virtual NodeType nodeType() const;
39 virtual bool childTypeAllowed(NodeType) const;
43 DEFINE_NODE_TYPE_CASTS(CDATASection, nodeType() == Node::CDATA_SECTION_NODE);
|
| Comment.h | 40 virtual NodeType nodeType() const;
42 virtual bool childTypeAllowed(NodeType) const;
45 DEFINE_NODE_TYPE_CASTS(Comment, nodeType() == Node::COMMENT_NODE);
|
| DocumentFragment.h | 49 virtual NodeType nodeType() const;
51 virtual bool childTypeAllowed(NodeType) const;
54 DEFINE_NODE_TYPE_CASTS(DocumentFragment, nodeType() == Node::DOCUMENT_FRAGMENT_NODE);
|
| ElementTraversal.h | 59 template <class NodeType>
60 inline Element* firstElementWithinTemplate(NodeType& current)
71 template <class NodeType>
72 inline Element* traverseNextElementTemplate(NodeType& current)
82 template <class NodeType>
83 inline Element* traverseNextElementTemplate(NodeType& current, const Node* stayWithin)
93 template <class NodeType>
94 inline Element* traverseNextElementSkippingChildrenTemplate(NodeType& current)
104 template <class NodeType>
105 inline Element* traverseNextElementSkippingChildrenTemplate(NodeType& current, const Node* stayWithin
[all...] |
| CDATASection.cpp | 45 Node::NodeType CDATASection::nodeType() const
50 bool CDATASection::childTypeAllowed(NodeType) const
|
| Comment.cpp | 45 Node::NodeType Comment::nodeType() const
55 bool Comment::childTypeAllowed(NodeType) const
|
| /external/chromium_org/ui/base/models/ |
| tree_node_model.h | 63 template <class NodeType>
74 virtual void Add(NodeType* node, int index) {
79 NodeType* parent = node->parent_;
82 node->parent_ = static_cast<NodeType*>(this);
88 virtual NodeType* Remove(NodeType* node) {
89 typename std::vector<NodeType*>::iterator i =
106 void SetChildren(const std::vector<NodeType*>& children) {
113 const NodeType* parent() const { return parent_; }
114 NodeType* parent() { return parent_;
[all...] |
| tree_node_iterator.h | 22 template <class NodeType>
29 TreeNodeIterator(NodeType* node, bool (*prune)(NodeType*))
42 positions_.push(Position<NodeType>(node, index));
45 explicit TreeNodeIterator(NodeType* node) : prune_(NULL) {
47 positions_.push(Position<NodeType>(node, 0));
54 NodeType* Next() {
61 NodeType* result = positions_.top().node->GetChild(positions_.top().index);
67 positions_.push(Position<NodeType>(result, 0));
96 std::stack<Position<NodeType> > positions_
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| RegionIterator.h | 33 template<class NodeType>
35 NodeType, ptrdiff_t>
37 typedef std::iterator<std::forward_iterator_tag, NodeType, ptrdiff_t> super;
50 PointerIntPair<NodeType*, 2, enum ItMode> Node;
62 NodeType* getNode() const{ return Node.getPointer(); }
87 typedef RNSuccIterator<NodeType> Self;
92 inline RNSuccIterator(NodeType* node)
107 inline RNSuccIterator(NodeType* node, bool)
165 template<class NodeType>
166 class RNSuccIterator<FlatIt<NodeType> >
[all...] |
| DominatorInternals.h | 34 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT,
35 typename GraphT::NodeType* V, unsigned N) {
56 SmallVector<std::pair<typename GraphT::NodeType*,
60 typename GraphT::NodeType* BB = Worklist.back().first;
63 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo =
93 typename GraphT::NodeType* Succ = *NextSucc;
95 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &SuccVInfo =
107 typename GraphT::NodeType*
108 Eval(DominatorTreeBase<typename GraphT::NodeType>& DT,
109 typename GraphT::NodeType *VIn, unsigned LastLinked)
[all...] |
| /external/clang/include/clang/AST/ |
| StmtGraphTraits.h | 28 typedef clang::Stmt NodeType;
32 static NodeType* getEntryNode(clang::Stmt* S) { return S; }
34 static inline ChildIteratorType child_begin(NodeType* N) {
39 static inline ChildIteratorType child_end(NodeType* N) {
55 typedef const clang::Stmt NodeType;
59 static NodeType* getEntryNode(const clang::Stmt* S) { return S; }
61 static inline ChildIteratorType child_begin(NodeType* N) {
66 static inline ChildIteratorType child_end(NodeType* N) {
|
| /external/chromium_org/ui/views/examples/ |
| tree_view_example.cc | 20 model_(new NodeType(ASCIIToUTF16("root"), 1)) {
31 NodeType* colors_node = new NodeType(ASCIIToUTF16("colors"), 1);
33 colors_node->Add(new NodeType(ASCIIToUTF16("red"), 1), 0);
34 colors_node->Add(new NodeType(ASCIIToUTF16("green"), 1), 1);
35 colors_node->Add(new NodeType(ASCIIToUTF16("blue"), 1), 2);
37 NodeType* sheep_node = new NodeType(ASCIIToUTF16("sheep"), 1);
39 sheep_node->Add(new NodeType(ASCIIToUTF16("Sheep 1"), 1), 0);
40 sheep_node->Add(new NodeType(ASCIIToUTF16("Sheep 2"), 1), 1)
[all...] |
| /external/chromium/chrome/browser/ui/cocoa/content_settings/ |
| cookie_tree_node.mm | 32 - (CocoaCookieDetailsType)nodeType {
59 return [self nodeType] != kCocoaCookieDetailsTypeFolder;
64 @"<CocoaCookieTreeNode @ %p (title=%@, nodeType=%d, childCount=%u)";
66 [self nodeType], [[self children] count]];
|
| /external/chromium_org/chrome/browser/ui/cocoa/content_settings/ |
| cookie_tree_node.mm | 32 - (CocoaCookieDetailsType)nodeType {
59 return [self nodeType] != kCocoaCookieDetailsTypeFolder;
64 @"<CocoaCookieTreeNode @ %p (title=%@, nodeType=%d, childCount=%u)";
66 [self nodeType], [[self children] count]];
|
| /external/clang/unittests/AST/ |
| MatchVerifier.h | 31 template <typename NodeType>
58 const NodeType &Node) {}
76 template <typename NodeType> template <typename MatcherType>
77 testing::AssertionResult MatchVerifier<NodeType>::match(
116 template <typename NodeType>
117 void MatchVerifier<NodeType>::run(const MatchFinder::MatchResult &Result) {
118 const NodeType *Node = Result.Nodes.getNodeAs<NodeType>("");
132 template <typename NodeType>
133 class LocationVerifier : public MatchVerifier<NodeType> {
[all...] |
| /external/llvm/include/llvm/ADT/ |
| PostOrderIterator.h | 58 template<typename NodeType>
59 bool insertEdge(NodeType *From, NodeType *To) {
64 template<typename NodeType>
65 void finishPostorder(NodeType *BB) {}
79 template<class NodeType>
80 bool insertEdge(NodeType *From, NodeType *To) { return Visited.insert(To); }
83 template<class NodeType>
84 void finishPostorder(NodeType *BB) {
[all...] |
| GraphTraits.h | 30 // typedef NodeType - Type of Node in the graph
33 // static NodeType *getEntryNode(const GraphType &)
36 // static ChildIteratorType child_begin(NodeType *)
37 // static ChildIteratorType child_end (NodeType *)
60 typedef typename GraphType::UnknownGraphTypeError NodeType;
88 typedef typename GraphTraits<T>::NodeType NodeType;
91 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {
95 static ChildIteratorType child_begin(NodeType* N) {
99 static ChildIteratorType child_end(NodeType* N)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/track/vtt/ |
| VTTElement.cpp | 33 static const QualifiedName& nodeTypeToTagName(VTTNodeType nodeType)
43 switch (nodeType) {
67 VTTElement::VTTElement(VTTNodeType nodeType, Document* document)
68 : Element(nodeTypeToTagName(nodeType), document, CreateElement)
70 , m_webVTTNodeType(nodeType)
74 PassRefPtr<VTTElement> VTTElement::create(VTTNodeType nodeType, Document* document)
76 return adoptRef(new VTTElement(nodeType, document));
|
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchersMacros.h | 180 /// The variables are the same as for AST_MATCHER, but NodeType will be deduced
184 template <typename NodeType> \
185 class matcher_##DefineMatcher##Matcher : public MatcherInterface<NodeType> { \
187 virtual bool matches(const NodeType &Node, ASTMatchFinder *Finder, \
197 template <typename NodeType> \
198 bool internal::matcher_##DefineMatcher##Matcher<NodeType>::matches( \
199 const NodeType &Node, ASTMatchFinder *Finder, \
207 /// AST_MATCHER_P, with the addition of NodeType, which specifies the node type
208 /// of the matcher Matcher<NodeType> returned by the function matcher().
219 template <typename NodeType, typename ParamT>
[all...] |
| /external/chromium_org/third_party/tlslite/tlslite/utils/ |
| xmltools.py | 48 if element.firstChild.nodeType == element.firstChild.TEXT_NODE:
54 elif element.firstChild.nodeType == element.firstChild.ELEMENT_NODE:
62 if child.nodeType == child.ELEMENT_NODE:
65 elif child.nodeType == child.TEXT_NODE:
79 if element.nodeType != element.ELEMENT_NODE:
89 if element.nodeType != element.ELEMENT_NODE:
118 if element.nodeType != element.ELEMENT_NODE:
124 if element.nodeType != element.ELEMENT_NODE:
151 if element.nodeType != element.ELEMENT_NODE:
163 if element.nodeType != element.ELEMENT_NODE
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| rbbinode.h | 27 enum NodeType {
54 NodeType fType;
87 RBBINode(NodeType t);
94 void findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status);
|
