8c39cbeab9949a0a7d6ae66b768a7352019e42f8johanengelen

072916d0ef7dccd696b59381f50bcf776abccefbjohanengelen

dc98accfae7a38326b92d74fa4330ac8ccb5b778jfbarraud

dc98accfae7a38326b92d74fa4330ac8ccb5b778jfbarraud#ifdef HAVE_CONFIG_H

dc98accfae7a38326b92d74fa4330ac8ccb5b778jfbarraud# include <config.h>

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#endif

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include "odf.h"

8d9f5d586a04809427ce1df284a5720112177991cilix

c169f6cddd2da06cfb761339f445bbd8866f72a8buliabyak#include <stdio.h>

0563fd55cbad59e8a878e6d4cbbdd8e47f74488djohanengelen#include <time.h>

0cc5b8d2f7b87c4222ee3662071bef1cb1f22b06bgk#include <vector>

0563fd55cbad59e8a878e6d4cbbdd8e47f74488djohanengelen#include <math.h>

f4db63be4e929f4706410914295deccaceea19cdcilix

e54ce05030e6aab675331e18f46f029f55ed1bf0cilix#include "clear-n_.h"

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include "inkscape.h"

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen#include <style.h>

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen#include "display/curve.h"

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include <2geom/pathvector.h>

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include <2geom/curves.h>

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include <2geom/transforms.h>

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include <helper/geom.h>

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include "helper/geom-curves.h"

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include "extension/system.h"

072916d0ef7dccd696b59381f50bcf776abccefbjohanengelen

8c39cbeab9949a0a7d6ae66b768a7352019e42f8johanengelen#include "xml/repr.h"

dc98accfae7a38326b92d74fa4330ac8ccb5b778jfbarraud#include "xml/attribute-record.h"

dc98accfae7a38326b92d74fa4330ac8ccb5b778jfbarraud#include "sp-image.h"

dc98accfae7a38326b92d74fa4330ac8ccb5b778jfbarraud#include "sp-gradient.h"

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include "sp-stop.h"

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include "gradient-chemistry.h"

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include "sp-linear-gradient.h"

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include "sp-radial-gradient.h"

0563fd55cbad59e8a878e6d4cbbdd8e47f74488djohanengelen#include "sp-path.h"

8d9f5d586a04809427ce1df284a5720112177991cilix#include "sp-text.h"

70eb1fc448cb08acf3468f80fa2296c03b32afd2cilix#include "sp-flowtext.h"

c169f6cddd2da06cfb761339f445bbd8866f72a8buliabyak#include "svg/svg.h"

0563fd55cbad59e8a878e6d4cbbdd8e47f74488djohanengelen#include "text-editing.h"

0cc5b8d2f7b87c4222ee3662071bef1cb1f22b06bgk#include "util/units.h"

0563fd55cbad59e8a878e6d4cbbdd8e47f74488djohanengelen

f4db63be4e929f4706410914295deccaceea19cdcilix#include "uri.h"

0563fd55cbad59e8a878e6d4cbbdd8e47f74488djohanengelen

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include "inkscape-version.h"

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include "document.h"

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include "extension/extension.h"

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include "io/inkscapestream.h"

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include "io/bufferstream.h"

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include <util/ziptool.h>

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include <iomanip>

8c39cbeab9949a0a7d6ae66b768a7352019e42f8johanengelennamespace Inkscape

