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
|
//
//
// 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.
//
#include "SequenceRule.h"
#include "../CIPMol.h"
namespace RDKit {
namespace CIPLabeler {
SequenceRule::SequenceRule() = default;
SequenceRule::~SequenceRule() = default;
Descriptor SequenceRule::getBondLabel(const Edge *edge) const {
Bond *bond = edge->getBond();
if (bond == nullptr) {
return Descriptor::NONE;
}
Descriptor label = edge->getAux();
if (label != Descriptor::NONE) {
return label;
}
return label;
}
int SequenceRule::getComparision(const Edge *a, const Edge *b) const {
return getComparision(a, b, true);
}
int SequenceRule::getComparision(const Edge *a, const Edge *b,
bool deep) const {
return deep ? recursiveCompare(a, b) : compare(a, b);
}
const Sort *SequenceRule::getSorter() const {
if (dp_sorter == nullptr) {
const_cast<SequenceRule *>(this)->setSorter(new Sort(this));
}
return dp_sorter.get();
}
int SequenceRule::recursiveCompare(const Edge *a, const Edge *b) const {
if (!CIPLabeler_detail::decrementRemainingCallCountAndCheck()) {
throw MaxIterationsExceeded();
}
int cmp = compare(a, b);
if (cmp != 0) {
return cmp;
}
auto aQueue = std::vector<const Edge *>({a});
auto bQueue = std::vector<const Edge *>({b});
for (auto pos = 0u; pos < aQueue.size() && pos < bQueue.size(); ++pos) {
a = aQueue[pos];
b = bQueue[pos];
auto as = a->getEnd()->getEdges();
auto bs = b->getEnd()->getEdges();
// shallow sort first of all
sort(a->getEnd(), as, false);
sort(b->getEnd(), bs, false);
int sizediff = three_way_comparison(static_cast<int>(as.size()),
static_cast<int>(bs.size()));
{
auto aIt = as.begin();
auto bIt = bs.begin();
for (; aIt != as.end() && bIt != bs.end(); ++aIt, ++bIt) {
Node *aNode = a->getEnd();
Node *bNode = b->getEnd();
Edge *aEdge = *aIt;
Edge *bEdge = *bIt;
if (areUpEdges(aNode, bNode, aEdge, bEdge)) {
continue;
}
cmp = compare(aEdge, bEdge);
if (cmp != 0) {
return cmp;
}
}
}
if (sizediff != 0) {
return sizediff;
}
sort(a->getEnd(), as);
sort(b->getEnd(), bs);
{
auto aIt = as.begin();
auto bIt = bs.begin();
for (; aIt != as.end() && bIt != bs.end(); ++aIt, ++bIt) {
Node *aNode = a->getEnd();
Node *bNode = b->getEnd();
Edge *aEdge = *aIt;
Edge *bEdge = *bIt;
if (areUpEdges(aNode, bNode, aEdge, bEdge)) {
continue;
}
cmp = compare(aEdge, bEdge);
if (cmp != 0) {
return cmp;
}
aQueue.push_back(aEdge);
bQueue.push_back(bEdge);
}
}
}
return 0;
}
void SequenceRule::setSorter(const Sort *sorter) { dp_sorter.reset(sorter); }
Priority SequenceRule::sort(const Node *node, std::vector<Edge *> &edges,
bool deep) const {
return getSorter()->prioritize(node, edges, deep);
}
Priority SequenceRule::sort(const Node *node,
std::vector<Edge *> &edges) const {
return sort(node, edges, true);
}
bool SequenceRule::areUpEdges(Node *aNode, Node *bNode, Edge *aEdge,
Edge *bEdge) const {
// step over 'up' edges
if (aEdge->isEnd(aNode)) {
// if b is 'down' something's not right!
if (!bEdge->isEnd(bNode)) {
throw std::runtime_error("Something unexpected!");
}
return true;
}
return false;
}
} // namespace CIPLabeler
} // namespace RDKit
|