1 /****************************************************************************
3 ** Copyright (C) 2012 Digia Plc and/or its subsidiary(-ies).
4 ** Contact: http://www.qt-project.org/legal
6 ** This file is part of the QtQuick module of the Qt Toolkit.
8 ** $QT_BEGIN_LICENSE:LGPL$
9 ** Commercial License Usage
10 ** Licensees holding valid commercial Qt licenses may use this file in
11 ** accordance with the commercial license agreement provided with the
12 ** Software or, alternatively, in accordance with the terms contained in
13 ** a written agreement between you and Digia. For licensing terms and
14 ** conditions see http://qt.digia.com/licensing. For further information
15 ** use the contact form at http://qt.digia.com/contact-us.
17 ** GNU Lesser General Public License Usage
18 ** Alternatively, this file may be used under the terms of the GNU Lesser
19 ** General Public License version 2.1 as published by the Free Software
20 ** Foundation and appearing in the file LICENSE.LGPL included in the
21 ** packaging of this file. Please review the following information to
22 ** ensure the GNU Lesser General Public License version 2.1 requirements
23 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
25 ** In addition, as a special exception, Digia gives you certain additional
26 ** rights. These rights are described in the Digia Qt LGPL Exception
27 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
29 ** GNU General Public License Usage
30 ** Alternatively, this file may be used under the terms of the GNU
31 ** General Public License version 3.0 as published by the Free Software
32 ** Foundation and appearing in the file LICENSE.GPL included in the
33 ** packaging of this file. Please review the following information to
34 ** ensure the GNU General Public License version 3.0 requirements will be
35 ** met: http://www.gnu.org/copyleft/gpl.html.
40 ****************************************************************************/
42 #include "qquickmaskextruder_p.h"
43 #include <QtQml/qqml.h>
44 #include <QtQml/qqmlinfo.h>
50 \instantiates QQuickMaskExtruder
51 \inqmlmodule QtQuick.Particles 2
53 \brief For representing an image as a shape to affectors and emitters
54 \ingroup qtquick-particles
58 \qmlproperty url QtQuick.Particles2::MaskShape::source
60 The image to use as the mask. Areas with non-zero opacity
61 will be considered inside the shape.
65 QQuickMaskExtruder::QQuickMaskExtruder(QObject *parent) :
66 QQuickParticleExtruder(parent)
72 void QQuickMaskExtruder::setSource(QUrl arg)
74 if (m_source != arg) {
77 m_lastHeight = -1;//Trigger reset
79 emit sourceChanged(arg);
84 void QQuickMaskExtruder::startMaskLoading()
87 if (m_source.isEmpty())
89 m_pix.load(qmlEngine(this), m_source);
90 if (m_pix.isLoading())
91 m_pix.connectFinished(this, SLOT(finishMaskLoading()));
96 void QQuickMaskExtruder::finishMaskLoading()
99 qmlInfo(this) << m_pix.error();
102 QPointF QQuickMaskExtruder::extrude(const QRectF &r)
104 ensureInitialized(r);
105 if (!m_mask.count() || m_img.isNull())
107 const QPointF p = m_mask[rand() % m_mask.count()];
108 //### Should random sub-pixel positioning be added?
109 return p + r.topLeft();
112 bool QQuickMaskExtruder::contains(const QRectF &bounds, const QPointF &point)
114 ensureInitialized(bounds);//###Current usage patterns WILL lead to different bounds/r calls. Separate list?
117 QPoint p = point.toPoint() - bounds.topLeft().toPoint();
118 return m_img.rect().contains(p) && (bool)m_img.pixelIndex(p);
121 void QQuickMaskExtruder::ensureInitialized(const QRectF &r)
123 if (m_lastWidth == r.width() && m_lastHeight == r.height())
124 return;//Same as before
125 if (!m_pix.isReady())
127 m_lastWidth = r.width();
128 m_lastHeight = r.height();
132 m_img = m_pix.image().createAlphaMask();
133 m_img = m_img.convertToFormat(QImage::Format_Mono);//Else LSB, but I think that's easier
134 m_img = m_img.scaled(r.size().toSize());//TODO: Do they need aspect ratio stuff? Or tiling?
135 for (int i=0; i<r.width(); i++){
136 for (int j=0; j<r.height(); j++){
137 if (m_img.pixelIndex(i,j))//Direct bit manipulation is presumably more efficient
138 m_mask << QPointF(i,j);