VinaLC: Parallel Molecular Docking Program

Biochemical and Biophysical Systems Group
VinaLC version: 1.1.2

manifold.h
Go to the documentation of this file.
1 /*
2 
3  Copyright (c) 2006-2010, The Scripps Research Institute
4 
5  Licensed under the Apache License, Version 2.0 (the "License");
6  you may not use this file except in compliance with the License.
7  You may obtain a copy of the License at
8 
9  http://www.apache.org/licenses/LICENSE-2.0
10 
11  Unless required by applicable law or agreed to in writing, software
12  distributed under the License is distributed on an "AS IS" BASIS,
13  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14  See the License for the specific language governing permissions and
15  limitations under the License.
16 
17  Author: Dr. Oleg Trott <ot14@columbia.edu>,
18  The Olson Lab,
19  The Scripps Research Institute
20 
21 */
22 
23 #ifndef VINA_MANIFOLD_H
24 #define VINA_MANIFOLD_H
25 
26 // This is not used by Vina proper any more, but "design" sort of needs it
27 
28 #include "ssd.h"
29 
30 struct manifold {
33  unsigned num_steps;
34  unsigned num_attempts;
36 
37  //fl manifold_mid_factor;
43 
45 
47 
48  fl relative_pair_cost; // the cost of calculating pairwise energy / interaction of atom with grid
49 
50  bool use_ssd;
51 
52  void print() const {
53  std::cout << "{ssd: "; ssd_par.print();
54  std::cout << "}\n" << "num_phases=" << num_phases
55  << ",\nnum_steps=" << num_steps
56  << ",\nnum_attempts=" << num_attempts
57  << ",\nnum_final_tunings=" << num_final_tunings
58  << ",\nmanifold_lambda=" << manifold_lambda
59  << ",\ncost_factor=" << cost_factor
60  << ",\nmax_prob=" << max_prob
61  << ",\nrstart_fraction=" << rstart_fraction
62  << ",\nmin_rmsd=" << min_rmsd
63  << ",\nhunt_cap=" << hunt_cap[0] << " " << hunt_cap[1] << " " << hunt_cap[2]
64  << ",\nexclusion=" << exclusion.position << " " << exclusion.orientation << " " << exclusion.torsion
65  << ",\nrelative_pair_cost=" << relative_pair_cost
66  << ",\nuse_ssd=" << use_ssd << std::endl;
67  }
70  /*manifold_mid_factor(0.1), */ manifold_lambda(0), cost_factor(0.5), max_prob(0.9), rstart_fraction(0.25), min_rmsd(2),
71  //hunt_cap(2, 0.1, 2),
72  hunt_cap(0.01, 0.001, 0.01),
73  exclusion(1, pi/24, pi/12),
74  relative_pair_cost(0.5),
75  use_ssd(false) {}
76 
77  output_type operator()(model& m, const precalculate& p, const igrid& ig, const precalculate& p_widened, const igrid& ig_widened, const vec& corner1, const vec& corner2, rng& generator) const;
78 
79  // out is sorted
80  void operator()(model& m, output_container& out, const precalculate& p, const igrid& ig, const precalculate& p_widened, const igrid& ig_widened, const vec& corner1, const vec& corner2, rng& generator) const;
81 
82 };
83 
84 #endif