| /external/chromium_org/components/bookmarks/browser/ |
| bookmark_expanded_state_tracker.h | 18 // BookmarkExpandedStateTracker is used to track a set of expanded nodes. The
19 // nodes are persisted in preferences. If an expanded node is removed from the
23 typedef std::set<const BookmarkNode*> Nodes;
29 // The set of expanded nodes.
30 void SetExpandedNodes(const Nodes& nodes);
31 Nodes GetExpandedNodes();
50 void UpdatePrefs(const Nodes& nodes);
|
| bookmark_expanded_state_tracker.cc | 27 void BookmarkExpandedStateTracker::SetExpandedNodes(const Nodes& nodes) {
28 UpdatePrefs(nodes);
31 BookmarkExpandedStateTracker::Nodes
33 Nodes nodes; local
35 return nodes;
38 return nodes;
43 return nodes;
54 nodes.insert(node)
[all...] |
| bookmark_index.h | 55 typedef std::vector<const BookmarkNode*> Nodes;
62 // Extracts |matches.nodes| into Nodes, sorts the pairs in decreasing order of
64 void SortMatches(const Matches& matches, Nodes* sorted_nodes) const;
80 // Iterates over |matches| updating each Match's nodes to contain the
81 // intersection of the Match's current nodes and the nodes at |index_i|.
89 // Match's nodes and the nodes at |index_i|. If the intersection between the
|
| bookmark_expanded_state_tracker_unittest.cc | 80 BookmarkExpandedStateTracker::Nodes nodes; local
81 nodes.insert(model_->bookmark_bar_node());
82 tracker->SetExpandedNodes(nodes);
83 EXPECT_EQ(nodes, tracker->GetExpandedNodes());
88 nodes.insert(n1);
89 tracker->SetExpandedNodes(nodes);
90 EXPECT_EQ(nodes, tracker->GetExpandedNodes());
92 // Remove the folder, which should remove it from the list of expanded nodes.
94 nodes.erase(n1)
105 BookmarkExpandedStateTracker::Nodes nodes; local
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| CallGraphSCCPass.h | 85 std::vector<CallGraphNode*> Nodes;
90 Nodes.assign(I, E);
93 bool isSingular() const { return Nodes.size() == 1; }
94 unsigned size() const { return Nodes.size(); }
101 iterator begin() const { return Nodes.begin(); }
102 iterator end() const { return Nodes.end(); }
|
| Interval.h | 11 // represents a set of CFG nodes and is a portion of an interval partition.
33 /// Interval Class - An Interval is a set of nodes defined such that every node
48 Nodes.push_back(Header);
53 /// Nodes - The basic blocks in this interval.
55 std::vector<BasicBlock*> Nodes;
57 /// Successors - List of BasicBlocks that are reachable directly from nodes in
59 /// These nodes necessarily must be header nodes for other intervals.
70 for (unsigned i = 0; i < Nodes.size(); ++i)
71 if (Nodes[i] == BB) return true
[all...] |
| BlockFrequencyInfoImpl.h | 215 NodeList Nodes; ///< Header and the members of the loop.
221 : Parent(Parent), IsPackaged(false), NumHeaders(1), Nodes(1, Header) {}
225 : Parent(Parent), IsPackaged(false), Nodes(FirstHeader, LastHeader) {
226 NumHeaders = Nodes.size();
227 Nodes.insert(Nodes.end(), FirstOther, LastOther);
231 return std::binary_search(Nodes.begin(), Nodes.begin() + NumHeaders,
233 return Node == Nodes[0];
235 BlockNode getHeader() const { return Nodes[0];
[all...] |
| IntervalIterator.h | 14 // 1. A Function* object, composed of BasicBlock nodes.
15 // 2. An IntervalPartition& object, composed of Interval nodes.
69 Int->Nodes.push_back(BB);
80 // Add all of the nodes in I as new nodes in Int.
81 copy(I->Nodes.begin(), I->Nodes.end(), back_inserter(Int->Nodes));
161 // the ProcessNode method to add all of the nodes to the interval.
182 // ProcessNode - This method is called by ProcessInterval to add nodes to th
[all...] |
| /external/llvm/lib/Support/ |
| IntervalMap.cpp | 120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
123 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements");
125 if (!Nodes)
129 const unsigned PerNode = (Elements + Grow) / Nodes;
130 const unsigned Extra = (Elements + Grow) % Nodes;
131 IdxPair PosPair = IdxPair(Nodes, 0);
133 for (unsigned n = 0; n != Nodes; ++n) {
135 if (PosPair.first == Nodes && Sum > Position)
142 assert(PosPair.first < Nodes && "Bad algebra");
149 for (unsigned n = 0; n != Nodes; ++n)
[all...] |
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchFinder.h | 18 // AST nodes that the subexpressions matched on to output information about
26 // Result.Nodes.GetDeclAs<CXXRecordDecl>("id");
73 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
75 /// \brief Contains the nodes bound on the current match.
77 /// This allows user code to easily extract matched AST nodes.
78 const BoundNodes Nodes;
232 Nodes.push_back(Result.Nodes);
234 SmallVector<BoundNodes, 1> Nodes;
246 return Callback.Nodes;
[all...] |
| /external/llvm/unittests/Analysis/ |
| LazyCallGraphTest.cpp | 127 // The order of the entry nodes should be stable w.r.t. the source order of
159 std::vector<std::string> Nodes;
162 Nodes.push_back(N.getFunction().getName());
163 std::sort(Nodes.begin(), Nodes.end());
164 EXPECT_EQ("a2", Nodes[0]);
165 EXPECT_EQ("b2", Nodes[1]);
166 EXPECT_EQ("c3", Nodes[2]);
167 Nodes.clear();
175 Nodes.push_back(N.getFunction().getName())
[all...] |
| /external/llvm/lib/Analysis/ |
| Interval.cpp | 45 for (std::vector<BasicBlock*>::const_iterator I = Nodes.begin(),
46 E = Nodes.end(); I != E; ++I)
|
| IntervalPartition.cpp | 48 for (Interval::node_iterator It = I->Nodes.begin(), End = I->Nodes.end();
|
| BlockFrequencyInfoImpl.cpp | 197 // Early exit for termination nodes.
368 for (const BlockNode &M : Loop.Nodes) {
465 for (const BlockNode &N : Loop.Nodes) {
545 Nodes.reserve(OuterLoop.Nodes.size());
546 for (auto N : OuterLoop.Nodes)
558 for (auto &I : Nodes)
598 // Map from nodes in the SCC to whether it's an entry block.
601 // InSCC also acts the set of nodes in the graph. Seed it.
674 for (const auto &N : Loop->Nodes)
[all...] |
| /external/clang/lib/Tooling/ |
| RefactoringCallbacks.cpp | 42 if (const Stmt *FromMatch = Result.Nodes.getStmtAs<Stmt>(FromId)) {
55 const Stmt *FromMatch = Result.Nodes.getStmtAs<Stmt>(FromId);
56 const Stmt *ToMatch = Result.Nodes.getStmtAs<Stmt>(ToId);
68 if (const IfStmt *Node = Result.Nodes.getStmtAs<IfStmt>(Id)) {
|
| /external/chromium_org/ui/gfx/geometry/ |
| r_tree_base.h | 8 // internal objects of an RTree, namely Nodes (internal nodes of the tree) and
32 typedef ScopedVector<NodeBase> Nodes;
37 // Protected data structure class for storing internal Nodes or leaves with
56 // Returns -1 for Records, or the height of this subtree for Nodes. The
63 // recursively on our parent so that ultimately all nodes up to the root
124 // this Node as its sole child. Valid to call only on root Nodes, meaning
125 // Nodes with |parent_| NULL. Note that ownership of this Node is
130 // the supplied list. Does not repair bounds upon completion. Nodes are
136 // nodes that have exceeded the maximum number of children during an Insert
[all...] |
| /external/chromium_org/tools/clang/empty_string/ |
| EmptyStringConverter.cpp | 108 // calls to the std::string constructor with exprWithCleanups nodes. Without
123 result.Nodes.getNodeAs<clang::StringLiteral>("literal");
128 result.Nodes.getNodeAs<clang::CXXConstructExpr>("call");
136 result.Nodes.getNodeAs<clang::StringLiteral>("literal");
141 result.Nodes.getNodeAs<clang::CXXConstructExpr>("call");
147 result.Nodes.getNodeAs<clang::StringLiteral>("literal");
152 result.Nodes.getNodeAs<clang::CXXConstructExpr>("call");
|
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 19 /// Graph<N> - A graph with N nodes. Note that N can be at most 8.
32 /// NodeSubset - A subset of the graph's nodes.
101 /// Nodes - The list of nodes for this graph.
102 NodeType Nodes[N];
108 // the Nodes array given a pointer to any element of it.
110 Nodes[i].first = i;
117 Nodes[FromIdx].second.AddNode(ToIdx);
124 Nodes[FromIdx].second.DeleteNode(ToIdx);
132 return const_cast<NodeType *>(&Nodes[Idx])
[all...] |
| /external/llvm/include/llvm/ADT/ |
| IntervalMap.h | 189 // Both leaf and branch nodes store vectors of pairs.
196 // The nodes don't know how many elements they contain - that information is
201 // wasted space when nodes are sized to fit in three cache lines (192 bytes):
324 /// IntervalMapImpl::adjustSiblingSizes - Move elements between sibling nodes.
325 /// @param Node Array of pointers to sibling nodes.
326 /// @param Nodes Number of nodes.
330 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes,
333 for (int n = Nodes - 1; n; --n) {
347 if (Nodes == 0
[all...] |
| /external/chromium_org/tools/clang/rewrite_scoped_ptr_ctor_null/ |
| RewriteScopedPtrCtorNull.cpp | 124 const clang::Expr* arg = result.Nodes.getNodeAs<clang::Expr>("arg");
129 result.Nodes.getNodeAs<clang::CXXConstructExpr>("call");
136 const clang::Expr* arg = result.Nodes.getNodeAs<clang::Expr>("arg");
141 result.Nodes.getNodeAs<clang::CXXConstructExpr>("call");
146 const clang::Expr* arg = result.Nodes.getNodeAs<clang::Expr>("arg");
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 67 /// common case in an ExplodedGraph, where most nodes have only one
71 /// empty and no nodes may be added.
75 // for the nodes in the group.
262 /// The nodes in the simulation graph which have been
266 /// Nodes - The nodes in the graph.
267 llvm::FoldingSet<ExplodedNode> Nodes;
269 /// BVC - Allocator and context for allocating nodes and their predecessor
273 /// NumNodes - The number of nodes in the graph.
276 /// A list of recently allocated nodes that can potentially be recycled
[all...] |
| /external/chromium_org/chrome/browser/ui/cocoa/bookmarks/ |
| bookmark_editor_base_controller.h | 99 // Expands the set of BookmarkNodes in |nodes|.
101 const bookmarks::BookmarkExpandedStateTracker::Nodes&)nodes;
104 - (bookmarks::BookmarkExpandedStateTracker::Nodes)getExpandedNodes;
174 // Create any newly added folders. New folders are nodes in folderTreeArray
|
| /external/jsoncpp/include/json/ |
| reader.h | 171 typedef std::stack<Value *> Nodes;
172 Nodes nodes_;
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 180 NodeVector Nodes;
190 NodeEntry& getNode(NodeId NId) { return Nodes[NId]; }
191 const NodeEntry& getNode(NodeId NId) const { return Nodes[NId]; }
201 Nodes[NId] = std::move(N);
203 NId = Nodes.size();
204 Nodes.push_back(std::move(N));
224 // Add the edge to the adjacency sets of its nodes.
239 : CurNId(CurNId), EndNId(G.Nodes.size()), FreeNodeIds(G.FreeNodeIds) {
292 NodeItr end() const { return NodeItr(G.Nodes.size(), G); }
293 bool empty() const { return G.Nodes.empty();
[all...] |
| /external/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 10 // Implements an algorithm to efficiently search for matches on AST nodes.
13 // The general idea is to visit all AST nodes with a RecursiveASTVisitor,
47 // bound nodes before the matcher was executed.
49 // We currently only memoize on nodes whose pointers identify the
50 // nodes (\c Stmt and \c Decl, but not \c QualType or \c TypeLoc).
53 // FIXME: Benchmark whether memoization of non-pointer typed nodes
66 // Used to store the result of a match and possibly bound nodes.
69 BoundNodesTreeBuilder Nodes;
127 // It's OK to always overwrite the bound nodes, as if there was
374 // For AST-nodes that don't have an identity, we can't memoize
[all...] |
