projects
/
libcds.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Removed redundant spaces
[libcds.git]
/
test
/
unit
/
queue
/
test_generic_queue.h
diff --git
a/test/unit/queue/test_generic_queue.h
b/test/unit/queue/test_generic_queue.h
index 295040ac98c52ebecd6f7e80aa79e61fae77c7d7..67ed8075ae568c6bfb89edad2ec77a231501ca53 100644
(file)
--- a/
test/unit/queue/test_generic_queue.h
+++ b/
test/unit/queue/test_generic_queue.h
@@
-46,7
+46,7
@@
namespace cds_test {
const size_t nSize = 100;
const size_t nSize = 100;
- ASSERT_TRUE( q.empty()
);
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
// enqueue/dequeue
ASSERT_CONTAINER_SIZE( q, 0 );
// enqueue/dequeue
@@
-55,16
+55,16
@@
namespace cds_test {
ASSERT_TRUE( q.enqueue( it ));
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
ASSERT_TRUE( q.enqueue( it ));
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
- ASSERT_FALSE( q.empty()
);
+ ASSERT_FALSE( q.empty());
ASSERT_CONTAINER_SIZE( q, nSize );
for ( size_t i = 0; i < nSize; ++i ) {
it = -1;
ASSERT_CONTAINER_SIZE( q, nSize );
for ( size_t i = 0; i < nSize; ++i ) {
it = -1;
- ASSERT_TRUE( q.dequeue( it )
);
+ ASSERT_TRUE( q.dequeue( it ));
ASSERT_EQ( it, static_cast<value_type>( i ));
ASSERT_CONTAINER_SIZE( q, nSize - i - 1 );
}
ASSERT_EQ( it, static_cast<value_type>( i ));
ASSERT_CONTAINER_SIZE( q, nSize - i - 1 );
}
- ASSERT_TRUE( q.empty()
);
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
// push/pop
ASSERT_CONTAINER_SIZE( q, 0 );
// push/pop
@@
-73,16
+73,16
@@
namespace cds_test {
ASSERT_TRUE( q.push( it ));
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
ASSERT_TRUE( q.push( it ));
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
- ASSERT_FALSE( q.empty()
);
+ ASSERT_FALSE( q.empty());
ASSERT_CONTAINER_SIZE( q, nSize );
for ( size_t i = 0; i < nSize; ++i ) {
it = -1;
ASSERT_CONTAINER_SIZE( q, nSize );
for ( size_t i = 0; i < nSize; ++i ) {
it = -1;
- ASSERT_TRUE( q.pop( it )
);
+ ASSERT_TRUE( q.pop( it ));
ASSERT_EQ( it, static_cast<value_type>( i ));
ASSERT_CONTAINER_SIZE( q, nSize - i - 1 );
}
ASSERT_EQ( it, static_cast<value_type>( i ));
ASSERT_CONTAINER_SIZE( q, nSize - i - 1 );
}
- ASSERT_TRUE( q.empty()
);
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
// push/pop with lambda
ASSERT_CONTAINER_SIZE( q, 0 );
// push/pop with lambda
@@
-97,7
+97,7
@@
namespace cds_test {
ASSERT_EQ( it, -1 );
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
ASSERT_EQ( it, -1 );
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
- ASSERT_FALSE( q.empty()
);
+ ASSERT_FALSE( q.empty());
ASSERT_CONTAINER_SIZE( q, nSize );
for ( size_t i = 0; i < nSize; ++i ) {
ASSERT_CONTAINER_SIZE( q, nSize );
for ( size_t i = 0; i < nSize; ++i ) {
@@
-110,30
+110,30
@@
namespace cds_test {
ASSERT_EQ( it, static_cast<value_type>( i ));
ASSERT_CONTAINER_SIZE( q, nSize - i - 1 );
}
ASSERT_EQ( it, static_cast<value_type>( i ));
ASSERT_CONTAINER_SIZE( q, nSize - i - 1 );
}
- ASSERT_TRUE( q.empty()
);
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
// clear
for ( size_t i = 0; i < nSize; ++i ) {
ASSERT_CONTAINER_SIZE( q, 0 );
// clear
for ( size_t i = 0; i < nSize; ++i ) {
- ASSERT_TRUE( q.push( static_cast<value_type>(i)
) );
+ ASSERT_TRUE( q.push( static_cast<value_type>(i)) );
}
}
- ASSERT_FALSE( q.empty()
);
+ ASSERT_FALSE( q.empty());
ASSERT_CONTAINER_SIZE( q, nSize );
q.clear();
ASSERT_CONTAINER_SIZE( q, nSize );
q.clear();
- ASSERT_TRUE( q.empty()
);
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
// pop from empty queue
it = nSize * 2;
ASSERT_CONTAINER_SIZE( q, 0 );
// pop from empty queue
it = nSize * 2;
- ASSERT_FALSE( q.pop( it )
);
+ ASSERT_FALSE( q.pop( it ));
ASSERT_EQ( it, static_cast<value_type>( nSize * 2 ));
ASSERT_EQ( it, static_cast<value_type>( nSize * 2 ));
- ASSERT_TRUE( q.empty()
);
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
ASSERT_CONTAINER_SIZE( q, 0 );
- ASSERT_FALSE( q.dequeue( it )
);
+ ASSERT_FALSE( q.dequeue( it ));
ASSERT_EQ( it, static_cast<value_type>( nSize * 2 ));
ASSERT_EQ( it, static_cast<value_type>( nSize * 2 ));
- ASSERT_TRUE( q.empty()
);
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
}
ASSERT_CONTAINER_SIZE( q, 0 );
}
@@
-151,13
+151,13
@@
namespace cds_test {
ASSERT_TRUE( q.emplace( str[i].c_str()));
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
ASSERT_TRUE( q.emplace( str[i].c_str()));
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
- ASSERT_FALSE( q.empty()
);
+ ASSERT_FALSE( q.empty());
ASSERT_CONTAINER_SIZE( q, nSize );
{
std::string s;
auto f = [&s]( std::string& src ) {
ASSERT_CONTAINER_SIZE( q, nSize );
{
std::string s;
auto f = [&s]( std::string& src ) {
- ASSERT_FALSE( src.empty()
);
+ ASSERT_FALSE( src.empty());
s = std::move( src );
ASSERT_NE( s, src );
};
s = std::move( src );
ASSERT_NE( s, src );
};
@@
-171,31
+171,31
@@
namespace cds_test {
ASSERT_EQ( s, str[i] );
}
}
ASSERT_EQ( s, str[i] );
}
}
- ASSERT_TRUE( q.empty()
);
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
// move push
for ( size_t i = 0; i < nSize; ++i ) {
std::string s = str[i];
ASSERT_CONTAINER_SIZE( q, 0 );
// move push
for ( size_t i = 0; i < nSize; ++i ) {
std::string s = str[i];
- ASSERT_FALSE( s.empty()
);
+ ASSERT_FALSE( s.empty());
if ( i & 1 )
ASSERT_TRUE( q.enqueue( std::move( s )));
else
ASSERT_TRUE( q.push( std::move( s )));
if ( i & 1 )
ASSERT_TRUE( q.enqueue( std::move( s )));
else
ASSERT_TRUE( q.push( std::move( s )));
- ASSERT_TRUE( s.empty()
);
+ ASSERT_TRUE( s.empty());
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
- ASSERT_FALSE( q.empty()
);
+ ASSERT_FALSE( q.empty());
ASSERT_CONTAINER_SIZE( q, nSize );
for ( size_t i = 0; i < nSize; ++i ) {
std::string s;
ASSERT_CONTAINER_SIZE( q, nSize );
for ( size_t i = 0; i < nSize; ++i ) {
std::string s;
- ASSERT_TRUE( q.pop( s )
);
+ ASSERT_TRUE( q.pop( s ));
ASSERT_CONTAINER_SIZE( q, nSize - i - 1 );
ASSERT_EQ( s, str[i] );
}
ASSERT_CONTAINER_SIZE( q, nSize - i - 1 );
ASSERT_EQ( s, str[i] );
}
- ASSERT_TRUE( q.empty()
);
+ ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0 );
}
ASSERT_CONTAINER_SIZE( q, 0 );
}