2017-07-21 16:21:34 +00:00
|
|
|
/******************************************************************************
|
|
|
|
* QSkinny - Copyright (C) 2016 Uwe Rathmann
|
|
|
|
* This file may be used under the terms of the QSkinny License, Version 1.0
|
|
|
|
*****************************************************************************/
|
|
|
|
|
|
|
|
#include "QskGradient.h"
|
2017-10-17 15:34:00 +00:00
|
|
|
#include "QskRgbValue.h"
|
2017-07-21 16:21:34 +00:00
|
|
|
|
2018-08-03 06:15:28 +00:00
|
|
|
#include <qvariant.h>
|
2017-10-17 15:34:00 +00:00
|
|
|
|
|
|
|
static void qskRegisterGradient()
|
|
|
|
{
|
|
|
|
qRegisterMetaType< QskGradient >();
|
2020-10-30 06:29:43 +00:00
|
|
|
|
2022-03-30 16:30:22 +00:00
|
|
|
#if QT_VERSION < QT_VERSION_CHECK( 6, 0, 0 )
|
|
|
|
QMetaType::registerEqualsComparator< QskGradient >();
|
|
|
|
#endif
|
|
|
|
|
2020-10-30 06:29:43 +00:00
|
|
|
QMetaType::registerConverter< QColor, QskGradient >(
|
|
|
|
[]( const QColor& color ) { return QskGradient( color ); } );
|
2017-10-17 15:34:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Q_CONSTRUCTOR_FUNCTION( qskRegisterGradient )
|
|
|
|
|
2021-09-17 11:35:11 +00:00
|
|
|
static inline bool qskIsGradientValid( const QskGradientStops& stops )
|
2017-07-21 16:21:34 +00:00
|
|
|
{
|
2022-10-24 15:29:39 +00:00
|
|
|
if ( stops.isEmpty() )
|
2017-07-21 16:21:34 +00:00
|
|
|
return false;
|
|
|
|
|
2022-10-24 15:29:39 +00:00
|
|
|
if ( stops.first().position() < 0.0 || stops.last().position() > 1.0 )
|
2017-07-21 16:21:34 +00:00
|
|
|
return false;
|
|
|
|
|
|
|
|
if ( !stops.first().color().isValid() )
|
|
|
|
return false;
|
|
|
|
|
|
|
|
for ( int i = 1; i < stops.size(); i++ )
|
|
|
|
{
|
2018-08-03 06:15:28 +00:00
|
|
|
if ( stops[ i ].position() < stops[ i - 1 ].position() )
|
2017-07-21 16:21:34 +00:00
|
|
|
return false;
|
|
|
|
|
2018-08-03 06:15:28 +00:00
|
|
|
if ( !stops[ i ].color().isValid() )
|
2017-07-21 16:21:34 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2022-10-24 15:08:48 +00:00
|
|
|
static inline bool qskCanBeInterpolated( const QskGradient& from, const QskGradient& to )
|
2017-10-17 15:34:00 +00:00
|
|
|
{
|
2022-10-24 15:08:48 +00:00
|
|
|
if ( from.isMonochrome() || to.isMonochrome() )
|
|
|
|
return true;
|
2017-10-17 15:34:00 +00:00
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
return from.type() == to.type();
|
2017-07-21 16:21:34 +00:00
|
|
|
}
|
|
|
|
|
2018-08-03 06:15:28 +00:00
|
|
|
QskGradient::QskGradient( const QColor& color )
|
2017-07-21 16:21:34 +00:00
|
|
|
{
|
2022-10-24 14:02:46 +00:00
|
|
|
setStops( color );
|
2017-07-21 16:21:34 +00:00
|
|
|
}
|
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
QskGradient::QskGradient( const QColor& color1, const QColor& color2 )
|
2020-07-31 10:42:36 +00:00
|
|
|
{
|
2022-10-31 13:42:08 +00:00
|
|
|
setStops( color1, color2 );
|
2020-07-31 10:42:36 +00:00
|
|
|
}
|
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
QskGradient::QskGradient( QGradient::Preset preset )
|
2020-07-31 10:42:36 +00:00
|
|
|
{
|
2022-10-31 13:42:08 +00:00
|
|
|
setStops( qskBuildGradientStops( QGradient( preset ).stops() ) );
|
2020-07-31 10:42:36 +00:00
|
|
|
}
|
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
QskGradient::QskGradient( const QVector< QskGradientStop >& stops )
|
2017-10-17 15:34:00 +00:00
|
|
|
{
|
2022-01-21 06:49:38 +00:00
|
|
|
setStops( stops );
|
2017-10-17 15:34:00 +00:00
|
|
|
}
|
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
QskGradient::QskGradient( const QskGradient& other ) noexcept
|
|
|
|
: m_stops( other.m_stops )
|
|
|
|
, m_values{ other.m_values[0], other.m_values[1],
|
|
|
|
other.m_values[2], other.m_values[3], }
|
|
|
|
, m_type( other.m_type )
|
|
|
|
, m_spread( other.m_spread )
|
|
|
|
, m_isDirty( other.m_isDirty )
|
|
|
|
, m_isValid( other.m_isValid )
|
|
|
|
, m_isMonchrome( other.m_isMonchrome )
|
|
|
|
, m_isVisible( other.m_isVisible )
|
2022-03-30 10:28:45 +00:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
QskGradient::~QskGradient()
|
2022-03-18 15:50:34 +00:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
QskGradient& QskGradient::operator=( const QskGradient& other ) noexcept
|
2017-07-21 16:21:34 +00:00
|
|
|
{
|
2022-10-31 13:42:08 +00:00
|
|
|
m_type = other.m_type;
|
|
|
|
m_spread = other.m_spread;
|
|
|
|
m_stops = other.m_stops;
|
|
|
|
|
|
|
|
m_values[0] = other.m_values[0];
|
|
|
|
m_values[1] = other.m_values[1];
|
|
|
|
m_values[2] = other.m_values[2];
|
|
|
|
m_values[3] = other.m_values[3];
|
|
|
|
|
|
|
|
m_isDirty = other.m_isDirty;
|
|
|
|
m_isValid = other.m_isValid;
|
|
|
|
m_isMonchrome = other.m_isMonchrome;
|
|
|
|
m_isVisible = other.m_isVisible;
|
|
|
|
|
|
|
|
return *this;
|
2017-07-21 16:21:34 +00:00
|
|
|
}
|
|
|
|
|
2022-10-24 14:02:46 +00:00
|
|
|
bool QskGradient::operator==( const QskGradient& other ) const noexcept
|
2017-07-21 16:21:34 +00:00
|
|
|
{
|
2022-10-31 13:42:08 +00:00
|
|
|
return ( m_type == other.m_type )
|
|
|
|
&& ( m_spread == other.m_spread )
|
|
|
|
&& ( m_values[0] == other.m_values[0] )
|
|
|
|
&& ( m_values[1] == other.m_values[1] )
|
|
|
|
&& ( m_values[2] == other.m_values[2] )
|
|
|
|
&& ( m_values[3] == other.m_values[3] )
|
|
|
|
&& ( m_stops == other.m_stops );
|
2017-07-21 16:21:34 +00:00
|
|
|
}
|
|
|
|
|
2022-10-24 14:02:46 +00:00
|
|
|
void QskGradient::updateStatusBits() const
|
2017-07-21 16:21:34 +00:00
|
|
|
{
|
2022-10-24 14:02:46 +00:00
|
|
|
// doing all bits in one loop ?
|
|
|
|
m_isValid = qskIsGradientValid( m_stops );
|
|
|
|
|
|
|
|
if ( m_isValid )
|
2022-01-21 06:29:07 +00:00
|
|
|
{
|
2022-10-24 14:02:46 +00:00
|
|
|
m_isMonchrome = qskIsMonochrome( m_stops );
|
|
|
|
m_isVisible = qskIsVisible( m_stops );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
m_isMonchrome = true;
|
|
|
|
m_isVisible = false;
|
2022-01-21 06:29:07 +00:00
|
|
|
}
|
2022-10-24 14:02:46 +00:00
|
|
|
|
|
|
|
m_isDirty = false;
|
2017-07-21 16:21:34 +00:00
|
|
|
}
|
|
|
|
|
2022-10-24 14:02:46 +00:00
|
|
|
bool QskGradient::isValid() const noexcept
|
|
|
|
{
|
|
|
|
if ( m_isDirty )
|
|
|
|
updateStatusBits();
|
|
|
|
|
|
|
|
return m_isValid;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool QskGradient::isMonochrome() const noexcept
|
2017-07-21 16:21:34 +00:00
|
|
|
{
|
2022-01-21 06:29:07 +00:00
|
|
|
if ( m_isDirty )
|
|
|
|
updateStatusBits();
|
2017-07-21 16:21:34 +00:00
|
|
|
|
2022-01-21 06:29:07 +00:00
|
|
|
return m_isMonchrome;
|
2017-07-21 16:21:34 +00:00
|
|
|
}
|
|
|
|
|
2022-10-24 14:02:46 +00:00
|
|
|
bool QskGradient::isVisible() const noexcept
|
2017-07-21 16:21:34 +00:00
|
|
|
{
|
2022-01-21 06:29:07 +00:00
|
|
|
if ( m_isDirty )
|
|
|
|
updateStatusBits();
|
2017-10-17 15:34:00 +00:00
|
|
|
|
2022-01-21 06:29:07 +00:00
|
|
|
return m_isVisible;
|
2017-07-21 16:21:34 +00:00
|
|
|
}
|
|
|
|
|
2022-10-24 14:02:46 +00:00
|
|
|
void QskGradient::setStops( const QColor& color )
|
2017-07-21 16:21:34 +00:00
|
|
|
{
|
2022-10-24 15:08:48 +00:00
|
|
|
m_stops = { { 0.0, color }, { 1.0, color } };
|
2022-01-21 06:29:07 +00:00
|
|
|
m_isDirty = true;
|
2017-07-21 16:21:34 +00:00
|
|
|
}
|
|
|
|
|
2022-10-24 15:08:48 +00:00
|
|
|
void QskGradient::setStops( const QColor& color1, const QColor& color2 )
|
2017-07-21 16:21:34 +00:00
|
|
|
{
|
2022-10-24 15:08:48 +00:00
|
|
|
m_stops = { { 0.0, color1 }, { 1.0, color2 } };
|
2022-01-21 06:29:07 +00:00
|
|
|
m_isDirty = true;
|
2017-07-21 16:21:34 +00:00
|
|
|
}
|
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
void QskGradient::setStops( QGradient::Preset preset )
|
|
|
|
{
|
|
|
|
const auto stops = qskBuildGradientStops( QGradient( preset ).stops() );
|
|
|
|
setStops( stops );
|
|
|
|
}
|
|
|
|
|
2021-09-17 11:35:11 +00:00
|
|
|
void QskGradient::setStops( const QskGradientStops& stops )
|
2017-07-21 16:21:34 +00:00
|
|
|
{
|
2022-10-24 14:02:46 +00:00
|
|
|
if ( !stops.isEmpty() && !qskIsGradientValid( stops ) )
|
2017-07-21 16:21:34 +00:00
|
|
|
{
|
|
|
|
qWarning( "Invalid gradient stops" );
|
2022-10-24 14:02:46 +00:00
|
|
|
m_stops.clear();
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
m_stops = stops;
|
2017-07-21 16:21:34 +00:00
|
|
|
}
|
|
|
|
|
2022-01-21 06:29:07 +00:00
|
|
|
m_isDirty = true;
|
2017-07-21 16:21:34 +00:00
|
|
|
}
|
|
|
|
|
2022-10-24 15:29:39 +00:00
|
|
|
int QskGradient::stepCount() const noexcept
|
2021-02-19 11:42:05 +00:00
|
|
|
{
|
2022-10-24 15:29:39 +00:00
|
|
|
if ( !isValid() )
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
int steps = m_stops.count() - 1;
|
|
|
|
|
|
|
|
if ( m_stops.first().position() > 0.0 )
|
|
|
|
steps++;
|
|
|
|
|
|
|
|
if ( m_stops.last().position() < 1.0 )
|
|
|
|
steps++;
|
|
|
|
|
|
|
|
return steps;
|
2021-02-19 11:42:05 +00:00
|
|
|
}
|
|
|
|
|
2022-10-24 14:40:47 +00:00
|
|
|
qreal QskGradient::stopAt( int index ) const noexcept
|
2017-07-21 16:21:34 +00:00
|
|
|
{
|
2022-10-24 14:40:47 +00:00
|
|
|
if ( index < 0 || index >= m_stops.size() )
|
2017-07-21 16:21:34 +00:00
|
|
|
return -1.0;
|
|
|
|
|
2018-08-03 06:15:28 +00:00
|
|
|
return m_stops[ index ].position();
|
2017-07-21 16:21:34 +00:00
|
|
|
}
|
|
|
|
|
2022-10-24 14:40:47 +00:00
|
|
|
bool QskGradient::hasStopAt( qreal value ) const noexcept
|
|
|
|
{
|
|
|
|
// better use binary search TODO ...
|
|
|
|
for ( auto& stop : m_stops )
|
|
|
|
{
|
|
|
|
if ( stop.position() == value )
|
|
|
|
return true;
|
|
|
|
|
|
|
|
if ( stop.position() > value )
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
QColor QskGradient::colorAt( int index ) const noexcept
|
2017-07-21 16:21:34 +00:00
|
|
|
{
|
|
|
|
if ( index >= m_stops.size() )
|
|
|
|
return QColor();
|
|
|
|
|
2018-08-03 06:15:28 +00:00
|
|
|
return m_stops[ index ].color();
|
2017-07-21 16:21:34 +00:00
|
|
|
}
|
|
|
|
|
2017-10-17 15:34:00 +00:00
|
|
|
void QskGradient::setAlpha( int alpha )
|
|
|
|
{
|
|
|
|
for ( auto& stop : m_stops )
|
|
|
|
{
|
2020-08-15 12:42:28 +00:00
|
|
|
auto c = stop.color();
|
2017-10-17 15:34:00 +00:00
|
|
|
if ( c.isValid() && c.alpha() )
|
|
|
|
{
|
|
|
|
c.setAlpha( alpha );
|
|
|
|
stop.setColor( c );
|
|
|
|
}
|
|
|
|
}
|
2022-01-21 06:29:07 +00:00
|
|
|
|
|
|
|
m_isDirty = true;
|
2017-10-17 15:34:00 +00:00
|
|
|
}
|
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
void QskGradient::setSpread( QGradient::Spread spread )
|
|
|
|
{
|
|
|
|
m_spread = spread;
|
|
|
|
}
|
|
|
|
|
2020-07-31 10:42:36 +00:00
|
|
|
void QskGradient::reverse()
|
|
|
|
{
|
|
|
|
if ( isMonochrome() )
|
|
|
|
return;
|
|
|
|
|
|
|
|
std::reverse( m_stops.begin(), m_stops.end() );
|
|
|
|
for( auto& stop : m_stops )
|
|
|
|
stop.setPosition( 1.0 - stop.position() );
|
|
|
|
}
|
|
|
|
|
|
|
|
QskGradient QskGradient::reversed() const
|
|
|
|
{
|
|
|
|
auto gradient = *this;
|
|
|
|
gradient.reverse();
|
|
|
|
|
|
|
|
return gradient;
|
|
|
|
}
|
|
|
|
|
|
|
|
QskGradient QskGradient::extracted( qreal from, qreal to ) const
|
|
|
|
{
|
2022-10-24 15:08:48 +00:00
|
|
|
auto gradient = *this;
|
2020-07-31 10:42:36 +00:00
|
|
|
|
2022-10-24 15:08:48 +00:00
|
|
|
if ( !isValid() || ( from > to ) || ( from > 1.0 ) )
|
2018-12-22 15:12:45 +00:00
|
|
|
{
|
2022-10-24 15:08:48 +00:00
|
|
|
gradient.clearStops();
|
2018-12-22 15:12:45 +00:00
|
|
|
}
|
2022-10-24 15:08:48 +00:00
|
|
|
else if ( isMonochrome() )
|
2022-03-29 09:14:23 +00:00
|
|
|
{
|
2022-10-24 15:08:48 +00:00
|
|
|
from = qMax( from, 0.0 );
|
|
|
|
to = qMin( to, 1.0 );
|
2022-03-29 09:14:23 +00:00
|
|
|
|
2022-10-24 15:08:48 +00:00
|
|
|
const auto color = m_stops.first().color();
|
2022-03-29 09:14:23 +00:00
|
|
|
|
2022-10-24 15:08:48 +00:00
|
|
|
gradient.setStops( { { from, color }, { to, color } } );
|
2017-10-17 15:34:00 +00:00
|
|
|
}
|
2022-10-24 15:08:48 +00:00
|
|
|
else
|
2017-10-17 15:34:00 +00:00
|
|
|
{
|
2022-10-24 15:08:48 +00:00
|
|
|
gradient.setStops( qskExtractedGradientStops( m_stops, from, to ) );
|
|
|
|
}
|
2017-10-17 15:34:00 +00:00
|
|
|
|
2022-10-24 15:08:48 +00:00
|
|
|
return gradient;
|
|
|
|
}
|
2017-10-17 15:34:00 +00:00
|
|
|
|
2022-10-24 15:08:48 +00:00
|
|
|
QskGradient QskGradient::interpolated( const QskGradient& to, qreal ratio ) const
|
|
|
|
{
|
|
|
|
if ( !isValid() && !to.isValid() )
|
|
|
|
return to;
|
2017-10-17 15:34:00 +00:00
|
|
|
|
2022-10-24 15:08:48 +00:00
|
|
|
QskGradient gradient;
|
2017-10-17 15:34:00 +00:00
|
|
|
|
2022-10-24 15:08:48 +00:00
|
|
|
if ( qskCanBeInterpolated( *this, to ) )
|
2017-10-17 15:34:00 +00:00
|
|
|
{
|
2022-10-31 13:42:08 +00:00
|
|
|
// We simply interpolate stops and values
|
2017-10-17 15:34:00 +00:00
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
gradient = to;
|
2017-10-17 15:34:00 +00:00
|
|
|
|
2022-10-31 16:35:13 +00:00
|
|
|
const auto stops = qskInterpolatedGradientStops(
|
|
|
|
m_stops, isMonochrome(), to.m_stops, to.isMonochrome(), ratio );
|
|
|
|
|
|
|
|
gradient.setStops( stops );
|
2022-10-31 13:42:08 +00:00
|
|
|
|
|
|
|
for ( uint i = 0; i < sizeof( m_values ) / sizeof( m_values[0] ); i++ )
|
|
|
|
gradient.m_values[i] = m_values[i] + ratio * ( to.m_values[i] - m_values[i] );
|
2017-10-17 15:34:00 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
The interpolation is devided into 2 steps. First we
|
2022-10-24 15:08:48 +00:00
|
|
|
interpolate into a monochrome gradient and then
|
|
|
|
recolor the gradient towards the target gradient
|
|
|
|
This will always result in a smooth transition - even, when
|
|
|
|
interpolating between different gradient types
|
2017-10-17 15:34:00 +00:00
|
|
|
*/
|
|
|
|
|
2022-10-24 15:08:48 +00:00
|
|
|
const auto c = QskRgb::interpolated( startColor(), to.startColor(), 0.5 );
|
2017-10-17 15:34:00 +00:00
|
|
|
|
2022-10-24 15:08:48 +00:00
|
|
|
if ( ratio < 0.5 )
|
2017-10-17 15:34:00 +00:00
|
|
|
{
|
2022-10-24 15:08:48 +00:00
|
|
|
const auto r = 2.0 * ratio;
|
2017-10-17 15:34:00 +00:00
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
gradient = *this;
|
2022-10-24 15:08:48 +00:00
|
|
|
gradient.setStops( qskInterpolatedGradientStops( m_stops, c, r ) );
|
2017-10-17 15:34:00 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2022-10-24 15:08:48 +00:00
|
|
|
const auto r = 2.0 * ( ratio - 0.5 );
|
2017-10-17 15:34:00 +00:00
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
gradient = to;
|
2022-10-24 15:08:48 +00:00
|
|
|
gradient.setStops( qskInterpolatedGradientStops( c, to.m_stops, r ) );
|
2017-10-17 15:34:00 +00:00
|
|
|
}
|
|
|
|
}
|
2022-10-24 15:08:48 +00:00
|
|
|
|
|
|
|
return gradient;
|
2017-10-17 15:34:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
QVariant QskGradient::interpolate(
|
|
|
|
const QskGradient& from, const QskGradient& to, qreal progress )
|
|
|
|
{
|
|
|
|
return QVariant::fromValue( from.interpolated( to, progress ) );
|
|
|
|
}
|
|
|
|
|
2022-10-24 14:02:46 +00:00
|
|
|
void QskGradient::clearStops()
|
|
|
|
{
|
|
|
|
if ( !m_stops.isEmpty() )
|
|
|
|
{
|
|
|
|
m_stops.clear();
|
|
|
|
m_isDirty = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
QskHashValue QskGradient::hash( QskHashValue seed ) const
|
|
|
|
{
|
2022-10-31 13:42:08 +00:00
|
|
|
auto hash = qHashBits( &m_type, sizeof( m_type ), seed );
|
|
|
|
|
|
|
|
if ( m_type != Stops )
|
|
|
|
hash = qHashBits( m_values, sizeof( m_values ), seed );
|
2022-10-24 14:02:46 +00:00
|
|
|
|
|
|
|
for ( const auto& stop : m_stops )
|
|
|
|
hash = stop.hash( hash );
|
|
|
|
|
|
|
|
return hash;
|
|
|
|
}
|
|
|
|
|
2022-11-13 09:09:18 +00:00
|
|
|
void QskGradient::setLinear( const QVector< qreal >& params )
|
|
|
|
{
|
|
|
|
Q_ASSERT( params.size() == 4 );
|
|
|
|
|
|
|
|
m_type = Linear;
|
|
|
|
|
|
|
|
m_values[0] = params[0];
|
|
|
|
m_values[1] = params[1];
|
|
|
|
m_values[2] = params[2];
|
|
|
|
m_values[3] = params[3];
|
|
|
|
}
|
|
|
|
|
|
|
|
QVector< qreal > QskGradient::linear() const
|
|
|
|
{
|
|
|
|
Q_ASSERT( m_type == Linear );
|
|
|
|
return { m_values[0], m_values[1], m_values[2], m_values[3] };
|
|
|
|
}
|
|
|
|
|
|
|
|
void QskGradient::setRadial( const QVector< qreal >& params )
|
|
|
|
{
|
|
|
|
Q_ASSERT( params.size() == 3 );
|
|
|
|
|
|
|
|
m_type = Radial;
|
|
|
|
|
|
|
|
m_values[0] = params[0];
|
|
|
|
m_values[1] = params[1];
|
|
|
|
m_values[2] = params[2];
|
|
|
|
m_values[3] = 0.0;
|
|
|
|
}
|
|
|
|
|
|
|
|
QVector< qreal > QskGradient::radial() const
|
|
|
|
{
|
|
|
|
Q_ASSERT( m_type == Radial );
|
|
|
|
return { m_values[0], m_values[1], m_values[2] };
|
|
|
|
}
|
|
|
|
|
|
|
|
void QskGradient::setConic( const QVector< qreal >& params )
|
|
|
|
{
|
|
|
|
Q_ASSERT( params.size() >= 2 && params.size() <= 4 );
|
|
|
|
|
|
|
|
m_type = Linear;
|
|
|
|
|
|
|
|
m_values[0] = params[0];
|
|
|
|
m_values[1] = params[1];
|
|
|
|
|
|
|
|
if ( params.size() > 2 )
|
|
|
|
m_values[2] = params[2];
|
|
|
|
else
|
|
|
|
m_values[2] = 0.0;
|
|
|
|
|
|
|
|
if ( params.size() == 4 )
|
|
|
|
m_values[3] = params[3];
|
|
|
|
else
|
|
|
|
m_values[2] = 360.0;
|
|
|
|
}
|
|
|
|
|
|
|
|
QVector< qreal > QskGradient::conic() const
|
|
|
|
{
|
|
|
|
Q_ASSERT( m_type == Conic );
|
|
|
|
return { m_values[0], m_values[1], m_values[2], m_values[3] };
|
|
|
|
}
|
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
#include "QskLinearGradient.h"
|
|
|
|
#include "QskRadialGradient.h"
|
|
|
|
#include "QskConicGradient.h"
|
|
|
|
|
|
|
|
QskLinearGradient& QskGradient::asLinearGradient()
|
|
|
|
{
|
|
|
|
assert( m_type == QskGradient::Linear );
|
|
|
|
return *reinterpret_cast< QskLinearGradient* >( this );
|
|
|
|
}
|
|
|
|
|
|
|
|
const QskLinearGradient& QskGradient::asLinearGradient() const
|
|
|
|
{
|
|
|
|
assert( m_type == QskGradient::Linear );
|
|
|
|
return *reinterpret_cast< const QskLinearGradient* >( this );
|
|
|
|
}
|
|
|
|
|
|
|
|
QskRadialGradient& QskGradient::asRadialGradient()
|
|
|
|
{
|
|
|
|
assert( m_type == QskGradient::Radial );
|
|
|
|
return *reinterpret_cast< QskRadialGradient* >( this );
|
|
|
|
}
|
|
|
|
|
|
|
|
const QskRadialGradient& QskGradient::asRadialGradient() const
|
|
|
|
{
|
|
|
|
assert( m_type == QskGradient::Radial );
|
|
|
|
return *reinterpret_cast< const QskRadialGradient* >( this );
|
|
|
|
}
|
|
|
|
|
|
|
|
QskConicGradient& QskGradient::asConicGradient()
|
|
|
|
{
|
|
|
|
assert( m_type == QskGradient::Conic );
|
|
|
|
return *reinterpret_cast< QskConicGradient* >( this );
|
|
|
|
}
|
|
|
|
|
|
|
|
const QskConicGradient& QskGradient::asConicGradient() const
|
|
|
|
{
|
|
|
|
assert( m_type == QskGradient::Conic );
|
|
|
|
return *reinterpret_cast< const QskConicGradient* >( this );
|
|
|
|
}
|
|
|
|
|
2017-07-21 16:21:34 +00:00
|
|
|
#ifndef QT_NO_DEBUG_STREAM
|
|
|
|
|
2018-07-19 12:10:48 +00:00
|
|
|
#include <qdebug.h>
|
|
|
|
|
2017-07-21 16:21:34 +00:00
|
|
|
QDebug operator<<( QDebug debug, const QskGradient& gradient )
|
|
|
|
{
|
2022-03-30 10:28:45 +00:00
|
|
|
QDebugStateSaver saver( debug );
|
|
|
|
debug.nospace();
|
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
debug << "QskGradient( ";
|
|
|
|
|
|
|
|
switch ( gradient.type() )
|
|
|
|
{
|
|
|
|
case QskGradient::Linear:
|
|
|
|
{
|
|
|
|
debug << "L(";
|
|
|
|
|
|
|
|
const auto& g = gradient.asLinearGradient();
|
|
|
|
debug << g.start().x() << "," << g.start().y()
|
|
|
|
<< "," << g.stop().x() << "," << g.stop().y() << ")";
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case QskGradient::Radial:
|
|
|
|
{
|
|
|
|
debug << "R(";
|
|
|
|
|
|
|
|
const auto& g = gradient.asRadialGradient();
|
|
|
|
|
|
|
|
debug << g.center().x() << "," << g.center().y()
|
|
|
|
<< "," << g.radius() << ")";
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case QskGradient::Conic:
|
|
|
|
{
|
|
|
|
debug << "C(";
|
|
|
|
|
|
|
|
const auto& g = gradient.asConicGradient();
|
2022-03-30 10:28:45 +00:00
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
debug << g.center().x() << "," << g.center().y()
|
|
|
|
<< ",[" << g.startAngle() << "," << g.spanAngle() << "])";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case QskGradient::Stops:
|
|
|
|
{
|
|
|
|
debug << "S()";
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( gradient.stops().isEmpty() )
|
2022-03-30 10:28:45 +00:00
|
|
|
{
|
2022-10-31 13:42:08 +00:00
|
|
|
debug << " ()";
|
2022-03-30 10:28:45 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if ( gradient.isMonochrome() )
|
|
|
|
{
|
2022-10-31 13:42:08 +00:00
|
|
|
debug << ' ';
|
|
|
|
const auto color = gradient.stops().first().color();
|
|
|
|
QskRgb::debugColor( debug, color );
|
2022-03-30 10:28:45 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2022-10-31 13:42:08 +00:00
|
|
|
debug << " ( ";
|
2022-03-30 10:28:45 +00:00
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
const auto& stops = gradient.stops();
|
|
|
|
for ( int i = 0; i < stops.count(); i++ )
|
2022-03-30 10:28:45 +00:00
|
|
|
{
|
2022-10-31 13:42:08 +00:00
|
|
|
if ( i != 0 )
|
|
|
|
debug << ", ";
|
|
|
|
|
|
|
|
debug << stops[i];
|
2022-03-30 10:28:45 +00:00
|
|
|
}
|
2022-10-31 13:42:08 +00:00
|
|
|
|
|
|
|
debug << " )";
|
2022-03-30 10:28:45 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-10-31 13:42:08 +00:00
|
|
|
switch( gradient.spread() )
|
|
|
|
{
|
|
|
|
case QGradient::RepeatSpread:
|
|
|
|
debug << " RP";
|
|
|
|
break;
|
|
|
|
|
|
|
|
case QGradient::ReflectSpread:
|
|
|
|
debug << " RF";
|
|
|
|
break;
|
|
|
|
|
|
|
|
case QGradient::PadSpread:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
debug << " )";
|
|
|
|
|
2017-07-21 16:21:34 +00:00
|
|
|
return debug;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "moc_QskGradient.cpp"
|