* By default, this assumes a left-hand coordinate system (for svg); if RHS = 2 flag
* is set, use standard coordinate system.
*/
-void get_gradient_points(pointf * A, pointf * G, int n, float angle, int flags)
-{
+void get_gradient_points(pointf *A, pointf *G, int n, double angle, int flags) {
int i;
double rx, ry;
pointf min,max,center;
UTILS_API bool overlap_label(textlabel_t *lp, boxf b);
UTILS_API bool overlap_edge(edge_t *e, boxf b);
- UTILS_API void get_gradient_points(pointf * A, pointf * G, int n, float angle, int flags);
+ UTILS_API void get_gradient_points(pointf *A, pointf *G, int n,
+ double angle, int flags);
UTILS_API void processClusterEdges(graph_t * g);
unsigned char buf0[BUFSIZ];
agxbuf xb;
obj_state_t* obj = job->obj;
- float angle = obj->gradient_angle * M_PI / 180;
+ double angle = obj->gradient_angle * M_PI / 180;
float r1,r2;
pointf G[2],c1,c2;
static int svg_gradstyle(GVJ_t * job, pointf * A, int n)
{
pointf G[2];
- float angle;
static int gradId;
int id = gradId++;
obj_state_t *obj = job->obj;
- angle = obj->gradient_angle * M_PI / 180; //angle of gradient line
+ double angle = obj->gradient_angle * M_PI / 180; //angle of gradient line
G[0].x = G[0].y = G[1].x = G[1].y = 0.;
get_gradient_points(A, G, n, angle, 0); //get points on gradient line
static void cairo_gradient_fill (cairo_t* cr, obj_state_t* obj, int filled, pointf* A, int n)
{
cairo_pattern_t* pat;
- float angle = obj->gradient_angle * M_PI / 180;
+ double angle = obj->gradient_angle * M_PI / 180;
float r1,r2;
pointf G[2],c1;