2004-01-16 09:39:11 +00:00
|
|
|
/*************************************************************************
|
|
|
|
*
|
2008-04-10 18:08:09 +00:00
|
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
2004-01-16 09:39:11 +00:00
|
|
|
*
|
2010-02-12 15:01:35 +01:00
|
|
|
* Copyright 2000, 2010 Oracle and/or its affiliates.
|
2004-01-16 09:39:11 +00:00
|
|
|
*
|
2008-04-10 18:08:09 +00:00
|
|
|
* OpenOffice.org - a multi-platform office productivity suite
|
2004-01-16 09:39:11 +00:00
|
|
|
*
|
2008-04-10 18:08:09 +00:00
|
|
|
* This file is part of OpenOffice.org.
|
2004-01-16 09:39:11 +00:00
|
|
|
*
|
2008-04-10 18:08:09 +00:00
|
|
|
* OpenOffice.org is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU Lesser General Public License version 3
|
|
|
|
* only, as published by the Free Software Foundation.
|
2004-01-16 09:39:11 +00:00
|
|
|
*
|
2008-04-10 18:08:09 +00:00
|
|
|
* OpenOffice.org is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU Lesser General Public License version 3 for more details
|
|
|
|
* (a copy is included in the LICENSE file that accompanied this code).
|
2004-01-16 09:39:11 +00:00
|
|
|
*
|
2008-04-10 18:08:09 +00:00
|
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
|
|
* version 3 along with OpenOffice.org. If not, see
|
|
|
|
* <http://www.openoffice.org/license.html>
|
|
|
|
* for a copy of the LGPLv3 License.
|
2004-01-16 09:39:11 +00:00
|
|
|
*
|
|
|
|
************************************************************************/
|
|
|
|
|
2006-09-17 07:07:43 +00:00
|
|
|
// MARKER(update_precomp.py): autogen include statement, do not remove
|
|
|
|
#include "precompiled_basegfx.hxx"
|
2004-01-16 09:39:11 +00:00
|
|
|
#include <basegfx/tuple/b2ituple.hxx>
|
2004-02-25 08:54:11 +00:00
|
|
|
#include <basegfx/tuple/b2dtuple.hxx>
|
2004-06-25 16:19:01 +00:00
|
|
|
#include <rtl/instance.hxx>
|
|
|
|
|
|
|
|
namespace { struct EmptyTuple : public rtl::Static<basegfx::B2ITuple, EmptyTuple> {}; }
|
2004-01-16 09:39:11 +00:00
|
|
|
|
|
|
|
namespace basegfx
|
|
|
|
{
|
2004-06-25 16:19:01 +00:00
|
|
|
const B2ITuple& B2ITuple::getEmptyTuple()
|
|
|
|
{
|
|
|
|
return EmptyTuple::get();
|
|
|
|
}
|
2004-01-16 09:39:11 +00:00
|
|
|
|
2004-02-25 08:54:11 +00:00
|
|
|
// external operators
|
|
|
|
//////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
B2ITuple minimum(const B2ITuple& rTupA, const B2ITuple& rTupB)
|
|
|
|
{
|
|
|
|
B2ITuple aMin(
|
|
|
|
(rTupB.getX() < rTupA.getX()) ? rTupB.getX() : rTupA.getX(),
|
|
|
|
(rTupB.getY() < rTupA.getY()) ? rTupB.getY() : rTupA.getY());
|
|
|
|
return aMin;
|
|
|
|
}
|
|
|
|
|
|
|
|
B2ITuple maximum(const B2ITuple& rTupA, const B2ITuple& rTupB)
|
|
|
|
{
|
|
|
|
B2ITuple aMax(
|
|
|
|
(rTupB.getX() > rTupA.getX()) ? rTupB.getX() : rTupA.getX(),
|
|
|
|
(rTupB.getY() > rTupA.getY()) ? rTupB.getY() : rTupA.getY());
|
|
|
|
return aMax;
|
|
|
|
}
|
|
|
|
|
|
|
|
B2ITuple absolute(const B2ITuple& rTup)
|
|
|
|
{
|
|
|
|
B2ITuple aAbs(
|
|
|
|
(0 > rTup.getX()) ? -rTup.getX() : rTup.getX(),
|
|
|
|
(0 > rTup.getY()) ? -rTup.getY() : rTup.getY());
|
|
|
|
return aAbs;
|
|
|
|
}
|
|
|
|
|
|
|
|
B2DTuple interpolate(const B2ITuple& rOld1, const B2ITuple& rOld2, double t)
|
|
|
|
{
|
|
|
|
B2DTuple aInt(
|
|
|
|
((rOld2.getX() - rOld1.getX()) * t) + rOld1.getX(),
|
|
|
|
((rOld2.getY() - rOld1.getY()) * t) + rOld1.getY());
|
|
|
|
return aInt;
|
|
|
|
}
|
|
|
|
|
|
|
|
B2DTuple average(const B2ITuple& rOld1, const B2ITuple& rOld2)
|
|
|
|
{
|
|
|
|
B2DTuple aAvg(
|
|
|
|
(rOld1.getX() + rOld2.getX()) * 0.5,
|
|
|
|
(rOld1.getY() + rOld2.getY()) * 0.5);
|
|
|
|
return aAvg;
|
|
|
|
}
|
|
|
|
|
|
|
|
B2DTuple average(const B2ITuple& rOld1, const B2ITuple& rOld2, const B2ITuple& rOld3)
|
|
|
|
{
|
|
|
|
B2DTuple aAvg(
|
|
|
|
(rOld1.getX() + rOld2.getX() + rOld3.getX()) * (1.0 / 3.0),
|
|
|
|
(rOld1.getY() + rOld2.getY() + rOld3.getY()) * (1.0 / 3.0));
|
|
|
|
return aAvg;
|
|
|
|
}
|
|
|
|
|
|
|
|
B2ITuple operator+(const B2ITuple& rTupA, const B2ITuple& rTupB)
|
|
|
|
{
|
|
|
|
B2ITuple aSum(rTupA);
|
|
|
|
aSum += rTupB;
|
|
|
|
return aSum;
|
|
|
|
}
|
|
|
|
|
|
|
|
B2ITuple operator-(const B2ITuple& rTupA, const B2ITuple& rTupB)
|
|
|
|
{
|
|
|
|
B2ITuple aSub(rTupA);
|
|
|
|
aSub -= rTupB;
|
|
|
|
return aSub;
|
|
|
|
}
|
|
|
|
|
|
|
|
B2ITuple operator/(const B2ITuple& rTupA, const B2ITuple& rTupB)
|
|
|
|
{
|
|
|
|
B2ITuple aDiv(rTupA);
|
|
|
|
aDiv /= rTupB;
|
|
|
|
return aDiv;
|
|
|
|
}
|
|
|
|
|
|
|
|
B2ITuple operator*(const B2ITuple& rTupA, const B2ITuple& rTupB)
|
|
|
|
{
|
|
|
|
B2ITuple aMul(rTupA);
|
|
|
|
aMul *= rTupB;
|
|
|
|
return aMul;
|
|
|
|
}
|
|
|
|
|
|
|
|
B2ITuple operator*(const B2ITuple& rTup, sal_Int32 t)
|
|
|
|
{
|
|
|
|
B2ITuple aNew(rTup);
|
|
|
|
aNew *= t;
|
|
|
|
return aNew;
|
|
|
|
}
|
|
|
|
|
|
|
|
B2ITuple operator*(sal_Int32 t, const B2ITuple& rTup)
|
|
|
|
{
|
|
|
|
B2ITuple aNew(rTup);
|
|
|
|
aNew *= t;
|
|
|
|
return aNew;
|
|
|
|
}
|
|
|
|
|
|
|
|
B2ITuple operator/(const B2ITuple& rTup, sal_Int32 t)
|
|
|
|
{
|
|
|
|
B2ITuple aNew(rTup);
|
|
|
|
aNew /= t;
|
|
|
|
return aNew;
|
|
|
|
}
|
|
|
|
|
|
|
|
B2ITuple operator/(sal_Int32 t, const B2ITuple& rTup)
|
|
|
|
{
|
|
|
|
B2ITuple aNew(t, t);
|
|
|
|
B2ITuple aTmp(rTup);
|
|
|
|
aNew /= aTmp;
|
|
|
|
return aNew;
|
|
|
|
}
|
|
|
|
|
2004-01-16 09:39:11 +00:00
|
|
|
} // end of namespace basegfx
|
|
|
|
|
|
|
|
// eof
|