blob: 609605635c2683f3ce0167b4a3bdbae1f3d3be21 (
plain)
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
|
/*
* Copyright (C) 2007 Thiago Macieira <thiago@kde.org>
*
* 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, see <http://www.gnu.org/licenses/>.
*/
#include "svn.h"
#include "repository.h"
typedef QList<Rules::Match> MatchRuleList;
typedef QHash<QString, Repository *> RepositoryHash;
class SvnPrivate
{
public:
SvnPrivate(const QString &pathToRepository);
~SvnPrivate();
int youngestRevision();
void exportRevision(int revnum);
MatchRuleList matchRules;
RepositoryHash repositories;
};
void Svn::initialize()
{
}
Svn::Svn(const QString &pathToRepository)
: d(new SvnPrivate(pathToRepository))
{
}
Svn::~Svn()
{
delete d;
}
void Svn::setMatchRules(const MatchRuleList &matchRules)
{
d->matchRules = matchRules;
}
void Svn::setRepositories(const RepositoryHash &repositories)
{
d->repositories = repositories;
}
int Svn::youngestRevision()
{
return d->youngestRevision();
}
void Svn::exportRevision(int revnum)
{
d->exportRevision(revnum);
}
|
