30   VectorTy Vector;  variable
35     assert(Vector.size() >= Map.size()); // May differ due to blotting.  in ~BlotMapVector()
38       assert(I->second < Vector.size());  in ~BlotMapVector()
39       assert(Vector[I->second].first == I->first);  in ~BlotMapVector()
41     for (typename VectorTy::const_iterator I = Vector.begin(), E = Vector.end();  in ~BlotMapVector()
44                            Map[I->first] == size_t(I - Vector.begin())));  in ~BlotMapVector()
51   iterator begin() { return Vector.begin(); }  in begin()
52   iterator end() { return Vector.end(); }  in end()
53   const_iterator begin() const { return Vector.begin(); }  in begin()
54   const_iterator end() const { return Vector.end(); }  in end()
60       size_t Num = Vector.size();
62       Vector.push_back(std::make_pair(Arg, ValueT()));
63       return Vector[Num].second;
65     return Vector[Pair.first->second].second;
72       size_t Num = Vector.size();  in insert()
74       Vector.push_back(InsertPair);  in insert()
75       return std::make_pair(Vector.begin() + Num, true);  in insert()
77     return std::make_pair(Vector.begin() + Pair.first->second, false);  in insert()
83       return Vector.end();  in find()
84     return Vector.begin() + It->second;  in find()
90       return Vector.end();  in find()
91     return Vector.begin() + It->second;  in find()
101     Vector[It->second].first = KeyT();  in blot()
107     Vector.clear();  in clear()
111     assert(Map.empty() == Vector.empty());  in empty()