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
|
/*
* This file is part of KDevelop
*
* Copyright 2006 Adam Treat <treat@kde.org>
*
* This program 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 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 Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include "codeproxy.h"
#include "cpplanguagesupport.h"
#include "parser/codemodel.h"
#include <kdebug.h>
CodeProxy::CodeProxy( QObject* parent )
: KDevelop::CodeProxy( parent ),
m_kindFilter( 0 )
{
QMap<QString, int> filter;
filter.insert( "Namespace", _CodeModelItem::Kind_Namespace );
filter.insert( "Class", _CodeModelItem::Kind_Class );
filter.insert( "Enum", _CodeModelItem::Kind_Enum );
filter.insert( "Enumerator", _CodeModelItem::Kind_Enumerator );
filter.insert( "Function", _CodeModelItem::Kind_Function );
filter.insert( "Function Def.", _CodeModelItem::Kind_FunctionDefinition );
filter.insert( "Argument", _CodeModelItem::Kind_Argument );
filter.insert( "Template", _CodeModelItem::Kind_Template );
filter.insert( "Template Param.", _CodeModelItem::Kind_TemplateParameter );
filter.insert( "Type Alias", _CodeModelItem::Kind_TypeAlias );
filter.insert( "Variable", _CodeModelItem::Kind_Variable );
setKindFilterList( filter );
m_sortKind.append( _CodeModelItem::Kind_Namespace );
m_sortKind.append( _CodeModelItem::Kind_Class );
m_sortKind.append( _CodeModelItem::Kind_Enum );
m_sortKind.append( _CodeModelItem::Kind_File );
m_sortKind.append( _CodeModelItem::Kind_Scope );
m_sortKind.append( _CodeModelItem::Kind_Member );
m_sortKind.append( _CodeModelItem::Kind_Function );
m_sortKind.append( _CodeModelItem::Kind_FunctionDefinition );
m_sortKind.append( _CodeModelItem::Kind_Argument );
m_sortKind.append( _CodeModelItem::Kind_Enumerator );
m_sortKind.append( _CodeModelItem::Kind_Template );
m_sortKind.append( _CodeModelItem::Kind_TemplateParameter );
m_sortKind.append( _CodeModelItem::Kind_TypeAlias );
m_sortKind.append( _CodeModelItem::Kind_Variable );
m_sortKind.append( _CodeModelItem::FirstKind );
m_sortKind.append( _CodeModelItem::KindMask );
}
CodeProxy::~CodeProxy()
{}
bool CodeProxy::filterAcceptsRow( int source_row,
const QModelIndex &source_parent ) const
{
bool exclude = false;
if ( m_kindFilter )
{
QModelIndex source_index =
sourceModel() ->index( source_row, 0, source_parent );
Q_ASSERT( source_index.isValid() );
KDevelop::CodeItem *codeItem = sourceToItem( source_index );
exclude = ( ( m_kindFilter & codeItem->kind() ) == codeItem->kind() );
}
exclude = KDevelop::CodeProxy::filterAcceptsRow( source_row, source_parent ) ?
exclude : false;
return !exclude;
}
bool CodeProxy::lessThan( const QModelIndex &left,
const QModelIndex &right ) const
{
KDevelop::CodeItem * leftItem = sourceToItem( left );
KDevelop::CodeItem * rightItem = sourceToItem( right );
Q_ASSERT( leftItem && rightItem );
int leftKind = leftItem->kind();
int rightKind = rightItem->kind();
int function = _CodeModelItem::Kind_Function |
_CodeModelItem::Kind_FunctionDefinition;
if ( ( function & leftKind ) == leftKind &&
( function & rightKind ) == rightKind )
{
//!!!Special case for functions and definitions
return functionLessThan( left, right );
}
else if ( leftKind == rightKind )
return KDevelop::CodeProxy::lessThan( left, right );
else
return m_sortKind.indexOf( leftKind ) < m_sortKind.indexOf( rightKind );
}
bool CodeProxy::functionLessThan( const QModelIndex &left,
const QModelIndex &right ) const
{
_FunctionModelItem * leftItem =
dynamic_cast<_FunctionModelItem*>( sourceToItem( left ) );
_FunctionModelItem * rightItem =
dynamic_cast<_FunctionModelItem*>( sourceToItem( right ) );
Q_ASSERT( leftItem && rightItem );
if ( leftItem->isConstructor() &&
!rightItem->isConstructor() )
{
return true;
}
else if ( leftItem->isDestructor() &&
!rightItem->isDestructor() &&
!rightItem->isConstructor() )
{
return true;
}
if ( rightItem->isConstructor() &&
!leftItem->isConstructor() )
{
return false;
}
else if ( rightItem->isDestructor() &&
!leftItem->isDestructor() &&
!leftItem->isConstructor() )
{
return false;
}
return KDevelop::CodeProxy::lessThan( left, right );
}
void CodeProxy::setKindFilter( int kind )
{
m_kindFilter = kind;
clear();
}
#include "codeproxy.moc"
|
