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
|
/*
This file is part of libkldap.
Copyright (c) 2006 Sean Harmer <sh@theharmers.co.uk>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library 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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#include "ldapstructureproxymodel.h"
#include "ldapmodel.h"
#include "ldapmodelnode_p.h"
#include <kdebug.h>
#include <klocale.h>
using namespace KLDAP;
class LdapStructureProxyModel::LdapStructureProxyModelPrivate
{
public:
LdapStructureProxyModelPrivate();
};
LdapStructureProxyModel::LdapStructureProxyModelPrivate::LdapStructureProxyModelPrivate()
{
}
LdapStructureProxyModel::LdapStructureProxyModel( QObject *parent )
: QSortFilterProxyModel( parent ),
m_d( new LdapStructureProxyModelPrivate() )
{
}
LdapStructureProxyModel::~LdapStructureProxyModel()
{
delete m_d;
}
QVariant LdapStructureProxyModel::data( const QModelIndex &index,
int role ) const
{
// Included just in case we decide to do any special presentation of the data
// at some other point throughout the 4.x series.
return sourceModel()->data( mapToSource( index ), role );
}
bool LdapStructureProxyModel::setData( const QModelIndex &index,
const QVariant &value,
int role )
{
Q_UNUSED( index );
Q_UNUSED( value );
Q_UNUSED( role );
return false;
}
bool LdapStructureProxyModel::filterAcceptsRow( int sourceRow,
const QModelIndex &sourceParent ) const
{
QModelIndex idx = sourceModel()->index( sourceRow, 0, sourceParent );
LdapModelNode::NodeType nodeType =
static_cast<LdapModelNode::NodeType>(
sourceModel()->data( idx, LdapModel::NodeTypeRole ).toUInt() );
return nodeType == LdapModelNode::DN;
}
QVariant LdapStructureProxyModel::headerData( int section,
Qt::Orientation orientation,
int role ) const
{
Q_UNUSED( section );
if ( orientation == Qt::Horizontal && role == Qt::DisplayRole ) {
return QString( i18n( "Distinguished Name" ) );
}
return QVariant();
}
int LdapStructureProxyModel::columnCount( const QModelIndex &/*parent*/ ) const
{
// No need for more than one column just to show the structure
return 1;
}
Qt::ItemFlags LdapStructureProxyModel::flags( const QModelIndex &index ) const
{
// Included so as not to break BC in case we wish to use this later in 4.x
return sourceModel()->flags( mapToSource( index ) );
}
bool LdapStructureProxyModel::hasChildren( const QModelIndex &parent ) const
{
// We need to handle this carefully bacause of the filtering out of attributes
// and the lazy population approach.
LdapModel *model = static_cast<LdapModel*>( sourceModel() );
return model->hasChildrenOfType( mapToSource( parent ), LdapModel::DistinguishedName );
}
QModelIndex LdapStructureProxyModel::mapFromSource( const QModelIndex &sourceIndex ) const
{
return QSortFilterProxyModel::mapFromSource( sourceIndex );
}
QModelIndex LdapStructureProxyModel::mapToSource( const QModelIndex &proxyIndex ) const
{
return QSortFilterProxyModel::mapToSource( proxyIndex );
}
bool LdapStructureProxyModel::insertRows( int row, int count,
const QModelIndex &parent )
{
Q_UNUSED( row );
Q_UNUSED( count );
Q_UNUSED( parent );
return false;
}
bool LdapStructureProxyModel::removeRows( int row, int count,
const QModelIndex &parent )
{
Q_UNUSED( row );
Q_UNUSED( count );
Q_UNUSED( parent );
return false;
}
void LdapStructureProxyModel::sort( int column, Qt::SortOrder order )
{
Q_UNUSED( column );
Q_UNUSED( order );
}
Qt::DropActions LdapStructureProxyModel::supportedDropActions() const
{
return Qt::MoveAction;
}
QMimeData *LdapStructureProxyModel::mimeData( const QModelIndexList &indexes ) const
{
Q_UNUSED( indexes );
return 0;
}
bool LdapStructureProxyModel::dropMimeData( const QMimeData *data, Qt::DropAction action,
int row, int column, const QModelIndex &parent )
{
/** \todo Implement drag and drop for LdapModel */
Q_UNUSED( data );
Q_UNUSED( action );
Q_UNUSED( row );
Q_UNUSED( column );
Q_UNUSED( parent );
return false;
}
#include "ldapstructureproxymodel.moc"
|
