sl@0: /* GLIB - Library of useful routines for C programming
sl@0:  * Copyright (C) 1995-1997  Peter Mattis, Spencer Kimball and Josh MacDonald
sl@0:  * Portion Copyright © 2008-09 Nokia Corporation and/or its subsidiary(-ies). All rights reserved.
sl@0:  * This library is free software; you can redistribute it and/or
sl@0:  * modify it under the terms of the GNU Lesser General Public
sl@0:  * License as published by the Free Software Foundation; either
sl@0:  * version 2 of the License, or (at your option) any later version.
sl@0:  *
sl@0:  * This library is distributed in the hope that it will be useful,
sl@0:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
sl@0:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
sl@0:  * Lesser General Public License for more details.
sl@0:  *
sl@0:  * You should have received a copy of the GNU Lesser General Public
sl@0:  * License along with this library; if not, write to the
sl@0:  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
sl@0:  * Boston, MA 02111-1307, USA.
sl@0:  */
sl@0: 
sl@0: /*
sl@0:  * Modified by the GLib Team and others 1997-2000.  See the AUTHORS
sl@0:  * file for a list of people on the GLib Team.  See the ChangeLog
sl@0:  * files for a list of changes.  These files are distributed with
sl@0:  * GLib at ftp://ftp.gtk.org/pub/gtk/. 
sl@0:  */
sl@0: 
sl@0: #undef G_DISABLE_ASSERT
sl@0: #undef G_LOG_DOMAIN
sl@0: 
sl@0: #ifdef HAVE_CONFIG_H
sl@0: #include <config.h>
sl@0: #endif
sl@0: 
sl@0: #include <stdio.h>
sl@0: #include <string.h>
sl@0: #include <stdlib.h>
sl@0: 
sl@0: #ifdef HAVE_UNISTD_H
sl@0: #include <unistd.h>
sl@0: #endif
sl@0: 
sl@0: #include "glib.h"
sl@0: 
sl@0: #ifdef SYMBIAN
sl@0: #include "mrt2_glib2_test.h"
sl@0: #endif /*SYMBIAN*/
sl@0: 
sl@0: 
sl@0: int array[10000];
sl@0: gboolean failed = FALSE;
sl@0: 
sl@0: #define	TEST(m,cond)	G_STMT_START { failed = !(cond); \
sl@0: if (failed) \
sl@0:   { assert_failed = TRUE; \
sl@0:   	if (!m) \
sl@0:       g_print ("\n(%s:%d) failed for: %s\n", __FILE__, __LINE__, ( # cond )); \
sl@0:     else \
sl@0:       g_print ("\n(%s:%d) failed for: %s: (%s)\n", __FILE__, __LINE__, ( # cond ), (gchar*)m); \
sl@0:       exit(1); \
sl@0:   } \
sl@0: } G_STMT_END
sl@0: 
sl@0: #define	C2P(c)		((gpointer) ((long) (c)))
sl@0: #define	P2C(p)		((gchar) ((long) (p)))
sl@0: 
sl@0: #define GLIB_TEST_STRING "el dorado "
sl@0: #define GLIB_TEST_STRING_5 "el do"
sl@0: 
sl@0: typedef struct {
sl@0: 	guint age;
sl@0: 	gchar name[40];
sl@0: } GlibTestInfo;
sl@0: 
sl@0: static gboolean
sl@0: node_build_string (GNode    *node,
sl@0: 		   gpointer  data)
sl@0: {
sl@0:   gchar **p = data;
sl@0:   gchar *string;
sl@0:   gchar c[2] = "_";
sl@0: 
sl@0:   c[0] = P2C (node->data);
sl@0: 
sl@0:   string = g_strconcat (*p ? *p : "", c, NULL);
sl@0:   g_free (*p);
sl@0:   *p = string;
sl@0: 
sl@0:   return FALSE;
sl@0: }
sl@0: 
sl@0: static void
sl@0: g_node_test (void)
sl@0: {
sl@0:   GNode *root;
sl@0:   GNode *node;
sl@0:   GNode *node_B;
sl@0:   GNode *node_D;
sl@0:   GNode *node_F;
sl@0:   GNode *node_G;
sl@0:   GNode *node_J;
sl@0:   guint i;
sl@0:   gchar *tstring;
sl@0: 
sl@0:   failed = FALSE;
sl@0: 
sl@0:   root = g_node_new (C2P ('A'));
sl@0:   TEST (NULL, g_node_depth (root) == 1 && g_node_max_height (root) == 1);
sl@0: 
sl@0:   node_B = g_node_new (C2P ('B'));
sl@0:   g_node_append (root, node_B);
sl@0:   TEST (NULL, root->children == node_B);
sl@0: 
sl@0:   g_node_append_data (node_B, C2P ('E'));
sl@0:   g_node_prepend_data (node_B, C2P ('C'));
sl@0:   node_D = g_node_new (C2P ('D'));
sl@0:   g_node_insert (node_B, 1, node_D); 
sl@0: 
sl@0:   node_F = g_node_new (C2P ('F'));
sl@0:   g_node_append (root, node_F);
sl@0:   TEST (NULL, root->children->next == node_F);
sl@0: 
sl@0:   node_G = g_node_new (C2P ('G'));
sl@0:   g_node_append (node_F, node_G);
sl@0:   node_J = g_node_new (C2P ('J'));
sl@0:   g_node_prepend (node_G, node_J);
sl@0:   g_node_insert (node_G, 42, g_node_new (C2P ('K')));
sl@0:   g_node_insert_data (node_G, 0, C2P ('H'));
sl@0:   g_node_insert (node_G, 1, g_node_new (C2P ('I')));
sl@0: 
sl@0:   TEST (NULL, g_node_depth (root) == 1);
sl@0:   TEST (NULL, g_node_max_height (root) == 4);
sl@0:   TEST (NULL, g_node_depth (node_G->children->next) == 4);
sl@0:   TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_LEAFS) == 7);
sl@0:   TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_NON_LEAFS) == 4);
sl@0:   TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_ALL) == 11);
sl@0:   TEST (NULL, g_node_max_height (node_F) == 3);
sl@0:   TEST (NULL, g_node_n_children (node_G) == 4);
sl@0:   TEST (NULL, g_node_find_child (root, G_TRAVERSE_ALL, C2P ('F')) == node_F);
sl@0:   TEST (NULL, g_node_find (root, G_LEVEL_ORDER, G_TRAVERSE_NON_LEAFS, C2P ('I')) == NULL);
sl@0:   TEST (NULL, g_node_find (root, G_IN_ORDER, G_TRAVERSE_LEAFS, C2P ('J')) == node_J);
sl@0: 
sl@0:   for (i = 0; i < g_node_n_children (node_B); i++)
sl@0:     {
sl@0:       node = g_node_nth_child (node_B, i);
sl@0:       TEST (NULL, P2C (node->data) == ('C' + i));
sl@0:     }
sl@0:   
sl@0:   for (i = 0; i < g_node_n_children (node_G); i++)
sl@0:     TEST (NULL, g_node_child_position (node_G, g_node_nth_child (node_G, i)) == i);
sl@0: 
sl@0:   /* we have built:                    A
sl@0:    *                                 /   \
sl@0:    *                               B       F
sl@0:    *                             / | \       \
sl@0:    *                           C   D   E       G
sl@0:    *                                         / /\ \
sl@0:    *                                       H  I  J  K
sl@0:    *
sl@0:    * for in-order traversal, 'G' is considered to be the "left"
sl@0:    * child of 'F', which will cause 'F' to be the last node visited.
sl@0:    */
sl@0: 
sl@0:   tstring = NULL;
sl@0:   g_node_traverse (root, G_PRE_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
sl@0:   TEST (tstring, strcmp (tstring, "ABCDEFGHIJK") == 0);
sl@0:   g_free (tstring); tstring = NULL;
sl@0:   g_node_traverse (root, G_POST_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
sl@0:   TEST (tstring, strcmp (tstring, "CDEBHIJKGFA") == 0);
sl@0:   g_free (tstring); tstring = NULL;
sl@0:   g_node_traverse (root, G_IN_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
sl@0:   TEST (tstring, strcmp (tstring, "CBDEAHGIJKF") == 0);
sl@0:   g_free (tstring); tstring = NULL;
sl@0:   g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
sl@0:   TEST (tstring, strcmp (tstring, "ABFCDEGHIJK") == 0);
sl@0:   g_free (tstring); tstring = NULL;
sl@0:   
sl@0:   g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_LEAFS, -1, node_build_string, &tstring);
sl@0:   TEST (tstring, strcmp (tstring, "CDEHIJK") == 0);
sl@0:   g_free (tstring); tstring = NULL;
sl@0:   g_node_traverse (root, G_PRE_ORDER, G_TRAVERSE_NON_LEAFS, -1, node_build_string, &tstring);
sl@0:   TEST (tstring, strcmp (tstring, "ABFG") == 0);
sl@0:   g_free (tstring); tstring = NULL;
sl@0: 
sl@0:   g_node_reverse_children (node_B);
sl@0:   g_node_reverse_children (node_G);
sl@0: 
sl@0:   g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
sl@0:   TEST (tstring, strcmp (tstring, "ABFEDCGKJIH") == 0);
sl@0:   g_free (tstring); tstring = NULL;
sl@0:   
sl@0:   g_node_append (node_D, g_node_new (C2P ('L')));
sl@0:   g_node_append (node_D, g_node_new (C2P ('M')));
sl@0: 
sl@0:   g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
sl@0:   TEST (tstring, strcmp (tstring, "ABFEDCGLMKJIH") == 0);
sl@0:   g_free (tstring); tstring = NULL;
sl@0: 
sl@0:   g_node_destroy (root);
sl@0: 
sl@0:   /* allocation tests */
sl@0: 
sl@0:   root = g_node_new (NULL);
sl@0:   node = root;
sl@0: 
sl@0:   for (i = 0; i < 200; i++)
sl@0:     {
sl@0:       g_node_append (node, g_node_new (NULL));
sl@0:       if ((i%5) == 4)
sl@0: 	node = node->children->next;
sl@0:     }
sl@0:   TEST (NULL, g_node_max_height (root) > 40);
sl@0:   TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_ALL) == 1 + 200);
sl@0: 
sl@0:   g_node_destroy (root);
sl@0:   
sl@0:   if (failed)
sl@0:     exit(1);
sl@0: }
sl@0: 
sl@0: 
sl@0: int
sl@0: main (int   argc,
sl@0:       char *argv[])
sl@0: {
sl@0:   #ifdef SYMBIAN
sl@0:   g_log_set_handler (NULL,  G_LOG_FLAG_FATAL| G_LOG_FLAG_RECURSION | G_LOG_LEVEL_CRITICAL | G_LOG_LEVEL_WARNING | G_LOG_LEVEL_MESSAGE | G_LOG_LEVEL_INFO | G_LOG_LEVEL_DEBUG, &mrtLogHandler, NULL);
sl@0:   g_set_print_handler(mrtPrintHandler);
sl@0:   #endif /*SYMBIAN*/
sl@0: 	  
sl@0: 
sl@0:   g_node_test ();
sl@0: 
sl@0: #ifdef SYMBIAN
sl@0:   testResultXml("node-test");
sl@0: #endif /* EMULATOR */
sl@0:   return 0;
sl@0: }
sl@0: