//
// The LLVM Compiler Infrastructure
//
-// This file was developed by Reid Spencer. It is distributed under the
-// University of Illinois Open Source License. See LICENSE.TXT for details.
+// This file is distributed under the University of Illinois Open Source
+// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
/// @{
public:
- TypeSymbolTable() {}
+ TypeSymbolTable():LastUnique(0) {}
~TypeSymbolTable();
/// @}
/// @brief Get a const_iterator to the start of the symbol table
inline const_iterator begin() const { return tmap.begin(); }
- /// Get an iterator to the end of the symbol talbe.
+ /// Get an iterator to the end of the symbol table.
inline iterator end() { return tmap.end(); }
/// Get a const_iterator to the end of the symbol table.
/// @{
public:
- /// This method will strip the symbol table of its names
- /// @brief Strip the symbol table.
- bool strip();
-
/// Inserts a type into the symbol table with the specified name. There can be
/// a many-to-one mapping between names and types. This method allows a type
/// with an existing entry in the symbol table to get a new name.
/// @returns the Type that was erased from the symbol table.
Type* remove(iterator TI);
- /// Remove a specific Type from the symbol table. This isn't fast, linear
- /// search, O(n), algorithm.
- /// @returns true if the erase was successful (TI was found)
- bool remove(Type* TI);
-
- /// Rename a type. This ain't fast, we have to linearly search for it first.
- /// @returns true if the rename was successful (type was found)
- bool rename(Type* T, const std::string& new_name);
-
/// @}
/// @name AbstractTypeUser Methods
/// @{
} // End llvm namespace
#endif
-