File: TestFindAbsNodePath.cpp

package info (click to toggle)
ecflow 5.15.2-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 51,868 kB
  • sloc: cpp: 269,341; python: 22,756; sh: 3,609; perl: 770; xml: 333; f90: 204; ansic: 141; makefile: 70
file content (86 lines) | stat: -rw-r--r-- 3,241 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
/*
 * Copyright 2009- ECMWF.
 *
 * This software is licensed under the terms of the Apache Licence version 2.0
 * which can be obtained at http://www.apache.org/licenses/LICENSE-2.0.
 * In applying this licence, ECMWF does not waive the privileges and immunities
 * granted to it by virtue of its status as an intergovernmental organisation
 * nor does it submit to any jurisdiction.
 */

#include <iostream>

#include <boost/test/unit_test.hpp>

#include "ecflow/core/Converter.hpp"
#include "ecflow/node/Defs.hpp"
#include "ecflow/node/Family.hpp"
#include "ecflow/node/Suite.hpp"
#include "ecflow/node/Task.hpp"
#include "ecflow/test/scaffold/Naming.hpp"

using namespace std;
using namespace ecf;

BOOST_AUTO_TEST_SUITE(U_Node)

BOOST_AUTO_TEST_SUITE(T_FindAbsNodePath)

BOOST_AUTO_TEST_CASE(test_find_abs_node_path) {
    ECF_NAME_THIS_TEST();

    size_t no_of_nodes = 0;
    size_t no_of_alias = 0;
    Defs theDefs;
    {
        for (int s = 0; s < 3; s++) {
            suite_ptr suite = theDefs.add_suite("suite" + ecf::convert_to<std::string>(s));
            no_of_nodes++;
            for (int f = 0; f < 3; f++) {
                family_ptr fam = suite->add_family("family" + ecf::convert_to<std::string>(f));
                no_of_nodes++;
                for (int ff = 0; ff < 3; ff++) {
                    family_ptr hfam = fam->add_family("family" + ecf::convert_to<std::string>(ff));
                    no_of_nodes++;
                    for (int t = 0; t < 3; t++) {
                        task_ptr task = hfam->add_task("t1" + ecf::convert_to<std::string>(t));
                        no_of_nodes++;
                        for (int a = 0; a < 3; a++) {
                            task->add_alias_only();
                            no_of_nodes++;
                            no_of_alias++;
                        }
                    }
                }
            }
        }
    }

    // Test Defs::getAllNodes()
    std::vector<Node*> all_nodes;
    theDefs.getAllNodes(all_nodes);
    BOOST_CHECK_MESSAGE(all_nodes.size() == no_of_nodes,
                        "Expected theDefs.getAllNodes() to return " << no_of_nodes << " node, but found "
                                                                    << all_nodes.size());

    // Test Defs::get_all_aliases()
    std::vector<alias_ptr> alias_vec;
    theDefs.get_all_aliases(alias_vec);
    BOOST_CHECK_MESSAGE(alias_vec.size() == no_of_alias,
                        "Expected theDefs.get_all_aliases() to return " << no_of_alias << " node, but found "
                                                                        << alias_vec.size());

    // Test Defs::findAbsNode()
    //   PrintStyle style(PrintStyle::STATE); std::cout << theDefs;
    for (auto node : all_nodes) {
        node_ptr found_node = theDefs.findAbsNode(node->absNodePath());
        BOOST_CHECK_MESSAGE(found_node.get(), "Could not find node " << node->debugNodePath());
        BOOST_CHECK_MESSAGE(found_node.get() == node,
                            " Expected to find " << node->debugNodePath() << " but found "
                                                 << found_node->debugNodePath());
    }
}

BOOST_AUTO_TEST_SUITE_END()

BOOST_AUTO_TEST_SUITE_END()