hashtree_test.cpp

Go to the documentation of this file.

#include "a_lolly_test.hpp"
#include "hashtree.hpp"
#include "string.hpp"
#include <string>
 
TEST_CASE ("Test the add_child function") {
  hashtree<int, string> t;
  string                a ("one");
  string                b ("two");
  hashtree<int, string> child1 (string ("one"));
  hashtree<int, string> child2 (string ("two"));
  hashtree<int, string> child3 (string ("three"));
  t->add_child (1, child1);
  t->add_child (2, child2);
 
  CHECK (N (child1) == 0);
  CHECK (N (child2) == 0);
  CHECK (N (t) == 2);
 
  child1->add_child (3, child3);
 
  CHECK (N (child1) == 1);
  CHECK (N (child2) == 0);
  CHECK_EQ (N (t) == 3, false);
  CHECK_EQ (N (t) == 2, true);
}
 
TEST_CASE ("Test the contains function") {
  hashtree<int, string> t;
 
  string a ("one");
  string b ("two");
 
  hashtree<int, string> child1 (string ("one"));
  hashtree<int, string> child2 (string ("two"));
  t->add_child (1, child1);
  t->add_child (2, child2);
  CHECK (t->contains (1));
  CHECK (t->contains (2));
  CHECK (!t->contains (3));
}
 
TEST_CASE ("add_new_child function") {
  hashtree<int, string> t;
 
  string a ("one");
  string b ("two");
 
  hashtree<int, string> child1 (string ("one"));
  hashtree<int, string> child2 (string ("two"));
  t->add_child (1, child1);
  t->add_child (2, child2);
  t->add_new_child (3);
  CHECK_EQ (N (child2) == 3, false);
  CHECK (t->contains (3));
}
 
TEST_CASE ("set_label and get_label function") {
  hashtree<int, string> t;
  t->set_label ("root");
  CHECK_EQ (t->get_label () == "root", true);
}
 
TEST_CASE ("Test the N and is_nil functions") {
  hashtree<int, std::string> nil_tree;
  CHECK_EQ (is_nil (nil_tree), false);
}