2011-06-24 10:41:16 -07:00
|
|
|
/* -*- Mode: C++; tab-width: 20; indent-tabs-mode: nil; c-basic-offset: 2 -*-
|
|
|
|
* ***** BEGIN LICENSE BLOCK *****
|
|
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
|
|
|
*
|
|
|
|
* The contents of this file are subject to the Mozilla Public License Version
|
|
|
|
* 1.1 (the "License"); you may not use this file except in compliance with
|
|
|
|
* the License. You may obtain a copy of the License at
|
|
|
|
* http://www.mozilla.org/MPL/
|
|
|
|
*
|
|
|
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
|
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
|
|
|
* for the specific language governing rights and limitations under the
|
|
|
|
* License.
|
|
|
|
*
|
|
|
|
* The Original Code is Mozilla Corporation code.
|
|
|
|
*
|
|
|
|
* The Initial Developer of the Original Code is Mozilla Foundation.
|
|
|
|
* Portions created by the Initial Developer are Copyright (C) 2011
|
|
|
|
* the Initial Developer. All Rights Reserved.
|
|
|
|
*
|
|
|
|
* Contributor(s):
|
|
|
|
* Bas Schouten <bschouten@mozilla.com>
|
|
|
|
*
|
|
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
|
|
* either the GNU General Public License Version 2 or later (the "GPL"), or
|
|
|
|
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
|
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
|
|
|
* use your version of this file under the terms of the MPL, indicate your
|
|
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
|
|
* the provisions above, a recipient may use your version of this file under
|
|
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
|
|
|
*
|
|
|
|
* ***** END LICENSE BLOCK ***** */
|
|
|
|
|
|
|
|
#ifndef MOZILLA_GFX_MATRIX_H_
|
|
|
|
#define MOZILLA_GFX_MATRIX_H_
|
|
|
|
|
|
|
|
#include "Types.h"
|
|
|
|
#include "Rect.h"
|
|
|
|
#include "Point.h"
|
|
|
|
#include <math.h>
|
|
|
|
|
|
|
|
namespace mozilla {
|
|
|
|
namespace gfx {
|
|
|
|
|
|
|
|
class Matrix
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
Matrix()
|
|
|
|
: _11(1.0f), _12(0)
|
|
|
|
, _21(0), _22(1.0f)
|
|
|
|
, _31(0), _32(0)
|
|
|
|
{}
|
|
|
|
Matrix(Float a11, Float a12, Float a21, Float a22, Float a31, Float a32)
|
|
|
|
: _11(a11), _12(a12)
|
|
|
|
, _21(a21), _22(a22)
|
|
|
|
, _31(a31), _32(a32)
|
|
|
|
{}
|
|
|
|
Float _11, _12;
|
|
|
|
Float _21, _22;
|
|
|
|
Float _31, _32;
|
|
|
|
|
|
|
|
Point operator *(const Point &aPoint) const
|
|
|
|
{
|
|
|
|
Point retPoint;
|
|
|
|
|
|
|
|
retPoint.x = aPoint.x * _11 + aPoint.y * _21 + _31;
|
|
|
|
retPoint.y = aPoint.x * _12 + aPoint.y * _22 + _32;
|
|
|
|
|
|
|
|
return retPoint;
|
|
|
|
}
|
|
|
|
|
2012-01-04 23:17:51 -08:00
|
|
|
Size operator *(const Size &aSize) const
|
|
|
|
{
|
|
|
|
Size retSize;
|
|
|
|
|
|
|
|
retSize.width = aSize.width * _11 + aSize.height * _21;
|
|
|
|
retSize.height = aSize.width * _12 + aSize.height * _22;
|
|
|
|
|
|
|
|
return retSize;
|
|
|
|
}
|
|
|
|
|
2012-05-03 12:21:52 -07:00
|
|
|
GFX2D_API Rect TransformBounds(const Rect& rect) const;
|
2011-06-24 10:41:16 -07:00
|
|
|
|
|
|
|
// Apply a scale to this matrix. This scale will be applied -before- the
|
|
|
|
// existing transformation of the matrix.
|
|
|
|
Matrix &Scale(Float aX, Float aY)
|
|
|
|
{
|
|
|
|
_11 *= aX;
|
|
|
|
_12 *= aX;
|
|
|
|
_21 *= aY;
|
|
|
|
_22 *= aY;
|
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
Matrix &Translate(Float aX, Float aY)
|
|
|
|
{
|
|
|
|
_31 += _11 * aX + _21 * aY;
|
|
|
|
_32 += _12 * aX + _22 * aY;
|
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Invert()
|
|
|
|
{
|
|
|
|
// Compute co-factors.
|
|
|
|
Float A = _22;
|
|
|
|
Float B = -_21;
|
|
|
|
Float C = _21 * _32 - _22 * _31;
|
|
|
|
Float D = -_12;
|
|
|
|
Float E = _11;
|
|
|
|
Float F = _31 * _12 - _11 * _32;
|
|
|
|
|
|
|
|
Float det = Determinant();
|
|
|
|
|
|
|
|
if (!det) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
Float inv_det = 1 / det;
|
|
|
|
|
|
|
|
_11 = inv_det * A;
|
|
|
|
_12 = inv_det * D;
|
|
|
|
_21 = inv_det * B;
|
|
|
|
_22 = inv_det * E;
|
|
|
|
_31 = inv_det * C;
|
|
|
|
_32 = inv_det * F;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
Float Determinant() const
|
|
|
|
{
|
|
|
|
return _11 * _22 - _12 * _21;
|
|
|
|
}
|
|
|
|
|
2012-05-03 12:21:52 -07:00
|
|
|
GFX2D_API static Matrix Rotation(Float aAngle);
|
2011-06-24 10:41:16 -07:00
|
|
|
|
|
|
|
Matrix operator*(const Matrix &aMatrix) const
|
|
|
|
{
|
|
|
|
Matrix resultMatrix;
|
|
|
|
|
|
|
|
resultMatrix._11 = this->_11 * aMatrix._11 + this->_12 * aMatrix._21;
|
|
|
|
resultMatrix._12 = this->_11 * aMatrix._12 + this->_12 * aMatrix._22;
|
|
|
|
resultMatrix._21 = this->_21 * aMatrix._11 + this->_22 * aMatrix._21;
|
|
|
|
resultMatrix._22 = this->_21 * aMatrix._12 + this->_22 * aMatrix._22;
|
|
|
|
resultMatrix._31 = this->_31 * aMatrix._11 + this->_32 * aMatrix._21 + aMatrix._31;
|
|
|
|
resultMatrix._32 = this->_31 * aMatrix._12 + this->_32 * aMatrix._22 + aMatrix._32;
|
|
|
|
|
|
|
|
return resultMatrix;
|
|
|
|
}
|
2011-12-27 21:56:11 -08:00
|
|
|
|
2012-01-04 15:02:59 -08:00
|
|
|
/* Returns true if the other matrix is fuzzy-equal to this matrix.
|
|
|
|
* Note that this isn't a cheap comparison!
|
|
|
|
*/
|
|
|
|
bool operator==(const Matrix& other) const
|
|
|
|
{
|
|
|
|
return FuzzyEqual(_11, other._11) && FuzzyEqual(_12, other._12) &&
|
|
|
|
FuzzyEqual(_21, other._21) && FuzzyEqual(_22, other._22) &&
|
|
|
|
FuzzyEqual(_31, other._31) && FuzzyEqual(_32, other._32);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator!=(const Matrix& other) const
|
|
|
|
{
|
|
|
|
return !(*this == other);
|
|
|
|
}
|
|
|
|
|
2011-12-27 21:56:11 -08:00
|
|
|
/* Returns true if the matrix is a rectilinear transformation (i.e.
|
|
|
|
* grid-aligned rectangles are transformed to grid-aligned rectangles)
|
|
|
|
*/
|
|
|
|
bool IsRectilinear() {
|
|
|
|
if (FuzzyEqual(_12, 0) && FuzzyEqual(_21, 0)) {
|
|
|
|
return true;
|
|
|
|
} else if (FuzzyEqual(_22, 0) && FuzzyEqual(_11, 0)) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
2012-01-04 15:02:59 -08:00
|
|
|
|
|
|
|
/* Returns true if the matrix is an identity matrix.
|
|
|
|
*/
|
|
|
|
bool IsIdentity() const
|
|
|
|
{
|
|
|
|
return _11 == 1.0f && _12 == 0.0f &&
|
|
|
|
_21 == 0.0f && _22 == 1.0f &&
|
|
|
|
_31 == 0.0f && _32 == 0.0f;
|
|
|
|
}
|
|
|
|
|
2011-12-27 21:56:11 -08:00
|
|
|
private:
|
|
|
|
static bool FuzzyEqual(Float aV1, Float aV2) {
|
|
|
|
// XXX - Check if fabs does the smart thing and just negates the sign bit.
|
|
|
|
return fabs(aV2 - aV1) < 1e-6;
|
|
|
|
}
|
2011-06-24 10:41:16 -07:00
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* MOZILLA_GFX_MATRIX_H_ */
|