andreacavalli/rocksdb
0
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Make autovector_test runnable in ROCKSDB_LITE

Browse Source 
Summary: Make autovector_test runnable in ROCKSDB_LITE

Test Plan: autovector_test

Reviewers: sdong, rven, anthony, kradhakrishnan, IslamAbdelRahman, igor

Reviewed By: igor

Subscribers: dhruba, leveldb

Differential Revision: https://reviews.facebook.net/D40245
This commit is contained in:
Yueh-Hsuan Chiang 2015-06-18 15:58:00 -07:00
parent 4d6d47688c
commit df719d4964
1 changed files with 20 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
util/autovector_test.cc
View File

@ -18,8 +18,17 @@ namespace rocksdb {
using namespace std; using namespace std;
class AutoVectorTest : public testing::Test {}; class AutoVectorTest : public testing::Test {};
const unsigned long kSize = 8; const unsigned long kSize = 8;
namespace {
template <class T>
void AssertAutoVectorOnlyInStack(autovector<T, kSize>* vec, bool result) {
#ifndef ROCKSDB_LITE
ASSERT_EQ(vec->only_in_stack(), result);
#endif // !ROCKSDB_LITE
}
} // namespace
TEST_F(AutoVectorTest, PushBackAndPopBack) { TEST_F(AutoVectorTest, PushBackAndPopBack) {
autovector<size_t, kSize> vec; autovector<size_t, kSize> vec;
ASSERT_TRUE(vec.empty()); ASSERT_TRUE(vec.empty());
@ -29,9 +38,9 @@ TEST_F(AutoVectorTest, PushBackAndPopBack) {
vec.push_back(i); vec.push_back(i);
ASSERT_TRUE(!vec.empty()); ASSERT_TRUE(!vec.empty());
if (i < kSize) { if (i < kSize) {
ASSERT_TRUE(vec.only_in_stack()); AssertAutoVectorOnlyInStack(&vec, true);
} else { } else {
ASSERT_TRUE(!vec.only_in_stack()); AssertAutoVectorOnlyInStack(&vec, false);
} }
ASSERT_EQ(i + 1, vec.size()); ASSERT_EQ(i + 1, vec.size());
ASSERT_EQ(i, vec[i]); ASSERT_EQ(i, vec[i]);
@ -42,7 +51,7 @@ TEST_F(AutoVectorTest, PushBackAndPopBack) {
while (size != 0) { while (size != 0) {
vec.pop_back(); vec.pop_back();
// will always be in heap // will always be in heap
ASSERT_TRUE(!vec.only_in_stack()); AssertAutoVectorOnlyInStack(&vec, false);
ASSERT_EQ(--size, vec.size()); ASSERT_EQ(--size, vec.size());
} }
@ -57,9 +66,9 @@ TEST_F(AutoVectorTest, EmplaceBack) {
vec.emplace_back(i, ToString(i + 123)); vec.emplace_back(i, ToString(i + 123));
ASSERT_TRUE(!vec.empty()); ASSERT_TRUE(!vec.empty());
if (i < kSize) { if (i < kSize) {
ASSERT_TRUE(vec.only_in_stack()); AssertAutoVectorOnlyInStack(&vec, true);
} else { } else {
ASSERT_TRUE(!vec.only_in_stack()); AssertAutoVectorOnlyInStack(&vec, false);
} }
ASSERT_EQ(i + 1, vec.size()); ASSERT_EQ(i + 1, vec.size());
@ -69,20 +78,20 @@ TEST_F(AutoVectorTest, EmplaceBack) {
vec.clear(); vec.clear();
ASSERT_TRUE(vec.empty()); ASSERT_TRUE(vec.empty());
ASSERT_TRUE(!vec.only_in_stack()); AssertAutoVectorOnlyInStack(&vec, false);
} }
TEST_F(AutoVectorTest, Resize) { TEST_F(AutoVectorTest, Resize) {
autovector<size_t, kSize> vec; autovector<size_t, kSize> vec;
vec.resize(kSize); vec.resize(kSize);
ASSERT_TRUE(vec.only_in_stack()); AssertAutoVectorOnlyInStack(&vec, true);
for (size_t i = 0; i < kSize; ++i) { for (size_t i = 0; i < kSize; ++i) {
vec[i] = i; vec[i] = i;
} }
vec.resize(kSize * 2); vec.resize(kSize * 2);
ASSERT_TRUE(!vec.only_in_stack()); AssertAutoVectorOnlyInStack(&vec, false);
for (size_t i = 0; i < kSize; ++i) { for (size_t i = 0; i < kSize; ++i) {
ASSERT_EQ(vec[i], i); ASSERT_EQ(vec[i], i);
} }
@ -99,7 +108,9 @@ void AssertEqual(
const autovector<size_t, kSize>& a, const autovector<size_t, kSize>& b) { const autovector<size_t, kSize>& a, const autovector<size_t, kSize>& b) {
ASSERT_EQ(a.size(), b.size()); ASSERT_EQ(a.size(), b.size());
ASSERT_EQ(a.empty(), b.empty()); ASSERT_EQ(a.empty(), b.empty());
#ifndef ROCKSDB_LITE
ASSERT_EQ(a.only_in_stack(), b.only_in_stack()); ASSERT_EQ(a.only_in_stack(), b.only_in_stack());
#endif // !ROCKSDB_LITE
for (size_t i = 0; i < a.size(); ++i) { for (size_t i = 0; i < a.size(); ++i) {
ASSERT_EQ(a[i], b[i]); ASSERT_EQ(a[i], b[i]);
} }