Line data Source code
1 : /*
2 : * Copyright (c) 2007-2015: Sebastian Reiter
3 : * Author: Sebastian Reiter
4 : *
5 : * This file is part of UG4.
6 : *
7 : * UG4 is free software: you can redistribute it and/or modify it under the
8 : * terms of the GNU Lesser General Public License version 3 (as published by the
9 : * Free Software Foundation) with the following additional attribution
10 : * requirements (according to LGPL/GPL v3 §7):
11 : *
12 : * (1) The following notice must be displayed in the Appropriate Legal Notices
13 : * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
14 : *
15 : * (2) The following notice must be displayed at a prominent place in the
16 : * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
17 : *
18 : * (3) The following bibliography is recommended for citation and must be
19 : * preserved in all covered files:
20 : * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
21 : * parallel geometric multigrid solver on hierarchically distributed grids.
22 : * Computing and visualization in science 16, 4 (2013), 151-164"
23 : * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
24 : * flexible software system for simulating pde based models on high performance
25 : * computers. Computing and visualization in science 16, 4 (2013), 165-179"
26 : *
27 : * This program is distributed in the hope that it will be useful,
28 : * but WITHOUT ANY WARRANTY; without even the implied warranty of
29 : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
30 : * GNU Lesser General Public License for more details.
31 : */
32 :
33 : #include "group_node.h"
34 :
35 : namespace ug{
36 : namespace node_tree
37 : {
38 :
39 0 : SPGroupNode GroupNode::create()
40 : {
41 0 : GroupNode* node = new GroupNode;
42 0 : node->m_objectCode = OC_GROUP_NODE;
43 0 : return SPGroupNode(node);
44 : }
45 :
46 0 : GroupNode::GroupNode()
47 : {
48 0 : }
49 :
50 0 : GroupNode::~GroupNode()
51 : {
52 0 : }
53 :
54 0 : void GroupNode::clear()
55 : {
56 : vChildren.clear();
57 0 : }
58 :
59 0 : void GroupNode::add_child(SPNode node)
60 : {
61 0 : vChildren.push_back(node);
62 0 : }
63 :
64 0 : void GroupNode::remove_child(SPNode node)
65 : {
66 0 : for(std::vector<SPNode>::iterator iter = vChildren.begin();
67 0 : iter != vChildren.end(); iter++)
68 : {
69 : SPNode& spNode = *iter;
70 0 : if(spNode == node)
71 : {
72 0 : vChildren.erase(iter);
73 0 : break;
74 : }
75 : }
76 0 : }
77 :
78 0 : int GroupNode::num_children()
79 : {
80 0 : return vChildren.size();
81 : }
82 :
83 0 : SPNode GroupNode::get_child(int index)
84 : {
85 0 : return vChildren[index];
86 : }
87 :
88 : }// end of namespace node_tree
89 : }// end of namespace ug
|