StructuresOfData/test_Table.cpp at master · Ksunyy/StructuresOfData · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
#pragma once
#include <gtest.h>
#include "Polynomials.h"
#include "string"
#include "Table.h"


// --------------- POSITIVE TESTS ---------------- //

// SMOKE //

TEST(tables, can_create_default_table) {
	ASSERT_NO_THROW(Table t());
}

TEST(tables, can_insert_one_polynomial) {
	Polynomials p;
	std::string name = "name";
	Table t;
	ASSERT_NO_THROW(t.insert(name, p));
}

TEST(tables, can_erase_one_polynomial) {
	Polynomials p1, p2;
	std::string name = "name";
	std::string name2 = "name2";
	Table t;
	t.insert(name, p1);
	t.insert(name2, p2);

	ASSERT_NO_THROW(t.erase(name));
}

// FUNCTIONS //

TEST(tables, find_exist_polinomyal) {
	Polynomials p;
	std::string name = "name";
	Table t;
	t.insert(name, p);
	EXPECT_EQ(1, t.find(name));
}
TEST(tables, find_unexist_polinomyal) {
	Polynomials p;
	std::string name = "name";
	Table t;
	EXPECT_EQ(0, t.find(name));
}

TEST(tables, can_get_size_of_table) {
	Polynomials p1, p2;
	std::string name = "name";
	std::string name2 = "name2";
	Table t;
	t.insert(name, p1);
	t.insert(name2, p2);
	EXPECT_EQ(2, t.size());
}

TEST(tables, erase_exist_key) {
	Polynomials p1, p2;
	std::string name = "name";
	std::string name2 = "name2";
	Table t;
	t.insert(name, p1);
	t.insert(name2, p2);
	t.erase(name);
	EXPECT_EQ(0, t.find(name));

}

TEST(tables, erase_unexist_key) {
	Polynomials p1, p2;
	std::string name = "name";
	std::string name2 = "name2";
	Table t;
	t.insert(name2, p2);
	t.erase(name);
	EXPECT_EQ(0, t.find(name));

}

TEST(tables, insert_unexist_key) {
	Polynomials p1, p2;
	std::string name = "name";
	std::string name2 = "name2";
	Table t;
	t.insert(name, p1);
	t.insert(name2, p2);
	EXPECT_EQ(1, t.find(name));
}
TEST(tables, insert_equal_poly_dif_names) {
	Polynomials p1;
	std::string name = "name";
	std::string name2 = "name2";
	Table t;
	t.insert(name, p1);
	ASSERT_NO_THROW(t.insert(name2, p1));

}

// BORDER CONDITION //

TEST(tables, erase_elem_empty_table) {
	Table t;
	t.erase("name");
	EXPECT_EQ(0, t.size());
}

TEST(tables, find_in_empty_table) {
	Table t;
	EXPECT_EQ(0, t.find("name"));
}

// --------------- NEGATIVE TESTS ---------------- //

TEST(tables, throw_insert_existing_key) {
	Polynomials p1, p2;
	std::string name = "name";
	Table t;
	t.insert(name, p1);
	ASSERT_ANY_THROW(t.insert(name, p2));
}