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
|
#ifndef _REPOS_LOG_HPP
#define _REPOS_LOG_HPP
#include "svnqt/svnqt_defines.h"
#include "svnqt/svnqttypes.h"
#include "svnqt/revision.h"
#include <tqsqldatabase.h>
#include <tqstring.h>
namespace svn
{
class Client;
namespace cache
{
class SVNTQT_EXPORT ReposLog
{
protected:
svn::Client*m_Client;
mutable TQDataBase m_Database;
TQString m_ReposRoot;
svn::Revision m_latestHead;
//! internal insert.
bool _insertLogEntry(const svn::LogEntry&);
bool checkFill(svn::Revision&_start,svn::Revision&_end,bool checkHead);
public:
ReposLog(svn::Client*aClient,const TQString&aRepository=TQString());
TQString ReposRoot() const
{
return m_ReposRoot;
}
TQDataBase Database() const
{
return m_Database;
}
//! search for latest head revision on network for assigned repository
svn::Revision latestHeadRev();
//! return lates revision in cache
svn::Revision latestCachedRev();
//! simple retrieves logentries
/*!
* This method acts on network, too for checking if there are new entries on server.
*
* @param target where to store the result
* @param start revision to start for search
* @param end revision to end for search
* @param noNetwork if yes, no check on network for newer revisions will made
* @return true if entries found and no error, if no entries found false
* @exception svn::DatabaseException in case of errors
*/
bool simpleLog(LogEntriesMap&target,const svn::Revision&start,const svn::Revision&end,bool noNetwork=false);
svn::Revision date2numberRev(const svn::Revision&,bool noNetwork=false);
bool fillCache(const svn::Revision&end);
bool insertLogEntry(const svn::LogEntry&);
bool log(const svn::Path&,const svn::Revision&start, const svn::Revision&end,const svn::Revision&peg,svn::LogEntriesMap&target, bool strictNodeHistory,int limit);
bool itemExists(const svn::Revision&,const svn::Path&);
bool isValid()const;
};
}
}
#endif
|