92fe3142613d000eff89db8a983b3b18b14eee79johanengelen{

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrmnamespace Extension

072916d0ef7dccd696b59381f50bcf776abccefbjohanengelen{

92fe3142613d000eff89db8a983b3b18b14eee79johanengelennamespace Internal

42e99769805c14a5cc01c805faa3c3b03f9dd1c0johanengelen{

92fe3142613d000eff89db8a983b3b18b14eee79johanengelentypedef Inkscape::IO::BufferOutputStream BufferOutputStream;

dc98accfae7a38326b92d74fa4330ac8ccb5b778jfbarraudtypedef Inkscape::IO::OutputStreamWriter OutputStreamWriter;

dc98accfae7a38326b92d74fa4330ac8ccb5b778jfbarraudtypedef Inkscape::IO::StringOutputStream StringOutputStream;

92fe3142613d000eff89db8a983b3b18b14eee79johanengelen

dc98accfae7a38326b92d74fa4330ac8ccb5b778jfbarraud

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm#include <math.h>

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

92fe3142613d000eff89db8a983b3b18b14eee79johanengelenclass SVDMatrix

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm{

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrmpublic:

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

92fe3142613d000eff89db8a983b3b18b14eee79johanengelen SVDMatrix()

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm {

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm init();

92fe3142613d000eff89db8a983b3b18b14eee79johanengelen }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

0563fd55cbad59e8a878e6d4cbbdd8e47f74488djohanengelen SVDMatrix(unsigned int rowSize, unsigned int colSize)

0563fd55cbad59e8a878e6d4cbbdd8e47f74488djohanengelen {

0563fd55cbad59e8a878e6d4cbbdd8e47f74488djohanengelen init();

0563fd55cbad59e8a878e6d4cbbdd8e47f74488djohanengelen rows = rowSize;

0563fd55cbad59e8a878e6d4cbbdd8e47f74488djohanengelen cols = colSize;

0563fd55cbad59e8a878e6d4cbbdd8e47f74488djohanengelen size = rows * cols;

8d9f5d586a04809427ce1df284a5720112177991cilix d = new double[size];

92fe3142613d000eff89db8a983b3b18b14eee79johanengelen for (unsigned int i=0 ; i<size ; i++)

8d9f5d586a04809427ce1df284a5720112177991cilix d[i] = 0.0;

70eb1fc448cb08acf3468f80fa2296c03b32afd2cilix }

92fe3142613d000eff89db8a983b3b18b14eee79johanengelen

70eb1fc448cb08acf3468f80fa2296c03b32afd2cilix SVDMatrix(double *vals, unsigned int rowSize, unsigned int colSize)

c169f6cddd2da06cfb761339f445bbd8866f72a8buliabyak {

c169f6cddd2da06cfb761339f445bbd8866f72a8buliabyak init();

c169f6cddd2da06cfb761339f445bbd8866f72a8buliabyak rows = rowSize;

6f4a90e526af850ffc36064f58f09c190f3b633fjohanengelen cols = colSize;

6f4a90e526af850ffc36064f58f09c190f3b633fjohanengelen size = rows * cols;

6f4a90e526af850ffc36064f58f09c190f3b633fjohanengelen d = new double[size];

f4db63be4e929f4706410914295deccaceea19cdcilix for (unsigned int i=0 ; i<size ; i++)

f4db63be4e929f4706410914295deccaceea19cdcilix d[i] = vals[i];

f4db63be4e929f4706410914295deccaceea19cdcilix }

ab99111a42436818e6902e044c8f3af2b724263bcilix

ab99111a42436818e6902e044c8f3af2b724263bcilix

ab99111a42436818e6902e044c8f3af2b724263bcilix SVDMatrix(const SVDMatrix &other)

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm {

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm init();

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm assign(other);

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm SVDMatrix &operator=(const SVDMatrix &other)

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm {

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm assign(other);

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm return *this;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm virtual ~SVDMatrix()

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm {

6656f193fdace606d1b162d6dea0223bc295f0a6cilix delete[] d;

6656f193fdace606d1b162d6dea0223bc295f0a6cilix }

6656f193fdace606d1b162d6dea0223bc295f0a6cilix

6656f193fdace606d1b162d6dea0223bc295f0a6cilix double& operator() (unsigned int row, unsigned int col)

6656f193fdace606d1b162d6dea0223bc295f0a6cilix {

6656f193fdace606d1b162d6dea0223bc295f0a6cilix if (row >= rows || col >= cols)

6656f193fdace606d1b162d6dea0223bc295f0a6cilix return badval;

6656f193fdace606d1b162d6dea0223bc295f0a6cilix return d[cols*row + col];

6656f193fdace606d1b162d6dea0223bc295f0a6cilix }

6656f193fdace606d1b162d6dea0223bc295f0a6cilix

6656f193fdace606d1b162d6dea0223bc295f0a6cilix double operator() (unsigned int row, unsigned int col) const

6656f193fdace606d1b162d6dea0223bc295f0a6cilix {

6656f193fdace606d1b162d6dea0223bc295f0a6cilix if (row >= rows || col >= cols)

6656f193fdace606d1b162d6dea0223bc295f0a6cilix return badval;

6656f193fdace606d1b162d6dea0223bc295f0a6cilix return d[cols*row + col];

6656f193fdace606d1b162d6dea0223bc295f0a6cilix }

6656f193fdace606d1b162d6dea0223bc295f0a6cilix

6656f193fdace606d1b162d6dea0223bc295f0a6cilix unsigned int getRows()

6656f193fdace606d1b162d6dea0223bc295f0a6cilix {

6656f193fdace606d1b162d6dea0223bc295f0a6cilix return rows;

6656f193fdace606d1b162d6dea0223bc295f0a6cilix }

6656f193fdace606d1b162d6dea0223bc295f0a6cilix

6656f193fdace606d1b162d6dea0223bc295f0a6cilix unsigned int getCols()

6656f193fdace606d1b162d6dea0223bc295f0a6cilix {

6656f193fdace606d1b162d6dea0223bc295f0a6cilix return cols;

6656f193fdace606d1b162d6dea0223bc295f0a6cilix }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

fbb4eb8b63e74d9441220a73a8ca858425be4bd4johanengelen SVDMatrix multiply(const SVDMatrix &other)

71146abe8aba032d73788a625fee5769a581bd3ccilix {

fbb4eb8b63e74d9441220a73a8ca858425be4bd4johanengelen if (cols != other.rows)

fbb4eb8b63e74d9441220a73a8ca858425be4bd4johanengelen {

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm SVDMatrix dummy;

71146abe8aba032d73788a625fee5769a581bd3ccilix return dummy;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm SVDMatrix result(rows, other.cols);

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm for (unsigned int i=0 ; i<rows ; i++)

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm {

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm for (unsigned int j=0 ; j<other.cols ; j++)

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm {

eaa9bdc7bf7b73397e536edd47490d84e4420bd8bryce double sum = 0.0;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm for (unsigned int k=0 ; k<cols ; k++)

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm {

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm //sum += a[i][k] * b[k][j];

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm sum += d[i*cols +k] * other(k, j);

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm result(i, j) = sum;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

c90010388b0d4045c26e81c2be28beedcb36c7d3cilix }

c90010388b0d4045c26e81c2be28beedcb36c7d3cilix return result;

c90010388b0d4045c26e81c2be28beedcb36c7d3cilix }

c90010388b0d4045c26e81c2be28beedcb36c7d3cilix

c90010388b0d4045c26e81c2be28beedcb36c7d3cilix SVDMatrix transpose()

262d0c3f05130d86368d95f110aa8ccab5f83e5ccilix {

262d0c3f05130d86368d95f110aa8ccab5f83e5ccilix SVDMatrix result(cols, rows);

262d0c3f05130d86368d95f110aa8ccab5f83e5ccilix for (unsigned int i=0 ; i<rows ; i++){

262d0c3f05130d86368d95f110aa8ccab5f83e5ccilix for (unsigned int j=0 ; j<cols ; j++){

262d0c3f05130d86368d95f110aa8ccab5f83e5ccilix result(j, i) = d[i*cols + j];

262d0c3f05130d86368d95f110aa8ccab5f83e5ccilix }

23d859f2ce09c04ed802cb4912cc9c50f512f0a2bgk }

2d107ef9730aff3f4d776ae0c2f7d983e289ce02joncruz return result;

23d859f2ce09c04ed802cb4912cc9c50f512f0a2bgk }

23d859f2ce09c04ed802cb4912cc9c50f512f0a2bgk

23d859f2ce09c04ed802cb4912cc9c50f512f0a2bgkprivate:

23d859f2ce09c04ed802cb4912cc9c50f512f0a2bgk

23d859f2ce09c04ed802cb4912cc9c50f512f0a2bgk

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm virtual void init()

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm {

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm badval = 0.0;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm d = NULL;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm rows = 0;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm cols = 0;

dda97aeba7480d08320ebceecae13b8531db1b81johanengelen size = 0;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

dda97aeba7480d08320ebceecae13b8531db1b81johanengelen

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm void assign(const SVDMatrix &other)

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm {

dda97aeba7480d08320ebceecae13b8531db1b81johanengelen if (d)

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm {

dda97aeba7480d08320ebceecae13b8531db1b81johanengelen delete[] d;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm d = 0;

ab5f33e91458710ed8dd2b2a1b3a53e4227d4856johanengelen }

feb44ad276e996ca244e071f936c61b009bd73f4johanengelen rows = other.rows;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm cols = other.cols;

feb44ad276e996ca244e071f936c61b009bd73f4johanengelen size = other.size;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm badval = other.badval;

dda97aeba7480d08320ebceecae13b8531db1b81johanengelen d = new double[size];

dda97aeba7480d08320ebceecae13b8531db1b81johanengelen for (unsigned int i=0 ; i<size ; i++){

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm d[i] = other.d[i];

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

ecda720053ff791e35dae3c5c1177bc225b6cdf1johanengelen

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm double badval;

46c4893a7458eda6edcd064121bc000634af7a09johanengelen

46c4893a7458eda6edcd064121bc000634af7a09johanengelen double *d;

46c4893a7458eda6edcd064121bc000634af7a09johanengelen unsigned int rows;

46c4893a7458eda6edcd064121bc000634af7a09johanengelen unsigned int cols;

46c4893a7458eda6edcd064121bc000634af7a09johanengelen unsigned int size;

46c4893a7458eda6edcd064121bc000634af7a09johanengelen};

46c4893a7458eda6edcd064121bc000634af7a09johanengelen

46c4893a7458eda6edcd064121bc000634af7a09johanengelen

46c4893a7458eda6edcd064121bc000634af7a09johanengelen

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrmclass SingularValueDecomposition

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen{

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelenpublic:

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen /** Construct the singular value decomposition

2d107ef9730aff3f4d776ae0c2f7d983e289ce02joncruz

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen SingularValueDecomposition (const SVDMatrix &mat) :

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen A (mat),

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen U (),

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen s (NULL),

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen s_size (0),

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm V ()

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen {

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm calculate();

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm virtual ~SingularValueDecomposition()

0fc5ce7045233dae7e15fdc86774370f1b1d73cbjohanengelen {

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm delete[] s;

0fc5ce7045233dae7e15fdc86774370f1b1d73cbjohanengelen }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen /**

2d107ef9730aff3f4d776ae0c2f7d983e289ce02joncruz SVDMatrix &getU();

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm /**

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm SVDMatrix &getV();

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm /**

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm */ double getS(unsigned int index);

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm /**

73d455c08e8062e257dd052d2d690b9300434351cilix double norm2();

73d455c08e8062e257dd052d2d690b9300434351cilix

73d455c08e8062e257dd052d2d690b9300434351cilix /**

73d455c08e8062e257dd052d2d690b9300434351cilix double cond();

73d455c08e8062e257dd052d2d690b9300434351cilix

edfb6f4ecc50bd6d9d7acfe7fc36b915eb921c85cilix /**

73d455c08e8062e257dd052d2d690b9300434351cilix int rank();

73d455c08e8062e257dd052d2d690b9300434351cilix

73d455c08e8062e257dd052d2d690b9300434351cilixprivate:

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen

73d455c08e8062e257dd052d2d690b9300434351cilix void calculate();

73d455c08e8062e257dd052d2d690b9300434351cilix

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm SVDMatrix A;

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen SVDMatrix U;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm double *s;

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen unsigned int s_size;

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen SVDMatrix V;

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen};

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelenstatic double svd_hypot(double a, double b)

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen{

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen double r;

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen if (fabs(a) > fabs(b))

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen {

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen r = b/a;

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen r = fabs(a) * sqrt(1+r*r);

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm else if (b != 0)

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen {

c0cd5511d3b975ebe07d019c1f5528108725e438johanengelen r = a/b;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm r = fabs(b) * sqrt(1+r*r);

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm else

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm {

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm r = 0.0;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen return r;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm}

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrmvoid SingularValueDecomposition::calculate()

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen{

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm // Initialize.

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm int m = A.getRows();

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm int n = A.getCols();

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm int nu = (m > n) ? m : n;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm s_size = (m+1 < n) ? m+1 : n;

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen s = new double[s_size];

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen U = SVDMatrix(m, nu);

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen V = SVDMatrix(n, n);

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen double *e = new double[n];

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen double *work = new double[m];

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen bool wantu = true;

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen bool wantv = true;

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen // Reduce A to bidiagonal form, storing the diagonal elements

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen // in s and the super-diagonal elements in e.

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen int nct = (m-1<n) ? m-1 : n;

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen int nrtx = (n-2<m) ? n-2 : m;

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen int nrt = (nrtx>0) ? nrtx : 0;

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen for (int k = 0; k < 2; k++) {

93bb287e28a818fd5ba61b99d012e0500a49ccf6johanengelen if (k < nct) {

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen // Compute the transformation for the k-th column and

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen // place the k-th diagonal in s[k].

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen // Compute 2-norm of k-th column without under/overflow.

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen s[k] = 0;

af8d25189f88abf89cdbe0e180e271c94079624fbuliabyak for (int i = k; i < m; i++) {

af8d25189f88abf89cdbe0e180e271c94079624fbuliabyak s[k] = svd_hypot(s[k],A(i, k));

af8d25189f88abf89cdbe0e180e271c94079624fbuliabyak }

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen if (s[k] != 0.0) {

af8d25189f88abf89cdbe0e180e271c94079624fbuliabyak if (A(k, k) < 0.0) {

a0334366488989ef25fb812d7030d298c0917c96johanengelen s[k] = -s[k];

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen }

a0334366488989ef25fb812d7030d298c0917c96johanengelen for (int i = k; i < m; i++) {

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen A(i, k) /= s[k];

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen }

a0334366488989ef25fb812d7030d298c0917c96johanengelen A(k, k) += 1.0;

a0334366488989ef25fb812d7030d298c0917c96johanengelen }

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen s[k] = -s[k];

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen }

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen for (int j = k+1; j < n; j++) {

f9504c822b72a774b910958446fd1e730235b7cbjoncruz if ((k < nct) & (s[k] != 0.0)) {

a0334366488989ef25fb812d7030d298c0917c96johanengelen

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen // Apply the transformation.

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen double t = 0;

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen for (int i = k; i < m; i++) {

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen t += A(i, k) * A(i, j);

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen }

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen t = -t/A(k, k);

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen for (int i = k; i < m; i++) {

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen A(i, j) += t*A(i, k);

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen }

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen }

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen // Place the k-th row of A into e for the

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen // subsequent calculation of the row transformation.

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen e[j] = A(k, j);

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen }

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen if (wantu & (k < nct)) {

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen // Place the transformation in U for subsequent back

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen // multiplication.

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen

fb5a72174252e0e79107dcad3bf5a2bbd73e349cjohanengelen for (int i = k; i < m; i++) {

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm U(i, k) = A(i, k);

42e99769805c14a5cc01c805faa3c3b03f9dd1c0johanengelen }

42e99769805c14a5cc01c805faa3c3b03f9dd1c0johanengelen }

42e99769805c14a5cc01c805faa3c3b03f9dd1c0johanengelen if (k < nrt) {

42e99769805c14a5cc01c805faa3c3b03f9dd1c0johanengelen

42e99769805c14a5cc01c805faa3c3b03f9dd1c0johanengelen // Compute the k-th row transformation and place the

42e99769805c14a5cc01c805faa3c3b03f9dd1c0johanengelen // k-th super-diagonal in e[k].

42e99769805c14a5cc01c805faa3c3b03f9dd1c0johanengelen // Compute 2-norm without under/overflow.

42e99769805c14a5cc01c805faa3c3b03f9dd1c0johanengelen e[k] = 0;

42e99769805c14a5cc01c805faa3c3b03f9dd1c0johanengelen for (int i = k+1; i < n; i++) {

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen e[k] = svd_hypot(e[k],e[i]);

a797dcb8e284cab19f60b3eff93a53a62abda263johanengelen }

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen if (e[k] != 0.0) {

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen if (e[k+1] < 0.0) {

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen e[k] = -e[k];

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen }

56542e2b97ec8826cc692153b0e2d4f5ac8ef913johanengelen for (int i = k+1; i < n; i++) {

ddc251b3cf95b0097b6a5ee39ea132bd4d7d5cbcjohanengelen e[i] /= e[k];

ddc251b3cf95b0097b6a5ee39ea132bd4d7d5cbcjohanengelen }

ddc251b3cf95b0097b6a5ee39ea132bd4d7d5cbcjohanengelen e[k+1] += 1.0;

ddc251b3cf95b0097b6a5ee39ea132bd4d7d5cbcjohanengelen }

ddc251b3cf95b0097b6a5ee39ea132bd4d7d5cbcjohanengelen e[k] = -e[k];

ddc251b3cf95b0097b6a5ee39ea132bd4d7d5cbcjohanengelen if ((k+1 < m) & (e[k] != 0.0)) {

bdd7add6c064afee52d2eabeaa18f745430e5a4djohanengelen

ddc251b3cf95b0097b6a5ee39ea132bd4d7d5cbcjohanengelen // Apply the transformation.

ddc251b3cf95b0097b6a5ee39ea132bd4d7d5cbcjohanengelen

42e99769805c14a5cc01c805faa3c3b03f9dd1c0johanengelen for (int i = k+1; i < m; i++) {

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm work[i] = 0.0;

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm for (int j = k+1; j < n; j++) {

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm for (int i = k+1; i < m; i++) {

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm work[i] += e[j]*A(i, j);

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm for (int j = k+1; j < n; j++) {

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm double t = -e[j]/e[k+1];

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm for (int i = k+1; i < m; i++) {

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm A(i, j) += t*work[i];

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

f07bfd5a05d43a6d11f7cd442f085149092dea88pjrm }

if (wantv) {

// Place the transformation in V for subsequent

// back multiplication.

for (int i = k+1; i < n; i++) {

V(i, k) = e[i];

}

}

}

}

// Set up the final bidiagonal matrix or order p.

int p = (n < m+1) ? n : m+1;

if (nct < n) {

s[nct] = A(nct, nct);

}

if (m < p) {

s[p-1] = 0.0;

}

if (nrt+1 < p) {

e[nrt] = A(nrt, p-1);

}

e[p-1] = 0.0;

// If required, generate U.

if (wantu) {

for (int j = nct; j < nu; j++) {

for (int i = 0; i < m; i++) {

U(i, j) = 0.0;

}

U(j, j) = 1.0;

}

for (int k = nct-1; k >= 0; k--) {

if (s[k] != 0.0) {

for (int j = k+1; j < nu; j++) {

double t = 0;

for (int i = k; i < m; i++) {

t += U(i, k)*U(i, j);

}

t = -t/U(k, k);

for (int i = k; i < m; i++) {

U(i, j) += t*U(i, k);

}

}

for (int i = k; i < m; i++ ) {

U(i, k) = -U(i, k);

}

U(k, k) = 1.0 + U(k, k);

for (int i = 0; i < k-1; i++) {

U(i, k) = 0.0;

}

} else {

for (int i = 0; i < m; i++) {

U(i, k) = 0.0;

}

U(k, k) = 1.0;

}

}

}

// If required, generate V.

if (wantv) {

for (int k = n-1; k >= 0; k--) {

if ((k < nrt) & (e[k] != 0.0)) {

for (int j = k+1; j < nu; j++) {

double t = 0;

for (int i = k+1; i < n; i++) {

t += V(i, k)*V(i, j);

}

t = -t/V(k+1, k);

for (int i = k+1; i < n; i++) {

V(i, j) += t*V(i, k);

}

}

}

for (int i = 0; i < n; i++) {

V(i, k) = 0.0;

}

V(k, k) = 1.0;

}

}

// Main iteration loop for the singular values.

int pp = p-1;

//double eps = pow(2.0,-52.0);

//double tiny = pow(2.0,-966.0);

//let's just calculate these now

//a double can be e ± 308.25, so this is safe

double eps = 2.22e-16;

double tiny = 1.6e-291;

while (p > 0) {

int k,kase;

// Here is where a test for too many iterations would go.

// This section of the program inspects for

// negligible elements in the s and e arrays. On

// completion the variables kase and k are set as follows.

// kase = 1 if s(p) and e[k-1] are negligible and k<p

// kase = 2 if s(k) is negligible and k<p

// kase = 3 if e[k-1] is negligible, k<p, and

// s(k), ..., s(p) are not negligible (qr step).

// kase = 4 if e(p-1) is negligible (convergence).

for (k = p-2; k >= -1; k--) {

if (k == -1) {

break;

}

if (fabs(e[k]) <=

tiny + eps*(fabs(s[k]) + fabs(s[k+1]))) {

e[k] = 0.0;

break;

}

}

if (k == p-2) {

kase = 4;

} else {

int ks;

for (ks = p-1; ks >= k; ks--) {

if (ks == k) {

break;

}

double t = (ks != p ? fabs(e[ks]) : 0.) +

(ks != k+1 ? fabs(e[ks-1]) : 0.);

if (fabs(s[ks]) <= tiny + eps*t) {

s[ks] = 0.0;

break;

}

}

if (ks == k) {

kase = 3;

} else if (ks == p-1) {

kase = 1;

} else {

kase = 2;

k = ks;

}

}

k++;

// Perform the task indicated by kase.

switch (kase) {

// Deflate negligible s(p).

case 1: {

double f = e[p-2];

e[p-2] = 0.0;

for (int j = p-2; j >= k; j--) {

double t = svd_hypot(s[j],f);

double cs = s[j]/t;

double sn = f/t;

s[j] = t;

if (j != k) {

f = -sn*e[j-1];

e[j-1] = cs*e[j-1];

}

if (wantv) {

for (int i = 0; i < n; i++) {

t = cs*V(i, j) + sn*V(i, p-1);

V(i, p-1) = -sn*V(i, j) + cs*V(i, p-1);

V(i, j) = t;

}

}

}

}

break;

// Split at negligible s(k).

case 2: {

double f = e[k-1];

e[k-1] = 0.0;

for (int j = k; j < p; j++) {

double t = svd_hypot(s[j],f);

double cs = s[j]/t;

double sn = f/t;

s[j] = t;

f = -sn*e[j];

e[j] = cs*e[j];

if (wantu) {

for (int i = 0; i < m; i++) {

t = cs*U(i, j) + sn*U(i, k-1);

U(i, k-1) = -sn*U(i, j) + cs*U(i, k-1);

U(i, j) = t;

}

}

}

}

break;

// Perform one qr step.

case 3: {

// Calculate the shift.

double scale = fabs(s[p-1]);

double d = fabs(s[p-2]);

if (d>scale) scale=d;

d = fabs(e[p-2]);

if (d>scale) scale=d;

d = fabs(s[k]);

if (d>scale) scale=d;

d = fabs(e[k]);

if (d>scale) scale=d;

double sp = s[p-1]/scale;

double spm1 = s[p-2]/scale;

double epm1 = e[p-2]/scale;

double sk = s[k]/scale;

double ek = e[k]/scale;

double b = ((spm1 + sp)*(spm1 - sp) + epm1*epm1)/2.0;

double c = (sp*epm1)*(sp*epm1);

double shift = 0.0;

if ((b != 0.0) | (c != 0.0)) {

shift = sqrt(b*b + c);

if (b < 0.0) {

shift = -shift;

}

shift = c/(b + shift);

}

double f = (sk + sp)*(sk - sp) + shift;

double g = sk*ek;

// Chase zeros.

for (int j = k; j < p-1; j++) {

double t = svd_hypot(f,g);

double cs = f/t;

double sn = g/t;

if (j != k) {

e[j-1] = t;

}

f = cs*s[j] + sn*e[j];

e[j] = cs*e[j] - sn*s[j];

g = sn*s[j+1];

s[j+1] = cs*s[j+1];

if (wantv) {

for (int i = 0; i < n; i++) {

t = cs*V(i, j) + sn*V(i, j+1);

V(i, j+1) = -sn*V(i, j) + cs*V(i, j+1);

V(i, j) = t;

}

}

t = svd_hypot(f,g);

cs = f/t;

sn = g/t;

s[j] = t;

f = cs*e[j] + sn*s[j+1];

s[j+1] = -sn*e[j] + cs*s[j+1];

g = sn*e[j+1];

e[j+1] = cs*e[j+1];

if (wantu && (j < m-1)) {

for (int i = 0; i < m; i++) {

t = cs*U(i, j) + sn*U(i, j+1);

U(i, j+1) = -sn*U(i, j) + cs*U(i, j+1);

U(i, j) = t;

}

}

}

e[p-2] = f;

}

break;

// Convergence.

case 4: {

// Make the singular values positive.

if (s[k] <= 0.0) {

s[k] = (s[k] < 0.0 ? -s[k] : 0.0);

if (wantv) {

for (int i = 0; i <= pp; i++) {

V(i, k) = -V(i, k);

}

}

}

// Order the singular values.

while (k < pp) {

if (s[k] >= s[k+1]) {

break;

}

double t = s[k];

s[k] = s[k+1];

s[k+1] = t;

if (wantv && (k < n-1)) {

for (int i = 0; i < n; i++) {

t = V(i, k+1); V(i, k+1) = V(i, k); V(i, k) = t;

}

}

if (wantu && (k < m-1)) {

for (int i = 0; i < m; i++) {

t = U(i, k+1); U(i, k+1) = U(i, k); U(i, k) = t;

}

}

k++;

}

p--;

}

break;

}

}

delete [] e;

delete [] work;

}

SVDMatrix &SingularValueDecomposition::getU()

{

return U;

}

SVDMatrix &SingularValueDecomposition::getV()

{

return V;

}

double SingularValueDecomposition::getS(unsigned int index)

{

if (index >= s_size)

return 0.0;

return s[index];

}

double SingularValueDecomposition::norm2()

{

return s[0];

}

double SingularValueDecomposition::cond()

{

return s[0]/s[2];

}

int SingularValueDecomposition::rank()

{

double eps = pow(2.0,-52.0);

double tol = 3.0*s[0]*eps;

int r = 0;

for (int i = 0; i < 3; i++)

{

if (s[i] > tol)

r++;

}

return r;

}

#define pi 3.14159

#define pxToCm 0.03

#define piToRad 0.0174532925

#define docHeightCm 22.86

static Glib::ustring getAttribute( Inkscape::XML::Node *node, char const *attrName)

{

Glib::ustring val;

char const *valstr = node->attribute(attrName);

if (valstr)

val = valstr;

return val;

}

static Glib::ustring getExtension(const Glib::ustring &fname)

{

Glib::ustring ext;

std::string::size_type pos = fname.rfind('.');

if (pos == fname.npos)

{

ext = "";

}

else

{

ext = fname.substr(pos);

}

return ext;

}

static Glib::ustring formatTransform(Geom::Affine &tf)

{

Glib::ustring str;

if (!tf.isIdentity())

{

StringOutputStream outs;

OutputStreamWriter out(outs);

out.printf("matrix(%.3f %.3f %.3f %.3f %.3f %.3f)",

tf[0], tf[1], tf[2], tf[3], tf[4], tf[5]);

str = outs.getString();

}

return str;

}

static Geom::Affine getODFTransform(const SPItem *item)

{

//### Get SVG-to-ODF transform

Geom::Affine tf (item->i2dt_affine());

//Flip Y into document coordinates

double doc_height = SP_ACTIVE_DOCUMENT->getHeight().value("px");

Geom::Affine doc2dt_tf = Geom::Affine(Geom::Scale(1.0, -1.0)); /// @fixme hardcoded desktop transform

doc2dt_tf = doc2dt_tf * Geom::Affine(Geom::Translate(0, doc_height));

tf = tf * doc2dt_tf;

tf = tf * Geom::Affine(Geom::Scale(pxToCm));

return tf;

}

static Geom::OptRect getODFBoundingBox(const SPItem *item)

{

// TODO: geometric or visual?

Geom::OptRect bbox = item->documentVisualBounds();

if (bbox) {

*bbox *= Geom::Affine(Geom::Scale(pxToCm));

}

return bbox;

}

static Geom::Affine getODFItemTransform(const SPItem *item)

{

Geom::Affine itemTransform (Geom::Scale(1, -1)); /// @fixme hardcoded doc2dt transform?

itemTransform = itemTransform * (Geom::Affine)item->transform;

itemTransform = itemTransform * Geom::Scale(1, -1);

return itemTransform;

}

static void analyzeTransform(Geom::Affine &tf,

double &rotate, double &/*xskew*/, double &/*yskew*/,

double &xscale, double &yscale)

{

SVDMatrix mat(2, 2);

mat(0, 0) = tf[0];

mat(0, 1) = tf[1];

mat(1, 0) = tf[2];

mat(1, 1) = tf[3];

SingularValueDecomposition svd(mat);

SVDMatrix U = svd.getU();

SVDMatrix V = svd.getV();

SVDMatrix Vt = V.transpose();

SVDMatrix UVt = U.multiply(Vt);

double s0 = svd.getS(0);

double s1 = svd.getS(1);

xscale = s0;

yscale = s1;

rotate = UVt(0,0);

}

static void gatherText(Inkscape::XML::Node *node, Glib::ustring &buf)

{

if (node->type() == Inkscape::XML::TEXT_NODE)

{

char *s = (char *)node->content();

if (s)

buf.append(s);

}

for (Inkscape::XML::Node *child = node->firstChild() ;

child != NULL; child = child->next())

{

gatherText(child, buf);

}

}

void OdfOutput::preprocess(ZipFile &zf, Inkscape::XML::Node *node)

{

Glib::ustring nodeName = node->name();

Glib::ustring id = getAttribute(node, "id");

//### First, check for metadata

if (nodeName == "metadata" || nodeName == "svg:metadata")

{

Inkscape::XML::Node *mchild = node->firstChild() ;

if (!mchild || strcmp(mchild->name(), "rdf:RDF"))

return;

Inkscape::XML::Node *rchild = mchild->firstChild() ;

if (!rchild || strcmp(rchild->name(), "cc:Work"))

return;

for (Inkscape::XML::Node *cchild = rchild->firstChild() ;

cchild ; cchild = cchild->next())

{

Glib::ustring ccName = cchild->name();

Glib::ustring ccVal;

gatherText(cchild, ccVal);

//g_message("ccName: %s ccVal:%s", ccName.c_str(), ccVal.c_str());

metadata[ccName] = ccVal;

}

return;

}

//Now consider items.

SPObject *reprobj = SP_ACTIVE_DOCUMENT->getObjectByRepr(node);

if (!reprobj)

{

return;

}

if (!SP_IS_ITEM(reprobj))

{

return;

}

if (nodeName == "image" || nodeName == "svg:image")

{

Glib::ustring href = getAttribute(node, "xlink:href");

if (href.size() > 0)

{

Glib::ustring oldName = href;

Glib::ustring ext = getExtension(oldName);

if (ext == ".jpeg")

ext = ".jpg";

if (imageTable.find(oldName) == imageTable.end())

{

char buf[64];

snprintf(buf, sizeof(buf), "Pictures/image%u%s",

static_cast<unsigned int>(imageTable.size()), ext.c_str());

Glib::ustring newName = buf;

imageTable[oldName] = newName;

Glib::ustring comment = "old name was: ";

comment.append(oldName);

Inkscape::URI oldUri(oldName.c_str());

//# if relative to the documentURI, get proper path

std::string pathName = documentUri.getFullPath(oldUri.getFullPath(""));

ZipEntry *ze = zf.addFile(pathName, comment);

if (ze)

{

ze->setFileName(newName);

}

else

{

g_warning("Could not load image file '%s'", pathName.c_str());

}

}

}

}

for (Inkscape::XML::Node *child = node->firstChild() ;

child ; child = child->next())

preprocess(zf, child);

}

bool OdfOutput::writeManifest(ZipFile &zf)

{

BufferOutputStream bouts;

OutputStreamWriter outs(bouts);

time_t tim;

time(&tim);

outs.writeString("<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n");

outs.writeString("<!DOCTYPE manifest:manifest PUBLIC \"-//OpenOffice.org//DTD Manifest 1.0//EN\" \"Manifest.dtd\">\n");

outs.writeString("\n");

outs.writeString("\n");

outs.writeString("<!--\n");

outs.writeString("*************************************************************************\n");

outs.writeString(" file: manifest.xml\n");

outs.printf (" Generated by Inkscape: %s", ctime(&tim)); //ctime has its own <cr>

outs.writeString(" http://www.inkscape.org\n");

outs.writeString("*************************************************************************\n");

outs.writeString("-->\n");

outs.writeString("\n");

outs.writeString("\n");

outs.writeString("<manifest:manifest xmlns:manifest=\"urn:oasis:names:tc:opendocument:xmlns:manifest:1.0\">\n");

outs.writeString(" <manifest:file-entry manifest:media-type=\"application/vnd.oasis.opendocument.graphics\" manifest:full-path=\"/\"/>\n");

outs.writeString(" <manifest:file-entry manifest:media-type=\"text/xml\" manifest:full-path=\"content.xml\"/>\n");

outs.writeString(" <manifest:file-entry manifest:media-type=\"text/xml\" manifest:full-path=\"styles.xml\"/>\n");

outs.writeString(" <manifest:file-entry manifest:media-type=\"text/xml\" manifest:full-path=\"meta.xml\"/>\n");

outs.writeString(" <!--List our images here-->\n");

std::map<Glib::ustring, Glib::ustring>::iterator iter;

for (iter = imageTable.begin() ; iter!=imageTable.end() ; ++iter)

{

Glib::ustring oldName = iter->first;

Glib::ustring newName = iter->second;

Glib::ustring ext = getExtension(oldName);

if (ext == ".jpeg")

ext = ".jpg";

outs.printf(" <manifest:file-entry manifest:media-type=\"");

if (ext == ".gif")

outs.printf("image/gif");

else if (ext == ".png")

outs.printf("image/png");

else if (ext == ".jpg")

outs.printf("image/jpeg");

outs.printf("\" manifest:full-path=\"");

outs.writeString(newName.c_str());

outs.printf("\"/>\n");

}

outs.printf("</manifest:manifest>\n");

outs.close();

//Make our entry

ZipEntry *ze = zf.newEntry("META-INF/manifest.xml", "ODF file manifest");

ze->setUncompressedData(bouts.getBuffer());

ze->finish();

return true;

}

bool OdfOutput::writeMeta(ZipFile &zf)

{

BufferOutputStream bouts;

OutputStreamWriter outs(bouts);

time_t tim;

time(&tim);

std::map<Glib::ustring, Glib::ustring>::iterator iter;

Glib::ustring InkscapeVersion = Glib::ustring("Inkscape.org - ") + Inkscape::version_string;

Glib::ustring creator = InkscapeVersion;

iter = metadata.find("dc:creator");

if (iter != metadata.end())

{

creator = iter->second;

}

Glib::ustring date;

Glib::ustring moddate;

char buf [80];

time_t rawtime;

struct tm * timeinfo;

time (&rawtime);

timeinfo = localtime (&rawtime);

strftime (buf,80,"%Y-%m-%d %H:%M:%S",timeinfo);

moddate = Glib::ustring(buf);

iter = metadata.find("dc:date");

if (iter != metadata.end())

{

date = iter->second;

}

else

{

date = moddate;

}

outs.writeString("<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n");

outs.writeString("\n");

outs.writeString("<!--\n");

outs.writeString("*************************************************************************\n");

outs.writeString(" file: meta.xml\n");

outs.printf (" Generated by Inkscape: %s", ctime(&tim)); //ctime has its own <cr>

outs.writeString(" http://www.inkscape.org\n");

outs.writeString("*************************************************************************\n");

outs.writeString("-->\n");

outs.writeString("\n");

outs.writeString("<office:document-meta\n");

outs.writeString("xmlns:office=\"urn:oasis:names:tc:opendocument:xmlns:office:1.0\"\n");

outs.writeString("xmlns:xlink=\"http://www.w3.org/1999/xlink\"\n");

outs.writeString("xmlns:dc=\"http://purl.org/dc/elements/1.1/\"\n");

outs.writeString("xmlns:meta=\"urn:oasis:names:tc:opendocument:xmlns:meta:1.0\"\n");

outs.writeString("xmlns:presentation=\"urn:oasis:names:tc:opendocument:xmlns:presentation:1.0\"\n");

outs.writeString("xmlns:ooo=\"http://openoffice.org/2004/office\"\n");

outs.writeString("xmlns:smil=\"urn:oasis:names:tc:opendocument:xmlns:smil-compatible:1.0\"\n");

outs.writeString("xmlns:anim=\"urn:oasis:names:tc:opendocument:xmlns:animation:1.0\"\n");

outs.writeString("office:version=\"1.0\">\n");

outs.writeString("<office:meta>\n");

Glib::ustring tmp = Glib::ustring::compose(" <meta:generator>%1</meta:generator>\n", InkscapeVersion);

tmp += Glib::ustring::compose(" <meta:initial-creator>%1</meta:initial-creator>\n", creator);

tmp += Glib::ustring::compose(" <meta:creation-date>%1</meta:creation-date>\n", date);

tmp += Glib::ustring::compose(" <dc:date>%1</dc:date>\n", moddate);

outs.writeUString(tmp);

for (iter = metadata.begin() ; iter != metadata.end() ; ++iter)

{

Glib::ustring name = iter->first;

Glib::ustring value = iter->second;

if (!name.empty() && !value.empty())

{

tmp = Glib::ustring::compose(" <%1>%2</%3>\n", name, value, name);

outs.writeUString(tmp);

}

}

// outs.writeString(" <meta:editing-cycles>2</meta:editing-cycles>\n");

// outs.writeString(" <meta:editing-duration>PT56S</meta:editing-duration>\n");

// outs.writeString(" <meta:user-defined meta:name=\"Info 1\"/>\n");

// outs.writeString(" <meta:user-defined meta:name=\"Info 2\"/>\n");

// outs.writeString(" <meta:user-defined meta:name=\"Info 3\"/>\n");

// outs.writeString(" <meta:user-defined meta:name=\"Info 4\"/>\n");

// outs.writeString(" <meta:document-statistic meta:object-count=\"2\"/>\n");

outs.writeString("</office:meta>\n");

outs.writeString("</office:document-meta>\n");

outs.close();

//Make our entry

ZipEntry *ze = zf.newEntry("meta.xml", "ODF info file");

ze->setUncompressedData(bouts.getBuffer());

ze->finish();

return true;

}

static int

writePath(Writer &outs, Geom::PathVector const &pathv,

Geom::Affine const &tf, double xoff, double yoff)

{

using Geom::X;

using Geom::Y;

int nrPoints = 0;

// convert the path to only lineto's and cubic curveto's:

Geom::PathVector pv = pathv_to_linear_and_cubic_beziers(pathv * tf * Geom::Translate(xoff, yoff) * Geom::Scale(1000.));

for (Geom::PathVector::const_iterator pit = pv.begin(); pit != pv.end(); ++pit) {

double destx = pit->initialPoint()[X];

double desty = pit->initialPoint()[Y];

if (fabs(destx)<1.0) destx = 0.0; // Why is this needed? Shouldn't we just round all numbers then?

if (fabs(desty)<1.0) desty = 0.0;

outs.printf("M %.3f %.3f ", destx, desty);

nrPoints++;

for (Geom::Path::const_iterator cit = pit->begin(); cit != pit->end_closed(); ++cit) {

if( is_straight_curve(*cit) )

{

double destx = cit->finalPoint()[X];

double desty = cit->finalPoint()[Y];

if (fabs(destx)<1.0) destx = 0.0; // Why is this needed? Shouldn't we just round all numbers then?

if (fabs(desty)<1.0) desty = 0.0;

outs.printf("L %.3f %.3f ", destx, desty);

}

else if(Geom::CubicBezier const *cubic = dynamic_cast<Geom::CubicBezier const*>(&*cit)) {

std::vector<Geom::Point> points = cubic->controlPoints();

for (unsigned i = 1; i <= 3; i++) {

if (fabs(points[i][X])<1.0) points[i][X] = 0.0; // Why is this needed? Shouldn't we just round all numbers then?

if (fabs(points[i][Y])<1.0) points[i][Y] = 0.0;

}

outs.printf("C %.3f %.3f %.3f %.3f %.3f %.3f ", points[1][X],points[1][Y], points[2][X],points[2][Y], points[3][X],points[3][Y]);

}

else {

g_error ("logical error, because pathv_to_linear_and_cubic_beziers was used");

}

nrPoints++;

}

if (pit->closed()) {

outs.printf("Z");

}

}

return nrPoints;

}

bool OdfOutput::processStyle(SPItem *item, const Glib::ustring &id, const Glib::ustring &gradientNameFill, const Glib::ustring &gradientNameStroke, Glib::ustring& output)

{

output.clear();

if (!item)

{

return false;

}

SPStyle *style = item->style;

if (!style)

{

return false;

}

StyleInfo si;

// FILL

if (style->fill.isColor())

{

guint32 fillCol = style->fill.value.color.toRGBA32( 0 );

char buf[16];

int r = (fillCol >> 24) & 0xff;

int g = (fillCol >> 16) & 0xff;

int b = (fillCol >> 8) & 0xff;

snprintf(buf, 15, "#%02x%02x%02x", r, g, b);

si.fillColor = buf;

si.fill = "solid";

double opacityPercent = 100.0 *

(SP_SCALE24_TO_FLOAT(style->fill_opacity.value));

snprintf(buf, 15, "%.3f%%", opacityPercent);

si.fillOpacity = buf;

}

else if (style->fill.isPaintserver())

{

SPGradient *gradient = SP_GRADIENT(SP_STYLE_FILL_SERVER(style));

if (gradient)

{

si.fill = "gradient";

}

}

// STROKE

if (style->stroke.isColor())

{

guint32 strokeCol = style->stroke.value.color.toRGBA32( 0 );

char buf[16];

int r = (strokeCol >> 24) & 0xff;

int g = (strokeCol >> 16) & 0xff;

int b = (strokeCol >> 8) & 0xff;