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
|
/* ****************************************************************************
* eID Middleware Project.
* Copyright (C) 2008-2009 FedICT.
*
* This is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License version
* 3.0 as published by the Free Software Foundation.
*
* This software 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 software; if not, see
* http://www.gnu.org/licenses/.
**************************************************************************** */
#include "util.h"
////////////////////////////////////////////////////////////////////////////////////////////////
std::wstring wstring_From_string(std::string const& in)
{
//----------------------------------------------------------
// just put every char to a wchar and prevent sign extension
//----------------------------------------------------------
std::wstring wzString;
for(size_t i=0;i<in.length();i++)
{
wchar_t c = in.at(i);
wzString += c & 0x00ff;
}
return wzString;
}
////////////////////////////////////////////////////////////////////////////////////////////////
void wstring_TrimR(std::wstring *in)
{
if(in == NULL)
return;
for(size_t i=in->length();i>0;)
{
i--;
if(in->at(i) == L' ')
{
in->at(i) = L'\0';
}
else
{
break;
}
}
}
////////////////////////////////////////////////////////////////////////////////////////////////
void vector_From_bytes(std::vector<unsigned char> *out, const unsigned char *in, size_t len)
{
out->clear();
out->reserve(len);
for(size_t i = 0; i<len; i++)
out->push_back(in[i]);
}
////////////////////////////////////////////////////////////////////////////////////////////////
void TokenizeS (const std::string& str, std::vector<std::string>& tokens, const std::string& delimiters, unsigned long maxToken)
{
tokens.clear();
// Skip delimiters at beginning.
std::string::size_type lastPos = str.find_first_not_of(delimiters, 0);
// Find first "non-delimiter".
std::string::size_type pos = str.find_first_of(delimiters, lastPos);
size_t count = 0;
while ((maxToken == 0 || count < maxToken) && (std::string::npos != pos || std::string::npos != lastPos))
{
// Found a token, add it to the vector.
// For the last token accepted we take up to the end of string
if (pos != (size_t) -1 && (maxToken == 0 || count < (maxToken-1)))
tokens.push_back(str.substr(lastPos, pos - lastPos));
else
tokens.push_back(str.substr(lastPos, str.length() - lastPos));
// Skip delimiters. Note the "not_of"
lastPos = str.find_first_not_of(delimiters, pos);
// Find next "non-delimiter"
pos = str.find_first_of(delimiters, lastPos);
count++;
}
}
////////////////////////////////////////////////////////////////////////////////////////////////
void TokenizeW (const std::wstring& str, std::vector<std::wstring>& tokens, const std::wstring& delimiters, unsigned long maxToken)
{
tokens.clear();
// Skip delimiters at beginning.
std::wstring::size_type lastPos = str.find_first_not_of(delimiters, 0);
// Find first "non-delimiter".
std::wstring::size_type pos = str.find_first_of(delimiters, lastPos);
size_t count = 0;
while ((maxToken == 0 || count < maxToken) && (std::string::npos != pos || std::string::npos != lastPos))
{
// Found a token, add it to the vector.
// For the last token accepted we take up to the end of string
if (pos != (size_t) -1 && (maxToken == 0 || count < (maxToken-1)))
tokens.push_back(str.substr(lastPos, pos - lastPos));
else
tokens.push_back(str.substr(lastPos, str.length() - lastPos));
// Skip delimiters. Note the "not_of"
lastPos = str.find_first_not_of(delimiters, pos);
// Find next "non-delimiter"
pos = str.find_first_of(delimiters, lastPos);
count++;
}
}
|
