/usr/include/agg2/agg_trans_double_path.h is in libagg-dev 2.5+dfsg1-9.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 | //----------------------------------------------------------------------------
// Anti-Grain Geometry (AGG) - Version 2.5
// A high quality rendering engine for C++
// Copyright (C) 2002-2006 Maxim Shemanarev
// Contact: mcseem@antigrain.com
// mcseemagg@yahoo.com
// http://antigrain.com
//
// AGG is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version 2
// of the License, or (at your option) any later version.
//
// AGG 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 General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with AGG; if not, write to the Free Software
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
// MA 02110-1301, USA.
//----------------------------------------------------------------------------
#ifndef AGG_TRANS_DOUBLE_PATH_INCLUDED
#define AGG_TRANS_DOUBLE_PATH_INCLUDED
#include "agg_basics.h"
#include "agg_vertex_sequence.h"
namespace agg
{
// See also: agg_trans_double_path.cpp
//
//-------------------------------------------------------trans_double_path
class trans_double_path
{
enum status_e
{
initial,
making_path,
ready
};
public:
typedef vertex_sequence<vertex_dist, 6> vertex_storage;
trans_double_path();
//--------------------------------------------------------------------
void base_length(double v) { m_base_length = v; }
double base_length() const { return m_base_length; }
//--------------------------------------------------------------------
void base_height(double v) { m_base_height = v; }
double base_height() const { return m_base_height; }
//--------------------------------------------------------------------
void preserve_x_scale(bool f) { m_preserve_x_scale = f; }
bool preserve_x_scale() const { return m_preserve_x_scale; }
//--------------------------------------------------------------------
void reset();
void move_to1(double x, double y);
void line_to1(double x, double y);
void move_to2(double x, double y);
void line_to2(double x, double y);
void finalize_paths();
//--------------------------------------------------------------------
template<class VertexSource1, class VertexSource2>
void add_paths(VertexSource1& vs1, VertexSource2& vs2,
unsigned path1_id=0, unsigned path2_id=0)
{
double x;
double y;
unsigned cmd;
vs1.rewind(path1_id);
while(!is_stop(cmd = vs1.vertex(&x, &y)))
{
if(is_move_to(cmd))
{
move_to1(x, y);
}
else
{
if(is_vertex(cmd))
{
line_to1(x, y);
}
}
}
vs2.rewind(path2_id);
while(!is_stop(cmd = vs2.vertex(&x, &y)))
{
if(is_move_to(cmd))
{
move_to2(x, y);
}
else
{
if(is_vertex(cmd))
{
line_to2(x, y);
}
}
}
finalize_paths();
}
//--------------------------------------------------------------------
double total_length1() const;
double total_length2() const;
void transform(double *x, double *y) const;
private:
double finalize_path(vertex_storage& vertices);
void transform1(const vertex_storage& vertices,
double kindex, double kx,
double *x, double* y) const;
vertex_storage m_src_vertices1;
vertex_storage m_src_vertices2;
double m_base_length;
double m_base_height;
double m_kindex1;
double m_kindex2;
status_e m_status1;
status_e m_status2;
bool m_preserve_x_scale;
};
}
#endif
|