19 : theSlabs(slabs), thePhiMin(phiMin), theBinFinder(
nullptr) {
25 vector<double> zBorders;
26 for (vector<MagBSlab *>::const_iterator islab =
theSlabs.begin(); islab !=
theSlabs.end(); ++islab) {
29 cout << (*islab)->minZ() << endl;
31 zBorders.push_back((*islab)->minZ());
40 for (vector<MagBSlab *>::const_iterator islab =
theSlabs.begin(); islab !=
theSlabs.end(); ++islab) {
56 cout <<
" Trying slab at Z " <<
theSlabs[
bin]->minZ() <<
" " << Z << endl;
60 cout <<
"***In guessed bslab" << (result ==
nullptr ?
" failed " :
" OK ") << endl;
MagBinFinders::GeneralBinFinderInZ< double > * theBinFinder
const MagVolume * findVolume(const GlobalPoint &gp, double tolerance) const
Find the volume containing a point, with a given tolerance.
int binIndex(T z) const override
returns an index in the valid range for the bin closest to Z
virtual ~MagBRod()
Destructor.
MagBRod(std::vector< MagBSlab * > &slabs, Geom::Phi< float > phiMin)
Constructor.
static constexpr bool debugOut
std::vector< MagBSlab * > theSlabs