summaryrefslogtreecommitdiff
path: root/agg/inc/agg_vertex_sequence.h
diff options
context:
space:
mode:
Diffstat (limited to 'agg/inc/agg_vertex_sequence.h')
-rwxr-xr-xagg/inc/agg_vertex_sequence.h16
1 files changed, 6 insertions, 10 deletions
diff --git a/agg/inc/agg_vertex_sequence.h b/agg/inc/agg_vertex_sequence.h
index 357a3df15fa4..5a14da20c32f 100755
--- a/agg/inc/agg_vertex_sequence.h
+++ b/agg/inc/agg_vertex_sequence.h
@@ -1,5 +1,5 @@
//----------------------------------------------------------------------------
-// Anti-Grain Geometry - Version 2.3
+// Anti-Grain Geometry - Version 2.4
// Copyright (C) 2002-2005 Maxim Shemanarev (http://www.antigrain.com)
//
// Permission to copy, use, modify, sell and distribute this software
@@ -27,10 +27,10 @@ namespace agg
{
//----------------------------------------------------------vertex_sequence
- // Modified agg::pod_deque. The data is interpreted as a sequence of vertices.
- // It means that the type T must expose:
+ // Modified agg::pod_bvector. The data is interpreted as a sequence
+ // of vertices. It means that the type T must expose:
//
- // bool operator() (const T& val)
+ // bool T::operator() (const T& val)
//
// that is called every time new vertex is being added. The main purpose
// of this operator is the possibility to calculate some values during
@@ -64,10 +64,10 @@ namespace agg
// necessary.
//------------------------------------------------------------------------
template<class T, unsigned S=6>
- class vertex_sequence : public pod_deque<T, S>
+ class vertex_sequence : public pod_bvector<T, S>
{
public:
- typedef pod_deque<T, S> base_type;
+ typedef pod_bvector<T, S> base_type;
void add(const T& val);
void modify_last(const T& val);
@@ -124,10 +124,6 @@ namespace agg
}
-
- // Coinciding points maximal distance (Epsilon)
- const double vertex_dist_epsilon = 1e-14;
-
//-------------------------------------------------------------vertex_dist
// Vertex (x, y) with the distance to the next one. The last vertex has
// distance between the last and the first points if the polygon is closed