Newer
Older
// ************************************************************************************************
// BornAgain: simulate and fit reflection and scattering
//! @file Device/Mask/MaskStack.cpp
//! @brief Implements class MaskStack.
//!
//! @homepage http://www.bornagainproject.org
//! @license GNU General Public License v3 or higher (see COPYING)
//! @copyright Forschungszentrum Jülich GmbH 2018
//! @authors Scientific Computing Group at MLZ (see CITATION, AUTHORS)
// ************************************************************************************************
MaskPattern::MaskPattern(IShape2D* shape_, bool doMask_)
: shape(shape_)
, doMask(doMask_)
{
}
MaskPattern::~MaskPattern()
{
delete shape;
}
MaskPattern* MaskPattern::clone() const
{
return new MaskPattern(shape->clone(), doMask);
}
MaskStack::MaskStack(const Scale& xAxis, const Scale& yAxis)

Wuttke, Joachim
committed
: m_xAxis(xAxis.clone())
, m_yAxis(yAxis.clone())
MaskStack::MaskStack(const MaskStack& other)

Wuttke, Joachim
committed
: m_xAxis(other.m_xAxis->clone())
, m_yAxis(other.m_yAxis->clone())
, m_stack(other.m_stack)
void MaskStack::addMask(const IShape2D& shape, bool mask_value)
m_stack.emplace_back(new MaskPattern(shape.clone(), mask_value));
bool MaskStack::isMasked(size_t i_flat) const
Bin1D binx = m_xAxis->bin(i_flat % m_xAxis->size());
Bin1D biny = m_yAxis->bin(i_flat / m_xAxis->size());
for (int k = m_stack.size() - 1; k >= 0; --k) {
const MaskPattern* const pat = m_stack[k];
if (pat->shape->contains(binx, biny))
return pat->doMask;
}
return false;
size_t MaskStack::numberOfMasks() const
const MaskPattern* MaskStack::patternAt(size_t iMask) const