Lines Matching refs:node_
770 // node_ is always correct. This is handy because the most common
771 // operations are operator* and operator-> and they only use node_.
772 // When node_ is set to a non-NULL value, all the other non-const fields
776 iterator_base() : node_(NULL) {}
787 : node_(it.node_),
793 : node_(n),
798 : node_(NodePtrFromKeyPtr(*tree_it)),
807 // If nothing non-empty is found then leave node_ == NULL.
811 node_ = NULL;
815 node_ = static_cast<Node*>(m_->table_[bucket_index_]);
821 node_ = NodePtrFromKeyPtr(*tree_it_);
827 reference operator*() const { return node_->kv; }
831 return a.node_ == b.node_;
834 return a.node_ != b.node_;
838 if (node_->next == NULL) {
848 node_ = NodePtrFromKeyPtr(*tree_it_);
852 node_ = node_->next;
863 // Assumes node_ and m_ are correct and non-NULL, but other fields may be
864 // stale. Fix them as needed. Then return true iff node_ points to a
867 GOOGLE_DCHECK(node_ != NULL && m_ != NULL);
870 // Common case: the bucket we think is relevant points to node_.
871 if (m_->table_[bucket_index_] == static_cast<void*>(node_))
873 // Less common: the bucket is a linked list with node_ somewhere in it,
878 if (l == node_) {
887 iterator_base i(m_->find(*KeyPtrFromNodePtr(node_)));
893 Node* node_;
954 if (p.first.node_ != NULL)
973 if (p.first.node_ != NULL)
997 Node* const item = it.node_;
