2021-01-04 05:02:51 +08:00
|
|
|
// (C) Copyright 2020, Google Inc.
|
|
|
|
// 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 "include_gunit.h"
|
2021-03-27 02:23:51 +08:00
|
|
|
#include "clst.h"
|
2021-01-04 05:02:51 +08:00
|
|
|
#include "elst.h"
|
2021-03-27 02:23:51 +08:00
|
|
|
#include "elst2.h"
|
2021-01-04 05:02:51 +08:00
|
|
|
|
|
|
|
namespace tesseract {
|
|
|
|
|
|
|
|
class ListTest : public ::testing::Test {
|
2021-03-13 05:06:34 +08:00
|
|
|
protected:
|
2021-01-04 05:02:51 +08:00
|
|
|
void SetUp() override {
|
|
|
|
static std::locale system_locale("");
|
|
|
|
std::locale::global(system_locale);
|
|
|
|
}
|
2021-03-27 02:23:51 +08:00
|
|
|
const size_t ListSize = 5;
|
|
|
|
};
|
|
|
|
|
2024-11-22 09:39:42 +08:00
|
|
|
class Clst {
|
2021-03-27 02:23:51 +08:00
|
|
|
public:
|
|
|
|
Clst(unsigned n) : value(n) {}
|
|
|
|
unsigned value;
|
2021-01-04 05:02:51 +08:00
|
|
|
};
|
|
|
|
|
2024-11-22 22:54:40 +08:00
|
|
|
class Elst : public ELIST<Elst>::LINK {
|
2021-03-13 05:06:34 +08:00
|
|
|
public:
|
|
|
|
Elst(unsigned n) : value(n) {}
|
2021-01-04 05:02:51 +08:00
|
|
|
unsigned value;
|
|
|
|
};
|
|
|
|
|
2024-11-22 23:22:53 +08:00
|
|
|
class Elst2 : public ELIST2<Elst2>::LINK {
|
2021-03-27 02:23:51 +08:00
|
|
|
public:
|
|
|
|
Elst2(unsigned n) : value(n) {}
|
|
|
|
unsigned value;
|
|
|
|
};
|
|
|
|
|
|
|
|
CLISTIZEH(Clst)
|
2021-01-04 05:02:51 +08:00
|
|
|
ELISTIZEH(Elst)
|
2021-03-27 02:23:51 +08:00
|
|
|
ELIST2IZEH(Elst2)
|
|
|
|
|
|
|
|
TEST_F(ListTest, TestCLIST) {
|
|
|
|
Clst_CLIST list;
|
|
|
|
EXPECT_TRUE(list.empty());
|
|
|
|
EXPECT_EQ(list.length(), 0);
|
2024-11-22 09:39:42 +08:00
|
|
|
auto it = Clst_CLIST::ITERATOR(&list);
|
2021-03-27 02:23:51 +08:00
|
|
|
for (unsigned i = 0; i < ListSize; i++) {
|
|
|
|
auto *lst = new Clst(i);
|
|
|
|
it.add_to_end(lst);
|
|
|
|
}
|
|
|
|
EXPECT_TRUE(!list.empty());
|
|
|
|
EXPECT_EQ(list.length(), ListSize);
|
|
|
|
it.move_to_first();
|
|
|
|
unsigned n = 0;
|
|
|
|
for (it.mark_cycle_pt(); !it.cycled_list(); it.forward()) {
|
|
|
|
EXPECT_TRUE(n == 0 || !it.at_first());
|
|
|
|
auto *lst = reinterpret_cast<Clst *>(it.data());
|
|
|
|
EXPECT_EQ(lst->value, n);
|
|
|
|
n++;
|
|
|
|
EXPECT_TRUE(n != ListSize || it.at_last());
|
|
|
|
}
|
|
|
|
it.forward();
|
|
|
|
n++;
|
|
|
|
for (it.mark_cycle_pt(); !it.cycled_list(); it.forward()) {
|
|
|
|
auto *lst = reinterpret_cast<Clst *>(it.extract());
|
|
|
|
EXPECT_EQ(lst->value, n % ListSize);
|
|
|
|
n++;
|
|
|
|
delete lst;
|
|
|
|
}
|
|
|
|
// TODO: add more tests for CLIST
|
|
|
|
}
|
2021-01-04 05:02:51 +08:00
|
|
|
|
|
|
|
TEST_F(ListTest, TestELIST) {
|
|
|
|
Elst_LIST list;
|
2021-03-27 02:23:51 +08:00
|
|
|
EXPECT_TRUE(list.empty());
|
|
|
|
EXPECT_EQ(list.length(), 0);
|
2024-11-22 22:54:40 +08:00
|
|
|
auto it = ELIST<Elst>::ITERATOR(&list);
|
2021-03-27 02:23:51 +08:00
|
|
|
for (unsigned i = 0; i < ListSize; i++) {
|
2021-03-13 05:06:34 +08:00
|
|
|
auto *elst = new Elst(i);
|
2021-01-04 05:02:51 +08:00
|
|
|
it.add_to_end(elst);
|
|
|
|
}
|
2021-03-27 02:23:51 +08:00
|
|
|
EXPECT_TRUE(!list.empty());
|
|
|
|
EXPECT_EQ(list.length(), ListSize);
|
2021-01-04 05:02:51 +08:00
|
|
|
it.move_to_first();
|
|
|
|
unsigned n = 0;
|
|
|
|
for (it.mark_cycle_pt(); !it.cycled_list(); it.forward()) {
|
2021-03-27 02:23:51 +08:00
|
|
|
EXPECT_TRUE(n == 0 || !it.at_first());
|
2021-03-13 05:06:34 +08:00
|
|
|
auto *elst = reinterpret_cast<Elst *>(it.data());
|
2021-01-04 05:02:51 +08:00
|
|
|
EXPECT_EQ(elst->value, n);
|
|
|
|
n++;
|
2021-03-27 02:23:51 +08:00
|
|
|
EXPECT_TRUE(n != ListSize || it.at_last());
|
2021-01-04 05:02:51 +08:00
|
|
|
}
|
|
|
|
it.forward();
|
|
|
|
n++;
|
|
|
|
for (it.mark_cycle_pt(); !it.cycled_list(); it.forward()) {
|
2021-03-13 05:06:34 +08:00
|
|
|
auto *elst = reinterpret_cast<Elst *>(it.extract());
|
2021-03-27 02:23:51 +08:00
|
|
|
EXPECT_EQ(elst->value, n % ListSize);
|
2021-01-04 05:02:51 +08:00
|
|
|
n++;
|
|
|
|
delete elst;
|
|
|
|
}
|
|
|
|
// TODO: add more tests for ELIST
|
|
|
|
}
|
|
|
|
|
2021-03-27 02:23:51 +08:00
|
|
|
TEST_F(ListTest, TestELIST2) {
|
|
|
|
Elst2_LIST list;
|
|
|
|
EXPECT_TRUE(list.empty());
|
|
|
|
EXPECT_EQ(list.length(), 0);
|
2024-11-22 23:22:53 +08:00
|
|
|
auto it = ELIST2<Elst2>::ITERATOR(&list);
|
2021-03-27 02:23:51 +08:00
|
|
|
for (unsigned i = 0; i < ListSize; i++) {
|
|
|
|
auto *lst = new Elst2(i);
|
|
|
|
it.add_to_end(lst);
|
|
|
|
}
|
|
|
|
EXPECT_TRUE(!list.empty());
|
|
|
|
EXPECT_EQ(list.length(), ListSize);
|
|
|
|
it.move_to_first();
|
|
|
|
unsigned n = 0;
|
|
|
|
for (it.mark_cycle_pt(); !it.cycled_list(); it.forward()) {
|
|
|
|
EXPECT_TRUE(n == 0 || !it.at_first());
|
|
|
|
auto *lst = reinterpret_cast<Elst2 *>(it.data());
|
|
|
|
EXPECT_EQ(lst->value, n);
|
|
|
|
n++;
|
|
|
|
EXPECT_TRUE(n != ListSize || it.at_last());
|
|
|
|
}
|
|
|
|
it.backward();
|
|
|
|
n--;
|
|
|
|
for (it.mark_cycle_pt(); !it.cycled_list(); it.backward()) {
|
|
|
|
auto *lst = reinterpret_cast<Elst2 *>(it.data());
|
|
|
|
EXPECT_EQ(lst->value, n);
|
|
|
|
n--;
|
|
|
|
}
|
|
|
|
it.forward();
|
|
|
|
n++;
|
|
|
|
for (it.mark_cycle_pt(); !it.cycled_list(); it.forward()) {
|
|
|
|
auto *lst = reinterpret_cast<Elst2 *>(it.extract());
|
|
|
|
EXPECT_EQ(lst->value, n % ListSize);
|
|
|
|
n++;
|
|
|
|
delete lst;
|
|
|
|
}
|
|
|
|
// TODO: add more tests for ELIST2
|
|
|
|
}
|
|
|
|
|
2021-03-13 05:06:34 +08:00
|
|
|
} // namespace tesseract.
|