Searched defs:NodeType (Results 1 - 25 of 61) sorted by relevance

123

/external/chromium_org/chrome/third_party/chromevox/third_party/closure-library/closure/goog/dom/
H A Dnodetype.js16 * @fileoverview Definition of goog.dom.NodeType.
19 goog.provide('goog.dom.NodeType');
35 goog.dom.NodeType = {
/external/smack/src/org/jivesoftware/smackx/pubsub/
H A DNodeType.java21 public enum NodeType enum
/external/chromium_org/chrome/test/chromedriver/js/
H A Dcall_function.js18 var NodeType = {
147 if (nodeType == NodeType.ELEMENT || nodeType == NodeType.DOCUMENT
/external/chromium_org/ui/views/examples/
H A Dtree_view_example.h78 typedef ui::TreeNodeWithValue<int> NodeType; typedef in class:views::examples::TreeViewExample
80 ui::TreeNodeModel<NodeType> model_;
/external/clang/include/clang/AST/
H A DStmtGraphTraits.h28 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/llvm/include/llvm/ADT/
H A DGraphTraits.h30 // 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 DDepthFirstIterator.h64 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
67 typename GT::NodeType, ptrdiff_t>,
70 typename GT::NodeType, ptrdiff_t> super;
72 typedef typename GT::NodeType NodeType; typedef in class:llvm::df_iterator
74 typedef PointerIntPair<NodeType*, 1> PointerIntTy;
81 inline df_iterator(NodeType *Node) {
89 inline df_iterator(NodeType *Node, SetType &S)
105 NodeType *Node = Top.first.getPointer();
114 NodeType *Nex
[all...]
H A DPostOrderIterator.h58 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...]
H A DSCCIterator.h43 const std::vector<typename GT::NodeType *>, ptrdiff_t> {
44 typedef typename GT::NodeType NodeType; typedef in class:llvm::scc_iterator
46 typedef std::vector<NodeType *> SccTy;
51 NodeType *Node; ///< The current node pointer.
55 StackElement(NodeType *Node, const ChildItTy &Child, unsigned Min)
70 DenseMap<NodeType *, unsigned> nodeVisitNumbers;
73 std::vector<NodeType *> SCCNodeStack;
83 void DFSVisitOne(NodeType *N);
91 scc_iterator(NodeType *entry
[all...]
/external/llvm/unittests/ADT/
H A DSCCIteratorTest.cpp97 /// 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 *Paren
234 typedef typename Graph<N>::NodeType NodeType; typedef in struct:llvm::GraphTraits
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DACBTree.h12 } NodeType; typedef in typeref:enum:__anon302
/external/llvm/lib/Target/XCore/
H A DXCoreISelLowering.h29 enum NodeType { enum in namespace:llvm::XCoreISD
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DTreeNode.h52 typedef T NodeType; typedef in class:WTF::TreeNode
63 NodeType* next() const { return m_next; }
64 NodeType* previous() const { return m_previous; }
65 NodeType* parent() const { return m_parent; }
66 NodeType* firstChild() const { return m_firstChild; }
67 NodeType* lastChild() const { return m_lastChild; }
68 NodeType* here() const { return static_cast<NodeType*>(const_cast<TreeNode*>(this)); }
73 void insertBefore(NodeType* newChild, NodeType* refChil
[all...]
/external/chromium_org/third_party/WebKit/public/web/
H A DWebNode.h76 enum NodeType { enum in class:blink::WebNode
93 BLINK_EXPORT NodeType nodeType() const;
/external/chromium_org/third_party/libxml/chromium/
H A Dlibxml_utils.h96 int NodeType() { return xmlTextReaderNodeType(reader_); } function in class:XmlReader
/external/llvm/include/llvm/Analysis/
H A DInterval.h122 typedef Interval NodeType; typedef in struct:llvm::GraphTraits
125 static NodeType *getEntryNode(Interval *I) { return I; }
128 static inline ChildIteratorType child_begin(NodeType *N) {
131 static inline ChildIteratorType child_end(NodeType *N) {
137 typedef Interval NodeType; typedef in struct:llvm::GraphTraits
139 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
140 static inline ChildIteratorType child_begin(NodeType *N) {
143 static inline ChildIteratorType child_end(NodeType *N) {
/external/llvm/include/llvm/CodeGen/
H A DMachineDominators.h182 typedef MachineDomTreeNode NodeType; typedef in struct:llvm::GraphTraits
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) {
H A DMachineLoopInfo.h164 typedef const MachineLoop NodeType; typedef in struct:llvm::GraphTraits
167 static NodeType *getEntryNode(const MachineLoop *L) { return L; }
168 static inline ChildIteratorType child_begin(NodeType *N) {
171 static inline ChildIteratorType child_end(NodeType *N) {
177 typedef MachineLoop NodeType; typedef in struct:llvm::GraphTraits
180 static NodeType *getEntryNode(MachineLoop *L) { return L; }
181 static inline ChildIteratorType child_begin(NodeType *N) {
184 static inline ChildIteratorType child_end(NodeType *N) {
/external/llvm/include/llvm/IR/
H A DDominators.h39 DominatorTreeBase<GraphTraits<BasicBlock *>::NodeType> &DT LLVM_COMMA
43 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *> >::NodeType> &DT
118 typedef DomTreeNode NodeType; typedef in struct:llvm::GraphTraits
119 typedef NodeType::iterator ChildIteratorType;
121 static NodeType *getEntryNode(NodeType *N) {
124 static inline ChildIteratorType child_begin(NodeType *N) {
127 static inline ChildIteratorType child_end(NodeType *N) {
144 static NodeType *getEntryNode(DominatorTree *DT) {
/external/chromium_org/third_party/WebKit/Source/modules/webaudio/
H A DAudioNode.h69 enum NodeType { enum in class:blink::AudioNode
97 NodeType nodeType() const { return m_nodeType; }
99 void setNodeType(NodeType);
205 NodeType m_nodeType;
/external/chromium_org/third_party/icu/source/common/
H A Drbbinode.h27 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/Analysis/Analyses/
H A DDominators.h172 typedef ::clang::DomTreeNode NodeType; typedef in struct:llvm::GraphTraits
173 typedef NodeType::iterator ChildIteratorType;
175 static NodeType *getEntryNode(NodeType *N) {
178 static inline ChildIteratorType child_begin(NodeType *N) {
181 static inline ChildIteratorType child_end(NodeType *N) {
198 static NodeType *getEntryNode(::clang::DominatorTree *DT) {
/external/clang/include/clang/Analysis/
H A DCallGraph.h174 typedef clang::CallGraphNode NodeType; typedef in struct:llvm::GraphTraits
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; typedef in struct:llvm::GraphTraits
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 *
[all...]
/external/icu/icu4c/source/common/
H A Drbbinode.h27 enum NodeType { enum in class:RBBINode
54 NodeType fType;
87 RBBINode(NodeType t);
94 void findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status);
/external/llvm/include/llvm/Support/
H A DGraphWriter.h63 typedef typename GTraits::NodeType NodeType; typedef in class:llvm::GraphWriter
70 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) {
148 bool isNodeHidden(NodeType &Node) {
152 bool isNodeHidden(NodeType *const *Node) {
156 bool isNodeHidden(NodeType *Node) {
160 void writeNode(NodeType& Node) {
164 void writeNode(NodeType *const *Node) {
168 void writeNode(NodeType *Node) {
239 void writeEdge(NodeType *Nod
[all...]

Completed in 1808 milliseconds

123