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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
|
/***************************************************************************
* Copyright (C) 2006-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 __HELPER_HPP
#define __HELPER_HPP
#include "svnqttypes.hpp"
#include "revision.hpp"
#include <svn_types.h>
#include <iostream>
namespace svn
{
namespace internal
{
class DepthToSvn
{
#if ((SVN_VER_MAJOR == 1) && (SVN_VER_MINOR >= 5)) || (SVN_VER_MAJOR > 1)
protected:
svn_depth_t _value;
public:
DepthToSvn(const svn::Depth&val):_value(svn_depth_unknown)
{
switch (val) {
case DepthUnknown:
_value = svn_depth_unknown;
break;
case DepthExclude:
_value = svn_depth_exclude;
break;
case DepthEmpty:
_value = svn_depth_empty;
break;
case DepthFiles:
_value = svn_depth_files;
break;
case DepthImmediates:
_value = svn_depth_immediates;
break;
case DepthInfinity:
default:
_value = svn_depth_infinity;
break;
}
}
operator svn_depth_t ()
{
return _value;
}
#endif
};
class RevisionRangesToHash
{
#if ((SVN_VER_MAJOR == 1) && (SVN_VER_MINOR >= 5)) || (SVN_VER_MAJOR > 1)
protected:
RevisionRanges m_ranges;
public:
RevisionRangesToHash(const RevisionRanges&_input):m_ranges(_input){}
apr_array_header_t*array(const Pool&pool)
{
apr_array_header_t*ranges=apr_array_make(pool,m_ranges.size(),sizeof(svn_opt_revision_range_t *));
svn_opt_revision_range_t *range;
for (unsigned long j=0;j<m_ranges.count();++j)
{
range = (svn_opt_revision_range_t *)apr_palloc(pool, sizeof(*range));
range->start= *m_ranges[j].first.revision();
range->end = *m_ranges[j].second.revision();
APR_ARRAY_PUSH(ranges,svn_opt_revision_range_t *) = range;
}
return ranges;
}
#endif
};
}
}
#endif
|
