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
|
//
//
// 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 <stdexcept>
#include <memory>
#include <vector>
#include "../CIPLabeler.h"
#include "../Descriptor.h"
#include "../Edge.h"
#include "../Node.h"
#include "../Sort.h"
#include "Pairlist.h"
namespace RDKit {
namespace CIPLabeler {
class CIPMol;
namespace {
template <typename T>
inline int three_way_comparison(const T &x, const T &y) {
return x < y ? -1 : (x == y ? 0 : 1);
}
} // namespace
class SequenceRule {
public:
SequenceRule();
virtual ~SequenceRule();
Descriptor getBondLabel(const Edge *edge) const;
int getComparision(const Edge *a, const Edge *b) const;
virtual int getComparision(const Edge *a, const Edge *b, bool deep) const;
virtual const Sort *getSorter() const;
int recursiveCompare(const Edge *a, const Edge *b) const;
void setSorter(const Sort *sorter);
Priority sort(const Node *node, std::vector<Edge *> &edges, bool deep) const;
Priority sort(const Node *node, std::vector<Edge *> &edges) const;
virtual int compare(const Edge *a, const Edge *b) const = 0;
protected:
std::unique_ptr<const Sort> dp_sorter = nullptr;
private:
bool areUpEdges(Node *aNode, Node *bNode, Edge *aEdge, Edge *bEdge) const;
};
} // namespace CIPLabeler
} // namespace RDKit
|
