6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-08-17 21:29:20 +00:00
Code Issues Projects Releases Wiki Activity

Simplify this a bit, add an assertion

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33936 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2007-02-05 23:24:48 +00:00
parent ae6eb5bfbe
commit c04a1ce623
1 changed files with 10 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
include/llvm/ADT/UniqueVector.h
View File

@ -27,28 +27,24 @@ private:
// Vector - ID ordered vector of entries. Entries can be indexed by ID - 1.
//
std::vector<const T *> Vector;
std::vector<T> Vector;
public:
/// insert - Append entry to the vector if it doesn't already exist. Returns
/// the entry's index + 1 to be used as a unique ID.
unsigned insert(const T &Entry) {
// Check if the entry is already in the map.
typename std::map<T, unsigned>::iterator MI = Map.lower_bound(Entry);
unsigned &Val = Map[Entry];
// See if entry exists, if so return prior ID.
if (MI != Map.end() && MI->first == Entry) return MI->second;
if (Val) return Val;
// Compute ID for entry.
unsigned ID = Vector.size() + 1;
// Insert in map.
MI = Map.insert(MI, std::make_pair(Entry, ID));
Val = Vector.size() + 1;
// Insert in vector.
Vector.push_back(&MI->first);
return ID;
Vector.push_back(Entry);
return Val;
}
/// idFor - return the ID for an existing entry. Returns 0 if the entry is
@ -66,7 +62,10 @@ public:
/// operator[] - Returns a reference to the entry with the specified ID.
///
const T &operator[](unsigned ID) const { return *Vector[ID - 1]; }
const T &operator[](unsigned ID) const {
assert(ID-1 < size() && "ID is 0 or out of range!");
return Vector[ID - 1];
}
/// size - Returns the number of entries in the vector.
///