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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
|
/*
* Port for usage with qt-framework and development for tdesvn
* (C) 2005-2007 by Rajko Albrecht
* http://tdesvn.alwins-world.de
*/
/*
* ====================================================================
* Copyright (c) 2002-2005 The RapidSvn Group. All rights reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library (in the file LGPL.txt); if not,
* write to the Free Software Foundation, Inc., 51 Franklin St,
* Fifth Floor, Boston, MA 02110-1301 USA
*
* This software consists of voluntary contributions made by many
* individuals. For exact contribution history, see the revision
* history and logs, available at http://rapidsvn.tigris.org/.
* ====================================================================
*/
#if defined( _MSC_VER) && _MSC_VER <= 1200
#pragma warning( disable: 4786 )// debug symbol truncated
#endif
// svncpp
#include "svnqt/client_impl.h"
#include "svn_opt.h"
#include "svnqt/svnqt_defines.h"
#include <tqmap.h>
#include <tqstringlist.h>
#if (!(SVN_VER_MAJOR == 1 && SVN_VER_MINOR <= 8))
apr_array_header_t* svn_sort__hash(apr_hash_t *ht,
int (*comparison_func)(const svn_sort__item_t*, const svn_sort__item_t*), apr_pool_t *pool)
{
apr_hash_index_t *hi;
apr_array_header_t *ary;
svn_boolean_t sorted;
svn_sort_item_type *prev_item;
/* allocate an array with enough elements to hold all the keys. */
ary = apr_array_make(pool, apr_hash_count(ht), sizeof(svn_sort_item_type));
/* loop over hash table and push all keys into the array */
sorted = TRUE;
prev_item = NULL;
for (hi = apr_hash_first(pool, ht); hi; hi = apr_hash_next(hi))
{
svn_sort_item_type *item = (svn_sort_item_type*)apr_array_push(ary);
apr_hash_this(hi, &item->key, &item->klen, &item->value);
if (prev_item == NULL)
{
prev_item = item;
continue;
}
if (sorted)
{
sorted = (comparison_func((svn_sort__item_t*)prev_item, (svn_sort__item_t*)item) < 0);
prev_item = item;
}
}
/* quicksort the array if it isn't already sorted. */
if (!sorted)
{
qsort(ary->elts, ary->nelts, ary->elt_size,
(int (*)(const void*, const void*))comparison_func);
}
return ary;
}
#endif
namespace svn
{
Client_impl::Client_impl (ContextP context)
: Client()
{
setContext (context);
}
Client_impl::~Client_impl ()
{
}
const ContextP
Client_impl::getContext () const
{
return m_context;
}
void
Client_impl::setContext (ContextP context)
{
m_context = context;
}
void
Client_impl::url2Revision(const TQString&revstring,
Revision&start,Revision&end)
{
Pool pool;
int n = svn_opt_parse_revision(start,end,revstring.TOUTF8(),pool);
if (n<0) {
start = Revision::UNDEFINED;
end = Revision::UNDEFINED;
}
}
void Client_impl::url2Revision(const TQString&revstring,Revision&start)
{
if (revstring=="WORKING") {
start = Revision::WORKING;
} else if (revstring=="BASE"){
start = Revision::BASE;
} else if (revstring=="START"){
start = Revision::START;
} else {
Revision end;
url2Revision(revstring,start,end);
}
}
apr_hash_t * Client_impl::map2hash(const PropertiesMap&aMap,const Pool&pool)
{
if (aMap.count()==0) {
return 0;
}
apr_hash_t * hash = apr_hash_make(pool);
PropertiesMap::ConstIterator it;
const char*propval;
const char*propname;
TQByteArray s,n;
for (it=aMap.begin();it!=aMap.end();++it) {
s=it.data().TOUTF8();
n=it.key().TOUTF8();
propval=apr_pstrndup(pool,s,s.size());
propname=apr_pstrndup(pool,n,n.size());
apr_hash_set(hash,propname,APR_HASH_KEY_STRING,propval);
}
return hash;
}
}
|
