blob: 7e3329a31eb77d0a55f7e8f2f9742b2ad45db127 (
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
|
// Copyright (c) 2009 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <string.h>
#include <vector>
#include "base/string_piece.h"
namespace net {
// Yea, this could be done with less code duplication using
// template magic, I know.
void SplitStringPieceToVector(const base::StringPiece& full,
const char* delim,
std::vector<base::StringPiece>* vec,
bool omit_empty_strings) {
vec->clear();
if (full.size() == 0 || delim[0] == '\0')
return;
if (delim[1] == '\0') {
base::StringPiece::const_iterator s = full.begin();
base::StringPiece::const_iterator e = s;
for (;e != full.end(); ++e) {
if (*e == delim[0]) {
if (e != s || !omit_empty_strings) {
vec->push_back(base::StringPiece(s, e - s));
}
s = e;
++s;
}
}
if (s != e) {
--e;
if (e != s || !omit_empty_strings) {
vec->push_back(base::StringPiece(s, e - s));
}
}
} else {
base::StringPiece::const_iterator s = full.begin();
base::StringPiece::const_iterator e = s;
for (;e != full.end(); ++e) {
bool one_matched = false;
for (const char *d = delim; *d != '\0'; ++d) {
if (*d == *e) {
one_matched = true;
break;
}
}
if (one_matched) {
if (e != s || !omit_empty_strings) {
vec->push_back(base::StringPiece(s, e - s));
}
s = e;
++s;
}
}
if (s != e) {
--e;
if (e != s || !omit_empty_strings) {
vec->push_back(base::StringPiece(s, e - s));
}
}
}
}
} // namespace net
|
