File: Rules.h

package info (click to toggle)
rdkit 202503.1-5
  • links: PTS, VCS
  • area: main
  • in suites: forky, 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 (90 lines) | stat: -rw-r--r-- 2,063 bytes parent folder | download | duplicates (3)
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
//
//
//  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 <initializer_list>
#include <vector>

#include "Rule5.h"
#include "SequenceRule.h"

namespace RDKit {
namespace CIPLabeler {

class Rules : public SequenceRule {
 public:
  Rules() = delete;

  Rules(std::initializer_list<SequenceRule *> rules) {
    for (auto &rule : rules) {
      add(rule);
    }
  }

  ~Rules() override {
    for (auto &rule : d_rules) {
      delete rule;
    }
  }

  void add(SequenceRule *rule) {
    if (rule == nullptr) {
      throw std::runtime_error("No sequence rule provided");
    }
    d_rules.push_back(rule);
    rule->setSorter(new Sort(d_rules));
  }

  int getNumSubRules() const { return d_rules.size(); }

  const Sort *getSorter() const override {
    if (dp_sorter == nullptr) {
      const_cast<Rules *>(this)->setSorter(new Sort(this));
    }
    return dp_sorter.get();
  }

  int compare(const Edge *o1, const Edge *o2) const override {
    // Try using each rules. The rules will expand the search exhaustively
    // to all child substituents
    for (const auto &rule : d_rules) {
      // compare expands exhaustively across the whole graph
      int value = rule->recursiveCompare(o1, o2);
      if (value != 0) {
        return value;
      }
    }
    return 0;
  }

  int getComparision(const Edge *a, const Edge *b, bool deep) const override {
    (void)deep;

    // Try using each rules. The rules will expand the search exhaustively
    // to all child substituents
    for (const auto &rule : d_rules) {
      // compare expands exhaustively across the whole graph
      int value = rule->recursiveCompare(a, b);

      if (value != 0) {
        return value;
      }
    }

    return 0;
  }

 private:
  std::vector<const SequenceRule *> d_rules;
};

}  // namespace CIPLabeler
}  // namespace RDKit