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 Sun May 12 01:17:25 2002 Speed Blue
35 G_DEFINE_TYPE(Graph, graph, G_TYPE_OBJECT);
37 static void graph_class_init(GraphClass *klass) {
38 GObjectClass *gobject_klass;
39 gobject_klass = G_OBJECT_CLASS(klass);
42 static void graph_init(Graph *graph) {
43 graph->symbol = CIRCLE;
44 graph->points = g_ptr_array_new();
48 Graph *graph_new(void) {
49 return g_object_new(GRAPH_TYPE, NULL);
52 /*1 means you're stupid and passed NULL*/
53 int graph_add_graph_point(Graph* graph, struct graph_point *pt) {
54 if(pt == NULL) return 1;
55 g_ptr_array_add(graph->points, pt);
56 if(graph->points->len == 1) {
57 graph->maxx = graph->minx = pt->x;
58 graph->maxy = graph->miny = pt->y;
60 if(pt->x > graph->maxx) graph->maxx = pt->x;
61 if(pt->x < graph->minx) graph->minx = pt->x;
62 if(pt->y > graph->maxy) graph->maxy = pt->y;
63 if(pt->y < graph->miny) graph->miny = pt->y;
70 *1 means failed to allocate point
71 *NOTE: label is duplicated if not NULL (using g_strdup)
73 int graph_add_point(Graph* graph, double x, double y, const GString *label) {
74 struct graph_point *pt = (struct graph_point*)malloc(sizeof(struct graph_point));
75 if(pt == NULL) return 1;
78 pt->label = (label)?g_string_new(label->str):NULL;
79 /*Easiest way to do a line: the control points are the same as this point*/
80 pt->bezier_from_x = pt->bezier_to_x = x;
81 pt->bezier_from_y = pt->bezier_to_y = y;
82 graph_add_graph_point(graph, pt);