File: Configuration.cpp

package info (click to toggle)
rdkit 202503.1-5
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 220,160 kB
  • sloc: cpp: 399,240; python: 77,453; ansic: 25,517; java: 8,173; javascript: 4,005; sql: 2,389; yacc: 1,565; lex: 1,263; cs: 1,081; makefile: 580; xml: 229; fortran: 183; sh: 105
file content (102 lines) | stat: -rw-r--r-- 2,785 bytes parent folder | download | duplicates (4)
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
//
//
//  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 "Configuration.h"

#include "../Priority.h"
#include "../rules/Rules.h"

namespace RDKit {
namespace CIPLabeler {

Edge *Configuration::findInternalEdge(const std::vector<Edge *> &edges,
                                      Atom *f1, Atom *f2) {
  for (const auto &edge : edges) {
    if (edge->getBeg()->isDuplicate() || edge->getEnd()->isDuplicate()) {
      continue;
    }
    if (isInternalEdge(edge, f1, f2)) {
      return edge;
    }
  }
  return nullptr;
}

bool Configuration::isInternalEdge(const Edge *edge, Atom *f1, Atom *f2) {
  const auto &beg = edge->getBeg();
  const auto &end = edge->getEnd();
  if (f1 == beg->getAtom() && f2 == end->getAtom()) {
    return true;
  } else if (f1 == end->getAtom() && f2 == beg->getAtom()) {
    return true;
  }
  return false;
}

void Configuration::removeInternalEdges(std::vector<Edge *> &edges, Atom *f1,
                                        Atom *f2) {
  std::vector<Edge *> new_edges;
  for (auto &&e : edges) {
    if (!isInternalEdge(e, f1, f2)) {
      new_edges.push_back(std::move(e));
    }
  }
  std::swap(edges, new_edges);
}

bool Configuration::isDuplicateOrHydrogenEdge(const Edge *edge) {
  return edge->getBeg()->isDuplicateOrH() || edge->getEnd()->isDuplicateOrH();
}

void Configuration::removeDuplicatesAndHs(std::vector<Edge *> &edges) {
  std::vector<Edge *> new_edges;
  for (auto &&e : edges) {
    if (!isDuplicateOrHydrogenEdge(e)) {
      new_edges.push_back(std::move(e));
    }
  }
  edges = std::move(new_edges);
}

void Configuration::setCarriers(std::vector<Atom *> &&carriers) {
  d_carriers = std::move(carriers);
}

Configuration::Configuration(const CIPMol &mol, Atom *focus)
    : d_foci{focus}, d_digraph{mol, focus} {};

Configuration::Configuration(const CIPMol &mol, std::vector<Atom *> &&foci,
                             bool atropisomerMode)
    : d_foci{std::move(foci)}, d_digraph{mol, d_foci[0], atropisomerMode} {}

Configuration::~Configuration() = default;

Atom *Configuration::getFocus() const { return d_foci[0]; }

const std::vector<Atom *> &Configuration::getFoci() const { return d_foci; }

const std::vector<Atom *> &Configuration::getCarriers() const {
  return d_carriers;
}

Digraph &Configuration::getDigraph() { return d_digraph; }

Descriptor Configuration::label(Node *node, Digraph &digraph,
                                const Rules &comp) {
  (void)node;
  (void)digraph;
  (void)comp;

  return Descriptor::UNKNOWN;
}

}  // namespace CIPLabeler
}  // namespace RDKit