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

Allow CycledSet to grow without bounds

Browse Source
This commit is contained in:
Vinnie Falco
2013-10-05 02:46:23 -07:00
parent 4d3d46f41d
commit 500bddebff
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/ripple/types/api/CycledSet.h
View File

@@ -53,7 +53,7 @@ public:
typedef typename ContainerType::const_pointer const_pointer; typedef typename ContainerType::const_pointer const_pointer;
explicit CycledSet ( explicit CycledSet (
size_type item_max, size_type item_max = 0, // 0 means no limit
Hash hash = Hash(), Hash hash = Hash(),
KeyEqual equal = KeyEqual(), KeyEqual equal = KeyEqual(),
Allocator alloc = Allocator()) Allocator alloc = Allocator())
@@ -69,7 +69,7 @@ public:
// Returns `true` if the next real insert would swap // Returns `true` if the next real insert would swap
bool full() const bool full() const
{ {
return m_front.size() >= m_max; return (m_max != 0) && m_front.size() >= m_max;
} }
// Adds the key to the front if its not in either map // Adds the key to the front if its not in either map