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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
|
/*
* Copyright (c) 2007, 2014, Oracle and/or its affiliates. All rights reserved.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation; version 2 of the
* License.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
* 02110-1301 USA
*/
#ifndef _ROLE_TREE_MODEL_H_
#define _ROLE_TREE_MODEL_H_
#include "grt/tree_model.h"
#include "grts/structs.db.h"
#include "wbpublic_public_interface.h"
namespace bec {
class WBPUBLICBACKEND_PUBLIC_FUNC RoleTreeBE : public TreeModel
{
public:
enum Columns {
Enabled,
Name
};
protected:
struct Node
{
Node *parent;
db_RoleRef role;
std::vector<Node*> children;
Node()
: parent(NULL)
{}
~Node()
{
for (std::vector<Node*>::iterator iter= children.begin(); iter!=children.end(); ++iter)
delete *iter;
}
void insert_child_after(Node *after, Node *child)
{
if (after == NULL)
children.push_back(child);
else
{
std::vector<Node*>::iterator insert_point= std::find(children.begin(), children.end(), after);
if(insert_point == children.end())
children.push_back(child);
else
children.insert(insert_point, child);
}
child->parent= this;
if (role.is_valid())
{
if (after)
role->childRoles().insert(child->role, role->childRoles().get_index(after->role));
else
role->childRoles().insert(child->role, role->childRoles().count()-1);
}
child->role->parentRole(this->role);
}
void insert_child_before(Node *before, Node *child)
{
if(before == NULL)
{
children.push_back(child);
}
else
{
std::vector<Node*>::iterator insert_point= std::find(children.begin(), children.end(), before);
if(insert_point == children.end())
children.push_back(child);
else
children.insert(insert_point, child);
}
child->parent= this;
if (role.is_valid())
{
if (before)
role->childRoles().insert(child->role, role->childRoles().get_index(before->role));
else
role->childRoles().insert(child->role);
}
child->role->parentRole(this->role);
}
void append_child(Node *child)
{
children.push_back(child);
child->parent= this;
// If this is the hidden root node then no child roles list exists (the role is just a dummy).
if (role.is_valid())
role->childRoles().insert(child->role);
child->role->parentRole(this->role);
}
void erase_child(Node *child)
{
std::vector<Node*>::iterator erase_point= std::find(children.begin(), children.end(), child);
if(erase_point != children.end())
{
children.erase(erase_point);
child->parent= NULL;
}
// If the current parent is the hidden root node then there is no childRoles collection.
if (role.is_valid())
role->childRoles().remove_value(child->role);
child->role->parentRole(db_RoleRef());
}
};
db_CatalogRef _catalog;
Node *_root;
std::string _object_id;
virtual bool get_field_grt(const NodeId &node, ColumnId column, grt::ValueRef &value);
virtual grt::Type get_field_type(const NodeId &node, ColumnId column);
virtual bool set_field(const NodeId &node, ColumnId column, const std::string &value);
Node *get_node_with_id(const NodeId &node);
bool find_role(const RoleTreeBE::Node *node, const db_RoleRef &role, bec::NodeId &path);
void add_role_children_to_node(Node *parent_node);
bool is_parent_child(Node *parent, Node *child);
public:
RoleTreeBE(const db_CatalogRef &catalog);
void set_object(const db_DatabaseObjectRef &object);
virtual ~RoleTreeBE();
virtual void refresh();
virtual size_t count_children(const NodeId &parent);
virtual NodeId get_child(const NodeId &parent, size_t index);
db_RoleRef get_role_with_id(const NodeId &node)
{
Node *n= get_node_with_id(node);
return (n ? n->role : db_RoleRef());
}
NodeId node_id_for_role(const db_RoleRef &role);
void erase_node(const NodeId &node);
void insert_node_after(const NodeId &after, const NodeId &node);
void insert_node_before(const NodeId &before, const NodeId &node);
void append_child(const NodeId &parent, const NodeId &child);
void move_to_top_level(const NodeId &node);
};
};
#endif
|
