Searched refs:vec_ (Results 1 – 5 of 5) sorted by relevance
23 vec_.clear(); in clear()32 if (vec_.size() == 0) { in insert()33 vec_.assign(8, P(0)); in insert()38 for (h = startIndex(KF::key(*p)); vec_[h] != 0 ; h = nextIndex(h)) in insert()39 if (KF::key(*vec_[h]) == KF::key(*p)) { in insert()41 P tem(vec_[h]); in insert()42 vec_[h] = p; in insert()46 return vec_[h]; in insert()49 if (vec_.size() > size_t(-1)/2) { in insert()50 if (usedLimit_ == vec_.size() - 1) in insert()[all …]
23 for (size_t i = 0; i < this->vec_.size(); i++) in ~OwnerTable()24 delete this->vec_[i]; in ~OwnerTable()30 for (size_t i = 0; i < this->vec_.size(); i++) in clear()31 delete this->vec_[i]; in clear()43 for (size_t i = 0; i < this->vec_.size(); i++) in operator =()44 if (this->vec_[i]) in operator =()45 this->vec_[i] = this->vec_[i]->copy(); in operator =()
39 Vector<P> vec_; variable43 return size_t(HF::hash(k) & (vec_.size() - 1)); in startIndex()46 return i == 0 ? vec_.size() - 1 : i - 1; in nextIndex()
524 Vector < Attribute > vec_; variable781 return (vec_.size()); in size()838 return (vec_[i].value()); in value()845 return (vec_[i].valuePointer()); in valuePointer()851 return (vec_[i].semantics()); in semantics()857 return (vec_[i].specIndex()); in specIndex()924 return (vec_[i].specified()); in specified()
1076 : def_(def), vec_(def.isNull() ? 0 : def->size()), nSpec_(0), conref_(0), in AttributeList()1094 vec_.resize(0); in init()1097 size_t clearLim = vec_.size(); in init()1100 vec_.resize(newLength); in init()1102 vec_[i].clear(); in init()1108 vec_.resize(def.isNull() ? 0 : def->size()); in changeDef()1114 vec_.swap(to.vec_); in swap()1140 for (size_t i = 0; i < vec_.size(); i++) in finish()1141 if (!vec_[i].specified()) { in finish()1144 vec_[i].setValue(value); in finish()[all …]