-
Notifications
You must be signed in to change notification settings - Fork 0
/
table.h
124 lines (96 loc) · 2.29 KB
/
table.h
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
// by wuwbobo2021 <https://github.com/wuwbobo2021>, <wuwbobo@outlook.com>
// If you have found bugs in this program, please pull an issue, or contact me.
#ifndef RAMDOM_PICKER_TABLE_H
#define RAMDOM_PICKER_TABLE_H
#include <stdexcept>
#include <vector>
#include <string>
namespace RandomPicker
{
class Item
{
std::string m_name;
double m_value;
public:
Item(const std::string& name, double value);
const std::string& name() const;
bool name(const std::string& name);
double value() const;
bool value(double value);
};
inline Item::Item(const std::string& name, double value)
{
if (! this->name(name))
throw std::invalid_argument("RandomPicker::Item::Item(): invalid name.");
if (! this->value(value))
throw std::invalid_argument("RandomPicker::Item::Item(): minus value.");
m_value = value;
}
inline const std::string& Item::name() const
{
return m_name;
}
inline double Item::value() const
{
return m_value;
}
inline bool Item::value(double value)
{
if (value < 0) return false;
m_value = value; return true;
}
class Table
{
std::vector<Item> m_vect; unsigned int m_count = 0;
int find_name(const std::string& name) const;
public:
bool repetitive_picking = false;
bool power_inversed = false;
unsigned int count() const;
bool is_empty() const;
Item& operator[](unsigned int index);
double item_value(const std::string& name) const;
void item(Item& item);
void clear();
void remove_impossible();
void scale(float scaler);
void inverse();
bool input(std::istream& ist);
bool output(std::ostream& ost) const;
bool open(const std::string& path);
bool save(const std::string& path) const;
};
inline unsigned int Table::count() const
{
return m_count;
}
inline bool Table::is_empty() const
{
return m_count == 0;
}
inline Item& Table::operator[](unsigned int index)
{
if (index > m_count - 1)
throw std::invalid_argument("Table::operator[](): invalid index.");
return m_vect[index];
}
inline double Table::item_value(const std::string& name) const
{
int i = this->find_name(name);
if (i < 0) return 0;
return m_vect[i].value();
}
inline void Table::item(Item& item)
{
int i = this->find_name(item.name());
if (i < 0) {
m_vect.push_back(item); m_count++;
} else
m_vect[i].value(item.value());
}
inline void Table::clear()
{
m_vect.clear(); m_count = 0;
}
}
#endif