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
|
/*
* ====================================================================
* Copyright (c) 2002-2009 The RapidSvn Group. All rights reserved.
*
* 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 3 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 (in the file GPL.txt.
* If not, see <http://www.gnu.org/licenses/>.
*
* 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
// subversion api
#include "svn_path.h"
// svncpp
#include "kdevsvncpp/pool.hpp"
#include "kdevsvncpp/url.hpp"
static void findAndReplace(std::string & source, const std::string & find, const std::string & replace)
{
// start searching from the beginning
size_t pos = 0;
size_t findLength = find.length();
size_t replaceLength = replace.length();
do
{
// search for the next occurrence
pos = source.find(find, pos);
// found?
if (pos != std::string::npos)
{
// yes, place
source.replace(pos, findLength, replace);
// Make sure we do not search from the beginning
// otherwise replacing % with %25 would result
// in an endless loop
pos = pos + replaceLength;
}
}
while (pos != std::string::npos);
}
namespace svn
{
Url::Url() {}
Url::~Url() {}
bool
Url::isValid(const char * urlToValidate)
{
return svn_path_is_url(urlToValidate) != 0;
}
std::string
Url::escape(const char * url)
{
Pool pool;
// First make sure % gets escaped
std::string partlyEscaped(url);
findAndReplace(partlyEscaped, "%", "%25");
// Let svn do the first part of the work
partlyEscaped=svn_path_uri_autoescape(partlyEscaped.c_str(), pool);
// Then worry about the rest
findAndReplace(partlyEscaped, "#", "%23");
findAndReplace(partlyEscaped, ";", "%3B");
findAndReplace(partlyEscaped, "?", "%3F");
findAndReplace(partlyEscaped, "[", "%5B");
findAndReplace(partlyEscaped, "]", "%5D");
return partlyEscaped;
}
std::string
Url::unescape(const char * url)
{
Pool pool;
return svn_path_uri_decode(url, pool);
}
/**
* the implementation of the function that pull the supported
* url schemas out of the ra layer it rather dirty now since
* we are lacking a higher level of abstraction
*/
std::vector<std::string>
Url::supportedSchemas()
{
std::vector<std::string> schemas;
return schemas;
}
}
/* -----------------------------------------------------------------
* local variables:
* eval: (load-file "../../rapidsvn-dev.el")
* end:
*/
|
