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
|
/***************************************************************************
* Copyright (C) 2005-2007 by Rajko Albrecht *
* ral@alwins-world.de *
* *
* 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; 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. *
***************************************************************************/
#ifndef REVISIONTREE_H
#define REVISIONTREE_H
#include "src/svnqt/log_entry.hpp"
#include "src/svnqt/revision.hpp"
#include "src/svnqt/client.hpp"
#include <tqstring.h>
#include <tqmap.h>
#include <tqpixmap.h>
class RtreeData;
class TQWidget;
class KListViewItem;
class KListView;
class CContextListener;
namespace svn
{
class Client;
}
/**
@author Rajko Albrecht <ral@alwins-world.de>
*/
class RevisionTree{
public:
RevisionTree(svn::Client*,
TQObject*aListener,
const TQString& reposRoot,
const svn::Revision&startr,const svn::Revision&endr,
const TQString&,const svn::Revision& baserevision,TQWidget*treeParent,
TQWidget*tqparent=0);
virtual ~RevisionTree();
bool isValid()const;
TQWidget*getView();
protected:
long m_Baserevision;
long m_InitialRevsion;
TQString m_Path;
bool m_Valid;
RtreeData*m_Data;
bool topDownScan();
bool bottomUpScan(long startrev,unsigned recurse,const TQString&path,long sRev = -1);
bool isDeleted(long revision,const TQString&);
static bool isParent(const TQString&_par,const TQString&tar);
void fillItem(long revIndex,int pathIndex,const TQString&nodeName,const TQString&path);
};
#endif
|
