Searched refs:vertices (Results 1 - 7 of 7) sorted by relevance

/haiku/src/libs/agg/src/
H A Dagg_trans_double_path.cpp98 double trans_double_path::finalize_path(vertex_storage& vertices) argument
104 vertices.close(false);
105 if(vertices.size() > 2)
107 if(vertices[vertices.size() - 2].dist * 10.0 <
108 vertices[vertices.size() - 3].dist)
110 d = vertices[vertices.size() - 3].dist +
111 vertices[vertice
169 transform1(const vertex_storage& vertices, double kindex, double kx, double *x, double* y) const argument
[all...]
H A Dagg_bezier_arc.cpp17 // 4, 7, 10, or 13 vertices.
243 mtx.transform(m_arc.vertices() + i, m_arc.vertices() + i + 1);
248 m_arc.vertices()[0] = x0;
249 m_arc.vertices()[1] = y0;
252 m_arc.vertices()[m_arc.num_vertices() - 2] = x2;
253 m_arc.vertices()[m_arc.num_vertices() - 1] = y2;
/haiku/headers/libs/agg/
H A Dagg_bezier_arc.h17 // 4, 7, 10, or 13 vertices.
75 // number of vertices. That is, for 1 vertex it returns 2.
78 const double* vertices() const { return m_vertices; } function in class:agg::bezier_arc
79 double* vertices() { return m_vertices; } function in class:agg::bezier_arc
142 // number of vertices. That is, for 1 vertex it returns 2.
145 const double* vertices() const { return m_arc.vertices(); } function in class:agg::bezier_arc_svg
146 double* vertices() { return m_arc.vertices(); } function in class:agg::bezier_arc_svg
H A Dagg_trans_double_path.h112 double finalize_path(vertex_storage& vertices);
113 void transform1(const vertex_storage& vertices,
H A Dagg_path_storage.h597 // A container to store vertices with their flags.
677 const container_type& vertices() const { return m_vertices; } function in class:agg::path_base
678 container_type& vertices() { return m_vertices; } function in class:agg::path_base
712 // Flip all vertices horizontally or vertically,
1224 // Skip all non-vertices at the beginning
1248 // Skip all non-vertices at the beginning
/haiku/src/add-ons/screen_savers/spider/
H A DPolygon.h23 Polygon(BRect bounds, int32 vertices);
H A DPolygon.cpp15 Polygon::Polygon(BRect bounds, int32 vertices) argument
16 : fPoints(vertices),
21 for (int32 i = 0; i < vertices; i++) {

Completed in 88 milliseconds