/haiku/headers/libs/agg/ |
H A D | agg_arc.h | 16 // Arc vertex generator 51 unsigned vertex(double* x, double* y);
|
H A D | agg_arrowhead.h | 61 unsigned vertex(double* x, double* y);
|
H A D | agg_bezier_arc.h | 65 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 D | agg_bounding_rect.h | 47 while(!is_stop(cmd = vs.vertex(&x, &y))) 89 while(!is_stop(cmd = vs.vertex(&x, &y)))
|
H A D | agg_conv_adaptor_vcgen.h | 31 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 D | agg_conv_adaptor_vpgen.h | 35 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 D | agg_conv_close_polygon.h | 32 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 D | agg_conv_concat.h | 42 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 D | agg_conv_curve.h | 115 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 D | agg_conv_marker.h | 38 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 D | agg_conv_transform.h | 41 unsigned vertex(double* x, double* y) function in class:agg::conv_transform 43 unsigned cmd = m_source->vertex(x, y);
|
H A D | agg_conv_unclose_polygon.h | 35 unsigned vertex(double* x, double* y) function in class:agg::conv_unclose_polygon 37 unsigned cmd = m_source->vertex(x, y);
|
H A D | agg_ellipse.h | 50 unsigned vertex(double* x, double* y); 101 inline unsigned ellipse::vertex(double* x, double* y) function in class:agg::ellipse
|
H A D | agg_gsv_text.h | 58 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 D | agg_path_length.h | 36 while(!is_stop(cmd = vs.vertex(&x2, &y2)))
|
H A D | agg_path_storage.h | 68 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 D | agg_path_storage_integer.h | 47 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 D | agg_rasterizer_compound_aa.h | 150 while(!is_stop(cmd = vs.vertex(&x, &y)))
|
H A D | agg_rasterizer_outline.h | 101 while(!is_stop(cmd = vs.vertex(&x, &y)))
|
H A D | agg_rasterizer_outline_aa.h | 32 // 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 D | agg_rasterizer_scanline_aa.h | 91 // 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 D | agg_rounded_rect.h | 16 // Rounded rectangle vertex generator 50 unsigned vertex(double* x, double* y);
|
H A D | agg_span_gouraud.h | 70 // triangle and render it as a 6-vertex polygon. 123 unsigned vertex(double* x, double* y) function in class:agg::span_gouraud
|
H A D | agg_trans_double_path.h | 73 while(!is_stop(cmd = vs1.vertex(&x, &y))) 89 while(!is_stop(cmd = vs2.vertex(&x, &y)))
|
H A D | agg_trans_single_path.h | 65 while(!is_stop(cmd = vs.vertex(&x, &y)))
|