Searched defs:Nodes (Results 1 - 25 of 34) sorted by relevance

12

/external/chromium_org/components/bookmarks/browser/
H A Dbookmark_expanded_state_tracker.h23 typedef std::set<const BookmarkNode*> Nodes; typedef in class:bookmarks::BookmarkExpandedStateTracker
30 void SetExpandedNodes(const Nodes& nodes);
31 Nodes GetExpandedNodes();
50 void UpdatePrefs(const Nodes& nodes);
H A Dbookmark_index.h52 typedef std::vector<const BookmarkNode*> Nodes; typedef in class:bookmarks::BookmarkIndex
59 // Extracts |matches.nodes| into Nodes, sorts the pairs in decreasing order of
61 void SortMatches(const Matches& matches, Nodes* sorted_nodes) const;
/external/llvm/include/llvm/Analysis/
H A DCallGraphSCCPass.h85 std::vector<CallGraphNode*> Nodes; member in class:llvm::CallGraphSCC
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(); }
H A DInterval.h48 Nodes.push_back(Header);
53 /// Nodes - The basic blocks in this interval.
55 std::vector<BasicBlock*> Nodes; member in class:llvm::Interval
70 for (unsigned i = 0; i < Nodes.size(); ++i)
71 if (Nodes[i] == BB) return true;
74 //return find(Nodes.begin(), Nodes.end(), BB) != Nodes.end();
H A DLazyCallGraph.h216 SmallVector<Node *, 1> Nodes; member in class:llvm::LazyCallGraph::SCC
231 iterator begin() const { return Nodes.begin(); }
232 iterator end() const { return Nodes.end(); }
/external/chromium_org/third_party/cython/src/Cython/Compiler/Tests/
H A DTestTreePath.py5 from Cython.Compiler import Nodes, ExprNodes namespace
54 self.assertEquals(Nodes.ReturnStatNode,
62 self.assertEquals(Nodes.ReturnStatNode,
/external/chromium_org/ui/gfx/geometry/
H A Dr_tree_base.h8 // internal objects of an RTree, namely Nodes (internal nodes of the tree) and
32 typedef ScopedVector<NodeBase> Nodes; typedef in class:gfx::RTreeBase
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
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
137 void RemoveNodesForReinsert(size_t number_to_remove, Nodes* nodes);
144 scoped_ptr<NodeBase> RemoveChild(NodeBase* child_node, Nodes* orphans);
156 // same parent. Bounds will be valid on both Nodes afte
[all...]
/external/clang/include/clang/ASTMatchers/
H A DASTMatchFinder.h26 // Result.Nodes.GetDeclAs<CXXRecordDecl>("id");
73 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
78 const BoundNodes Nodes; member in struct:clang::ast_matchers::MatchFinder::MatchResult
232 Nodes.push_back(Result.Nodes);
234 SmallVector<BoundNodes, 1> Nodes; member in class:clang::ast_matchers::internal::CollectMatchesCallback
246 return Callback.Nodes;
/external/llvm/lib/Support/
H A DIntervalMap.cpp120 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, argument
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;
[all...]
/external/jsoncpp/include/json/
H A Dreader.h171 typedef std::stack<Value *> Nodes; typedef in class:Json::Reader
172 Nodes nodes_;
/external/llvm/unittests/Analysis/
H A DLazyCallGraphTest.cpp159 std::vector<std::string> Nodes; local
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());
176 std::sort(Nodes
[all...]
/external/chromium_org/third_party/cython/src/Cython/Compiler/
H A DTypeInference.py3 import Nodes namespace
34 if isinstance(lhs, (ExprNodes.NameNode, Nodes.PyArgDeclNode)):
H A DUtilNodes.py2 # Nodes used as utilities and support for transforms etc.
3 # These often make up sets including both Nodes and ExprNodes
7 import Nodes namespace
9 from Nodes import Node
288 class LetNode(Nodes.StatNode, LetNodeMixin):
H A DVisitor.py10 from Cython.Compiler import Nodes namespace
108 if isinstance(node, Nodes.Node):
745 elif isinstance(node, Nodes.DefNode):
H A DFlowControl.py2 cython.declare(PyrexTypes=object, ExprNodes=object, Nodes=object,
11 import Nodes namespace
997 if isinstance(node, Nodes.ForInStatNode):
1003 if isinstance(node, Nodes.ParallelRangeNode):
H A DModuleNode.py18 import Nodes namespace
41 class ModuleNode(Nodes.Node, Nodes.BlockNode):
64 assert isinstance(self.body, Nodes.StatListNode)
65 if isinstance(tree, Nodes.StatListNode):
94 env.doc = EncodedString(u'File: %s (starting at line %s)' % Nodes.relative_position(self.pos))
648 code.put(Nodes.branch_prediction_macros)
2124 env.use_utility_code(Nodes.traceback_utility_code)
H A DOptimize.py5 Nodes=object, ExprNodes=object, PyrexTypes=object, Builtin=object,
8 import Nodes namespace
89 if_body = Nodes.StatListNode(
91 stats = [Nodes.SingleAssignmentNode(pos, lhs=result_ref, rhs=ExprNodes.BoolNode(pos, value=1)),
92 Nodes.BreakStatNode(pos)])
93 if_node = Nodes.IfStatNode(
95 if_clauses=[Nodes.IfClauseNode(pos, condition=cmp_node, body=if_body)],
100 body = Nodes.ForInStatNode(
105 else_clause=Nodes.SingleAssignmentNode(pos, lhs=result_ref, rhs=ExprNodes.BoolNode(pos, value=0))))
339 target_assign = Nodes
[all...]
/external/llvm/lib/IR/
H A DAttributeImpl.h255 ArrayRef<std::pair<unsigned, AttributeSetNode*> > Nodes) {
256 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
257 ID.AddInteger(Nodes[i].first);
258 ID.AddPointer(Nodes[i].second);
254 Profile(FoldingSetNodeID &ID, ArrayRef<std::pair<unsigned, AttributeSetNode*> > Nodes) argument
/external/llvm/include/llvm/ADT/
H A DIntervalMap.h326 /// @param Nodes Number of nodes.
330 void adjustSiblingSizes(NodeT *Node[], unsigned Nodes, argument
333 for (int n = Nodes - 1; n; --n) {
347 if (Nodes == 0)
351 for (unsigned n = 0; n != Nodes - 1; ++n) {
354 for (unsigned m = n + 1; m != Nodes; ++m) {
366 for (unsigned n = 0; n != Nodes; n++)
379 /// Elements + Grow <= Nodes * Capacity.
396 /// @param Nodes The number of nodes.
399 /// @param CurSize Array[Nodes] o
[all...]
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h266 /// Nodes - The nodes in the graph.
267 llvm::FoldingSet<ExplodedNode> Nodes; member in class:clang::ento::ExplodedGraph
336 node_iterator nodes_begin() { return Nodes.begin(); }
338 node_iterator nodes_end() { return Nodes.end(); }
340 const_node_iterator nodes_begin() const { return Nodes.begin(); }
342 const_node_iterator nodes_end() const { return Nodes.end(); }
368 /// \param Nodes The nodes which must appear in the final graph. Presumably
375 ExplodedGraph *trim(ArrayRef<const NodeTy *> Nodes,
/external/clang/lib/ASTMatchers/
H A DASTMatchFinder.cpp69 BoundNodesTreeBuilder Nodes; member in struct:clang::ast_matchers::internal::__anon17765::MemoizedMatchResult
387 *Builder = I->second.Nodes;
392 Result.Nodes = *Builder;
393 Result.ResultOfMatch = matchesRecursively(Node, Matcher, &Result.Nodes,
396 *Builder = Result.Nodes;
514 *Builder = I->second.Nodes;
519 Result.Nodes = *Builder;
523 if (Matcher.matches(Parent, this, &Result.Nodes)) {
528 Result.Nodes = *Builder;
530 Parent, Matcher, &Result.Nodes, MatchMod
760 MatchResult(const BoundNodes &Nodes, ASTContext *Context) argument
[all...]
/external/clang/unittests/ASTMatchers/
H A DASTMatchersTest.cpp684 virtual bool run(const BoundNodes *Nodes) { argument
685 const BoundNodes::IDToNodeMap &M = Nodes->getMap();
686 if (Nodes->getNodeAs<T>(Id)) {
688 if (const NamedDecl *Named = Nodes->getNodeAs<NamedDecl>(Id)) {
691 Nodes->getNodeAs<NestedNameSpecifier>(Id)) {
698 EXPECT_EQ(Nodes->getNodeAs<T>(Id), I->second.get<T>());
706 virtual bool run(const BoundNodes *Nodes, ASTContext *Context) { argument
707 return run(Nodes);
3640 bool run(const BoundNodes *Nodes) override { return false; }
3641 bool run(const BoundNodes *Nodes, ASTContex
4148 run(const BoundNodes *Nodes) argument
4150 run(const BoundNodes *Nodes, ASTContext *Context) argument
4199 run(const BoundNodes *Nodes) argument
4201 run(const BoundNodes *Nodes, ASTContext *Context) argument
4206 verify(const BoundNodes &Nodes, ASTContext &Context, const Stmt *Node) argument
4215 verify(const BoundNodes &Nodes, ASTContext &Context, const Decl *Node) argument
[all...]
/external/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h180 NodeVector Nodes; member in class:PBQP::Graph
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));
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(); }
295 return G.Nodes
[all...]
/external/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h523 void push_all(const std::vector<SUnit *> &Nodes) { argument
524 for (std::vector<SUnit *>::const_iterator I = Nodes.begin(),
525 E = Nodes.end(); I != E; ++I)
/external/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp283 const std::vector<RegionNode *> &Nodes = *I; local
284 Order.append(Nodes.begin(), Nodes.end());

Completed in 1060 milliseconds

12