LatinIME/native/jni/tests/utils/int_array_view_test.cpp

129 lines
4.3 KiB
C++

/*
* 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 "utils/int_array_view.h"
#include <gtest/gtest.h>
#include <array>
#include <vector>
namespace latinime {
namespace {
TEST(IntArrayViewTest, TestAccess) {
const std::vector<int> intVector = {3, 2, 1, 0, -1, -2};
IntArrayView intArrayView(intVector);
EXPECT_EQ(intVector.size(), intArrayView.size());
for (int i = 0; i < static_cast<int>(intVector.size()); ++i) {
EXPECT_EQ(intVector[i], intArrayView[i]);
}
}
TEST(IntArrayViewTest, TestIteration) {
const std::vector<int> intVector = {3, 2, 1, 0, -1, -2};
IntArrayView intArrayView(intVector);
size_t expectedIndex = 0;
for (const int element : intArrayView) {
EXPECT_EQ(intVector[expectedIndex], element);
++expectedIndex;
}
EXPECT_EQ(expectedIndex, intArrayView.size());
}
TEST(IntArrayViewTest, TestConstructFromArray) {
const size_t ARRAY_SIZE = 100;
std::array<int, ARRAY_SIZE> intArray;
const auto intArrayView = IntArrayView::fromArray(intArray);
EXPECT_EQ(ARRAY_SIZE, intArrayView.size());
}
TEST(IntArrayViewTest, TestConstructFromObject) {
const int object = 10;
const auto intArrayView = IntArrayView::singleElementView(&object);
EXPECT_EQ(1u, intArrayView.size());
EXPECT_EQ(object, intArrayView[0]);
}
TEST(IntArrayViewTest, TestContains) {
EXPECT_FALSE(IntArrayView().contains(0));
EXPECT_FALSE(IntArrayView().contains(1));
const std::vector<int> intVector = {3, 2, 1, 0, -1, -2};
IntArrayView intArrayView(intVector);
EXPECT_TRUE(intArrayView.contains(0));
EXPECT_TRUE(intArrayView.contains(3));
EXPECT_TRUE(intArrayView.contains(-2));
EXPECT_FALSE(intArrayView.contains(-3));
EXPECT_FALSE(intArrayView.limit(0).contains(3));
}
TEST(IntArrayViewTest, TestLimit) {
const std::vector<int> intVector = {3, 2, 1, 0, -1, -2};
IntArrayView intArrayView(intVector);
EXPECT_TRUE(intArrayView.limit(0).empty());
EXPECT_EQ(intArrayView.size(), intArrayView.limit(intArrayView.size()).size());
EXPECT_EQ(intArrayView.size(), intArrayView.limit(1000).size());
IntArrayView subView = intArrayView.limit(4);
EXPECT_EQ(4u, subView.size());
for (size_t i = 0; i < subView.size(); ++i) {
EXPECT_EQ(intVector[i], subView[i]);
}
}
TEST(IntArrayViewTest, TestSkip) {
const std::vector<int> intVector = {3, 2, 1, 0, -1, -2};
IntArrayView intArrayView(intVector);
EXPECT_TRUE(intArrayView.skip(intVector.size()).empty());
EXPECT_TRUE(intArrayView.skip(intVector.size() + 1).empty());
EXPECT_EQ(intArrayView.size(), intArrayView.skip(0).size());
EXPECT_EQ(intArrayView.size(), intArrayView.limit(1000).size());
static const size_t SKIP_COUNT = 2;
IntArrayView subView = intArrayView.skip(SKIP_COUNT);
EXPECT_EQ(intVector.size() - SKIP_COUNT, subView.size());
for (size_t i = 0; i < subView.size(); ++i) {
EXPECT_EQ(intVector[i + SKIP_COUNT], subView[i]);
}
}
TEST(IntArrayViewTest, TestCopyToArray) {
// "{{" to suppress warning.
std::array<int, 7> buffer = {{10, 20, 30, 40, 50, 60, 70}};
const std::vector<int> intVector = {3, 2, 1, 0, -1, -2};
IntArrayView intArrayView(intVector);
intArrayView.limit(0).copyToArray(&buffer, 0);
EXPECT_EQ(10, buffer[0]);
EXPECT_EQ(20, buffer[1]);
intArrayView.limit(1).copyToArray(&buffer, 0);
EXPECT_EQ(intVector[0], buffer[0]);
EXPECT_EQ(20, buffer[1]);
intArrayView.limit(1).copyToArray(&buffer, 1);
EXPECT_EQ(intVector[0], buffer[0]);
EXPECT_EQ(intVector[0], buffer[1]);
intArrayView.copyToArray(&buffer, 0);
for (size_t i = 0; i < intArrayView.size(); ++i) {
EXPECT_EQ(intVector[i], buffer[i]);
}
EXPECT_EQ(70, buffer[6]);
}
} // namespace
} // namespace latinime