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
|
//
// Copyright (C) 2014 Novartis Institutes for BioMedical Research
//
// @@ 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 <RDGeneral/export.h>
#pragma once
#include <map>
#include <vector>
#include <stdexcept>
#include <algorithm>
namespace RDKit {
namespace FMCS {
class DuplicatedSeedCache {
public:
typedef bool TValue;
class TKey {
std::vector<unsigned> AtomIdx; // sorted
std::vector<unsigned> BondIdx; // sorted
public:
size_t getNumAtoms() const { return AtomIdx.size(); }
size_t getNumBonds() const { return BondIdx.size(); }
void addAtom(unsigned i) {
std::vector<unsigned>::iterator it =
std::lower_bound(AtomIdx.begin(), AtomIdx.end(), i);
AtomIdx.insert(it, i);
}
void addBond(unsigned i) {
std::vector<unsigned>::iterator it =
std::lower_bound(BondIdx.begin(), BondIdx.end(), i);
BondIdx.insert(it, i);
}
bool operator==(const TKey& right) const { // opt.
return AtomIdx.size() == right.AtomIdx.size() &&
BondIdx.size() == right.BondIdx.size() &&
0 == memcmp(&AtomIdx[0], &right.AtomIdx[0],
AtomIdx.size() * sizeof(unsigned)) &&
0 == memcmp(&BondIdx[0], &right.BondIdx[0],
BondIdx.size() * sizeof(unsigned));
}
bool operator<(const TKey& right) const {
if (AtomIdx.size() < right.AtomIdx.size()) return true;
if (AtomIdx.size() > right.AtomIdx.size()) return false;
if (BondIdx.size() < right.BondIdx.size()) return true;
if (BondIdx.size() > right.BondIdx.size()) return false;
// everything is equal -> perform straight comparision
int diff;
diff = memcmp(&AtomIdx[0], &right.AtomIdx[0],
AtomIdx.size() * sizeof(unsigned));
if (diff < 0) return true;
if (diff > 0) return false;
return memcmp(&BondIdx[0], &right.BondIdx[0],
BondIdx.size() * sizeof(unsigned)) < 0;
}
};
private:
std::map<TKey, TValue> Index;
size_t MaxAtoms; // max key in the cache for fast failed find
public:
DuplicatedSeedCache() : MaxAtoms(0) {}
void clear() {
Index.clear();
MaxAtoms = 0;
}
bool find(const TKey& key, TValue& value) const {
value = false;
if (key.getNumAtoms() > MaxAtoms)
return false; // fast check if key greater then max key in the cache
std::map<TKey, TValue>::const_iterator entryit = Index.find(key);
if (Index.end() != entryit) value = entryit->second;
return Index.end() != entryit;
}
void add(const TKey& key, TValue found = true) {
if (key.getNumAtoms() > MaxAtoms) MaxAtoms = key.getNumAtoms();
Index.insert(std::pair<TKey, bool>(key, found));
}
size_t size() const {
return Index.size(); // for statistics only
}
};
}
}
|
