![]() |
RDKit
Open-source cheminformatics and machine learning.
|
#include <RGroupScore.h>
Public Member Functions | |
| RGroupScorer () | |
| RGroupScorer (const std::vector< std::vector< size_t > > &permutations, double score) | |
| double | matchScore (const std::vector< size_t > &permutation, const std::vector< std::vector< RGroupMatch > > &matches, const std::set< int > &labels) |
| score the passed permutation of matches | |
| void | setBestPermutation (const std::vector< size_t > &permutation, double score) |
| set the passed permutation and score as the best one | |
| const std::vector< size_t > & | getBestPermutation () const |
| return the best permutation found so far | |
| void | startProcessing () |
| called when process() starts to initialize State | |
| void | pushTieToStore (const std::vector< size_t > &permutation) |
| store the passed tied permutation for subsequent processing | |
| void | breakTies (const std::vector< std::vector< RGroupMatch > > &matches, const std::set< int > &labels, const std::unique_ptr< CartesianProduct > &iterator, const std::chrono::steady_clock::time_point &t0, double timeout) |
| find the best permutation across the tied ones that were stored | |
| void | clearTieStore () |
| clear all stored tied permutations | |
| size_t | tieStoreSize () const |
| number of stored tied permutations | |
| double | getBestScore () const |
| return the best score found so far | |
Definition at line 71 of file RGroupScore.h.
|
inline |
Definition at line 73 of file RGroupScore.h.
| RDKit::RGroupScorer::RGroupScorer | ( | const std::vector< std::vector< size_t > > & | permutations, |
| double | score ) |
| void RDKit::RGroupScorer::breakTies | ( | const std::vector< std::vector< RGroupMatch > > & | matches, |
| const std::set< int > & | labels, | ||
| const std::unique_ptr< CartesianProduct > & | iterator, | ||
| const std::chrono::steady_clock::time_point & | t0, | ||
| double | timeout ) |
find the best permutation across the tied ones that were stored
| void RDKit::RGroupScorer::clearTieStore | ( | ) |
clear all stored tied permutations
|
inline |
return the best permutation found so far
Definition at line 83 of file RGroupScore.h.
|
inline |
return the best score found so far
Definition at line 101 of file RGroupScore.h.
| double RDKit::RGroupScorer::matchScore | ( | const std::vector< size_t > & | permutation, |
| const std::vector< std::vector< RGroupMatch > > & | matches, | ||
| const std::set< int > & | labels ) |
score the passed permutation of matches
| void RDKit::RGroupScorer::pushTieToStore | ( | const std::vector< size_t > & | permutation | ) |
store the passed tied permutation for subsequent processing
| void RDKit::RGroupScorer::setBestPermutation | ( | const std::vector< size_t > & | permutation, |
| double | score ) |
set the passed permutation and score as the best one
| void RDKit::RGroupScorer::startProcessing | ( | ) |
called when process() starts to initialize State
|
inline |
number of stored tied permutations
Definition at line 99 of file RGroupScore.h.