Athenaeum class for fragment storage in CherryPicker algorithm.
More...
#include <indigox/classes/athenaeum.hpp>
Athenaeum class for fragment storage in CherryPicker algorithm.
◆ FragContain
◆ MoleculeFragments
◆ Settings
| Enumerator |
|---|
| FragmentCycles | |
| SelfConsistent | |
| BoolCount | |
| MoleculeSizeLimit | |
| MinimumFragmentSize | |
| MaximumFragmentSize | |
| OverlapLength | |
| CycleSize | |
| IntCount | |
◆ Athenaeum() [1/3]
◆ Athenaeum() [2/3]
◆ Athenaeum() [3/3]
◆ AddAllFragments()
| size_t AddAllFragments |
( |
const Molecule & |
mol | ) |
|
Determines all the fragments of a molecule and adds them.
- Returns
- the number of fragments added.
◆ AddFragment()
| bool AddFragment |
( |
const Fragment & |
frag | ) |
|
Adds the given fragment.
- Returns
- if the fragment was added or not.
◆ DefaultSettings()
◆ GetBool()
◆ GetForcefield()
◆ GetFragments() [1/2]
◆ GetFragments() [2/2]
◆ GetInt()
◆ HasFragments()
| bool HasFragments |
( |
const Molecule & |
mol | ) |
const |
◆ NumFragments() [1/2]
| size_t NumFragments |
( |
| ) |
const |
◆ NumFragments() [2/2]
| size_t NumFragments |
( |
const Molecule & |
mol | ) |
const |
◆ SetBool()
◆ SetInt()
| void SetInt |
( |
Settings |
param, |
|
|
int32_t |
value |
|
) |
| |
◆ UnsetBool()
◆ cereal::access
| friend class cereal::access |
|
friend |
The documentation for this class was generated from the following file: