4 ** Made by (Johnny Q. Hacker)
5 ** Login <solarion@johnathan>
9 Copyright (C) 2008 Joseph Pingenot
11 This program is free software: you can redistribute it and/or modify
12 it under the terms of the GNU Affero General Public License as published by
13 the Free Software Foundation, either version 3 of the License, or
14 (at your option) any later version.
16 This program is distributed in the hope that it will be useful,
17 but WITHOUT ANY WARRANTY; without even the implied warranty of
18 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 GNU Affero General Public License for more details.
21 You should have received a copy of the GNU Affero General Public License
22 along with this program. If not, see <http://www.gnu.org/licenses/>.
25 **Many thanks to Davyd Madeley for the excellent Cairo Tutorial
26 ** at http://gnomejournal.org/article/34/writing-a--using-cairo-and-gtk28
28 ** Started on Thu Jul 17 10:51:32 2008 Johnny Q. Hacker
29 ** Last update Thu Oct 15 21:37:21 2009 Johnny Q. Hacker
38 #define DEBUG_AUTOAXIS
41 G_DEFINE_TYPE(Graph, graph, G_TYPE_OBJECT);
43 static void graph_class_init(GraphClass *klass) {
44 GObjectClass *gobject_klass;
45 gobject_klass = G_OBJECT_CLASS(klass);
48 static void graph_init(Graph *graph) {
49 graph->symbol = CIRCLE;
50 graph->points = g_ptr_array_new();
52 graph->xaxis = graph->yaxis = NULL;
55 Graph *graph_new(void) {
56 return g_object_new(GRAPH_TYPE, NULL);
59 /*1 means you're stupid and passed NULL*/
60 int graph_add_graph_point(Graph* graph, struct graph_point *pt) {
61 if(pt == NULL) return 1;
62 g_ptr_array_add(graph->points, pt);
63 if((graph->points->len == 1) && ((graph->lines == NULL) || (graph->lines->len == 0))) {
64 graph->maxx = graph->minx = pt->x;
65 graph->maxy = graph->miny = pt->y;
67 if(pt->x > graph->maxx) graph->maxx = pt->x;
68 if(pt->x < graph->minx) graph->minx = pt->x;
69 if(pt->y > graph->maxy) graph->maxy = pt->y;
70 if(pt->y < graph->miny) graph->miny = pt->y;
77 *1 means failed to allocate point
78 *NOTE: label is duplicated if not NULL (using g_strdup)
80 int graph_add_point(Graph* graph, double x, double y, const GString *label) {
81 struct graph_point *pt = (struct graph_point*)malloc(sizeof(struct graph_point));
82 if(pt == NULL) return 1;
85 pt->label = (label)?g_string_new(label->str):NULL;
86 graph_add_graph_point(graph, pt);
90 int graph_add_graph_line(Graph* graph, struct graph_line *l) {
91 if(l == NULL) return 1;
92 if(graph->lines == NULL) {
93 if((graph->lines = g_ptr_array_new()) == NULL) return 1;
95 g_ptr_array_add(graph->lines, l);
96 if((graph->points->len == 0) &&
97 (graph->lines->len == 1)) {
98 graph->maxx = graph->minx = l->p0_x;
99 graph->maxy = graph->miny = l->p0_y;
101 if(l->p0_x > graph->maxx) graph->maxx = l->p0_x;
102 if(l->p0_x < graph->minx) graph->minx = l->p0_x;
103 if(l->p0_y > graph->maxy) graph->maxy = l->p0_y;
104 if(l->p0_y < graph->miny) graph->miny = l->p0_y;
106 if(l->p3_x > graph->maxx) graph->maxx = l->p3_x;
107 if(l->p3_x < graph->minx) graph->minx = l->p3_x;
108 if(l->p3_y > graph->maxy) graph->maxy = l->p3_y;
109 if(l->p3_y < graph->miny) graph->miny = l->p3_y;
114 int graph_add_line(Graph* graph, double p0_x, double p0_y, double p1_x, double p1_y, double p2_x, double p2_y, double p3_x, double p3_y) {
116 fprintf(stderr, "graph_add_line(%d, p0_x=%g, p0_y=%g, p1_x=%g, p1_y=%g, p2_x=%g, p2_y=%g, p3_x=%g, p3_y=%g\n", (unsigned int) graph, p0_x, p0_y, p1_x, p1_y, p2_x, p2_y, p3_x, p3_y);
118 struct graph_line *l;
119 if((l=(struct graph_line*)malloc(sizeof(struct graph_line))) == NULL) return 2;
128 return graph_add_graph_line(graph, l);
133 struct graph_point *p0;
136 static void linear_interpolate(gpointer data, gpointer user_data) {
137 struct cxt *cxt = user_data;
138 struct graph_point *p3 = data;
139 if(cxt->p0 != NULL) {
140 double p1_x = (p3->x + 2*cxt->p0->x)/3.0;
141 double p1_y = (p3->y + 2*cxt->p0->y)/3.0;
142 double p2_x = (2*p3->x + cxt->p0->x)/3.0;
143 double p2_y = (2*p3->y + cxt->p0->y)/3.0;
144 graph_add_line(cxt->graph, cxt->p0->x, cxt->p0->y, p1_x, p1_y, p2_x, p2_y, p3->x, p3->y);
149 void graph_add_linear_connectors(Graph* graph) {
153 g_ptr_array_foreach(graph->points, &linear_interpolate, &cxt);
156 void graph_bezier_linear_to_cubic(double x0, double x3, double *x1, double *x2) {
157 *x1 = (x3 + 2.0*x0)/3.0;
158 *x2 = (2.0*x3 + x0)/3.0;
161 void graph_bezier_linear_to_quadratic(double x0, double x3, double *x1) {
165 void graph_bezier_quadratic_to_cubic(double x0, double x3, double *x1, double *x2) {
166 *x2 = (x3-2.0*(*x1))/3.0;
167 *x1 = (x0-2.0*(*x1))/3.0;
170 void graph_set_xaxis(Graph *g, struct graph_axis *axis) {
171 if(g->xaxis != NULL) {
176 void graph_set_yaxis(Graph *g, struct graph_axis *axis) {
177 if(g->yaxis != NULL) {
183 struct graph_axis* autoset_axis(Graph* g, GString* title, double min, double max) {
184 struct graph_axis *axis;
189 if(g->points->len == 0) {
192 if((axis=(struct graph_axis *)malloc(sizeof(struct graph_axis))) == NULL) {
195 if(g->points->len == 1) {
199 axis->major_start=min;
200 axis->major_step=max;
202 range_mag = logb(max - min);
206 start_mag = copysign(pow(10, floor(log10(min))), min);
210 stop_mag = copysign(pow(10, ceil(log10(max))), max);
212 if(i*start_mag > min) break;
215 for(j=10; j>1; j--) {
216 if(j*(stop_mag/10) < max) break;
222 axis->major_start=i*start_mag;
223 axis->major_step=(j*(stop_mag/10) - axis->major_start)/(axis->major);
225 axis->title=g_string_new(title->str);
226 #ifdef DEBUG_AUTOAXIS
227 fprintf(stderr, "graph_autoset_xaxis: xmin=%g, log10(xmin)=%g, floor=%g, pow=%g round=%g\n", min, log10(min), floor(log10(min)), pow(10, floor(log10(min))), round(pow(10, floor(log10(min)))));
228 fprintf(stderr, "graph_autoset_xaxis: xmax=%g, log10(xmax)=%g, floor=%g, pow=%g round=%g\n", max, log10(max), floor(log10(max)), pow(10, floor(log10(max))), round(pow(10, floor(log10(max)))));
229 fprintf(stderr, "graph_autoset_xaxis: xmin=%g,max=%g start_mag=%g, stop_mag=%g range_mag=%g\n", min, max, start_mag, stop_mag, range_mag);
234 int graph_autoset_xaxis(Graph *g, GString *title) {
235 graph_set_xaxis(g, autoset_axis(g, title, g->minx, g->maxx));
239 int graph_autoset_yaxis(Graph *g, GString *title) {
240 graph_set_yaxis(g, autoset_axis(g, title, g->miny, g->maxy));