Adding upstream version 4:7.4.7.upstream/4%7.4.7upstream

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>

1 files changed, 117 insertions, 0 deletions

diff --git a/basegfx/source/curve/b2dbeziertools.cxx b/basegfx/source/curve/b2dbeziertools.cxx
new file mode 100644
index 000000000..8fd4c4b84
--- /dev/null
+++ b/basegfx/source/curve/b2dbeziertools.cxx
@@ -0,0 +1,117 @@
+/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
+/*
+ * This file is part of the LibreOffice project.
+ *
+ * This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/.
+ *
+ * This file incorporates work covered by the following license notice:
+ *
+ *   Licensed to the Apache Software Foundation (ASF) under one or more
+ *   contributor license agreements. See the NOTICE file distributed
+ *   with this work for additional information regarding copyright
+ *   ownership. The ASF licenses this file to you under the Apache
+ *   License, Version 2.0 (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.apache.org/licenses/LICENSE-2.0 .
+ */
+
+#include <basegfx/curve/b2dbeziertools.hxx>
+#include <basegfx/curve/b2dcubicbezier.hxx>
+#include <algorithm>
+
+namespace basegfx
+{
+    B2DCubicBezierHelper::B2DCubicBezierHelper(const B2DCubicBezier& rBase, sal_uInt32 nDivisions)
+    :   mnEdgeCount(0)
+    {
+        const bool bIsBezier(rBase.isBezier());
+
+        if(bIsBezier)
+        {
+            // check nDivisions; at least one is needed, but also prevent too big values
+            if(nDivisions < 1)
+            {
+                nDivisions = 1;
+            }
+            else if(nDivisions > 1000)
+            {
+                nDivisions = 1000;
+            }
+
+            // set nEdgeCount
+            mnEdgeCount = nDivisions + 1;
+
+            // fill in maLengthArray
+            maLengthArray.clear();
+            maLengthArray.reserve(mnEdgeCount);
+            B2DPoint aCurrent(rBase.getStartPoint());
+            double fLength(0.0);
+
+            for(sal_uInt32 a(1);;)
+            {
+                const B2DPoint aNext(rBase.interpolatePoint(static_cast<double>(a) / static_cast<double>(mnEdgeCount)));
+                const B2DVector aEdge(aNext - aCurrent);
+
+                fLength += aEdge.getLength();
+                maLengthArray.push_back(fLength);
+
+                if(++a < mnEdgeCount)
+                {
+                    aCurrent = aNext;
+                }
+                else
+                {
+                    const B2DPoint& aLastNext(rBase.getEndPoint());
+                    const B2DVector aLastEdge(aLastNext - aNext);
+
+                    fLength += aLastEdge.getLength();
+                    maLengthArray.push_back(fLength);
+                    break;
+                }
+            }
+        }
+        else
+        {
+            maLengthArray.clear();
+            maLengthArray.push_back(rBase.getEdgeLength());
+            mnEdgeCount = 1;
+        }
+    }
+
+    double B2DCubicBezierHelper::distanceToRelative(double fDistance) const
+    {
+        if(fDistance <= 0.0)
+        {
+            return 0.0;
+        }
+
+        const double fLength(getLength());
+
+        if(fTools::moreOrEqual(fDistance, fLength))
+        {
+            return 1.0;
+        }
+
+        // fDistance is in ]0.0 .. fLength[
+
+        if(mnEdgeCount == 1)
+        {
+            // not a bezier, linear edge
+            return fDistance / fLength;
+        }
+
+        // it is a bezier
+        std::vector< double >::const_iterator aIter = std::lower_bound(maLengthArray.begin(), maLengthArray.end(), fDistance);
+        const sal_uInt32 nIndex(aIter - maLengthArray.begin());
+        const double fHighBound(maLengthArray[nIndex]);
+        const double fLowBound(nIndex ?  maLengthArray[nIndex - 1] : 0.0);
+        const double fLinearInterpolatedLength((fDistance - fLowBound) / (fHighBound - fLowBound));
+
+        return (static_cast< double >(nIndex) + fLinearInterpolatedLength) / static_cast< double >(mnEdgeCount);
+    }
+
+} // end of namespace basegfx
+
+/* vim:set shiftwidth=4 softtabstop=4 expandtab: */