/external/smack/src/org/jivesoftware/smackx/pubsub/ |
NodeType.java | 21 public enum NodeType
|
/external/llvm/include/llvm/ADT/ |
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...] |
DepthFirstIterator.h | 63 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>, 66 typename GT::NodeType, ptrdiff_t>, 69 typename GT::NodeType, ptrdiff_t> super; 71 typedef typename GT::NodeType NodeType; 73 typedef PointerIntPair<NodeType*, 1> PointerIntTy; 80 inline df_iterator(NodeType *Node) { 88 inline df_iterator(NodeType *Node, SetType &S) 104 NodeType *Node = Top.first.getPointer(); 113 NodeType *Next = *It++ [all...] |
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...] |
SCCIterator.h | 38 std::vector<typename GT::NodeType>, ptrdiff_t> { 39 typedef typename GT::NodeType NodeType; 41 typedef std::vector<NodeType*> SccTy; 43 std::vector<typename GT::NodeType>, ptrdiff_t> super; 51 DenseMap<NodeType *, unsigned> nodeVisitNumbers; 54 std::vector<NodeType *> SCCNodeStack; 61 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack; 69 void DFSVisitOne(NodeType *N) { 84 NodeType *childN = *VisitStack.back().second++ [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/chrome/test/chromedriver/js/ |
call_function.js | 18 var NodeType = { 146 var nodeType = value['nodeType']; 147 if (nodeType == NodeType.ELEMENT || nodeType == NodeType.DOCUMENT
|
/external/chromium_org/ui/views/examples/ |
tree_view_example.h | 78 typedef ui::TreeNodeWithValue<int> NodeType; 80 ui::TreeNodeModel<NodeType> model_;
|
/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/llvm/unittests/ADT/ |
SCCIteratorTest.cpp | 97 /// NodeType - Node index and set of children of the node. 98 typedef std::pair<unsigned, NodeSubset> NodeType; 102 NodeType Nodes[N]; 128 NodeType *AccessNode(unsigned Idx) const { 132 return const_cast<NodeType *>(&Nodes[Idx]); 165 NodeType *FirstNode; 172 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {} 209 NodeType *operator*() { 222 static ChildIterator child_begin(NodeType *Parent) { 227 static ChildIterator child_end(NodeType *Parent) [all...] |
/frameworks/compile/mclinker/include/mcld/ADT/ |
TreeAllocator.h | 38 typedef Node<DataType> NodeType; 44 NodeType* produce() { 45 NodeType* result = Alloc::allocate();
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
ACBTree.h | 12 } NodeType; 51 NSInteger nodeType; /* 1 = node, 2 = leaf, -1 = unused */ 67 @property (assign) NSInteger nodeType;
|
/external/chromium/chrome/common/ |
libxml_utils.h | 102 int NodeType() { return xmlTextReaderNodeType(reader_); }
|
/external/chromium_org/third_party/libxml/chromium/ |
libxml_utils.h | 93 int NodeType() { return xmlTextReaderNodeType(reader_); }
|
/external/llvm/include/llvm/Analysis/ |
Interval.h | 125 typedef Interval NodeType; 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; 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/CodeGen/ |
MachineLoopInfo.h | 163 typedef const MachineLoop NodeType; 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; 179 static NodeType *getEntryNode(MachineLoop *L) { return L; } 180 static inline ChildIteratorType child_begin(NodeType *N) { 183 static inline ChildIteratorType child_end(NodeType *N) {
|
MachineDominators.h | 182 typedef MachineDomTreeNode NodeType; 183 typedef NodeType::iterator ChildIteratorType; 185 static NodeType *getEntryNode(NodeType *N) { 188 static inline ChildIteratorType child_begin(NodeType* N) { 191 static inline ChildIteratorType child_end(NodeType* N) { 198 static NodeType *getEntryNode(MachineDominatorTree *DT) {
|
/external/llvm/lib/Target/XCore/ |
XCoreISelLowering.h | 29 enum NodeType {
|
/external/chromium_org/third_party/WebKit/public/web/ |
WebNode.h | 74 enum NodeType { 91 WEBKIT_EXPORT NodeType nodeType() const;
|
/external/clang/include/clang/Analysis/Analyses/ |
Dominators.h | 171 typedef ::clang::DomTreeNode NodeType; 172 typedef NodeType::iterator ChildIteratorType; 174 static NodeType *getEntryNode(NodeType *N) { 177 static inline ChildIteratorType child_begin(NodeType *N) { 180 static inline ChildIteratorType child_end(NodeType *N) { 197 static NodeType *getEntryNode(::clang::DominatorTree *DT) {
|
/external/llvm/lib/Target/AArch64/ |
AArch64ISelLowering.h | 26 enum NodeType { 27 // Start the numbering from where ISD NodeType finishes.
|
/external/chromium_org/net/spdy/ |
spdy_priority_forest.h | 112 enum NodeType { ROOT_NODE, NONROOT_ORDERED, NONROOT_UNORDERED }; 117 NodeType type;
|
/external/chromium_org/third_party/WebKit/Source/modules/webaudio/ |
AudioNode.h | 63 enum NodeType { 91 NodeType nodeType() const { return m_nodeType; } 92 void setNodeType(NodeType); 203 NodeType m_nodeType;
|
/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);
|
/external/clang/include/clang/Analysis/ |
CallGraph.h | 174 typedef clang::CallGraphNode NodeType; 178 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; } 179 typedef mapped_iterator<NodeType::iterator, CGNDerefFun> ChildIteratorType; 180 static inline ChildIteratorType child_begin(NodeType *N) { 183 static inline ChildIteratorType child_end (NodeType *N) { 192 typedef const clang::CallGraphNode NodeType; 193 typedef NodeType::const_iterator ChildIteratorType; 194 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; } 195 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();} 196 static inline ChildIteratorType child_end(NodeType *N) { return N->end(); [all...] |