111             sparse_.reset(new SparseType());  in Reset()
114             sparse_.reset();  in Reset()
123             if (!sparse_->empty()) {  // Don't attempt lookup in empty map  in Get()
124                 auto it = sparse_->find(index);  in Get()
125                 if (it != sparse_->cend()) {  in Get()
164                     sparse_->clear();  // full range replaces all subranges  in SetRange()
174 …for (auto it = sparse_->begin(); it != sparse_->end();) {  // no increment clause because of erase…  in SetRange()
176                         it = sparse_->erase(it);  // remove redundant entries  in SetRange()
241                 if (it_sparse_ == vec_->sparse_->cend()) {
279                 it_sparse_ = vec_->sparse_->cbegin();  in ConstIterator()
332     std::unique_ptr<SparseType> sparse_;  variable
342     inline bool IsSparse() const { return kSparseThreshold && sparse_.get(); }  in IsSparse()
346     bool HasSparseSubranges() const { return IsSparse() && !sparse_->empty(); }  in HasSparseSubranges()
351         if (IsSparse() && (sparse_->size() > threshold_)) {  in SparseToDenseConversion()
355             for (auto const &item : *sparse_) {  in SparseToDenseConversion()
358             sparse_.reset();  in SparseToDenseConversion()
381             auto erasure = sparse_->erase(index);  // Remove duplicate record from map  in SetSparse()
387         auto insert_pair = sparse_->insert(map_pair);  in SetSparse()