You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
76 lines
2.6 KiB
76 lines
2.6 KiB
/***************************************************************************
|
|
* 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 "log_entry.h"
|
|
#include "revision.h"
|
|
#include "client.h"
|
|
|
|
#include <tqstring.h>
|
|
#include <tqmap.h>
|
|
#include <tqpixmap.h>
|
|
|
|
class RtreeData;
|
|
class TQWidget;
|
|
class TDEListViewItem;
|
|
class TDEListView;
|
|
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*parent=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
|