/Users/Shared/Development/cpp/sourceforge/cpunit/src/unittest_TestStore.cpp

Go to the documentation of this file.

/*
   Copyright (c) 2011 Daniel Bakkelund.
   All rights reserved.

   Redistribution and use in source and binary forms, with or without
   modification, are permitted provided that the following conditions
   are met:
    1. Redistributions of source code must retain the above copyright
       notice, this list of conditions and the following disclaimer.
    2. Redistributions in binary form must reproduce the above copyright
       notice, this list of conditions and the following disclaimer in the
       documentation and/or other materials provided with the distribution.
    3. Neither the name of the copyright holders nor the names of its
       contributors may be used to endorse or promote products derived from
       this software without specific prior written permission.

   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
   AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
   IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
   ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
   LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
   CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
   SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
   INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
   CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
   ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
   THE POSSIBILITY OF SUCH DAMAGE.
*/



#include "unittest_TestStore.hpp"
#include "unittest_TestTreeNode.hpp"
#include "unittest_TestUnit.hpp"
#include "unittest_GlobMatcher.hpp"
#include "unittest_trace.hpp"

unittest::TestStore *unittest::TestStore::INSTANCE(NULL);

unittest::TestStore::TestStore()
  : root(new TestTreeNode(""))
{}

unittest::TestStore::~TestStore()
{}

void
unittest::TestStore::dispose() {
  UNITTEST_DTRACE("TestStore::dispose()");
  delete INSTANCE;
  INSTANCE = NULL;
  UNITTEST_DTRACE("TestStore - disposed.");
}


unittest::TestStore& unittest::TestStore::get_instance() {
  if (INSTANCE == NULL) {
    INSTANCE = new TestStore;
  }
  return *INSTANCE;
}

void 
unittest::TestStore::insert_set_up(Callable *su) {
  UNITTEST_ITRACE("TestStore::insert_set_up for "<<su->get_reg_info().get_path());
  TestTreeNode *n = find_node(su->get_reg_info().get_path(), true);
  n->register_set_up(su);
}

void 
unittest::TestStore::insert_tear_down(Callable *td) {
  UNITTEST_ITRACE("TestStore::insert_tear_down for "<<td->get_reg_info().get_path());
  TestTreeNode *n = find_node(td->get_reg_info().get_path(), true);
  n->register_tear_down(td);
}

void 
unittest::TestStore::insert_test(Callable *test) {
  UNITTEST_ITRACE("TestStore::insert_test in "<<test->get_reg_info().get_path()<<": "<<test->get_reg_info().get_name());
  TestTreeNode *n = find_node(test->get_reg_info().get_path(), true);
  n->add_test(test);
}

std::vector<unittest::TestUnit> 
unittest::TestStore::get_test_units(const std::string pattern) {
  std::vector<TestUnit> result;
  GlobMatcher m(pattern);
  root->extract_matches(result, m);
  return result;
}

std::vector<unittest::RegInfo> 
unittest::TestStore::get_tests(const std::string pattern) {
  std::vector<TestUnit> tus = get_test_units(pattern);
  std::vector<RegInfo> result(tus.size());
  for (std::size_t i=0; i<tus.size(); i++) {
    result[i] = tus[i].get_test()->get_reg_info();
  }
  return result;
}

std::vector<std::string> 
unittest::TestStore::decompose_path(const std::string& path) const {
  static const std::string sep("::");

  std::vector<std::string> result;

  std::string str = path;
  if (str.find(sep) == 0) {
    str = str.substr(sep.length());
  }

  std::size_t index;
  while ((index = str.find(sep)) != std::string::npos) {
    result.push_back(str.substr(0, index));
    str = str.substr(index + sep.length());
  }
  if (str.length() > 0) {
    result.push_back(str);
  }
  return result;
}

unittest::TestTreeNode* 
unittest::TestStore::find_node(const std::string& path, const bool create_nonexisting) {
  UNITTEST_DTRACE("TestStore::find_node("<<path<<", "<<create_nonexisting<<')');
  std::vector<std::string> path_elts = decompose_path(path);
  TestTreeNode *current = root.get();
  for (std::size_t i=0; i<path_elts.size(); i++) {
    UNITTEST_DTRACE("TestStore::find_node - i="<<i<<" path_elts["<<i<<"]='"<<path_elts[i]<<"' current='"<<current->get_path()<<'\'');
    std::map<std::string, TestTreeNode*> children = current->get_children();
    std::map<std::string, TestTreeNode*>::iterator next = children.find(path_elts[i]);
    if (next != children.end()) {
      UNITTEST_DTRACE("TestStore::find_node - has next");
      current = next->second;
    } else if (create_nonexisting) {
      UNITTEST_DTRACE("TestStore::find_node - creating next: '"<<path_elts[i]<<'\'');
      TestTreeNode *next_child = new TestTreeNode(path_elts[i]);
      current->add_child(next_child);
      current = next_child;
    } else {
      UNITTEST_DTRACE("TestStore::find_node - returning NULL.");
      return NULL;
    }
  }
  UNITTEST_DTRACE("TestStore::find_node - returning '"<<current->get_path()<<'\'');
  return current;
}