/* GLIB - Library of useful routines for C programming

 * Copyright (C) 1995-1997  Peter Mattis, Spencer Kimball and Josh MacDonald

 * Portion Copyright © 2008-09 Nokia Corporation and/or its subsidiary(-ies). All rights reserved.

 * This library is free software; you can redistribute it and/or

 * modify it under the terms of the GNU Lesser General Public

 * License as published by the Free Software Foundation; either

 * version 2 of the License, or (at your option) any later version.

 *

 * This library is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU

 * Lesser General Public License for more details.

 *

 * You should have received a copy of the GNU Lesser General Public

 * License along with this library; if not, write to the

 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,

 * Boston, MA 02111-1307, USA.

 */

/*

 * Modified by the GLib Team and others 1997-2000.  See the AUTHORS

 * file for a list of people on the GLib Team.  See the ChangeLog

 * files for a list of changes.  These files are distributed with

 * GLib at ftp://ftp.gtk.org/pub/gtk/. 

 */

#include "config.h"

#undef GLIB_COMPILATION

#include <stdio.h>

#include <string.h>

#include <errno.h>

#include "glib.h"

#include <glib/gstdio.h>

#ifdef __SYMBIAN32__

#include <sys/stat.h>

#include <glib_global.h>

#include "mrt2_glib2_test.h"

#endif /*__SYMBIAN32__*/

#ifdef HAVE_UNISTD_H

#include <unistd.h>

#endif

#ifdef G_OS_WIN32

#include <io.h>			/* For read(), write() etc */

#endif

#define GLIB_TEST_STRING "el dorado "

#define GLIB_TEST_STRING_5 "el do"

/* --- variables --- */

static gint test_nums[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };

static gint more_nums[10] = { 8, 9, 7, 0, 3, 2, 5, 1, 4, 6};

/* --- functions --- */

static gint

my_list_compare_one (gconstpointer a, gconstpointer b)

{

  gint one = *((const gint*)a);

  gint two = *((const gint*)b);

  return one-two;

}

static gint

my_list_compare_two (gconstpointer a, gconstpointer b)

{

  gint one = *((const gint*)a);

  gint two = *((const gint*)b);

  return two-one;

}

/* static void

my_list_print (gpointer a, gpointer b)

{

  gint three = *((gint*)a);

  g_print("%d", three);

}; */

static void

glist_test (void)

{

  GList *list = NULL;

  guint i;

  for (i = 0; i < 10; i++)

    list = g_list_append (list, &test_nums[i]);

  list = g_list_reverse (list);

  for (i = 0; i < 10; i++)

    {

      GList *t = g_list_nth (list, i);

      if (*((gint*) t->data) != (9 - i))

	g_error ("Regular insert failed");

    }

  for (i = 0; i < 10; i++)

    if (g_list_position (list, g_list_nth (list, i)) != i)

      g_error ("g_list_position does not seem to be the inverse of g_list_nth\n");

  g_list_free (list);

  list = NULL;

  for (i = 0; i < 10; i++)

    list = g_list_insert_sorted (list, &more_nums[i], my_list_compare_one);

  /*

  g_print("\n");

  g_list_foreach (list, my_list_print, NULL);

  */

  for (i = 0; i < 10; i++)

    {

      GList *t = g_list_nth (list, i);

      if (*((gint*) t->data) != i)

         g_error ("Sorted insert failed");

    }

  g_list_free (list);

  list = NULL;

  for (i = 0; i < 10; i++)

    list = g_list_insert_sorted (list, &more_nums[i], my_list_compare_two);

  /*

  g_print("\n");

  g_list_foreach (list, my_list_print, NULL);

  */

  for (i = 0; i < 10; i++)

    {

      GList *t = g_list_nth (list, i);

      if (*((gint*) t->data) != (9 - i))

         g_error ("Sorted insert failed");

    }

  g_list_free (list);

  list = NULL;

  for (i = 0; i < 10; i++)

    list = g_list_prepend (list, &more_nums[i]);

  list = g_list_sort (list, my_list_compare_two);

  /*

  g_print("\n");

  g_list_foreach (list, my_list_print, NULL);

  */

  for (i = 0; i < 10; i++)

    {

      GList *t = g_list_nth (list, i);

      if (*((gint*) t->data) != (9 - i))

         g_error ("Merge sort failed");

    }

  g_list_free (list);

}

static void

gslist_test (void)

