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
159
160
161
162
163
164
165
|
// stringutils.cpp
/* Copyright 2009 10gen Inc.
*
* Licensed 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
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "mongo/pch.h"
#include "mongo/util/stringutils.h"
namespace mongo {
void splitStringDelim( const string& str , vector<string>* res , char delim ) {
if ( str.empty() )
return;
size_t beg = 0;
size_t pos = str.find( delim );
while ( pos != string::npos ) {
res->push_back( str.substr( beg, pos - beg) );
beg = ++pos;
pos = str.find( delim, beg );
}
res->push_back( str.substr( beg ) );
}
void joinStringDelim( const vector<string>& strs , string* res , char delim ) {
for ( vector<string>::const_iterator it = strs.begin(); it != strs.end(); ++it ) {
if ( it !=strs.begin() ) res->push_back( delim );
res->append( *it );
}
}
LexNumCmp::LexNumCmp( bool lexOnly ) :
_lexOnly( lexOnly ) {
}
int LexNumCmp::cmp( const StringData& sd1, const StringData& sd2, bool lexOnly ) {
bool startWord = true;
size_t s1 = 0;
size_t s2 = 0;
while( s1 < sd1.size() && s2 < sd2.size() ) {
bool d1 = ( sd1[s1] == '.' );
bool d2 = ( sd2[s2] == '.' );
if ( d1 && !d2 )
return -1;
if ( d2 && !d1 )
return 1;
if ( d1 && d2 ) {
++s1; ++s2;
startWord = true;
continue;
}
bool p1 = ( sd1[s1] == (char)255 );
bool p2 = ( sd2[s2] == (char)255 );
if ( p1 && !p2 )
return 1;
if ( p2 && !p1 )
return -1;
if ( !lexOnly ) {
bool n1 = isdigit( sd1[s1] );
bool n2 = isdigit( sd2[s2] );
if ( n1 && n2 ) {
// get rid of leading 0s
if ( startWord ) {
while ( s1 < sd1.size() && sd1[s1] == '0' ) s1++;
while ( s2 < sd2.size() && sd2[s2] == '0' ) s2++;
}
size_t e1 = s1;
size_t e2 = s2;
while ( e1 < sd1.size() && isdigit( sd1[e1] ) ) e1++;
while ( e2 < sd2.size() && isdigit( sd2[e2] ) ) e2++;
size_t len1 = e1-s1;
size_t len2 = e2-s2;
int result;
// if one is longer than the other, return
if ( len1 > len2 ) {
return 1;
}
else if ( len2 > len1 ) {
return -1;
}
// if the lengths are equal, just strcmp
else {
result = strncmp( sd1.rawData() + s1,
sd2.rawData() + s2,
len1 );
if ( result )
return ( result > 0) ? 1 : -1;
}
// otherwise, the numbers are equal
s1 = e1;
s2 = e2;
startWord = false;
continue;
}
if ( n1 )
return 1;
if ( n2 )
return -1;
}
if ( sd1[s1] > sd2[s2] )
return 1;
if ( sd2[s2] > sd1[s1] )
return -1;
s1++; s2++;
startWord = false;
}
if ( s1 < sd1.size() && sd1[s1] )
return 1;
if ( s2 < sd2.size() && sd2[s2] )
return -1;
return 0;
}
int LexNumCmp::cmp( const StringData& s1, const StringData& s2 ) const {
return cmp( s1, s2, _lexOnly );
}
bool LexNumCmp::operator()( const StringData& s1, const StringData& s2 ) const {
return cmp( s1, s2 ) < 0;
}
int versionCmp(const StringData rhs, const StringData lhs) {
if (rhs == lhs) return 0;
// handle "1.2.3-" and "1.2.3-pre"
if (rhs.size() < lhs.size()) {
if (strncmp(rhs.rawData(), lhs.rawData(), rhs.size()) == 0 && lhs[rhs.size()] == '-') return +1;
}
else if (rhs.size() > lhs.size()) {
if (strncmp(rhs.rawData(), lhs.rawData(), lhs.size()) == 0 && rhs[lhs.size()] == '-') return -1;
}
return LexNumCmp::cmp(rhs, lhs, false);
}
} // namespace mongo
|
