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
|
/* This file is part of KCachegrind.
Copyright (C) 2003 Josef Weidendorfer <Josef.Weidendorfer@gmx.de>
KCachegrind 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.
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; see the file COPYING. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#ifndef COSTLISTITEM_H
#define COSTLISTITEM_H
#include <tqlistview.h>
#include "tracedata.h"
class CostListItem: public TQListViewItem
{
public:
CostListItem(TQListView* parent, TraceCostItem* cost,
TraceCostType* ct, int size = -1);
// entry with multiple skipped items
CostListItem(TQListView* parent, int skipped, TraceCostItem* cost,
TraceCostType* ct);
int compare(TQListViewItem * i, int col, bool ascending ) const;
TraceCostItem* costItem() { return (_skipped) ? 0 : _costItem; }
void setCostType(TraceCostType* ct);
void update();
void setSize(int s);
private:
void updateName();
SubCost _pure;
TraceCostType* _costType;
TraceCostItem* _costItem;
// >0 only for last item in list, if items are skipped
int _skipped;
// number of items in group, is put in parenthesis after name
int _groupSize;
};
#endif
|
