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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
//
//
// Copyright (C) 2020 Schrödinger, LLC
//
// @@ All Rights Reserved @@
// This file is part of the RDKit.
// The contents are covered by the terms of the BSD license
// which is included in the file license.txt, found at the root
// of the RDKit source tree.
//
#pragma once
#include <memory>
#include <vector>
#include "../Descriptor.h"
#include "../Digraph.h"
#include "../CIPMol.h"
namespace RDKit {
class Atom;
class Bond;
namespace CIPLabeler {
class Rules;
class Configuration {
public:
template <typename T>
static int parity4(const std::vector<T> &trg, const std::vector<T> &ref) {
if (ref.size() != 4 || trg.size() != ref.size()) {
throw std::runtime_error("Parity vectors must have size 4.");
}
if (ref[0] == trg[0]) {
if (ref[1] == trg[1]) {
// a,b,c,d -> a,b,c,d
if (ref[2] == trg[2] && ref[3] == trg[3]) {
return 2;
}
// a,b,c,d -> a,b,d,c
if (ref[2] == trg[3] && ref[3] == trg[2]) {
return 1;
}
} else if (ref[1] == trg[2]) {
// a,b,c,d -> a,c,b,d
if (ref[2] == trg[1] && ref[3] == trg[3]) {
return 1;
}
// a,b,c,d -> a,c,d,b
if (ref[2] == trg[3] && ref[3] == trg[1]) {
return 2;
}
} else if (ref[1] == trg[3]) {
// a,b,c,d -> a,d,c,b
if (ref[2] == trg[2] && ref[3] == trg[1]) {
return 1;
}
// a,b,c,d -> a,d,b,c
if (ref[2] == trg[1] && ref[3] == trg[2]) {
return 2;
}
}
} else if (ref[0] == trg[1]) {
if (ref[1] == trg[0]) {
// a,b,c,d -> b,a,c,d
if (ref[2] == trg[2] && ref[3] == trg[3]) {
return 1;
}
// a,b,c,d -> b,a,d,c
if (ref[2] == trg[3] && ref[3] == trg[2]) {
return 2;
}
} else if (ref[1] == trg[2]) {
// a,b,c,d -> b,c,a,d
if (ref[2] == trg[0] && ref[3] == trg[3]) {
return 2;
}
// a,b,c,d -> b,c,d,a
if (ref[2] == trg[3] && ref[3] == trg[0]) {
return 1;
}
} else if (ref[1] == trg[3]) {
// a,b,c,d -> b,d,c,a
if (ref[2] == trg[2] && ref[3] == trg[0]) {
return 2;
}
// a,b,c,d -> b,d,a,c
if (ref[2] == trg[0] && ref[3] == trg[2]) {
return 1;
}
}
} else if (ref[0] == trg[2]) {
if (ref[1] == trg[1]) {
// a,b,c,d -> c,b,a,d
if (ref[2] == trg[0] && ref[3] == trg[3]) {
return 1;
}
// a,b,c,d -> c,b,d,a
if (ref[2] == trg[3] && ref[3] == trg[0]) {
return 2;
}
} else if (ref[1] == trg[0]) {
// a,b,c,d -> c,a,b,d
if (ref[2] == trg[1] && ref[3] == trg[3]) {
return 2;
}
// a,b,c,d -> c,a,d,b
if (ref[2] == trg[3] && ref[3] == trg[1]) {
return 1;
}
} else if (ref[1] == trg[3]) {
// a,b,c,d -> c,d,a,b
if (ref[2] == trg[0] && ref[3] == trg[1]) {
return 2;
}
// a,b,c,d -> c,d,b,a
if (ref[2] == trg[1] && ref[3] == trg[0]) {
return 1;
}
}
} else if (ref[0] == trg[3]) {
if (ref[1] == trg[1]) {
// a,b,c,d -> d,b,c,a
if (ref[2] == trg[2] && ref[3] == trg[0]) {
return 1;
}
// a,b,c,d -> d,b,a,c
if (ref[2] == trg[0] && ref[3] == trg[2]) {
return 2;
}
} else if (ref[1] == trg[2]) {
// a,b,c,d -> d,c,b,a
if (ref[2] == trg[1] && ref[3] == trg[0]) {
return 2;
}
// a,b,c,d -> d,c,a,b
if (ref[2] == trg[0] && ref[3] == trg[1]) {
return 1;
}
} else if (ref[1] == trg[0]) {
// a,b,c,d -> d,a,c,b
if (ref[2] == trg[2] && ref[3] == trg[1]) {
return 2;
}
// a,b,c,d -> d,a,b,c
if (ref[2] == trg[1] && ref[3] == trg[2]) {
return 1;
}
}
}
// We should never hit this, but the compiler still complains
// about a missing return statement.
return 0;
}
Configuration() = delete;
Configuration(const CIPMol &mol, Atom *focus);
Configuration(const CIPMol &mol, std::vector<Atom *> &&foci);
virtual ~Configuration();
Atom *getFocus() const;
const std::vector<Atom *> &getFoci() const;
const std::vector<Atom *> &getCarriers() const;
Digraph &getDigraph();
virtual Descriptor label(Node *node, Digraph &digraph, const Rules &comp);
virtual Descriptor label(const Rules &comp) = 0;
virtual void setPrimaryLabel(Descriptor desc) = 0;
protected:
Edge *findInternalEdge(const std::vector<Edge *> &edges, Atom *f1, Atom *f2);
bool isInternalEdge(const Edge *edge, Atom *f1, Atom *f2);
void removeInternalEdges(std::vector<Edge *> &edges, Atom *f1, Atom *f2);
void setCarriers(std::vector<Atom *> &&carriers);
private:
/**
* Foci are the atoms on which the configuration is based,
* and which will carry the label. E.g., the chiral atom in
* a tetrahedral chirality, or the bond ends in a double bond.
*/
std::vector<Atom *> d_foci;
/**
* Carriers are the atoms neighboring the foci that define the
* configuration. E.g., for a chiral atom, its four neighbors
* define a parity; for a double bond, one neighbor on each
* side of the bond defines it as Cis or Trans.
*/
std::vector<Atom *> d_carriers;
Digraph d_digraph;
}; // namespace CIPLabeler
} // namespace CIPLabeler
} // namespace RDKit
|
