@ -21,17 +21,15 @@ using std::list;
// Increase reference count on all underling memtables
// Increase reference count on all underling memtables
void MemTableList : : RefAll ( ) {
void MemTableList : : RefAll ( ) {
for ( list < MemTable * > : : iterator it = memlist_ . begin ( ) ;
for ( auto & memtable : memlist_ ) {
it ! = memlist_ . end ( ) ; + + it ) {
memtable - > Ref ( ) ;
( * it ) - > Ref ( ) ;
}
}
}
}
// Drop reference count on all underling memtables
// Drop reference count on all underling memtables
void MemTableList : : UnrefAll ( ) {
void MemTableList : : UnrefAll ( ) {
for ( list < MemTable * > : : iterator it = memlist_ . begin ( ) ;
for ( auto & memtable : memlist_ ) {
it ! = memlist_ . end ( ) ; + + it ) {
memtable - > Unref ( ) ;
( * it ) - > Unref ( ) ;
}
}
}
}
@ -53,8 +51,7 @@ bool MemTableList::IsFlushPending(int min_write_buffer_number_to_merge) {
// Returns the memtables that need to be flushed.
// Returns the memtables that need to be flushed.
void MemTableList : : PickMemtablesToFlush ( std : : vector < MemTable * > * ret ) {
void MemTableList : : PickMemtablesToFlush ( std : : vector < MemTable * > * ret ) {
for ( list < MemTable * > : : reverse_iterator it = memlist_ . rbegin ( ) ;
for ( auto it = memlist_ . rbegin ( ) ; it ! = memlist_ . rend ( ) ; it + + ) {
it ! = memlist_ . rend ( ) ; it + + ) {
MemTable * m = * it ;
MemTable * m = * it ;
if ( ! m - > flush_in_progress_ ) {
if ( ! m - > flush_in_progress_ ) {
assert ( ! m - > flush_completed_ ) ;
assert ( ! m - > flush_completed_ ) ;
@ -184,9 +181,8 @@ void MemTableList::Add(MemTable* m) {
// Returns an estimate of the number of bytes of data in use.
// Returns an estimate of the number of bytes of data in use.
size_t MemTableList : : ApproximateMemoryUsage ( ) {
size_t MemTableList : : ApproximateMemoryUsage ( ) {
size_t size = 0 ;
size_t size = 0 ;
for ( list < MemTable * > : : iterator it = memlist_ . begin ( ) ;
for ( auto & memtable : memlist_ ) {
it ! = memlist_ . end ( ) ; + + it ) {
size + = memtable - > ApproximateMemoryUsage ( ) ;
size + = ( * it ) - > ApproximateMemoryUsage ( ) ;
}
}
return size ;
return size ;
}
}
@ -197,9 +193,8 @@ size_t MemTableList::ApproximateMemoryUsage() {
bool MemTableList : : Get ( const LookupKey & key , std : : string * value , Status * s ,
bool MemTableList : : Get ( const LookupKey & key , std : : string * value , Status * s ,
std : : deque < std : : string > * operands ,
std : : deque < std : : string > * operands ,
const Options & options ) {
const Options & options ) {
for ( list < MemTable * > : : iterator it = memlist_ . begin ( ) ;
for ( auto & memtable : memlist_ ) {
it ! = memlist_ . end ( ) ; + + it ) {
if ( memtable - > Get ( key , value , s , operands , options ) ) {
if ( ( * it ) - > Get ( key , value , s , operands , options ) ) {
return true ;
return true ;
}
}
}
}
@ -207,9 +202,8 @@ bool MemTableList::Get(const LookupKey& key, std::string* value, Status* s,
}
}
void MemTableList : : GetMemTables ( std : : vector < MemTable * > * output ) {
void MemTableList : : GetMemTables ( std : : vector < MemTable * > * output ) {
for ( list < MemTable * > : : iterator it = memlist_ . begin ( ) ;
for ( auto & memtable : memlist_ ) {
it ! = memlist_ . end ( ) ; + + it ) {
output - > push_back ( memtable ) ;
output - > push_back ( * it ) ;
}
}
}
}