project1/catalog_test.cpp at master · CSUF-Computer-Science/project1 · 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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140

#include "catalog.hpp"

#include <cassert>
#include <iostream>

using namespace std;

int main() {
  cout << "==== catalog.hpp ====" << endl;

  cout << "Product constructor" << endl;
  {
    // negative price should throw exception
    bool threw = false;
    try {
      Product p("123", "oats", -1.0);
    } catch (invalid_argument e) {
      threw = true;
    }
    assert(threw);

    Product works_fine("123", "oats", 1.0);
  }

  cout << "Product accessors" << endl;
  {
    Product p("123", "oats", 1.0);
    assert(p.getCode() == "123");
    assert(p.getName() == "oats");
    assert(p.getPrice() == 1.0);
  }

  cout << "Catalog constructor" << endl;
  {
    Catalog a(5), b(10);
    assert(a.getMaxProducts() == 5);
    assert(b.getMaxProducts() == 10);
    assert(a.getNumProducts() == 0);
    assert(b.getNumProducts() == 0);

    bool threw = false;
    try {
      Catalog c(0);
    } catch (invalid_argument e) {
      threw = true;
    }
    assert(threw);

    threw = false;
    try {
      Catalog c(-1);
    } catch (invalid_argument e) {
      threw = true;
    }
    assert(threw);

    assert(!a.isFull());
    assert(!b.isFull());
  }

  cout << "Catalog gets full" << endl;
  {
    Catalog a(2);
    assert(a.getMaxProducts() == 2);
    assert(a.getNumProducts() == 0);
    assert(!a.isFull());

    a.addProduct("100", "oats", 1.0);
    assert(a.getMaxProducts() == 2);
    assert(a.getNumProducts() == 1);
    assert(!a.isFull());

    a.addProduct("101", "groats", 2.0);
    assert(a.getMaxProducts() == 2);
    assert(a.getNumProducts() == 2);
    assert(a.isFull());

    bool threw = false;
    try {
      a.addProduct("102", "yolks", 3.0);
    } catch (overflow_error e) {
      threw = true;
    }
    assert(threw);
  }

  cout << "Catalog add and search for products" << endl;
  {
    Catalog a(4);
    a.addProduct("100", "oats", 1.0);
    a.addProduct("101", "groats", 2.0);
    assert(a.getNumProducts() == 2);

    // try to add duplicate code
    bool threw = false;
    try {
      a.addProduct("101", "premium groats", 2.0);
    } catch (invalid_argument e) {
      threw = true;
    }
    assert(threw);
    assert(a.getNumProducts() == 2);

    a.addProduct("102", "soap", 3.0);
    a.addProduct("103", "rope", 4.0);

    // catalog already full
    assert(a.isFull());
    threw = false;
    try {
      a.addProduct("104", "tote", 5.0);
    } catch (overflow_error e) {
      threw = true;
    }
    assert(threw);

    // successfull searches
    assert(a.findCode("100").getName() == "oats");
    assert(a.findCode("101").getName() == "groats");
    assert(a.findCode("102").getName() == "soap");
    assert(a.findCode("103").getName() == "rope");

    // failed searches
    threw = false;
    try {
      a.findCode("999");
    } catch (exception e) {
      threw = true;
    }
    assert(threw);
  }

  cout << "Catalog uses heap memory" << endl;
  {
    Catalog a(20*1000*1000); // 20 million is too big for the stack
  }

  return 0;
}