66     if (size_ < A_.size()) {  in Insert()
67       A_[size_] = val;  in Insert()
70       A_.push_back(val);  in Insert()
85     if (Better(val, A_[Parent(i)])) {  in Update()
88       A_[i] = val;  in Update()
96     T top = A_[0];  in Pop()
107     return A_[0];  in Top()
150     T val  = A_[j];  in Swap()
151     A_[j]  = A_[k];  in Swap()
152     A_[k]  = val;  in Swap()
167     if (l < size_ && Better(A_[l], A_[i]) )  in Heapify()
172     if (r < size_ && Better(A_[r], A_[largest]) )  in Heapify()
185     while (i > 0 && !Better(A_[p = Parent(i)], val)) {  in Insert()
198   vector<T>   A_;  variable