packageindex/PackageTable_test.cpp at master · jgoldsch/packageindex · 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
#include "PackageTable.h"
#include <memory>
#include <string>
#include <list>
#include <gtest/gtest.h>

using namespace std;

TEST(PackageTest, EmptyLookup) {
  auto PT = make_shared<PackageTable>();

  auto p = PT->lookup("foo");
  ASSERT_EQ(p, nullptr);
}

TEST(PackageTableTest, SourceInsert) {
  auto PT = make_shared<PackageTable>();
  list<string> empty;
  int err = PT->insert("foo", empty);
  ASSERT_EQ(err, 0);

  auto p = PT->lookup("foo");
  ASSERT_NE(p, nullptr);
  ASSERT_EQ(p->getName(), "foo");
}

TEST(PackageTableTest, SourceInsertDup) {
  auto PT = make_shared<PackageTable>();
  list<string> empty;
  int err = PT->insert("foo", empty);
  ASSERT_EQ(err, 0);

  err = PT->insert("foo", empty);
  ASSERT_EQ(err, 0);
}

TEST(PackageTableTest, InsertDependMissing) {
  auto PT = make_shared<PackageTable>();
  list<string> deps = {"bar"};
  int err = PT->insert("foo", deps);
  ASSERT_EQ(err, -1);
}

TEST(PackageTableTest, InsertDependsMet) {
  auto PT = make_shared<PackageTable>();
  list<string> deps;
  int err = PT->insert("bar", deps);
  ASSERT_EQ(err, 0);
  deps.push_back("bar");
  err = PT->insert("foo", deps);
  ASSERT_EQ(err, 0);
}

TEST(PackageTableTest, InsertUpdate) {
  auto PT = make_shared<PackageTable>();
  list<string> deps;
  ASSERT_EQ(PT->insert("bar", deps), 0);
  ASSERT_EQ(PT->insert("baz", deps), 0);
  deps.push_back("bar");
  ASSERT_EQ(PT->insert("foo", deps), 0);
  // Graph  foo->bar   baz

  deps.push_back("baz");
  ASSERT_EQ(PT->insert("foo", deps), 0);
  // Graph foo->bar|baz
}

TEST(PackageTableTest, InsertUpdateCircular) {
  auto PT = make_shared<PackageTable>();
  list<string> deps;
  ASSERT_EQ(PT->insert("baz", deps), 0);
  deps.push_back("baz");
  ASSERT_EQ(PT->insert("bar", deps), 0);
  deps.clear();
  deps.push_back("bar");
  ASSERT_EQ(PT->insert("foo", deps), 0);
  // Graph  foo->bar->baz

  deps.clear();
  deps.push_back("foo");
  // Try to add circular dependency like:
  // Graph foo->bar->baz->foo
  ASSERT_EQ(PT->insert("baz", deps), 1);
}


TEST(PackageTableTest, RemoveMissing) {
  auto PT = make_shared<PackageTable>();
  int err = PT->remove("foo");
  ASSERT_EQ(err, 0);
}

TEST(PackageTableTest, RemoveNotSink) {
  auto PT = make_shared<PackageTable>();
  list<string> deps;
  int err = PT->insert("bar", deps);
  ASSERT_EQ(err, 0);
  deps.push_back("bar");
  err = PT->insert("foo", deps);
  ASSERT_EQ(err, 0);
  err = PT->remove("bar");
  ASSERT_EQ(err, -1);
}

TEST(PackageTableTest, RemoveSinks) {
  auto PT = make_shared<PackageTable>();
  list<string> deps;
  int err = PT->insert("bar", deps);
  ASSERT_EQ(err, 0);
  deps.push_back("bar");
  err = PT->insert("foo", deps);
  ASSERT_EQ(err, 0);
  PT->print();
  err = PT->remove("foo");
  ASSERT_EQ(err, 0);
  err = PT->remove("bar");
  ASSERT_EQ(err, 0);
  PT->print();
}

int main(int argc, char **argv) {
  testing::InitGoogleTest(&argc, argv);
  return RUN_ALL_TESTS();
}