Searched defs:nodes_ (Results 1 - 11 of 11) sorted by relevance

/external/chromium_org/chrome/browser/ui/cocoa/bookmarks/
H A Dbookmark_model_observer_for_cocoa.h87 std::set<const BookmarkNode*> nodes_; // Weak items owned by a BookmarkModel. member in class:BookmarkModelObserverForCocoa
/external/chromium_org/third_party/libaddressinput/src/cpp/src/
H A Dlookup_key.h64 std::map<AddressField, std::string> nodes_; member in class:i18n::addressinput::LookupKey
/external/chromium_org/remoting/test/
H A Dfake_network_dispatcher.h63 NodesMap nodes_; member in class:remoting::FakeNetworkDispatcher
/external/chromium_org/cc/trees/
H A Dlayer_sorter.h98 NodeList nodes_; member in class:cc::LayerSorter
/external/chromium_org/v8/test/cctest/compiler/
H A Dtest-node-algorithm.cc28 nodes_.push_back(node);
31 std::vector<Node*> nodes_; member in class:PreNodeVisitor
39 nodes_.push_back(node);
42 std::vector<Node*> nodes_; member in class:PostNodeVisitor
52 CHECK_EQ(1, static_cast<int>(node_visitor.nodes_.size()));
67 CHECK_EQ(5, static_cast<int>(node_visitor.nodes_.size()));
68 CHECK(graph.start()->id() == node_visitor.nodes_[0]->id());
69 CHECK(n2->id() == node_visitor.nodes_[1]->id());
70 CHECK(n3->id() == node_visitor.nodes_[2]->id());
71 CHECK(n4->id() == node_visitor.nodes_[
211 std::vector<int> nodes_; member in struct:ReenterNodeVisitor
[all...]
H A Dtest-graph-reducer.cc631 nodes_(NodeSet::key_compare(), NodeSet::allocator_type(zone)) {}
633 CHECK_EQ(0, static_cast<int>(nodes_.count(node)));
634 nodes_.insert(node);
638 NodeSet nodes_; member in class:OneTimeReducer
/external/jsoncpp/include/json/
H A Dreader.h172 Nodes nodes_; member in class:Json::Reader
/external/openfst/src/include/fst/extensions/pdt/
H A Dpdt.h46 // 'nodes_'. Each node represents the top of some stack and is
75 nodes_.push_back(StackNode(-1, -1)); // Tree root.
98 child_id = nodes_.size();
99 nodes_.push_back(StackNode(stack_id, paren_id));
104 const StackNode &node = nodes_[stack_id];
114 return nodes_[stack_id].parent_id;
119 return nodes_[stack_id].paren_id;
140 vector<StackNode> nodes_; member in class:fst::PdtStack
/external/chromium_org/v8/src/compiler/
H A Dschedule.h53 NodeVector nodes_; // nodes of this block in forward order. member in class:v8::internal::compiler::BasicBlockData
66 nodes_(zone) {}
130 iterator begin() { return nodes_.begin(); }
131 iterator end() { return nodes_.end(); }
134 const_iterator begin() const { return nodes_.begin(); }
135 const_iterator end() const { return nodes_.end(); }
138 reverse_iterator rbegin() { return nodes_.rbegin(); }
139 reverse_iterator rend() { return nodes_.rend(); }
224 block->nodes_.push_back(node);
H A Dsimplified-lowering.cc67 nodes_(zone),
97 // Process nodes from the collected {nodes_} vector.
98 for (NodeVector::iterator i = nodes_.begin(); i != nodes_.end(); ++i) {
115 // Add {node} to {nodes_} if this is the first time it's been visited.
123 nodes_.push_back(node);
771 NodeVector nodes_; // collected nodes member in class:v8::internal::compiler::RepresentationSelector
/external/chromium_org/v8/src/
H A Dast.h2657 ZoneList<RegExpTree*>* nodes() { return nodes_; }
2659 ZoneList<RegExpTree*>* nodes_; member in class:v8::internal::FINAL

Completed in 3238 milliseconds