SpiecsEngine
 
Loading...
Searching...
No Matches
SpanList_test.h
Go to the documentation of this file.
1/**
2* @file SpanList_test.h.
3* @brief The SpanList_test Definitions.
4* @author Spices.
5*/
6
7#pragma once
8#include <gmock/gmock.h>
9#include <Core/Container/SpanList.h>
10#include "Instrumentor.h"
11
12namespace SpicesTest {
13
14 /**
15 * @brief The interface is inherited from testing::Test.
16 * Registry on Initialize.
17 */
18 class span_list_test : public testing::Test
19 {
20 protected:
21
22 /**
23 * @brief The interface is inherited from testing::Test.
24 * Registry on Initialize.
25 */
26 void SetUp() override {}
27
28 /**
29 * @brief The interface is inherited from testing::Test.
30 * Call before Destructor.
31 */
33
35 };
36
37 /**
38 * @brief Testing scl::span_list::Initialize.
39 */
41
43
44 EXPECT_EQ(m_SpanList.Empty(), true);
45 }
46
47 /**
48 * @brief Testing scl::span_list::Insert/Erase.
49 */
51
53
54 scl::span s0;
55 scl::span s1;
56 scl::span s2;
57
58 {
59 m_SpanList.Insert(m_SpanList.Begin(), &s0);
60 EXPECT_EQ(s0.m_Prev, m_SpanList.End());
61 EXPECT_EQ(s0.m_Next, m_SpanList.End());
62
63 m_SpanList.Insert(&s0, &s1);
64 EXPECT_EQ(s1.m_Prev, m_SpanList.End());
65 EXPECT_EQ(s1.m_Next, &s0);
66 EXPECT_EQ(s0.m_Prev, &s1);
67
68 m_SpanList.Insert(&s0, &s2);
69 EXPECT_EQ(s2.m_Prev, &s1);
70 EXPECT_EQ(s2.m_Next, &s0);
71 EXPECT_EQ(s1.m_Next, &s2);
72 EXPECT_EQ(s0.m_Prev, &s2);
73 }
74
75 {
76 m_SpanList.Erase(&s2);
77 EXPECT_EQ(s2.m_Prev, nullptr);
78 EXPECT_EQ(s2.m_Next, nullptr);
79 EXPECT_EQ(s1.m_Next, &s0);
80 EXPECT_EQ(s0.m_Prev, &s1);
81
82 m_SpanList.Erase(&s0);
83 EXPECT_EQ(s0.m_Prev, nullptr);
84 EXPECT_EQ(s0.m_Next, nullptr);
85 EXPECT_EQ(s1.m_Next, m_SpanList.End());
86
87 m_SpanList.Erase(&s1);
88 EXPECT_EQ(s1.m_Prev, nullptr);
89 EXPECT_EQ(s1.m_Next, nullptr);
90 EXPECT_EQ(m_SpanList.Empty(), true);
91 }
92 }
93
94 /**
95 * @brief Testing scl::span_list::PushFront/PopFront.
96 */
98
100
101 scl::span s0;
102 scl::span s1;
103 scl::span s2;
104
105 {
106 m_SpanList.PushFront(&s0);
107 EXPECT_EQ(s0.m_Prev, m_SpanList.End());
108 EXPECT_EQ(s0.m_Next, m_SpanList.End());
109
110 m_SpanList.PushFront(&s1);
111 EXPECT_EQ(s1.m_Prev, m_SpanList.End());
112 EXPECT_EQ(s1.m_Next, &s0);
113 EXPECT_EQ(s0.m_Prev, &s1);
114
115 m_SpanList.PushFront(&s2);
116 EXPECT_EQ(s2.m_Prev, m_SpanList.End());
117 EXPECT_EQ(s2.m_Next, &s1);
118 EXPECT_EQ(s1.m_Prev, &s2);
119 }
120
121 {
122 scl::span* ps2 = m_SpanList.PopFront();
123 EXPECT_EQ(ps2->m_Prev, nullptr);
124 EXPECT_EQ(ps2->m_Next, nullptr);
125 EXPECT_EQ(ps2, &s2);
126 EXPECT_EQ(m_SpanList.Begin(), &s1);
127
128 scl::span* ps1 = m_SpanList.PopFront();
129 EXPECT_EQ(ps1->m_Prev, nullptr);
130 EXPECT_EQ(ps1->m_Next, nullptr);
131 EXPECT_EQ(ps1, &s1);
132 EXPECT_EQ(m_SpanList.Begin(), &s0);
133
134 scl::span* ps0 = m_SpanList.PopFront();
135 EXPECT_EQ(ps0->m_Prev, nullptr);
136 EXPECT_EQ(ps0->m_Next, nullptr);
137 EXPECT_EQ(ps0, &s0);
138 EXPECT_EQ(m_SpanList.Empty(), true);
139 }
140 }
141}
#define SPICES_FUNC_SIG
#define SPICESTEST_PROFILE_SCOPE_LINE2(name, line)
#define SPICESTEST_PROFILE_SCOPE(name)
#define SPICES_PROFILE
#define SPICESTEST_PROFILE_END_SESSION()
#define SPICESTEST_PROFILE_BEGIN_SESSION(name, filepath)
#define SPICESTEST_PROFILE_SCOPE_LINE(name, line)
#define SPICESTEST_PROFILE_FUNCTION()
InstrumentationTimer(const char *name)
std::chrono::time_point< std::chrono::steady_clock > m_StartTimepoint
Instrumentor(Instrumentor &&)=delete
static Instrumentor & Get()
void BeginSession(const std::string &name, const std::string &filepath="results.json")
void WriteProfile(const ProfileResult &result)
InstrumentationSession * m_CurrentSession
std::ofstream m_OutputStream
Instrumentor(const Instrumentor &)=delete
void Test(float f)
Basic Override Class Function.
void Test()
Basic Override Class Function.
void TearDown() override
Testing class TearDown function.
std::vector< scl::directed_acyclic_node > m_Nodes
void SetUp() override
Testing class initialize function.
The interface is inherited from testing::Test. Registy on Initialize.
void SetUp() override
The interface is inherited from testing::Test. Registry on Initialize.
void TearDown() override
The interface is inherited from testing::Test. Call before Destructor.
The interface is inherited from testing::Test. Registry on Initialize.
scl::kd_tree< 2 > m_KDTree
Create a KDTree with 2 dimensions.
Definition KDTree_test.h:57
void TearDown() override
Testing class TearDown function.
Definition KDTree_test.h:52
void SetUp() override
Testing class initialize function.
Definition KDTree_test.h:27
The interface is inherited from testing::Test. Registry on Initialize.
Definition KDTree_test.h:21
scl::linked_unordered_map< int, std::string > c1
scl::linked_unordered_map< float, std::string > c2
scl::linked_unordered_map< std::string, std::string > c0
void SetUp() override
Testing class initialize function.
void TearDown() override
Testing class TearDown function.
The interface is inherited from testing::Test. Registry on Initialize.
void SetUp() override
The interface is inherited from testing::Test. Registry on Initialize.
void TearDown() override
Testing class TearDown function.
Unit Test for RuntimeMemoryBlock.
void TearDown() override
The interface is inherited from testing::Test. Call before Destructor.
void SetUp() override
The interface is inherited from testing::Test. Registry on Initialize.
The interface is inherited from testing::Test. Registry on Initialize.
bool Empty() const
Determine if this list is empty.
Definition FreeList.h:50
void Push(void *obj)
Recycle a object memory to this free list.
Definition FreeList.cpp:13
void *& Begin()
Get current pointer (no const & reference version).
Definition FreeList.h:94
void *& End()
Get end pointer (no const & reference version).
Definition FreeList.h:100
Free list for memory pool.
Definition FreeList.h:16
The kd_tree with K dimensions container Class. K the number of dimensions. Every node in the tree is ...
Definition KDTree.h:27
The container combines hashmap and list together. Used in the case that we want iter a hashmap in ord...
void build()
Malloc a memory to begin_.
void add_element(const std::string &name, const std::string &type)
Add a element to object_, means a memory block will be occupied with given param type.
runtime_memory_block()=default
Constructor Function.
void * get_addr() const
Get the begin_.
The container is wrapper of a continue memory block. Used in Material::BuildMaterial(),...
Bidirectional cyclic linked list for span.
Definition SpanList.h:73
span * m_Next
next span.
Definition SpanList.h:41
span * m_Prev
previous span.
Definition SpanList.h:46
Used for manage multiple page memory.
Definition SpanList.h:15
int main(int argc, char **argv)
The Entry of SpicesTest.
Definition main.cpp:76
constexpr auto CleanupOutputString(const char(&expr)[N], const char(&remove)[K])
TEST_F(free_list_test, PushPop)
Testing scl::free_list::Push/Pop.
TEST_F(runtime_memory_block_test, Initialize)
Testing if initialize successfully.
TEST_F(directed_acyclic_graph_test, Addnode)
Testing if add node successfully.
TEST_F(span_list_test, Initialize)
Testing scl::span_list::Initialize.
TEST_F(linked_unordered_map_test, Initialize)
Testing if initialize successfully.
TEST_F(kd_tree_test, Insert)
Testing if Insert successfully.
Definition KDTree_test.h:63
TEST(tuple_test, IterTuple)
Testing std::tuple Helper Function.
Definition Tuple_test.h:17
void IterTuple(Tuple &tuple, Function &&f)
Iter a tuple.
Definition Tuple.h:34
std::thread::id ThreadID
std::chrono::microseconds ElapsedTime
FloatingPointMicroseconds Start