{

  GSList *slist = NULL;

  guint i;

  for (i = 0; i < 10; i++)

    slist = g_slist_append (slist, &test_nums[i]);

  slist = g_slist_reverse (slist);

  for (i = 0; i < 10; i++)

    {

      GSList *st = g_slist_nth (slist, i);

      if (*((gint*) st->data) != (9 - i))

	g_error ("failed");

    }

  g_slist_free (slist);

  slist = NULL;

  for (i = 0; i < 10; i++)

    slist = g_slist_insert_sorted (slist, &more_nums[i], my_list_compare_one);

  /*

  g_print("\n");

  g_slist_foreach (slist, my_list_print, NULL);

  */

  for (i = 0; i < 10; i++)

    {

      GSList *st = g_slist_nth (slist, i);

      if (*((gint*) st->data) != i)

        g_error ("Sorted insert failed");

    }

  g_slist_free (slist);

  slist = NULL;

  for (i = 0; i < 10; i++)

    slist = g_slist_insert_sorted (slist, &more_nums[i], my_list_compare_two);

  /*

  g_print("\n");

  g_slist_foreach (slist, my_list_print, NULL);

  */

  for (i = 0; i < 10; i++)

    {

      GSList *st = g_slist_nth (slist, i);

      if (*((gint*) st->data) != (9 - i))

        g_error("Sorted insert failed");

    }

  g_slist_free(slist);

  slist = NULL;

  for (i = 0; i < 10; i++)

    slist = g_slist_prepend (slist, &more_nums[i]);

  slist = g_slist_sort (slist, my_list_compare_two);

  /*

  g_print("\n");

  g_slist_foreach (slist, my_list_print, NULL);

  */

  for (i = 0; i < 10; i++)

    {

      GSList *st = g_slist_nth (slist, i);

      if (*((gint*) st->data) != (9 - i))

        g_error("Sorted insert failed");

    }

  g_slist_free(slist);

}

static gboolean

node_build_string (GNode    *node,

		   gpointer  data)

{

  gchar **p = data;

  gchar *string;

  gchar c[2] = "_";

  c[0] = ((gchar) ((gintptr) (node->data)));

  string = g_strconcat (*p ? *p : "", c, NULL);

  g_free (*p);

  *p = string;

  return FALSE;

}

static void

gnode_test (void)

{

#define	C2P(c)		((gpointer) ((long) (c)))

#define	P2C(p)		((gchar) ((gintptr) (p)))

  GNode *root;

  GNode *node;

  GNode *node_B;

  GNode *node_F;

  GNode *node_G;

  GNode *node_J;

  guint i;

  gchar *tstring, *cstring;

  root = g_node_new (C2P ('A'));

  g_assert (g_node_depth (root) == 1 && g_node_max_height (root) == 1);

  node_B = g_node_new (C2P ('B'));

  g_node_append (root, node_B);

  g_assert (root->children == node_B);

  g_node_append_data (node_B, C2P ('E'));

  g_node_prepend_data (node_B, C2P ('C'));

  g_node_insert (node_B, 1, g_node_new (C2P ('D')));

  node_F = g_node_new (C2P ('F'));

  g_node_append (root, node_F);

  g_assert (root->children->next == node_F);

  node_G = g_node_new (C2P ('G'));

  g_node_append (node_F, node_G);

  node_J = g_node_new (C2P ('J'));

  g_node_prepend (node_G, node_J);

  g_node_insert (node_G, 42, g_node_new (C2P ('K')));

  g_node_insert_data (node_G, 0, C2P ('H'));

  g_node_insert (node_G, 1, g_node_new (C2P ('I')));

  g_assert (g_node_depth (root) == 1);

  g_assert (g_node_max_height (root) == 4);

  g_assert (g_node_depth (node_G->children->next) == 4);

  g_assert (g_node_n_nodes (root, G_TRAVERSE_LEAFS) == 7);

  g_assert (g_node_n_nodes (root, G_TRAVERSE_NON_LEAFS) == 4);

  g_assert (g_node_n_nodes (root, G_TRAVERSE_ALL) == 11);

  g_assert (g_node_max_height (node_F) == 3);

  g_assert (g_node_n_children (node_G) == 4);

  g_assert (g_node_find_child (root, G_TRAVERSE_ALL, C2P ('F')) == node_F);

  g_assert (g_node_find (root, G_LEVEL_ORDER, G_TRAVERSE_NON_LEAFS, C2P ('I')) == NULL);

  g_assert (g_node_find (root, G_IN_ORDER, G_TRAVERSE_LEAFS, C2P ('J')) == node_J);

  for (i = 0; i < g_node_n_children (node_B); i++)

    {

      node = g_node_nth_child (node_B, i);

      g_assert (P2C (node->data) == ('C' + i));

    }

  for (i = 0; i < g_node_n_children (node_G); i++)

    g_assert (g_node_child_position (node_G, g_node_nth_child (node_G, i)) == i);

  /* we have built:                    A

   *                                 /   \

   *                               B       F

   *                             / | \       \

   *                           C   D   E       G

   *                                         / /\ \

   *                                       H  I  J  K

   *

   * for in-order traversal, 'G' is considered to be the "left"

   * child of 'F', which will cause 'F' to be the last node visited.

   */

  tstring = NULL;

  g_node_traverse (root, G_PRE_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);

  g_assert_cmpstr (tstring, ==, "ABCDEFGHIJK");

  g_free (tstring); tstring = NULL;

  g_node_traverse (root, G_POST_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);

  g_assert_cmpstr (tstring, ==, "CDEBHIJKGFA");

  g_free (tstring); tstring = NULL;

  g_node_traverse (root, G_IN_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);

  g_assert_cmpstr (tstring, ==, "CBDEAHGIJKF");

  g_free (tstring); tstring = NULL;

  g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);

  g_assert_cmpstr (tstring, ==, "ABFCDEGHIJK");

  g_free (tstring); tstring = NULL;

  g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_LEAFS, -1, node_build_string, &tstring);

  g_assert_cmpstr (tstring, ==, "CDEHIJK");

  g_free (tstring); tstring = NULL;

  g_node_traverse (root, G_PRE_ORDER, G_TRAVERSE_NON_LEAFS, -1, node_build_string, &tstring);

  g_assert_cmpstr (tstring, ==, "ABFG");

  g_free (tstring); tstring = NULL;

  g_node_reverse_children (node_B);

  g_node_reverse_children (node_G);

  g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);

  g_assert_cmpstr (tstring, ==, "ABFEDCGKJIH");

  g_free (tstring); tstring = NULL;

  cstring = NULL;

  node = g_node_copy (root);

  g_assert (g_node_n_nodes (root, G_TRAVERSE_ALL) == g_node_n_nodes (node, G_TRAVERSE_ALL));

  g_assert (g_node_max_height (root) == g_node_max_height (node));

  g_node_traverse (root, G_IN_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);

  g_node_traverse (node, G_IN_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &cstring);

  g_assert_cmpstr (tstring, ==, cstring);

  g_free (tstring); tstring = NULL;

  g_free (cstring); cstring = NULL;

  g_node_destroy (node);

  g_node_destroy (root);

  /* allocation tests */

  root = g_node_new (NULL);

  node = root;

  for (i = 0; i < 2048; i++)

    {

      g_node_append (node, g_node_new (NULL));

      if ((i%5) == 4)

	node = node->children->next;

    }

  g_assert (g_node_max_height (root) > 100);

  g_assert (g_node_n_nodes (root, G_TRAVERSE_ALL) == 1 + 2048);

  g_node_destroy (root);

