#include <SequenceRule.h>
Definition at line 34 of file SequenceRule.h.
◆ SequenceRule()
RDKit::CIPLabeler::SequenceRule::SequenceRule |
( |
| ) |
|
◆ ~SequenceRule()
virtual RDKit::CIPLabeler::SequenceRule::~SequenceRule |
( |
| ) |
|
|
virtual |
◆ compare()
virtual int RDKit::CIPLabeler::SequenceRule::compare |
( |
const Edge * |
a, |
|
|
const Edge * |
b |
|
) |
| const |
|
pure virtual |
Implemented in RDKit::CIPLabeler::Rules, RDKit::CIPLabeler::Rule6, RDKit::CIPLabeler::Rule5New, RDKit::CIPLabeler::Rule5, RDKit::CIPLabeler::Rule4c, RDKit::CIPLabeler::Rule4b, RDKit::CIPLabeler::Rule4a, RDKit::CIPLabeler::Rule3, RDKit::CIPLabeler::Rule2, RDKit::CIPLabeler::Rule1b, and RDKit::CIPLabeler::Rule1a.
◆ getBondLabel()
Descriptor RDKit::CIPLabeler::SequenceRule::getBondLabel |
( |
const Edge * |
edge | ) |
const |
◆ getComparision() [1/2]
int RDKit::CIPLabeler::SequenceRule::getComparision |
( |
const Edge * |
a, |
|
|
const Edge * |
b |
|
) |
| const |
◆ getComparision() [2/2]
virtual int RDKit::CIPLabeler::SequenceRule::getComparision |
( |
const Edge * |
a, |
|
|
const Edge * |
b, |
|
|
bool |
deep |
|
) |
| const |
|
virtual |
◆ getSorter()
virtual const Sort* RDKit::CIPLabeler::SequenceRule::getSorter |
( |
| ) |
const |
|
virtual |
◆ recursiveCompare()
int RDKit::CIPLabeler::SequenceRule::recursiveCompare |
( |
const Edge * |
a, |
|
|
const Edge * |
b |
|
) |
| const |
◆ setSorter()
void RDKit::CIPLabeler::SequenceRule::setSorter |
( |
const Sort * |
sorter | ) |
|
◆ sort() [1/2]
Priority RDKit::CIPLabeler::SequenceRule::sort |
( |
const Node * |
node, |
|
|
std::vector< Edge * > & |
edges |
|
) |
| const |
◆ sort() [2/2]
Priority RDKit::CIPLabeler::SequenceRule::sort |
( |
const Node * |
node, |
|
|
std::vector< Edge * > & |
edges, |
|
|
bool |
deep |
|
) |
| const |
◆ dp_sorter
std::unique_ptr<const Sort> RDKit::CIPLabeler::SequenceRule::dp_sorter = nullptr |
|
protected |
The documentation for this class was generated from the following file: