Skip to content
Snippets Groups Projects
Commit d6babe77 authored by Wuttke, Joachim's avatar Wuttke, Joachim
Browse files

comms

parent 4b26c91a
No related branches found
No related tags found
1 merge request!2374rm remaining uses of PolyVector (#914)
...@@ -45,18 +45,15 @@ public: ...@@ -45,18 +45,15 @@ public:
//! interference is defining the density, this is the interference-calculated density. //! interference is defining the density, this is the interference-calculated density.
double totalDensityValue() const; double totalDensityValue() const;
//! The particles this layout contains. // Returns particles contained at top-level (non-recursive).
//!
//! Note that this is not a hierarchical search! Only the topmost particles are returned, not
//! their contained particles. For a hierarchical search use containedItemsWithParticles
QVector<ItemWithParticles*> itemsWithParticles() const; QVector<ItemWithParticles*> itemsWithParticles() const;
//! Return particles contained at any level (recursive).
QVector<ItemWithParticles*> containedItemsWithParticles() const;
void addItemWithParticleSelection(ItemWithParticles* particle); void addItemWithParticleSelection(ItemWithParticles* particle);
void removeItemWithParticle(ItemWithParticles* particle); void removeItemWithParticle(ItemWithParticles* particle);
//! Return full hierarchical contained items with particles.
QVector<ItemWithParticles*> containedItemsWithParticles() const;
PolyItem<InterferenceItemCatalog>& interferenceSelection() { return m_interference; } PolyItem<InterferenceItemCatalog>& interferenceSelection() { return m_interference; }
const PolyItem<InterferenceItemCatalog>& interferenceSelection() const; const PolyItem<InterferenceItemCatalog>& interferenceSelection() const;
void setInterference(InterferenceItem* i) { m_interference.setCertainItem(i); } void setInterference(InterferenceItem* i) { m_interference.setCertainItem(i); }
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment