Searched refs:NodeType (Results 1 - 25 of 141) sorted by relevance

123456

/external/smack/src/org/jivesoftware/smackx/pubsub/
H A DNodeType.java21 public enum NodeType enum
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DStaticNodeList.h43 template <typename NodeType>
46 static PassRefPtrWillBeRawPtr<StaticNodeTypeList> adopt(WillBeHeapVector<RefPtrWillBeMember<NodeType> >& nodes);
56 virtual NodeType* item(unsigned index) const OVERRIDE;
63 return m_nodes.capacity() * sizeof(RefPtrWillBeMember<NodeType>);
66 WillBeHeapVector<RefPtrWillBeMember<NodeType> > m_nodes;
72 template <typename NodeType>
73 PassRefPtrWillBeRawPtr<StaticNodeTypeList<NodeType> > StaticNodeTypeList<NodeType>::adopt(WillBeHeapVector<RefPtrWillBeMember<NodeType> >& nodes)
75 RefPtrWillBeRawPtr<StaticNodeTypeList<NodeType> > nodeLis
[all...]
H A DTreeShared.h32 template<typename NodeType> class TreeShared;
33 template<typename NodeType> void adopted(TreeShared<NodeType>*);
36 template<typename NodeType> class TreeShared : public NoBaseWillBeGarbageCollectedFinalized<NodeType> {
77 NodeType* thisNode = static_cast<NodeType*>(this);
98 friend void adopted<>(TreeShared<NodeType>*);
105 template<typename NodeType> void adopted(TreeShared<NodeType>* objec
[all...]
H A DNodeTraversal.h78 template <class NodeType>
79 static Node* traverseNextTemplate(NodeType&);
80 template <class NodeType>
81 static Node* traverseNextTemplate(NodeType&, const Node* stayWithin);
82 template <class NodeType>
83 static Node* childAtTemplate(NodeType&, unsigned);
86 template <class NodeType>
87 inline Node* NodeTraversal::traverseNextTemplate(NodeType& current)
96 template <class NodeType>
97 inline Node* NodeTraversal::traverseNextTemplate(NodeType
[all...]
/external/chromium_org/third_party/WebKit/Source/core/html/
H A DCollectionItemsCache.h41 template <typename Collection, typename NodeType>
42 class CollectionItemsCache : public CollectionIndexCache<Collection, NodeType> {
43 typedef CollectionIndexCache<Collection, NodeType> Base;
50 NodeType* nodeAt(const Collection&, unsigned index);
54 ptrdiff_t allocationSize() const { return m_cachedList.capacity() * sizeof(NodeType*); }
61 Vector<NodeType*> m_cachedList;
64 template <typename Collection, typename NodeType>
65 CollectionItemsCache<Collection, NodeType>::CollectionItemsCache()
70 template <typename Collection, typename NodeType>
71 CollectionItemsCache<Collection, NodeType>
[all...]
H A DCollectionIndexCache.h37 template <typename Collection, typename NodeType>
61 NodeType* nodeAt(const Collection&, unsigned index);
71 ALWAYS_INLINE NodeType* cachedNode() const { return m_currentNode; }
73 ALWAYS_INLINE void setCachedNode(NodeType* node, unsigned index)
89 NodeType* nodeBeforeCachedNode(const Collection&, unsigned index);
90 NodeType* nodeAfterCachedNode(const Collection&, unsigned index);
92 RawPtrWillBeMember<NodeType> m_currentNode;
98 template <typename Collection, typename NodeType>
99 CollectionIndexCache<Collection, NodeType>::CollectionIndexCache()
107 template <typename Collection, typename NodeType>
[all...]
/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/llvm/include/llvm/Analysis/
H A DRegionIterator.h33 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 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/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 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/chromium_org/ui/base/models/
H A Dtree_node_model.h63 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...]
H A Dtree_node_iterator.h23 template <class NodeType>
26 typedef base::Callback<bool(NodeType*)> PruneCallback;
32 TreeNodeIterator(NodeType* node, const PruneCallback& prune)
45 positions_.push(Position<NodeType>(node, index));
48 explicit TreeNodeIterator(NodeType* node) {
50 positions_.push(Position<NodeType>(node, 0));
57 NodeType* Next() {
64 NodeType* result = positions_.top().node->GetChild(positions_.top().index);
70 positions_.push(Position<NodeType>(result, 0));
99 std::stack<Position<NodeType> > positions
[all...]
/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/Support/
H A DGenericDomTreeConstruction.h34 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...]
/external/chromium_org/ui/views/examples/
H A Dtree_view_example.cc22 model_(new NodeType(ASCIIToUTF16("root"), 1)) {
33 NodeType* colors_node = new NodeType(ASCIIToUTF16("colors"), 1);
35 colors_node->Add(new NodeType(ASCIIToUTF16("red"), 1), 0);
36 colors_node->Add(new NodeType(ASCIIToUTF16("green"), 1), 1);
37 colors_node->Add(new NodeType(ASCIIToUTF16("blue"), 1), 2);
39 NodeType* sheep_node = new NodeType(ASCIIToUTF16("sheep"), 1);
41 sheep_node->Add(new NodeType(ASCIIToUTF16("Sheep 1"), 1), 0);
42 sheep_node->Add(new NodeType(ASCIIToUTF1
[all...]
/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/llvm/include/llvm/CodeGen/
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/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/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/IR/
H A DCFG.h275 typedef BasicBlock NodeType; typedef in struct:llvm::GraphTraits
278 static NodeType *getEntryNode(BasicBlock *BB) { return BB; }
279 static inline ChildIteratorType child_begin(NodeType *N) {
282 static inline ChildIteratorType child_end(NodeType *N) {
288 typedef const BasicBlock NodeType; typedef in struct:llvm::GraphTraits
291 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; }
293 static inline ChildIteratorType child_begin(NodeType *N) {
296 static inline ChildIteratorType child_end(NodeType *N) {
307 typedef BasicBlock NodeType; typedef in struct:llvm::GraphTraits
309 static NodeType *getEntryNod
319 typedef const BasicBlock NodeType; typedef in struct:llvm::GraphTraits
[all...]
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/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/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h445 typedef clang::ento::ExplodedNode NodeType; typedef in struct:llvm::GraphTraits
446 typedef NodeType::succ_iterator ChildIteratorType;
447 typedef llvm::df_iterator<NodeType*> nodes_iterator;
449 static inline NodeType* getEntryNode(NodeType* N) {
453 static inline ChildIteratorType child_begin(NodeType* N) {
457 static inline ChildIteratorType child_end(NodeType* N) {
461 static inline nodes_iterator nodes_begin(NodeType* N) {
465 static inline nodes_iterator nodes_end(NodeType* N) {
471 typedef const clang::ento::ExplodedNode NodeType; typedef in struct:llvm::GraphTraits
[all...]

Completed in 842 milliseconds

123456