glibmm r668 - trunk/tests/glibmm_tree

[murrayc svn gnome org]

Author: murrayc
Date: Sat Jun 14 05:56:38 2008
New Revision: 668
URL: http://svn.gnome.org/viewvc/glibmm?rev=668&view=rev

Log:
Added missing files

Added:
   trunk/tests/glibmm_tree/
   trunk/tests/glibmm_tree/Makefile.am
   trunk/tests/glibmm_tree/main.cc

Added: trunk/tests/glibmm_tree/Makefile.am
==============================================================================
--- (empty file)
+++ trunk/tests/glibmm_tree/Makefile.am	Sat Jun 14 05:56:38 2008
@@ -0,0 +1,7 @@
+include $(top_srcdir)/tests/Makefile.am_fragment
+
+noinst_PROGRAMS = test
+test_SOURCES = main.cc
+
+
+

Added: trunk/tests/glibmm_tree/main.cc
==============================================================================
--- (empty file)
+++ trunk/tests/glibmm_tree/main.cc	Sat Jun 14 05:56:38 2008
@@ -0,0 +1,91 @@
+#include <iostream>
+
+#include <glibmm.h>
+
+bool echo(std::string& i)
+{
+  std::cout << i << ' ';
+  return false;
+}
+
+void echof(std::string& i)
+{
+  std::cout << i << ' ';
+}
+
+
+int main()
+{
+  std::string a("a"),
+              b("b"),
+              c("c"),
+              d("d"),
+              e("e"),
+              f("f");
+
+  Glib::Tree<std::string> ta(a),
+                          tb(b),
+                          tc(c),
+                          te(e);
+
+  sigc::slot<bool, std::string&> echoslot = sigc::ptr_fun(echo);
+  sigc::slot<void, std::string&>echofslot = sigc::ptr_fun(echof);
+
+
+  ta.insert(0, tc);
+  ta.prepend(tb);
+  ta.append_data(d);
+  tc.append(te);
+  te.prepend_data(f);
+
+  std::cout << "Breadth-first:" << std::endl;
+  ta.traverse(Glib::LEVEL_ORDER, Glib::TRAVERSE_LEAVES | Glib::TRAVERSE_NON_LEAVES, INT_MAX, &echoslot);
+  std::cout << std::endl;
+
+  std::cout << "Depth-first (pre):" << std::endl;
+  ta.traverse(Glib::PRE_ORDER, Glib::TRAVERSE_LEAVES | Glib::TRAVERSE_NON_LEAVES, INT_MAX, &echoslot);
+  std::cout << std::endl;
+
+  std::cout << "Depth-first (in):" << std::endl;
+  ta.traverse(Glib::IN_ORDER, Glib::TRAVERSE_LEAVES | Glib::TRAVERSE_NON_LEAVES, INT_MAX, &echoslot);
+  std::cout << std::endl;
+
+  std::cout << "Depth-first (post):" << std::endl;
+  ta.traverse(Glib::POST_ORDER, Glib::TRAVERSE_LEAVES | Glib::TRAVERSE_NON_LEAVES, INT_MAX, &echoslot);
+  std::cout << std::endl;
+
+  Glib::Tree<std::string> *tmp = ta.find(Glib::IN_ORDER, Glib::TRAVERSE_LEAVES | Glib::TRAVERSE_NON_LEAVES, e);
+  if(NULL == tmp){ std::cout << e << " not found" << std::endl; }
+  else{ std::cout << "Found " << (tmp->data()) << std::endl; }
+
+  tmp = ta.find(Glib::IN_ORDER, Glib::TRAVERSE_LEAVES | Glib::TRAVERSE_NON_LEAVES, a);
+  if(NULL == tmp){ std::cout << a << " not found" << std::endl; }
+  else{ std::cout << "Found " << (tmp->data()) << std::endl; }
+
+  tmp = ta.find_child(Glib::TRAVERSE_LEAVES | Glib::TRAVERSE_NON_LEAVES, e);
+  if(NULL == tmp){ std::cout << e << " is not a child of " << (ta.data()) << std::endl; }
+  else{ std::cout << "Mistakenly found " << e << " in " << (ta.data()) << "'s children" << std::endl; }
+
+  tmp = ta.find_child(Glib::TRAVERSE_LEAVES | Glib::TRAVERSE_NON_LEAVES, c);
+  if(NULL == tmp) { 
+    std::cout << c << " is the number " << ta.index_of(c) << " child of " << (ta.data()) << std::endl;
+  }
+  else{ std::cout << "Mistakenly didn't find " << c << " in " << (ta.data()) << "'s children" << std::endl; }
+
+  tmp = tc.next_sibling();
+  if(NULL == tmp){ std::cout << tc.data() << "'s next sibling is NULL" << std::endl; }
+  else{ std::cout << tc.data() << "'s next sibling is " << tmp->data() << std::endl; }
+
+  tmp = ta.root();
+  std::cout << "Root is " << (tmp->data()) << std::endl;
+  std::cout << "Depth is " << tmp->max_height() << std::endl;
+
+  ta.unlink(tc);
+  std::cout << "New depth is " << tmp->max_height() << std::endl;
+
+  tmp = tc.root();
+  std::cout << "Pruned root is " << (tmp->data()) << std::endl;
+  std::cout << "Pruned depth is " << tmp->max_height() << std::endl;
+
+  return 0;
+}