29   VectorTy Vector;  variable
34     assert(Vector.size() >= Map.size()); // May differ due to blotting.  in ~BlotMapVector()
37       assert(I->second < Vector.size());  in ~BlotMapVector()
38       assert(Vector[I->second].first == I->first);  in ~BlotMapVector()
40     for (typename VectorTy::const_iterator I = Vector.begin(), E = Vector.end();  in ~BlotMapVector()
43                            Map[I->first] == size_t(I - Vector.begin())));  in ~BlotMapVector()
50   iterator begin() { return Vector.begin(); }  in begin()
51   iterator end() { return Vector.end(); }  in end()
52   const_iterator begin() const { return Vector.begin(); }  in begin()
53   const_iterator end() const { return Vector.end(); }  in end()
59       size_t Num = Vector.size();
61       Vector.push_back(std::make_pair(Arg, ValueT()));
62       return Vector[Num].second;
64     return Vector[Pair.first->second].second;
71       size_t Num = Vector.size();  in insert()
73       Vector.push_back(InsertPair);  in insert()
74       return std::make_pair(Vector.begin() + Num, true);  in insert()
76     return std::make_pair(Vector.begin() + Pair.first->second, false);  in insert()
82       return Vector.end();  in find()
83     return Vector.begin() + It->second;  in find()
89       return Vector.end();  in find()
90     return Vector.begin() + It->second;  in find()
100     Vector[It->second].first = KeyT();  in blot()
106     Vector.clear();  in clear()
110     assert(Map.empty() == Vector.empty());  in empty()