/external/smack/src/org/jivesoftware/smackx/pubsub/ |
H A D | NodeType.java | 21 public enum NodeType
enum
|
/external/llvm/include/llvm/Support/ |
H A D | DataFlow.h | 27 typedef const Value NodeType; typedef in struct:llvm::GraphTraits 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; typedef in struct:llvm::GraphTraits 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; typedef in struct:llvm::GraphTraits 64 static NodeType *getEntryNod 82 typedef Value NodeType; typedef in struct:llvm::GraphTraits [all...] |
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | TreeNode.h | 50 typedef T NodeType; typedef in class:WTF::TreeNode 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* refChil [all...] |
/external/chromium_org/ui/base/models/ |
H A D | 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...] |
H A D | 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* paren [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | 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...] |
H A D | 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 *VI [all...] |
H A D | Interval.h | 125 typedef Interval NodeType; typedef in struct:llvm::GraphTraits 128 static NodeType *getEntryNode(Interval *I) { return I; } 131 static inline ChildIteratorType child_begin(NodeType *N) { 134 static inline ChildIteratorType child_end(NodeType *N) { 140 typedef Interval NodeType; typedef in struct:llvm::GraphTraits 142 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; } 143 static inline ChildIteratorType child_begin(NodeType *N) { 146 static inline ChildIteratorType child_end(NodeType *N) {
|
/external/llvm/include/llvm/ADT/ |
H A D | 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; typedef in struct:llvm::GraphTraits 88 typedef typename GraphTraits<T>::NodeType NodeType; typedef in struct:llvm::GraphTraits 91 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) { 95 static ChildIteratorType child_begin(NodeType* N) { 99 static ChildIteratorType child_end(NodeType* [all...] |
H A D | 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 *B 96 typedef typename GT::NodeType NodeType; typedef in class:llvm::po_iterator 260 typedef typename GT::NodeType NodeType; typedef in class:llvm::ReversePostOrderTraversal [all...] |
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | 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)
|
H A D | CDATASection.h | 38 virtual NodeType nodeType() const; 39 virtual bool childTypeAllowed(NodeType) const;
|
H A D | Comment.h | 40 virtual NodeType nodeType() const; 42 virtual bool childTypeAllowed(NodeType) const;
|
H A D | CDATASection.cpp | 45 Node::NodeType CDATASection::nodeType() const 50 bool CDATASection::childTypeAllowed(NodeType) const
|
H A D | Comment.cpp | 45 Node::NodeType Comment::nodeType() const 55 bool Comment::childTypeAllowed(NodeType) const
|
H A D | DocumentFragment.h | 49 virtual NodeType nodeType() const; 51 virtual bool childTypeAllowed(NodeType) const;
|
H A D | NodeTraversal.h | 70 template <class NodeType> 71 inline Node* traverseNextTemplate(NodeType& current) 82 template <class NodeType> 83 inline Node* traverseNextTemplate(NodeType& current, const Node* stayWithin) 96 template <class NodeType> 97 inline Node* traverseNextSkippingChildrenTemplate(NodeType& current) 106 template <class NodeType> 107 inline Node* traverseNextSkippingChildrenTemplate(NodeType& current, const Node* stayWithin)
|
H A D | 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 [all...] |
/external/clang/include/clang/AST/ |
H A D | StmtGraphTraits.h | 28 typedef clang::Stmt NodeType; typedef in struct:llvm::GraphTraits 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; typedef in struct:llvm::GraphTraits 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/ |
H A D | 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(ASCIIToUTF1 [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | MachineLoopInfo.h | 163 typedef const MachineLoop NodeType; typedef in struct:llvm::GraphTraits 166 static NodeType *getEntryNode(const MachineLoop *L) { return L; } 167 static inline ChildIteratorType child_begin(NodeType *N) { 170 static inline ChildIteratorType child_end(NodeType *N) { 176 typedef MachineLoop NodeType; typedef in struct:llvm::GraphTraits 179 static NodeType *getEntryNode(MachineLoop *L) { return L; } 180 static inline ChildIteratorType child_begin(NodeType *N) { 183 static inline ChildIteratorType child_end(NodeType *N) {
|
/external/chromium_org/third_party/icu/source/common/ |
H A D | rbbinode.h | 27 enum NodeType { enum in class:RBBINode 54 NodeType fType; 87 RBBINode(NodeType t); 94 void findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status);
|
/external/clang/unittests/AST/ |
H A D | 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/icu4c/common/ |
H A D | rbbinode.h | 27 enum NodeType { enum in class:RBBINode 54 NodeType fType; 87 RBBINode(NodeType t); 94 void findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status);
|
/external/clang/include/clang/ASTMatchers/ |
H A D | 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, typenam [all...] |