Lines Matching refs:nodes_
87 nodes_.clear();
89 nodes_.insert(std::make_pair(COUNTRY, kUnknown));
97 nodes_.insert(std::make_pair(field, value));
111 assert(parent.nodes_.size() < arraysize(kHierarchy));
115 if (this != &parent) nodes_ = parent.nodes_;
116 AddressField child_field = kHierarchy[nodes_.size()];
117 nodes_.insert(std::make_pair(child_field, child_node));
126 std::map<AddressField, std::string>::const_iterator it = nodes_.find(field);
127 if (it == nodes_.end()) {
141 std::map<AddressField, std::string>::const_iterator it = nodes_.find(COUNTRY);
142 assert(it != nodes_.end());
147 size_t depth = nodes_.size() - 1;