-
Notifications
You must be signed in to change notification settings - Fork 5
/
LikeMoleculesContainer.h
72 lines (61 loc) · 1.86 KB
/
LikeMoleculesContainer.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
/*
* This file is part of esynth.
*
* esynth is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* esynth is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with esynth. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _LIKE_MOLECULES_CONTAINER_GUARD
#define _LIKE_MOLECULES_CONTAINER_GUARD 1
#include <cstring>
#include "MinimalMolecule.h"
class LikeMoleculesContainer
{
private:
std::vector<MinimalMolecule* > table;
public:
LikeMoleculesContainer() : table() { }
//
// Delete all entries
//
~LikeMoleculesContainer()
{
for (int i = 0; i < table.size(); i++)
{
// std::cerr << "Deleting MinimalMol " << i << std::endl;
delete table[i];
}
table.clear();
}
MinimalMolecule* contains(MinimalMolecule* const that) const
{
for (std::vector<MinimalMolecule*>::const_iterator it = table.begin();
it != table.end();
it++)
{
if ((*it)->equals(that)) return *it;
}
return 0;
}
// We assume a call to contains has already been made (as to limit the
// number of graph isomorphisms)
void add(MinimalMolecule* const that)
{
table.push_back(that);
}
// Are all the molecules in this container defined by the given key value?
bool definesKey(char* const thatKey)
{
return strcmp((*(table.begin()))->key, thatKey) == 0;
}
};
#endif