#undef C2P

#undef P2C

}

static gint

my_compare (gconstpointer a,

	    gconstpointer b)

{

  const char *cha = a;

  const char *chb = b;

  return *cha - *chb;

}

static gint

my_traverse (gpointer key,

	     gpointer value,

	     gpointer data)

{

  char *ch = key;

  g_print ("%c ", *ch);

  return FALSE;

}

static void

binary_tree_test (void)

{

  GTree *tree;

  char chars[62];

  guint i, j;

  tree = g_tree_new (my_compare);

  i = 0;

  for (j = 0; j < 10; j++, i++)

    {

      chars[i] = '0' + j;

      g_tree_insert (tree, &chars[i], &chars[i]);

    }

  for (j = 0; j < 26; j++, i++)

    {

      chars[i] = 'A' + j;

      g_tree_insert (tree, &chars[i], &chars[i]);

    }

  for (j = 0; j < 26; j++, i++)

    {

      chars[i] = 'a' + j;

      g_tree_insert (tree, &chars[i], &chars[i]);

    }

  g_assert_cmpint (g_tree_nnodes (tree), ==, 10 + 26 + 26);

  g_assert_cmpint (g_tree_height (tree), ==, 6);

  if (g_test_verbose())

    {

      g_print ("tree: ");

      g_tree_foreach (tree, my_traverse, NULL);

      g_print ("\n");

    }

  for (i = 0; i < 10; i++)

    g_tree_remove (tree, &chars[i]);

  g_assert_cmpint (g_tree_nnodes (tree), ==, 26 + 26);

  g_assert_cmpint (g_tree_height (tree), ==, 6);

  if (g_test_verbose())

    {

      g_print ("tree: ");

      g_tree_foreach (tree, my_traverse, NULL);

      g_print ("\n");

    }

}

static gboolean

my_hash_callback_remove (gpointer key,

			 gpointer value,

			 gpointer user_data)

{

  int *d = value;

  if ((*d) % 2)

    return TRUE;

  return FALSE;

}

static void

my_hash_callback_remove_test (gpointer key,

			      gpointer value,

			      gpointer user_data)

{

  int *d = value;

  if ((*d) % 2)

    g_print ("bad!\n");

}

static void

my_hash_callback (gpointer key,

		  gpointer value,

		  gpointer user_data)

{

  int *d = value;

  *d = 1;

}

static guint

my_hash (gconstpointer key)

{

  return (guint) *((const gint*) key);

}

static gboolean

my_hash_equal (gconstpointer a,

	       gconstpointer b)

{

  return *((const gint*) a) == *((const gint*) b);

}

static gboolean 

find_first_that(gpointer key, 

		gpointer value, 

		gpointer user_data)

{

  gint *v = value;

  gint *test = user_data;

  return (*v == *test);

}

static void

test_g_parse_debug_string (void)

{

  GDebugKey keys[3] = { 

    { "foo", 1 },

    { "bar", 2 },

    { "baz", 4 }

  };

  guint n_keys = 3;

  guint result;

  result = g_parse_debug_string ("bar:foo:blubb", keys, n_keys);

  g_assert (result == 3);

  result = g_parse_debug_string (":baz::_E@~!_::", keys, n_keys);