libgeda/tests/rtree.c

   1 #include "config.h"
   2
   3 #include <dejagnu.h>
   4 #include <glib.h>
   5 #include <stdio.h>
   6 #include <string.h>
   7 #include "libgeda_priv.h"
   8
   9 char const *rtree_test_data[] = {
  10   "v 20080706 2",
  11   "L 40500 40500 40500 50500 3 0 0 0 -1 -1",
  12   "L 56500 40500 56500 50500 3 0 0 0 -1 -1",
  13   "B 41000 40500 15000 10000 3 0 0 0 -1 -1 0 -1 -1 -1 -1 -1",
  14   "B 41500 40900 7500 9100 3 0 0 0 -1 -1 0 -1 -1 -1 -1 -1",
  15   "B 42000 45000 13500 4500 3 0 0 0 -1 -1 0 -1 -1 -1 -1 -1",
  16   "B 49500 44000 5000 5000 3 0 0 0 -1 -1 0 -1 -1 -1 -1 -1",
  17   "B 50000 43500 5000 1000 3 0 0 0 -1 -1 0 -1 -1 -1 -1 -1",
  18   "", NULL
  19 };
  20
  21 static enum visit_result rtree_add(OBJECT *o_current, void *context)
  22 {
  23   RTREE *rtree = context;
  24
  25   m_rtree_add(rtree, o_current);
  26
  27   return VISIT_RES_OK;
  28 }
  29
  30 int main()
  31 {
  32   TOPLEVEL *toplevel;
  33   PAGE *page;
  34   RTREE *rtree;
  35   GList *found_objects;
  36   char *buf;
  37
  38   libgeda_init(FALSE);
  39
  40   toplevel = s_toplevel_new();
  41   page = s_page_new(toplevel, "test");
  42   s_toplevel_goto_page(toplevel, page);
  43
  44   buf = g_strjoinv("\n", rtree_test_data);
  45   o_read_buffer(toplevel, toplevel->page_current->object_tail,
  46                 buf, strlen(buf), "test");
  47   g_free(buf);
  48
  49   rtree = m_rtree_new(0, 0, G_MAXINT, G_MAXINT);
  50   s_visit_page(toplevel->page_current, rtree_add, rtree, VISIT_ANY, 1);
  51
  52   found_objects = m_rtree_find(rtree, NULL, 0, 0, G_MAXINT, G_MAXINT);
  53   if (g_list_length(found_objects) == 7) {
  54     /* Assume that all 7 are right. */
  55     pass("rtree find-all");
  56   } else {
  57     GList *iter;
  58     for (iter = found_objects; iter != NULL; iter = iter->next) {
  59       OBJECT *o_current = iter->data;
  60       switch (o_current->type) {
  61         char *representation;
  62       case OBJ_LINE:
  63         representation = o_line_save(o_current);
  64         printf("%s\n", representation);
  65         break;
  66       case OBJ_BOX:
  67         representation = o_box_save(o_current);
  68         printf("%s\n", representation);
  69         break;
  70       default:
  71         printf("%c ...\n", o_current->type);
  72         break;
  73       }
  74     }
  75     fail("rtree find-all (%d)", g_list_length(found_objects));
  76   }
  77   g_list_free(found_objects);
  78
  79   found_objects = m_rtree_find(rtree, NULL, 40500, 40500, 40500, 50500);
  80   if (g_list_length(found_objects) == 1) {
  81     OBJECT *o_current = found_objects->data;
  82     if (o_current->type == OBJ_LINE) {
  83       char *representation = o_line_save(o_current);
  84       if (strcmp(representation, rtree_test_data[1]) == 0) {
  85         pass("rtree find-line");
  86       } else {
  87         fail("rtree find-line (details)");
  88       }
  89       g_free(representation);
  90     } else {
  91       fail("rtree find-line (type)");
  92     }
  93   } else {
  94     fail("rtree find-line (number)");
  95   }
  96   g_list_free(found_objects);
  97
  98   found_objects = m_rtree_find(rtree, NULL, 41000, 40500, 49500, 50500);
  99   if (g_list_length(found_objects) == 1) {
 100     OBJECT *o_current = found_objects->data;
 101     if (o_current->type == OBJ_BOX) {
 102       char *representation = o_box_save(o_current);
 103       if (strcmp(representation, rtree_test_data[4]) == 0) {
 104         pass("rtree find-box-simple");
 105       } else {
 106         fail("rtree find-box-simple (details)");
 107       }
 108       g_free(representation);
 109     } else {
 110       fail("rtree find-box-simple (type)");
 111     }
 112   } else {
 113     fail("rtree find-box-simple (number)");
 114   }
 115   g_list_free(found_objects);
 116
 117   return failed ? 1 : 0;
 118 }