EIC code displayed by LXR master/​acts/​Core/​src/​Geometry/​TrackingVolume.cpp	Source navigation Diff markup Identifier search General search
	Version: master test Revert   Change

File indexing completed on 2025-06-30 07:52:11

 // This file is part of the ACTS project.
 //
 // Copyright (C) 2016 CERN for the benefit of the ACTS project
 //
 // This Source Code Form is subject to the terms of the Mozilla Public
 // License, v. 2.0. If a copy of the MPL was not distributed with this
 // file, You can obtain one at https://mozilla.org/MPL/2.0/.
 
 #include "Acts/Geometry/TrackingVolume.hpp"
 
 #include "Acts/Definitions/Direction.hpp"
 #include "Acts/Geometry/GeometryIdentifier.hpp"
 #include "Acts/Geometry/GlueVolumesDescriptor.hpp"
 #include "Acts/Geometry/Portal.hpp"
 #include "Acts/Geometry/TrackingGeometryVisitor.hpp"
 #include "Acts/Geometry/VolumeBounds.hpp"
 #include "Acts/Material/IMaterialDecorator.hpp"
 #include "Acts/Material/IVolumeMaterial.hpp"
 #include "Acts/Material/ProtoVolumeMaterial.hpp"
 #include "Acts/Navigation/INavigationPolicy.hpp"
 #include "Acts/Navigation/NavigationStream.hpp"
 #include "Acts/Propagator/Navigator.hpp"
 #include "Acts/Surfaces/RegularSurface.hpp"
 #include "Acts/Surfaces/Surface.hpp"
 #include "Acts/Utilities/Intersection.hpp"
 
 #include <algorithm>
 #include <memory>
 #include <ostream>
 #include <string>
 #include <utility>
 
 #include <boost/container/small_vector.hpp>
 
 namespace Acts {
 
 // constructor for arguments
 TrackingVolume::TrackingVolume(
     const Transform3& transform, std::shared_ptr<VolumeBounds> volumeBounds,
     std::shared_ptr<const IVolumeMaterial> volumeMaterial,
     std::unique_ptr<const LayerArray> staticLayerArray,
     std::shared_ptr<const TrackingVolumeArray> containedVolumeArray,
     MutableTrackingVolumeVector denseVolumeVector,
     const std::string& volumeName)
     : Volume(transform, std::move(volumeBounds)),
       m_confinedLayers(std::move(staticLayerArray)),
       m_confinedVolumes(std::move(containedVolumeArray)),
       m_confinedDenseVolumes({}),
       m_volumeMaterial(std::move(volumeMaterial)),
       m_name(volumeName) {
   createBoundarySurfaces();
   interlinkLayers();
   connectDenseBoundarySurfaces(denseVolumeVector);
 
   DelegateChainBuilder{m_navigationDelegate}
       .add<&INavigationPolicy::noopInitializeCandidates>()
       .store(m_navigationDelegate);
 }
 
 TrackingVolume::TrackingVolume(Volume& volume, const std::string& volumeName)
     : TrackingVolume(volume.transform(), volume.volumeBoundsPtr(), nullptr,
                      nullptr, nullptr, MutableTrackingVolumeVector{},
                      volumeName) {}
 
 TrackingVolume::TrackingVolume(const Transform3& transform,
                                std::shared_ptr<VolumeBounds> volbounds,
                                const std::string& volumeName)
     : TrackingVolume(transform, std::move(volbounds), nullptr, nullptr, nullptr,
                      {}, volumeName) {}
 
 TrackingVolume::~TrackingVolume() = default;
 TrackingVolume::TrackingVolume(TrackingVolume&&) noexcept = default;
 TrackingVolume& TrackingVolume::operator=(TrackingVolume&&) noexcept = default;
 
 const TrackingVolume* TrackingVolume::lowestTrackingVolume(
     const GeometryContext& gctx, const Vector3& position,
     const double tol) const {
   if (!inside(position, tol)) {
     return nullptr;
   }
 
   // confined static volumes - highest hierarchy
   if (m_confinedVolumes) {
     const TrackingVolume* volume = m_confinedVolumes->object(position).get();
     if (volume != nullptr) {
       return volume->lowestTrackingVolume(gctx, position, tol);
     }
   }
 
   // search for dense volumes
   if (!m_confinedDenseVolumes.empty()) {
     for (auto& denseVolume : m_confinedDenseVolumes) {
       if (denseVolume->inside(position, tol)) {
         return denseVolume.get();
       }
     }
   }
 
   // @TODO: Abstract this into an accelerateable structure
   for (const auto& volume : volumes()) {
     if (volume.inside(position, tol)) {
       return volume.lowestTrackingVolume(gctx, position, tol);
     }
   }
 
   // there is no lower sub structure
   return this;
 }
 
 const TrackingVolumeBoundaries& TrackingVolume::boundarySurfaces() const {
   return m_boundarySurfaces;
 }
 
 void TrackingVolume::connectDenseBoundarySurfaces(
     MutableTrackingVolumeVector& confinedDenseVolumes) {
   if (!confinedDenseVolumes.empty()) {
     Direction dir = Direction::Positive();
     // Walk over each dense volume
     for (auto& confDenseVol : confinedDenseVolumes) {
       // Walk over each boundary surface of the volume
       auto& boundSur = confDenseVol->boundarySurfaces();
       for (std::size_t i = 0; i < boundSur.size(); i++) {
         // Skip empty entries since we do not know the shape of the dense volume
         // and therewith the used indices
         if (boundSur.at(i) == nullptr) {
           continue;
         }
 
         // Use mother volume as the opposite direction of the already used
         // direction
         auto mutableBs =
             std::const_pointer_cast<BoundarySurfaceT<TrackingVolume>>(
                 boundSur.at(i));
         if (mutableBs->m_oppositeVolume != nullptr &&
             mutableBs->m_alongVolume == nullptr) {
           dir = Direction::Positive();
           mutableBs->attachVolume(this, dir);
         } else {
           if (mutableBs->m_oppositeVolume == nullptr &&
               mutableBs->m_alongVolume != nullptr) {
             dir = Direction::Negative();
             mutableBs->attachVolume(this, dir);
           }
         }
 
         // Update the boundary
         confDenseVol->updateBoundarySurface(static_cast<BoundarySurfaceFace>(i),
                                             mutableBs);
       }
       // Store the volume
       m_confinedDenseVolumes.push_back(std::move(confDenseVol));
     }
   }
 }
 
 void TrackingVolume::createBoundarySurfaces() {
   using Boundary = BoundarySurfaceT<TrackingVolume>;
 
   // Transform Surfaces To BoundarySurfaces
   auto orientedSurfaces = Volume::volumeBounds().orientedSurfaces(m_transform);
 
   m_boundarySurfaces.reserve(orientedSurfaces.size());
   for (auto& osf : orientedSurfaces) {
     TrackingVolume* opposite = nullptr;
     TrackingVolume* along = nullptr;
     if (osf.direction == Direction::OppositeNormal()) {
       opposite = this;
     } else {
       along = this;
     }
     m_boundarySurfaces.push_back(std::make_shared<const Boundary>(
         std::move(osf.surface), opposite, along));
   }
 }
 
 void TrackingVolume::clearBoundarySurfaces() {
   m_boundarySurfaces.clear();
 }
 
 void TrackingVolume::glueTrackingVolume(const GeometryContext& gctx,
                                         BoundarySurfaceFace bsfMine,
                                         TrackingVolume* neighbor,
                                         BoundarySurfaceFace bsfNeighbor) {
   // Find the connection of the two tracking volumes: AxisDirection::AxisR
   // returns the center except for cylindrical volumes
   Vector3 bPosition(referencePosition(gctx, AxisDirection::AxisR));
   Vector3 distance = Vector3(
       neighbor->referencePosition(gctx, AxisDirection::AxisR) - bPosition);
   // glue to the face
   std::shared_ptr<const BoundarySurfaceT<TrackingVolume>> bSurfaceMine =
       boundarySurfaces().at(bsfMine);
   // @todo - complex glueing could be possible with actual intersection for the
   // normal vector
   // Coerce the arbitrary position bPosition to be on the surface repr so we can
   // get a normal
   Vector3 nvector =
       bSurfaceMine->surfaceRepresentation().normal(gctx, bPosition);
   // estimate the orientation
   Direction dir = Direction::fromScalar(nvector.dot(distance));
   // The easy case :
   // - no glue volume descriptors on either side
   if ((m_glueVolumeDescriptor == nullptr) ||
       m_glueVolumeDescriptor->glueVolumes(bsfMine) == nullptr) {
     // the boundary orientation
     auto mutableBSurfaceMine =
         std::const_pointer_cast<BoundarySurfaceT<TrackingVolume>>(bSurfaceMine);
     mutableBSurfaceMine->attachVolume(neighbor, dir);
     // Make sure you keep the boundary material if there
     const Surface& neighborSurface =
         neighbor->m_boundarySurfaces.at(bsfNeighbor)->surfaceRepresentation();
     auto neighborMaterial = neighborSurface.surfaceMaterialSharedPtr();
     const Surface& mySurface = bSurfaceMine->surfaceRepresentation();
     auto myMaterial = mySurface.surfaceMaterialSharedPtr();
     // Keep the neighbor material
     if (myMaterial == nullptr && neighborMaterial != nullptr) {
       Surface* myMutbableSurface = const_cast<Surface*>(&mySurface);
       myMutbableSurface->assignSurfaceMaterial(neighborMaterial);
     }
     // Now set it to the neighbor volume
     (neighbor->m_boundarySurfaces).at(bsfNeighbor) = bSurfaceMine;
   }
 }
 
 void TrackingVolume::glueTrackingVolumes(
     const GeometryContext& gctx, BoundarySurfaceFace bsfMine,
     const std::shared_ptr<TrackingVolumeArray>& neighbors,
     BoundarySurfaceFace bsfNeighbor) {
   // find the connection of the two tracking volumes : AxisDirection::AxisR
   // returns the center except for cylindrical volumes
   std::shared_ptr<const TrackingVolume> nRefVolume =
       neighbors->arrayObjects().at(0);
   // get the distance
   Vector3 bPosition(referencePosition(gctx, AxisDirection::AxisR));
   Vector3 distance(nRefVolume->referencePosition(gctx, AxisDirection::AxisR) -
                    bPosition);
   // take the normal at the binning positio
   std::shared_ptr<const BoundarySurfaceT<TrackingVolume>> bSurfaceMine =
       boundarySurfaces().at(bsfMine);
   // @todo - complex glueing could be possible with actual intersection for the
   // normal vector
   // Coerce the arbitrary position bPosition to be on the surface repr so we can
   // get a normal
   Vector3 nvector =
       bSurfaceMine->surfaceRepresentation().normal(gctx, bPosition);
   // estimate the orientation
   Direction dir = Direction::fromScalar(nvector.dot(distance));
   // the easy case :
   // - no glue volume descriptors on either side
   if ((m_glueVolumeDescriptor == nullptr) ||
       !m_glueVolumeDescriptor->glueVolumes(bsfMine)) {
     // the boundary orientation
     auto mutableBSurfaceMine =
         std::const_pointer_cast<BoundarySurfaceT<TrackingVolume>>(bSurfaceMine);
     mutableBSurfaceMine->attachVolumeArray(neighbors, dir);
     // now set it to the neighbor volumes - the optised way
     for (auto& nVolume : neighbors->arrayObjects()) {
       auto mutableNVolume = std::const_pointer_cast<TrackingVolume>(nVolume);
       (mutableNVolume->m_boundarySurfaces).at(bsfNeighbor) = bSurfaceMine;
     }
   }
 }
 
 void TrackingVolume::assignBoundaryMaterial(
     std::shared_ptr<const ISurfaceMaterial> surfaceMaterial,
     BoundarySurfaceFace bsFace) {
   auto bSurface = m_boundarySurfaces.at(bsFace);
   RegularSurface* surface =
       const_cast<RegularSurface*>(&bSurface->surfaceRepresentation());
   surface->assignSurfaceMaterial(std::move(surfaceMaterial));
 }
 
 void TrackingVolume::updateBoundarySurface(
     BoundarySurfaceFace bsf,
     std::shared_ptr<const BoundarySurfaceT<TrackingVolume>> bs,
     bool checkmaterial) {
   if (checkmaterial) {
     auto cMaterialPtr = m_boundarySurfaces.at(bsf)
                             ->surfaceRepresentation()
                             .surfaceMaterialSharedPtr();
     auto bsMaterial = bs->surfaceRepresentation().surfaceMaterial();
     if (cMaterialPtr != nullptr && bsMaterial == nullptr) {
       RegularSurface* surface =
           const_cast<RegularSurface*>(&bs->surfaceRepresentation());
       surface->assignSurfaceMaterial(cMaterialPtr);
     }
   }
   m_boundarySurfaces.at(bsf) = std::move(bs);
 }
 
 void TrackingVolume::registerGlueVolumeDescriptor(
     std::unique_ptr<GlueVolumesDescriptor> gvd) {
   m_glueVolumeDescriptor = std::move(gvd);
 }
 
 GlueVolumesDescriptor& TrackingVolume::glueVolumesDescriptor() {
   if (m_glueVolumeDescriptor == nullptr) {
     m_glueVolumeDescriptor = std::make_unique<GlueVolumesDescriptor>();
   }
   return *m_glueVolumeDescriptor;
 }
 
 void TrackingVolume::synchronizeLayers(double envelope) const {
   // case a : Layers exist
   // msgstream << MSG::VERBOSE << "  -> synchronizing Layer dimensions of
   // TrackingVolume '" << volumeName() << "'." << endreq;
 
   if (m_confinedLayers) {
     // msgstream << MSG::VERBOSE << "  ---> working on " <<
     // m_confinedLayers->arrayObjects().size() << " (material+navigation)
     // layers." << endreq;
     for (auto& clayIter : m_confinedLayers->arrayObjects()) {
       if (clayIter) {
         // @todo implement synchronize layer
         //  if (clayIter->surfaceRepresentation().type() == Surface::Cylinder &&
         //  !(center().isApprox(clayIter->surfaceRepresentation().center())) )
         //      clayIter->resizeAndRepositionLayer(volumeBounds(),center(),envelope);
         //  else
         //      clayIter->resizeLayer(volumeBounds(),envelope);
       }  // else
       // msgstream << MSG::WARNING << "  ---> found 0 pointer to layer,
       // indicates problem." << endreq;
     }
   }
 
   // case b : container volume -> step down
   if (m_confinedVolumes) {
     // msgstream << MSG::VERBOSE << "  ---> no confined layers, working on " <<
     // m_confinedVolumes->arrayObjects().size() << " confined volumes." <<
     // endreq;
     for (auto& cVolumesIter : m_confinedVolumes->arrayObjects()) {
       cVolumesIter->synchronizeLayers(envelope);
     }
   }
 }
 
 void TrackingVolume::interlinkLayers() {
   if (m_confinedLayers) {
     auto& layers = m_confinedLayers->arrayObjects();
 
     // forward register the last one as the previous one
     //  first <- | -> second, first <- | -> second, first <- | -> second
     const Layer* lastLayer = nullptr;
     for (auto& layerPtr : layers) {
       // we'll need to mutate our confined layers to perform this operation
       Layer& mutableLayer = *(std::const_pointer_cast<Layer>(layerPtr));
       // register the layers
       mutableLayer.m_nextLayerUtility = m_confinedLayers->binUtility();
       mutableLayer.m_nextLayers.first = lastLayer;
       // register the volume
       mutableLayer.encloseTrackingVolume(*this);
       // remember the last layer
       lastLayer = &mutableLayer;
     }
     // backward loop
     lastLayer = nullptr;
     for (auto layerIter = layers.rbegin(); layerIter != layers.rend();
          ++layerIter) {
       // set the other next volume
       Layer& mutableLayer = *(std::const_pointer_cast<Layer>(*layerIter));
       mutableLayer.m_nextLayers.second = lastLayer;
       lastLayer = &mutableLayer;
     }
   }
 }
 
 // Returns the boundary surfaces ordered in probability to hit them based on
 boost::container::small_vector<BoundaryIntersection, 4>
 TrackingVolume::compatibleBoundaries(const GeometryContext& gctx,
                                      const Vector3& position,
                                      const Vector3& direction,
                                      const NavigationOptions<Surface>& options,
                                      const Logger& logger) const {
   ACTS_VERBOSE("Finding compatibleBoundaries");
 
   boost::container::small_vector<BoundaryIntersection, 4> intersections;
 
   // The limits for this navigation step
   double nearLimit = options.nearLimit;
   double farLimit = options.farLimit;
 
   // Helper function to test intersection
   auto checkIntersection =
       [&](SurfaceMultiIntersection& candidates,
           const BoundarySurface* boundary) -> BoundaryIntersection {
     for (const auto& intersection : candidates.split()) {
       if (!intersection.isValid()) {
         continue;
       }
 
       ACTS_VERBOSE("Check intersection with surface "
                    << boundary->surfaceRepresentation().geometryId());
       if (detail::checkPathLength(intersection.pathLength(), nearLimit,
                                   farLimit, logger)) {
         return BoundaryIntersection(intersection, boundary);
       }
     }
 
     ACTS_VERBOSE("No intersection accepted");
     return BoundaryIntersection(SurfaceIntersection::invalid(), nullptr);
   };
 
   /// Helper function to process boundary surfaces
   auto processBoundaries =
       [&](const TrackingVolumeBoundaries& boundaries) -> void {
     // Loop over the boundary surfaces
     for (auto& boundary : boundaries) {
       // Get the boundary surface pointer
       const auto& surface = boundary->surfaceRepresentation();
       ACTS_VERBOSE("Consider boundary surface " << surface.geometryId());
 
       // Exclude the boundary where you are on
       // TODO this is not optimal as we might exit via the same boundary (e.g.
       // cylinder)
       if (&surface == options.startObject) {
         ACTS_VERBOSE(" - Surface is excluded surface");
         continue;
       }
 
       auto candidates = surface.intersect(gctx, position, direction,
                                           options.boundaryTolerance);
       // Intersect and continue
       auto intersection = checkIntersection(candidates, boundary.get());
       if (intersection.first.isValid()) {
         ACTS_VERBOSE(" - Proceed with surface");
         intersections.push_back(intersection);
       } else {
         ACTS_VERBOSE(" - Surface intersecion invalid");
       }
     }
   };
 
   // Process the boundaries of the current volume
   const auto& surfaces = boundarySurfaces();
   ACTS_VERBOSE("Volume reports " << surfaces.size() << " boundary surfaces");
   processBoundaries(surfaces);
 
   // Process potential boundaries of contained volumes
   auto confinedDenseVolumes = denseVolumes();
   ACTS_VERBOSE("Volume reports " << confinedDenseVolumes.size()
                                  << " confined dense volumes");
   for (const auto& volume : confinedDenseVolumes) {
     const auto& surfacesConfined = volume->boundarySurfaces();
     ACTS_VERBOSE(" -> " << surfacesConfined.size() << " boundary surfaces");
     processBoundaries(surfacesConfined);
   }
 
   return intersections;
 }
 
 boost::container::small_vector<LayerIntersection, 10>
 TrackingVolume::compatibleLayers(
     const GeometryContext& gctx, const Vector3& position,
     const Vector3& direction, const NavigationOptions<Layer>& options) const {
   // the layer intersections which are valid
   boost::container::small_vector<LayerIntersection, 10> lIntersections;
 
   // the confinedLayers
   if (m_confinedLayers == nullptr) {
     return {};
   }
 
   // start layer given or not - test layer
   const Layer* tLayer = options.startObject != nullptr
                             ? static_cast<const Layer*>(options.startObject)
                             : associatedLayer(gctx, position);
   while (tLayer != nullptr) {
     // check if the layer needs resolving
     // - resolveSensitive -> always take layer if it has a surface array
     // - resolveMaterial -> always take layer if it has material
     // - resolvePassive -> always take, unless it's a navigation layer
     // skip the start object
     if (tLayer != options.startObject && tLayer->resolve(options)) {
       // if it's a resolveable start layer, you are by definition on it
       // layer on approach intersection
       auto atIntersection =
           tLayer->surfaceOnApproach(gctx, position, direction, options);
       // Intersection is ok - take it (move to surface on approach)
       if (atIntersection.isValid()) {
         // create a layer intersection
         lIntersections.push_back(LayerIntersection(atIntersection, tLayer));
       }
     }
     // move to next one or break because you reached the end layer
     tLayer = (tLayer == options.endObject)
                  ? nullptr
                  : tLayer->nextLayer(gctx, position, direction);
   }
 
   // In case of cylindrical layers we might resolve far intersection solutions
   // which are not valid for navigation. These are discarded here by checking
   // against the minimum path length.
   auto min = std::min_element(
       lIntersections.begin(), lIntersections.end(),
       [](const LayerIntersection& a, const LayerIntersection& b) {
         return a.first.pathLength() < b.first.pathLength();
       });
   std::rotate(lIntersections.begin(), min, lIntersections.end());
   lIntersections.resize(std::distance(min, lIntersections.end()),
                         {SurfaceIntersection::invalid(), nullptr});
 
   return lIntersections;
 }
 
 const std::string& TrackingVolume::volumeName() const {
   return m_name;
 }
 
 void TrackingVolume::setVolumeName(const std::string& volumeName) {
   m_name = volumeName;
 }
 
 const IVolumeMaterial* TrackingVolume::volumeMaterial() const {
   return m_volumeMaterial.get();
 }
 
 const std::shared_ptr<const IVolumeMaterial>&
 TrackingVolume::volumeMaterialPtr() const {
   return m_volumeMaterial;
 }
 
 void TrackingVolume::assignVolumeMaterial(
     std::shared_ptr<const IVolumeMaterial> material) {
   m_volumeMaterial = std::move(material);
 }
 
 const LayerArray* TrackingVolume::confinedLayers() const {
   return m_confinedLayers.get();
 }
 
 const MutableTrackingVolumeVector TrackingVolume::denseVolumes() const {
   return m_confinedDenseVolumes;
 }
 
 std::shared_ptr<const TrackingVolumeArray> TrackingVolume::confinedVolumes()
     const {
   return m_confinedVolumes;
 }
 
 const TrackingVolume* TrackingVolume::motherVolume() const {
   return m_motherVolume;
 }
 
 TrackingVolume* TrackingVolume::motherVolume() {
   return m_motherVolume;
 }
 
 void TrackingVolume::setMotherVolume(TrackingVolume* mvol) {
   m_motherVolume = mvol;
 }
 
 const Acts::Layer* TrackingVolume::associatedLayer(
     const GeometryContext& /*gctx*/, const Vector3& position) const {
   // confined static layers - highest hierarchy
   if (m_confinedLayers != nullptr) {
     return (m_confinedLayers->object(position).get());
   }
 
   // return the null pointer
   return nullptr;
 }
 
 TrackingVolume::VolumeRange TrackingVolume::volumes() const {
   return VolumeRange{m_volumes};
 }
 
 TrackingVolume::MutableVolumeRange TrackingVolume::volumes() {
   return MutableVolumeRange{m_volumes};
 }
 
 TrackingVolume& TrackingVolume::addVolume(
     std::unique_ptr<TrackingVolume> volume) {
   if (volume->motherVolume() != nullptr) {
     throw std::invalid_argument("Volume already has a mother volume");
   }
 
   volume->setMotherVolume(this);
   m_volumes.push_back(std::move(volume));
   return *m_volumes.back();
 }
 
 TrackingVolume::PortalRange TrackingVolume::portals() const {
   return PortalRange{m_portals};
 }
 
 TrackingVolume::MutablePortalRange TrackingVolume::portals() {
   return MutablePortalRange{m_portals};
 }
 
 void TrackingVolume::addPortal(std::shared_ptr<Portal> portal) {
   if (portal == nullptr) {
     throw std::invalid_argument("Portal is nullptr");
   }
   m_portals.push_back(std::move(portal));
 }
 
 TrackingVolume::SurfaceRange TrackingVolume::surfaces() const {
   return SurfaceRange{m_surfaces};
 }
 
 TrackingVolume::MutableSurfaceRange TrackingVolume::surfaces() {
   return MutableSurfaceRange{m_surfaces};
 }
 
 void TrackingVolume::addSurface(std::shared_ptr<Surface> surface) {
   if (surface == nullptr) {
     throw std::invalid_argument("Surface is nullptr");
   }
   m_surfaces.push_back(std::move(surface));
 }
 
 void TrackingVolume::visualize(IVisualization3D& helper,
                                const GeometryContext& gctx,
                                const ViewConfig& viewConfig,
                                const ViewConfig& portalViewConfig,
                                const ViewConfig& sensitiveViewConfig) const {
   helper.object(volumeName());
   if (viewConfig.visible) {
     Volume::visualize(helper, gctx, viewConfig);
   }
 
   if (sensitiveViewConfig.visible) {
     if (!surfaces().empty()) {
       helper.object(volumeName() + "_sensitives");
       for (const auto& surface : surfaces()) {
         surface.visualize(helper, gctx, sensitiveViewConfig);
       }
     }
   }
 
   if (portalViewConfig.visible) {
     helper.object(volumeName() + "_portals");
     for (const auto& portal : portals()) {
       portal.surface().visualize(helper, gctx, portalViewConfig);
     }
   }
 
   for (const auto& child : volumes()) {
     child.visualize(helper, gctx, viewConfig, portalViewConfig,
                     sensitiveViewConfig);
   }
 }
 
 void TrackingVolume::setNavigationPolicy(
     std::unique_ptr<INavigationPolicy> policy) {
   if (policy == nullptr) {
     throw std::invalid_argument("Navigation policy is nullptr");
   }
 
   m_navigationPolicy = std::move(policy);
   m_navigationPolicy->connect(m_navigationDelegate);
 }
 
 void TrackingVolume::initializeNavigationCandidates(
     const NavigationArguments& args, AppendOnlyNavigationStream& stream,
     const Logger& logger) const {
   m_navigationDelegate(args, stream, logger);
 }
 
 namespace {
 
 void visitLayer(const Acts::Layer& layer, TrackingGeometryVisitor& visitor) {
   visitor.visitLayer(layer);
   // Surfaces contained in the surface array
   if (layer.surfaceArray() != nullptr) {
     for (const auto& srf : layer.surfaceArray()->surfaces()) {
       visitor.visitSurface(*srf);
     }
   }
   visitor.visitSurface(layer.surfaceRepresentation());
   if (layer.approachDescriptor() != nullptr) {
     for (const auto& srf : layer.approachDescriptor()->containedSurfaces()) {
       visitor.visitSurface(*srf);
     }
   }
 }
 
 }  // namespace
 
 // @TODO: Unify once Gen1 is removed: should share most code between mutable and const
 void TrackingVolume::apply(TrackingGeometryVisitor& visitor) const {
   visitor.visitVolume(*this);
 
   // Visit the boundary surfaces
   for (const auto& bs : m_boundarySurfaces) {
     visitor.visitBoundarySurface(*bs);
     visitor.visitSurface(bs->surfaceRepresentation());
   }
 
   for (const auto& portal : portals()) {
     visitor.visitPortal(portal);
     visitor.visitSurface(portal.surface());
   }
 
   // Internal structure
   if (m_confinedLayers != nullptr) {
     std::ranges::for_each(
         m_confinedLayers->arrayObjects(),
         [&](const auto& layer) { visitLayer(*layer, visitor); });
   }
 
   if (m_confinedVolumes != nullptr) {
     // contains sub volumes
     for (const auto& volume : m_confinedVolumes->arrayObjects()) {
       volume->apply(visitor);
     }
   }
 
   for (const auto& surface : surfaces()) {
     visitor.visitSurface(surface);
   }
 
   for (const auto& volume : volumes()) {
     volume.apply(visitor);
   }
 }
 
 void Acts::TrackingVolume::apply(TrackingGeometryMutableVisitor& visitor) {
   // if the visitor is configured for inner--->outer volume visiting we visit
   // the children first
   if (visitor.visitDepthFirst()) {
     for (auto& volume : volumes()) {
       volume.apply(visitor);
     }
   }
 
   visitor.visitVolume(*this);
 
   // Visit the boundary surfaces
   // This does const casts because Gen1 substructure does not have transitive
   // const-ness
 
   // @TODO: Remove this when Gen1 is remoeved
 
   for (const auto& bs : m_boundarySurfaces) {
     visitor.visitBoundarySurface(
         const_cast<BoundarySurfaceT<TrackingVolume>&>(*bs));
     visitor.visitSurface(
         const_cast<RegularSurface&>(bs->surfaceRepresentation()));
   }
 
   for (auto& portal : portals()) {
     visitor.visitPortal(portal);
     visitor.visitSurface(portal.surface());
   }
 
   // Internal structure
   // This does const casts because Gen1 substructure does not have transitive
   // const-ness
   // @TODO: Remove this when Gen1 is remoeved
   if (m_confinedVolumes == nullptr) {
     // no sub volumes => loop over the confined layers
     if (m_confinedLayers != nullptr) {
       for (const auto& layer : m_confinedLayers->arrayObjects()) {
         visitor.visitLayer(const_cast<Layer&>(*layer));
         // Surfaces contained in the surface array
         if (layer->surfaceArray() != nullptr) {
           for (const auto& srf : layer->surfaceArray()->surfaces()) {
             visitor.visitSurface(const_cast<Surface&>(*srf));
           }
         }
         // Surfaces of the layer
         visitor.visitSurface(
             const_cast<Surface&>(layer->surfaceRepresentation()));
         // Approach surfaces of the layer
         if (layer->approachDescriptor() != nullptr) {
           for (const auto& srf :
                layer->approachDescriptor()->containedSurfaces()) {
             visitor.visitSurface(const_cast<Surface&>(*srf));
           }
         }
       }
     }
   } else {
     // contains sub volumes
     for (const auto& volume : m_confinedVolumes->arrayObjects()) {
       const_cast<TrackingVolume&>(*volume).apply(visitor);
     }
   }
 
   for (auto& surface : surfaces()) {
     visitor.visitSurface(surface);
   }
 
   if (!visitor.visitDepthFirst()) {
     // if the visitor is configured for outer--->inner volume visiting we visit
     // the children last
     for (auto& volume : volumes()) {
       volume.apply(visitor);
     }
   }
 }
 
 }  // namespace Acts

This page was automatically generated by the 2.3.7 LXR engine. The LXR team