|
Rosetta 3.5
|
The LeapIndex stores information about a particular Leap. It hold the oroiginal high precision rigid body transform and an Index to a Backbone Database (BackboneDB) that has the actual phi psi angles. THe storage of the precise RT takes a lot of space and may be deprecated at some point, since once it is hashed, it is rarely needed and can be recomputed if it is. Note that the length of the loop is not stored either, this is again done for saving memory, as huge lists of Leaps are typically created all with the same length. THe length is stored and handled by the owner of LeapIndex list. The LeapIndex does not store the actual backbone coordinates of the Leap. It merely contains an index (the BackboneIndex) which refers to a serial store of backbone triples (phi,psi, omega) which are stored somewhere else in a BackboneDB. THis is improtant to save memory storage since multiple Leaps cna share the same backbone triple and redundant storage would be hugely wasteful. More...
#include <LoopHashMap.hh>

Public Attributes | |
| core::Size | index |
| core::Size | offset |
| boost::uint64_t | key |
The LeapIndex stores information about a particular Leap. It hold the oroiginal high precision rigid body transform and an Index to a Backbone Database (BackboneDB) that has the actual phi psi angles. THe storage of the precise RT takes a lot of space and may be deprecated at some point, since once it is hashed, it is rarely needed and can be recomputed if it is. Note that the length of the loop is not stored either, this is again done for saving memory, as huge lists of Leaps are typically created all with the same length. THe length is stored and handled by the owner of LeapIndex list. The LeapIndex does not store the actual backbone coordinates of the Leap. It merely contains an index (the BackboneIndex) which refers to a serial store of backbone triples (phi,psi, omega) which are stored somewhere else in a BackboneDB. THis is improtant to save memory storage since multiple Leaps cna share the same backbone triple and redundant storage would be hugely wasteful.
Definition at line 71 of file LoopHashMap.hh.
| core::Size protocols::loophash::LeapIndex::index |
Definition at line 72 of file LoopHashMap.hh.
Referenced by protocols::loophash::LoopHashMap::add_legacyleap(), protocols::loophash::LoopHashLibrary::apply_random(), protocols::loophash::LoopHashSampler::build_structures(), protocols::sic_dock::dump_loophash_linkers(), protocols::loophash::LoopHashLibrary::extract_data_from_pose(), protocols::loophash::LoopHashLibrary::get_all(), protocols::forge::remodel::RemodelLoopMover::loophash_stage(), protocols::loophash::LoopHashLibrary::merge(), protocols::loophash::LoopHashMap::by_index::operator()(), protocols::loophash::LoopHashMap::read_db(), protocols::loophash::LoopHashLibrary::test_loop_sample(), and protocols::loophash::LoopHashLibrary::test_saving_library().
| boost::uint64_t protocols::loophash::LeapIndex::key |
Definition at line 74 of file LoopHashMap.hh.
Referenced by protocols::loophash::LoopHashLibrary::merge(), protocols::loophash::LoopHashMap::read_db(), protocols::loophash::LoopHashMap::return_key(), and protocols::loophash::LoopHashLibrary::test_loop_sample().
| core::Size protocols::loophash::LeapIndex::offset |
Definition at line 73 of file LoopHashMap.hh.
Referenced by protocols::loophash::LoopHashMap::add_legacyleap(), protocols::loophash::LoopHashLibrary::apply_random(), protocols::loophash::LoopHashSampler::build_structures(), protocols::sic_dock::dump_loophash_linkers(), protocols::loophash::LoopHashLibrary::extract_data_from_pose(), protocols::loophash::LoopHashLibrary::get_all(), protocols::forge::remodel::RemodelLoopMover::loophash_stage(), protocols::loophash::LoopHashLibrary::merge(), protocols::loophash::LoopHashMap::read_db(), and protocols::loophash::LoopHashLibrary::test_loop_sample().
1.8.4