-
Notifications
You must be signed in to change notification settings - Fork 50
/
ci_string.hpp
459 lines (374 loc) · 10.1 KB
/
ci_string.hpp
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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
//
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
// Copyright (c) 2022 Alan de Freitas (alandefreitas@gmail.com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
// Official repository: https://github.com/boostorg/url
//
#ifndef BOOST_URL_GRAMMAR_CI_STRING_HPP
#define BOOST_URL_GRAMMAR_CI_STRING_HPP
#include <boost/url/detail/config.hpp>
#include <boost/core/detail/string_view.hpp>
#include <boost/url/grammar/detail/ci_string.hpp>
#include <cstdlib>
namespace boost {
namespace urls {
namespace grammar {
// Algorithms for interacting with low-ASCII
// characters and strings, for implementing
// semantics in RFCs. These routines do not
// use std::locale.
//------------------------------------------------
/** Return c converted to lowercase
This function returns the character,
converting it to lowercase if it is
uppercase.
The function is defined only for
low-ASCII characters.
@par Example
@code
assert( to_lower( 'A' ) == 'a' );
@endcode
@par Exception Safety
Throws nothing.
@return The converted character
@param c The character to convert
@see
@ref to_upper.
*/
constexpr
char
to_lower(char c) noexcept
{
return detail::to_lower(c);
}
/** Return c converted to uppercase
This function returns the character,
converting it to uppercase if it is
lowercase.
The function is defined only for
low-ASCII characters.
@par Example
@code
assert( to_upper( 'a' ) == 'A' );
@endcode
@par Exception Safety
Throws nothing.
@return The converted character
@param c The character to convert
@see
@ref to_lower.
*/
constexpr
char
to_upper(char c) noexcept
{
return detail::to_upper(c);
}
//------------------------------------------------
/** Return the case-insensitive comparison of s0 and s1
This returns the lexicographical comparison
of two strings, ignoring case.
The function is defined only for strings
containing low-ASCII characters.
@par Example
@code
assert( ci_compare( "boost", "Boost" ) == 0 );
@endcode
@par Exception Safety
Throws nothing.
@return 0 if the strings are equal, -1 if
`s0` is less than `s1`, or 1 if `s0` is
greater than s1.
@param s0 The first string
@param s1 The second string
@see
@ref ci_is_equal,
@ref ci_is_less.
*/
BOOST_URL_DECL
int
ci_compare(
core::string_view s0,
core::string_view s1) noexcept;
/** Return the case-insensitive digest of a string
The hash function is non-cryptographic and
not hardened against algorithmic complexity
attacks.
Returned digests are suitable for usage in
unordered containers.
The function is defined only for strings
containing low-ASCII characters.
@return The digest
@param s The string
*/
BOOST_URL_DECL
std::size_t
ci_digest(
core::string_view s) noexcept;
//------------------------------------------------
/** Return true if s0 equals s1 using case-insensitive comparison
The function is defined only for strings
containing low-ASCII characters.
@par Example
@code
assert( ci_is_equal( "Boost", "boost" ) );
@endcode
@see
@ref ci_compare,
@ref ci_is_less.
*/
#ifdef BOOST_URL_DOCS
template<
class String0,
class String1>
bool
ci_is_equal(
String0 const& s0,
String1 const& s1);
#else
/** Return true if s0 equals s1 using case-insensitive comparison
The function is defined only for strings
containing low-ASCII characters.
@par Example
@code
assert( ci_is_equal( "Boost", "boost" ) );
@endcode
@see
@ref ci_compare,
@ref ci_is_less.
*/
template<
class String0,
class String1>
auto
ci_is_equal(
String0 const& s0,
String1 const& s1) ->
typename std::enable_if<
! std::is_convertible<
String0, core::string_view>::value ||
! std::is_convertible<
String1, core::string_view>::value,
bool>::type
{
// this overload supports forward iterators and
// does not assume the existence core::string_view::size
if( detail::type_id<String0>() >
detail::type_id<String1>())
return detail::ci_is_equal(s1, s0);
return detail::ci_is_equal(s0, s1);
}
/** Return true if s0 equals s1 using case-insensitive comparison
The function is defined only for strings
containing low-ASCII characters.
@par Example
@code
assert( ci_is_equal( "Boost", "boost" ) );
@endcode
@see
@ref ci_compare,
@ref ci_is_less.
*/
inline
bool
ci_is_equal(
core::string_view s0,
core::string_view s1) noexcept
{
// this overload is faster as it makes use of
// core::string_view::size
if(s0.size() != s1.size())
return false;
return detail::ci_is_equal(s0, s1);
}
#endif
/** Return true if s0 is less than s1 using case-insensitive comparison
The comparison algorithm implements a
case-insensitive total order on the set
of all strings; however, it is not a
lexicographical comparison.
The function is defined only for strings
containing low-ASCII characters.
@par Example
@code
assert( ! ci_is_less( "Boost", "boost" ) );
@endcode
@see
@ref ci_compare,
@ref ci_is_equal.
*/
inline
bool
ci_is_less(
core::string_view s0,
core::string_view s1) noexcept
{
if(s0.size() != s1.size())
return s0.size() < s1.size();
return detail::ci_is_less(s0, s1);
}
//------------------------------------------------
/** A case-insensitive hash function object for strings
The hash function is non-cryptographic and
not hardened against algorithmic complexity
attacks.
This is a suitable hash function for
unordered containers.
The function is defined only for strings
containing low-ASCII characters.
@par Example
@code
boost::unordered_map< std::string, std::string, ci_hash, ci_equal > m1;
std::unordered_map < std::string, std::string, ci_hash, ci_equal > m2; // (since C++20)
@endcode
@see
@ref ci_equal,
@ref ci_less.
*/
#ifdef BOOST_URL_DOCS
using ci_hash = __see_below__;
#else
namespace see_below {
struct ci_hash
{
using is_transparent = void;
std::size_t
operator()(
core::string_view s) const noexcept
{
return ci_digest(s);
}
};
}
/** A case-insensitive hash function object for strings
The hash function is non-cryptographic and
not hardened against algorithmic complexity
attacks.
This is a suitable hash function for
unordered containers.
The function is defined only for strings
containing low-ASCII characters.
@par Example
@code
boost::unordered_map< std::string, std::string, ci_hash, ci_equal > m1;
std::unordered_map < std::string, std::string, ci_hash, ci_equal > m2; // (since C++20)
@endcode
@see
@ref ci_equal,
@ref ci_less.
*/
using ci_hash = see_below::ci_hash;
#endif
/** A case-insensitive equals predicate for strings
The function object returns `true` when
two strings are equal, ignoring case.
This is a suitable equality predicate for
unordered containers.
The function is defined only for strings
containing low-ASCII characters.
@par Example
@code
boost::unordered_map< std::string, std::string, ci_hash, ci_equal > m1;
std::unordered_map < std::string, std::string, ci_hash, ci_equal > m2; // (since C++20)
@endcode
@see
@ref ci_hash,
@ref ci_less.
*/
#ifdef BOOST_URL_DOCS
using ci_equal = __see_below__;
#else
namespace see_below {
struct ci_equal
{
using is_transparent = void;
template<
class String0, class String1>
bool
operator()(
String0 s0,
String1 s1) const noexcept
{
return ci_is_equal(s0, s1);
}
};
} // see_below
/** A case-insensitive equals predicate for strings
The function object returns `true` when
two strings are equal, ignoring case.
This is a suitable equality predicate for
unordered containers.
The function is defined only for strings
containing low-ASCII characters.
@par Example
@code
boost::unordered_map< std::string, std::string, ci_hash, ci_equal > m1;
std::unordered_map < std::string, std::string, ci_hash, ci_equal > m2; // (since C++20)
@endcode
@see
@ref ci_hash,
@ref ci_less.
*/
using ci_equal = see_below::ci_equal;
#endif
/** A case-insensitive less predicate for strings
The comparison algorithm implements a
case-insensitive total order on the set
of all ASCII strings; however, it is
not a lexicographical comparison.
This is a suitable predicate for
ordered containers.
The function is defined only for strings
containing low-ASCII characters.
@par Example
@code
boost::container::map< std::string, std::string, ci_less > m1;
std::map< std::string, std::string, ci_less > m2; // (since C++14)
@endcode
@see
@ref ci_equal,
@ref ci_hash.
*/
#ifdef BOOST_URL_DOCS
using ci_less = __see_below__;
#else
namespace see_below {
struct ci_less
{
using is_transparent = void;
std::size_t
operator()(
core::string_view s0,
core::string_view s1) const noexcept
{
return ci_is_less(s0, s1);
}
};
}
/** A case-insensitive less predicate for strings
The comparison algorithm implements a
case-insensitive total order on the set
of all ASCII strings; however, it is
not a lexicographical comparison.
This is a suitable predicate for
ordered containers.
The function is defined only for strings
containing low-ASCII characters.
@par Example
@code
boost::container::map< std::string, std::string, ci_less > m1;
std::map< std::string, std::string, ci_less > m2; // (since C++14)
@endcode
@see
@ref ci_equal,
@ref ci_hash.
*/
using ci_less = see_below::ci_less;
#endif
} // grammar
} // urls
} // boost
#endif