nyancrimew/LatinIME
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

am c8ae5605: Merge "Add DicNodePoolTest."

Browse source 
* commit 'c8ae5605905f843f37909635e728787e615f05ae':
  Add DicNodePoolTest.
This commit is contained in:
Keisuke Kuroyanagi 2014-08-29 06:11:07 +00:00 committed by Android Git Automerger
commit f8fcfe1c3a
2 changed files with 71 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
native/jni/NativeFileList.mk
View file

@ -121,8 +121,9 @@ LATIN_IME_CORE_SRC_FILES += $(LATIN_IME_CORE_SRC_FILES_BACKWARD_V402)
LATIN_IME_CORE_TEST_FILES := \
defines_test.cpp \
suggest/core/layout/normal_distribution_2d_test.cpp \
suggest/core/dicnode/dic_node_pool_test.cpp \
suggest/core/dictionary/bloom_filter_test.cpp \
suggest/core/layout/normal_distribution_2d_test.cpp \
suggest/policyimpl/dictionary/structure/v4/content/language_model_dict_content_test.cpp \
suggest/policyimpl/dictionary/structure/v4/content/probability_entry_test.cpp \
suggest/policyimpl/dictionary/utils/buffer_with_extendable_buffer_test.cpp \

69
native/jni/tests/suggest/core/dicnode/dic_node_pool_test.cpp Normal file
View file

@ -0,0 +1,69 @@
/*
* Copyright (C) 2014 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "suggest/core/dicnode/dic_node_pool.h"
#include <gtest/gtest.h>
namespace latinime {
namespace {
TEST(DicNodePoolTest, TestGet) {
static const int CAPACITY = 10;
DicNodePool dicNodePool(CAPACITY);
for (int i = 0; i < CAPACITY; ++i) {
EXPECT_NE(nullptr, dicNodePool.getInstance());
}
EXPECT_EQ(nullptr, dicNodePool.getInstance());
}
TEST(DicNodePoolTest, TestPlaceBack) {
static const int CAPACITY = 1;
DicNodePool dicNodePool(CAPACITY);
DicNode *const dicNode = dicNodePool.getInstance();
EXPECT_NE(nullptr, dicNode);
EXPECT_EQ(nullptr, dicNodePool.getInstance());
dicNodePool.placeBackInstance(dicNode);
EXPECT_EQ(dicNode, dicNodePool.getInstance());
}
TEST(DicNodePoolTest, TestReset) {
static const int CAPACITY_SMALL = 2;
static const int CAPACITY_LARGE = 10;
DicNodePool dicNodePool(CAPACITY_SMALL);
for (int i = 0; i < CAPACITY_SMALL; ++i) {
EXPECT_NE(nullptr, dicNodePool.getInstance());
}
EXPECT_EQ(nullptr, dicNodePool.getInstance());
dicNodePool.reset(CAPACITY_LARGE);
for (int i = 0; i < CAPACITY_LARGE; ++i) {
EXPECT_NE(nullptr, dicNodePool.getInstance());
}
EXPECT_EQ(nullptr, dicNodePool.getInstance());
dicNodePool.reset(CAPACITY_SMALL);
for (int i = 0; i < CAPACITY_SMALL; ++i) {
EXPECT_NE(nullptr, dicNodePool.getInstance());
}
EXPECT_EQ(nullptr, dicNodePool.getInstance());
}
} // namespace
} // namespace latinime