Searched refs:vertex (Results 1 - 25 of 66) sorted by path

123

/haiku/headers/libs/agg/
H A Dagg_arc.h16 // Arc vertex generator
51 unsigned vertex(double* x, double* y);
H A Dagg_arrowhead.h61 unsigned vertex(double* x, double* y);
H A Dagg_bezier_arc.h65 unsigned vertex(double* x, double* y) function in class:agg::bezier_arc
75 // number of vertices. That is, for 1 vertex it returns 2.
136 unsigned vertex(double* x, double* y) function in class:agg::bezier_arc_svg
138 return m_arc.vertex(x, y);
142 // number of vertices. That is, for 1 vertex it returns 2.
H A Dagg_bounding_rect.h47 while(!is_stop(cmd = vs.vertex(&x, &y)))
89 while(!is_stop(cmd = vs.vertex(&x, &y)))
H A Dagg_conv_adaptor_vcgen.h31 unsigned vertex(double*, double*) { return path_cmd_stop; } function in struct:agg::null_markers
66 unsigned vertex(double* x, double* y);
89 unsigned conv_adaptor_vcgen<VertexSource, Generator, Markers>::vertex(double* x, double* y) function in class:agg::conv_adaptor_vcgen
99 m_last_cmd = m_source->vertex(&m_start_x, &m_start_y);
111 cmd = m_source->vertex(x, y);
142 cmd = m_generator.vertex(x, y);
H A Dagg_conv_adaptor_vpgen.h35 unsigned vertex(double* x, double* y);
67 unsigned conv_adaptor_vpgen<VertexSource, VPGen>::vertex(double* x, double* y) function in class:agg::conv_adaptor_vpgen
72 cmd = m_vpgen.vertex(x, y);
97 cmd = m_source->vertex(&tx, &ty);
H A Dagg_conv_close_polygon.h32 unsigned vertex(double* x, double* y);
62 unsigned conv_close_polygon<VertexSource>::vertex(double* x, double* y) function in class:agg::conv_close_polygon
76 cmd = m_source->vertex(x, y);
H A Dagg_conv_concat.h42 unsigned vertex(double* x, double* y) function in class:agg::conv_concat
47 cmd = m_source1->vertex(x, y);
53 cmd = m_source2->vertex(x, y);
H A Dagg_conv_curve.h115 unsigned vertex(double* x, double* y);
144 unsigned conv_curve<VertexSource, Curve3, Curve4>::vertex(double* x, double* y) function in class:agg::conv_curve
146 if(!is_stop(m_curve3.vertex(x, y)))
153 if(!is_stop(m_curve4.vertex(x, y)))
165 unsigned cmd = m_source->vertex(x, y);
169 m_source->vertex(&end_x, &end_y);
177 m_curve3.vertex(x, y); // First call returns path_cmd_move_to
178 m_curve3.vertex(x, y); // This is the first vertex of the curve
184 m_source->vertex(
[all...]
H A Dagg_conv_marker.h38 unsigned vertex(double* x, double* y);
87 unsigned conv_marker<MarkerLocator, MarkerShapes>::vertex(double* x, double* y) function in class:agg::conv_marker
108 if(is_stop(m_marker_locator->vertex(&x1, &y1)))
113 if(is_stop(m_marker_locator->vertex(&x2, &y2)))
126 cmd = m_marker_shapes->vertex(x, y);
H A Dagg_conv_transform.h41 unsigned vertex(double* x, double* y) function in class:agg::conv_transform
43 unsigned cmd = m_source->vertex(x, y);
H A Dagg_conv_unclose_polygon.h35 unsigned vertex(double* x, double* y) function in class:agg::conv_unclose_polygon
37 unsigned cmd = m_source->vertex(x, y);
H A Dagg_ellipse.h50 unsigned vertex(double* x, double* y);
101 inline unsigned ellipse::vertex(double* x, double* y) function in class:agg::ellipse
H A Dagg_gsv_text.h58 unsigned vertex(double* x, double* y);
136 unsigned vertex(double* x, double* y) function in class:agg::gsv_text_outline
138 return m_trans.vertex(x, y);
H A Dagg_path_length.h36 while(!is_stop(cmd = vs.vertex(&x2, &y2)))
H A Dagg_path_storage.h68 unsigned vertex(unsigned idx, double* x, double* y) const;
148 unsigned cmd = v.vertex(i, &x, &y);
235 if(m_total_vertices) return vertex(m_total_vertices - 1, x, y);
243 if(m_total_vertices > 1) return vertex(m_total_vertices - 2, x, y);
280 inline unsigned vertex_block_storage<T,S,P>::vertex(unsigned idx, function in class:agg::vertex_block_storage
388 unsigned vertex(double* x, double* y) function in class:agg::poly_plain_adaptor
452 unsigned vertex(double* x, double* y) function in class:agg::poly_container_adaptor
514 unsigned vertex(double* x, double* y) function in class:agg::poly_container_reverse_adaptor
574 unsigned vertex(double* x, double* y) function in class:agg::line_adaptor
576 return m_line.vertex(
1125 inline unsigned path_base<VC>::vertex(unsigned idx, double* x, double* y) const function in class:agg::path_base
1167 inline unsigned path_base<VC>::vertex(double* x, double* y) function in class:agg::path_base
1439 unsigned vertex(unsigned idx, double* x, double* y) const function in class:agg::vertex_stl_storage
[all...]
H A Dagg_path_storage_integer.h47 unsigned vertex(double* x_, double* y_, function in struct:agg::vertex_integer
113 unsigned vertex(unsigned idx, double* x, double* y) const function in class:agg::path_storage_integer
115 return m_storage[idx].vertex(x, y);
138 unsigned vertex(double* x, double* y) function in class:agg::path_storage_integer
153 unsigned cmd = m_storage[m_vertex_idx].vertex(x, y);
180 m_storage[i].vertex(&x, &y);
249 unsigned vertex(double* x, double* y) function in class:agg::serialized_integer_path_adaptor
268 unsigned cmd = v.vertex(x, y, m_dx, m_dy, m_scale);
H A Dagg_rasterizer_compound_aa.h150 while(!is_stop(cmd = vs.vertex(&x, &y)))
H A Dagg_rasterizer_outline.h101 while(!is_stop(cmd = vs.vertex(&x, &y)))
H A Dagg_rasterizer_outline_aa.h32 // Vertex (x, y) with the distance to the next one. The last vertex has
173 while(!is_stop(cmd = vs.vertex(&x, &y)))
H A Dagg_rasterizer_scanline_aa.h91 // In this case the vertex order of all the contours must be the same
95 // contours with the same vertex order will be rendered without "holes"
196 while(!is_stop(cmd = vs.vertex(&x, &y)))
H A Dagg_rounded_rect.h16 // Rounded rectangle vertex generator
50 unsigned vertex(double* x, double* y);
H A Dagg_span_gouraud.h70 // triangle and render it as a 6-vertex polygon.
123 unsigned vertex(double* x, double* y) function in class:agg::span_gouraud
H A Dagg_trans_double_path.h73 while(!is_stop(cmd = vs1.vertex(&x, &y)))
89 while(!is_stop(cmd = vs2.vertex(&x, &y)))
H A Dagg_trans_single_path.h65 while(!is_stop(cmd = vs.vertex(&x, &y)))

Completed in 139 milliseconds

123