ARCHIVE/xahaud
3
0
Fork 0
mirror of https://github.com/Xahau/xahaud.git synced 2025-12-06 17:27:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

Remove some unneeded reference count bumps.

Browse Source
This commit is contained in:
JoelKatz
2012-07-26 16:38:42 -07:00
parent c5995e9e1e
commit ad77087ee5
2 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/LedgerEntrySet.cpp
View File

@@ -46,7 +46,7 @@ LedgerEntryAction LedgerEntrySet::hasEntry(const uint256& index) const
return it->second.mAction;
}
void LedgerEntrySet::entryCache(SLE::pointer sle)
void LedgerEntrySet::entryCache(SLE::pointer& sle)
{
boost::unordered_map<uint256, LedgerEntrySetEntry>::iterator it = mEntries.find(sle->getIndex());
if (it == mEntries.end())
@@ -67,7 +67,7 @@ void LedgerEntrySet::entryCache(SLE::pointer sle)
}
}
void LedgerEntrySet::entryCreate(SLE::pointer sle)
void LedgerEntrySet::entryCreate(SLE::pointer& sle)
{
boost::unordered_map<uint256, LedgerEntrySetEntry>::iterator it = mEntries.find(sle->getIndex());
if (it == mEntries.end())
@@ -97,7 +97,7 @@ void LedgerEntrySet::entryCreate(SLE::pointer sle)
}
}
void LedgerEntrySet::entryModify(SLE::pointer sle)
void LedgerEntrySet::entryModify(SLE::pointer& sle)
{
boost::unordered_map<uint256, LedgerEntrySetEntry>::iterator it = mEntries.find(sle->getIndex());
if (it == mEntries.end())
@@ -132,7 +132,7 @@ void LedgerEntrySet::entryModify(SLE::pointer sle)
}
}
void LedgerEntrySet::entryDelete(SLE::pointer sle)
void LedgerEntrySet::entryDelete(SLE::pointer& sle)
{
boost::unordered_map<uint256, LedgerEntrySetEntry>::iterator it = mEntries.find(sle->getIndex());
if (it == mEntries.end())

8
src/LedgerEntrySet.h
View File

@@ -49,10 +49,10 @@ public:
// basic entry functions
SLE::pointer getEntry(const uint256& index, LedgerEntryAction&);
LedgerEntryAction hasEntry(const uint256& index) const;
void entryCache(SLE::pointer); // Add this entry to the cache
void entryCreate(SLE::pointer); // This entry will be created
void entryDelete(SLE::pointer); // This entry will be deleted
void entryModify(SLE::pointer); // This entry will be modified
void entryCache(SLE::pointer&); // Add this entry to the cache
void entryCreate(SLE::pointer&); // This entry will be created
void entryDelete(SLE::pointer&); // This entry will be deleted
void entryModify(SLE::pointer&); // This entry will be modified
// iterator functions
bool isEmpty() const { return mEntries.empty(); }