SymbolDB: Simplify GetSymbolsFromHash
Given a std::map can't have duplicate keys, iterating over the map explicitly isn't necessary, and find() can just be used instead. Also, instead of manually calling push_back() for every entry to be added, the range constructor of std::vector can be used instead to add the whole range all at once.
This commit is contained in:
parent
5814d23fd9
commit
2f2aab963d
|
@ -72,14 +72,12 @@ Symbol* SymbolDB::GetSymbolFromHash(u32 hash)
|
||||||
|
|
||||||
std::vector<Symbol*> SymbolDB::GetSymbolsFromHash(u32 hash)
|
std::vector<Symbol*> SymbolDB::GetSymbolsFromHash(u32 hash)
|
||||||
{
|
{
|
||||||
std::vector<Symbol*> symbols;
|
const auto iter = checksumToFunction.find(hash);
|
||||||
|
|
||||||
for (const auto& iter : checksumToFunction)
|
if (iter == checksumToFunction.cend())
|
||||||
if (iter.first == hash)
|
return {};
|
||||||
for (const auto& symbol : iter.second)
|
|
||||||
symbols.push_back(symbol);
|
|
||||||
|
|
||||||
return symbols;
|
return {iter->second.cbegin(), iter->second.cend()};
|
||||||
}
|
}
|
||||||
|
|
||||||
void SymbolDB::AddCompleteSymbol(const Symbol& symbol)
|
void SymbolDB::AddCompleteSymbol(const Symbol& symbol)
|
||||||
|
|
Loading…
Reference in New Issue