| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| StaticNodeList.h | 43 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> > nodeList = adoptRefWillBeNoop(new StaticNodeTypeList<NodeType>)
[all...] |
| TreeShared.h | 32 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>* object
[all...] |
| NodeTraversal.h | 78 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& current, const Node* stayWithin
[all...] |
| DocumentFragment.h | 48 virtual NodeType nodeType() const OVERRIDE FINAL;
50 virtual bool childTypeAllowed(NodeType) const OVERRIDE;
|
| CDATASection.h | 39 virtual NodeType nodeType() const OVERRIDE;
43 DEFINE_NODE_TYPE_CASTS(CDATASection, nodeType() == Node::CDATA_SECTION_NODE);
|
| Comment.h | 39 virtual NodeType nodeType() const OVERRIDE;
43 DEFINE_NODE_TYPE_CASTS(Comment, nodeType() == Node::COMMENT_NODE);
|
| /external/smack/src/org/jivesoftware/smackx/pubsub/ |
| NodeType.java | 21 public enum NodeType
|
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| CollectionItemsCache.h | 41 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>::~CollectionItemsCache(
[all...] |
| CollectionIndexCache.h | 37 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/ |
| TreeNode.h | 52 typedef T NodeType;
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* refChild
[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...] |
| Interval.h | 122 typedef Interval NodeType;
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;
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/chromium_org/ui/base/models/ |
| tree_node_iterator.h | 23 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...] |
| 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...] |
| /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...] |
| 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 | 43 const std::vector<typename GT::NodeType *>, ptrdiff_t> {
44 typedef typename GT::NodeType NodeType;
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 *entryN) : visitNum(0)
[all...] |
| DepthFirstIterator.h | 64 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;
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 *Next = *It++
[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/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.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/chromium_org/ui/views/examples/ |
| tree_view_example.cc | 22 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(ASCIIToUTF16("Sheep 2"), 1), 1)
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineLoopInfo.h | 164 typedef const MachineLoop NodeType;
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;
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/ |
| rbbinode.h | 27 enum NodeType {
54 NodeType fType;
87 RBBINode(NodeType t);
94 void findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status);
|
| /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>("");
146 template <typename NodeType>
147 class LocationVerifier : public MatchVerifier<NodeType> {
[all...] |
| /external/icu/icu4c/source/common/ |
| rbbinode.h | 27 enum NodeType {
54 NodeType fType;
87 RBBINode(NodeType t);
94 void findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status);
|
