blob: f654c709ec64939ad9f85bef6ff0817d9253005b (
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
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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <file/quotedstring.hxx>
#include <rtl/ustrbuf.hxx>
namespace connectivity
{
sal_Int32 QuotedTokenizedString::GetTokenCount( sal_Unicode cTok, sal_Unicode cStrDel ) const
{
const sal_Int32 nLen = m_sString.getLength();
if ( !nLen )
return 0;
sal_Int32 nTokCount = 1;
bool bStart = true; // Are we on the first character in the Token?
bool bInString = false; // Are we WITHIN a (cStrDel delimited) String?
// Search for String-end after the first not matching character
for( sal_Int32 i = 0; i < nLen; ++i )
{
const sal_Unicode cChar = m_sString[i];
if (bStart)
{
bStart = false;
// First character a String-Delimiter?
if ( cChar == cStrDel )
{
bInString = true; // then we are now WITHIN the string!
continue; // skip this character!
}
}
if (bInString)
{
// when now the String-Delimiter-character occurs...
if ( cChar == cStrDel )
{
if ((i+1 < nLen) && (m_sString[i+1] == cStrDel))
{
// double String-Delimiter-character:
++i; // no string-end, skip next character.
}
else
{
// String-End
bInString = false;
}
}
} // if (bInString)
else
{
// does the Token-character match, then raise TokCount
if ( cChar == cTok )
{
++nTokCount;
bStart = true;
}
}
}
return nTokCount;
}
OUString QuotedTokenizedString::GetTokenSpecial(sal_Int32& nStartPos, sal_Unicode cTok, sal_Unicode cStrDel) const
{
const sal_Int32 nLen = m_sString.getLength();
if ( nLen )
{
bool bInString = (nStartPos < nLen) && (m_sString[nStartPos] == cStrDel); // are we WITHIN a (cStrDel delimited) String?
// First character a String-Delimiter?
if (bInString )
++nStartPos; // skip this character!
if ( nStartPos >= nLen )
return OUString();
OUStringBuffer sBuff( nLen - nStartPos + 1 );
// Search until end of string for the first not matching character
for( sal_Int32 i = nStartPos; i < nLen; ++i )
{
const sal_Unicode cChar = m_sString[i];
if (bInString)
{
// when now the String-Delimiter-character occurs ...
if ( cChar == cStrDel )
{
if ((i+1 < nLen) && (m_sString[i+1] == cStrDel))
{
// double String Delimiter-character
// no end of string, skip next character.
++i;
sBuff.append(m_sString[i]); // character belongs to Result-String
}
else
{
//end of String
bInString = false;
}
}
else
{
sBuff.append(cChar);
}
}
else
{
// does the Token-sign match, then raise nTok
if ( cChar == cTok )
{
// premature break of loop possible, because we found what we were looking for
nStartPos = i+1;
break;
}
else
{
sBuff.append(cChar);
}
}
} // for( sal_Int32 i = nStartPos; i < nLen; ++i )
return sBuff.makeStringAndClear();
}
return OUString();
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
