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
|
/* This file is part of the 'stringi' project.
* Copyright (c) 2013-2025, Marek Gagolewski <https://www.gagolewski.com/>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING,
* BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
* OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
* EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "stri_stringi.h"
#include "stri_container_utf16.h"
#include "stri_container_usearch.h"
#include "stri_container_integer.h"
#include "stri_container_logical.h"
#include <deque>
#include <utility>
using namespace std;
/**
* Split a string into parts [with collation]
*
* The pattern matches identify delimiters that separate the input into fields.
* The input data between the matches becomes the fields themselves.
*
* @param str character vector
* @param pattern character vector
* @param n integer vector
* @param omit_empty logical vector
* @param opts_collator passed to stri__ucol_open(),
* if \code{NA}, then \code{stri_detect_fixed_byte} is called
* @param tokens_only single logical value
* @param simplify single logical value
*
* @return list of character vectors or character matrix
*
*
* @version 0.1-?? (Bartek Tartanus)
*
* @version 0.1-?? (Marek Gagolewski, 2013-06-25)
* StriException friendly, use StriContainerUTF16
*
* @version 0.1-?? (Marek Gagolewski, 2013-07-10)
* BUGFIX: wrong behavior on empty str
*
* @version 0.2-3 (Marek Gagolewski, 2014-05-08)
* new fun: stri_split_coll (opts_collator == NA not allowed)
*
* @version 0.3-1 (Marek Gagolewski, 2014-10-19)
* added tokens_only param
*
* @version 0.3-1 (Marek Gagolewski, 2014-10-23)
* added split param
*
* @version 0.3-1 (Marek Gagolewski, 2014-10-24)
* allow omit_empty=NA
*
* @version 0.3-1 (Marek Gagolewski, 2014-11-04)
* Issue #112: str_prepare_arg* retvals were not PROTECTed from gc
*
* @version 0.4-1 (Marek Gagolewski, 2014-12-04)
* allow `simplify=NA`; FR #126: pass n to stri_list2matrix
*/
SEXP stri_split_coll(SEXP str, SEXP pattern, SEXP n, SEXP omit_empty,
SEXP tokens_only, SEXP simplify, SEXP opts_collator)
{
bool tokens_only1 = stri__prepare_arg_logical_1_notNA(tokens_only, "tokens_only");
PROTECT(str = stri__prepare_arg_string(str, "str"));
PROTECT(pattern = stri__prepare_arg_string(pattern, "pattern"));
PROTECT(n = stri__prepare_arg_integer(n, "n"));
PROTECT(omit_empty = stri__prepare_arg_logical(omit_empty, "omit_empty"));
PROTECT(simplify = stri__prepare_arg_logical_1(simplify, "simplify"));
UCollator* collator = NULL;
collator = stri__ucol_open(opts_collator);
STRI__ERROR_HANDLER_BEGIN(5)
R_len_t vectorize_length = stri__recycling_rule(true, 4,
LENGTH(str), LENGTH(pattern), LENGTH(n), LENGTH(omit_empty));
StriContainerUTF16 str_cont(str, vectorize_length);
StriContainerUStringSearch pattern_cont(pattern, vectorize_length, collator); // collator is not owned by pattern_cont
StriContainerInteger n_cont(n, vectorize_length);
StriContainerLogical omit_empty_cont(omit_empty, vectorize_length);
SEXP ret;
STRI__PROTECT(ret = Rf_allocVector(VECSXP, vectorize_length));
for (R_len_t i = pattern_cont.vectorize_init();
i != pattern_cont.vectorize_end();
i = pattern_cont.vectorize_next(i))
{
if (n_cont.isNA(i)) {
SET_VECTOR_ELT(ret, i, stri__vector_NA_strings(1));
continue;
}
int n_cur = n_cont.get(i);
int omit_empty_cur = !omit_empty_cont.isNA(i) && omit_empty_cont.get(i);
STRI__CONTINUE_ON_EMPTY_OR_NA_STR_PATTERN(str_cont, pattern_cont,
SET_VECTOR_ELT(ret, i, stri__vector_NA_strings(1));,
SET_VECTOR_ELT(ret, i,
(omit_empty_cont.isNA(i))?stri__vector_NA_strings(1):
stri__vector_empty_strings((omit_empty_cur || n_cur == 0)?0:1));)
UStringSearch *matcher = pattern_cont.getMatcher(i, str_cont.get(i));
usearch_reset(matcher);
if (n_cur >= INT_MAX-1)
throw StriException(MSG__INCORRECT_NAMED_ARG "; " MSG__EXPECTED_SMALLER, "n");
else if (n_cur < 0)
n_cur = INT_MAX;
else if (n_cur == 0) {
SET_VECTOR_ELT(ret, i, Rf_allocVector(STRSXP, 0));
continue;
}
else if (tokens_only1)
n_cur++; // we need to do one split ahead here
R_len_t k;
deque< pair<R_len_t, R_len_t> > fields; // byte based-indices
fields.push_back(pair<R_len_t, R_len_t>(0,0));
UErrorCode status = U_ZERO_ERROR;
for (k=1; k < n_cur && USEARCH_DONE != usearch_next(matcher, &status) && !U_FAILURE(status); ) {
R_len_t s1 = (R_len_t)usearch_getMatchedStart(matcher);
R_len_t s2 = (R_len_t)usearch_getMatchedLength(matcher) + s1;
if (omit_empty_cur && fields.back().first == s1)
fields.back().first = s2; // don't start any new field
else {
fields.back().second = s1;
fields.push_back(pair<R_len_t, R_len_t>(s2, s2)); // start a new field here
++k; // another field
}
}
STRI__CHECKICUSTATUS_THROW(status, {/* do nothing special on err */})
fields.back().second = str_cont.get(i).length();
if (omit_empty_cur && fields.back().first == fields.back().second)
fields.pop_back();
if (tokens_only1 && n_cur < INT_MAX) {
n_cur--; // one split ahead could have been made, see above
while (fields.size() > (size_t)n_cur)
fields.pop_back(); // get rid of the remainder
}
R_len_t noccurrences = (R_len_t)fields.size();
StriContainerUTF16 out_cont(noccurrences);
deque< pair<R_len_t, R_len_t> >::iterator iter = fields.begin();
for (k = 0; iter != fields.end(); ++iter, ++k) {
pair<R_len_t, R_len_t> curoccur = *iter;
if (curoccur.second == curoccur.first && omit_empty_cont.isNA(i))
out_cont.setNA(k);
else
out_cont.getWritable(k).setTo(str_cont.get(i),
curoccur.first, curoccur.second-curoccur.first);
}
SET_VECTOR_ELT(ret, i, out_cont.toR());
}
if (collator) {
ucol_close(collator);
collator=NULL;
}
if (LOGICAL(simplify)[0] == NA_LOGICAL || LOGICAL(simplify)[0]) {
R_len_t n_min = 0;
R_len_t n_length = LENGTH(n);
int* n_tab = INTEGER(n);
for (R_len_t i=0; i<n_length; ++i) {
if (n_tab[i] != NA_INTEGER && n_min < n_tab[i])
n_min = n_tab[i];
}
SEXP robj_TRUE, robj_n_min, robj_na_strings, robj_empty_strings;
STRI__PROTECT(robj_TRUE = Rf_ScalarLogical(TRUE));
STRI__PROTECT(robj_n_min = Rf_ScalarInteger(n_min));
STRI__PROTECT(robj_na_strings = stri__vector_NA_strings(1));
STRI__PROTECT(robj_empty_strings = stri__vector_empty_strings(1));
STRI__PROTECT(ret = stri_list2matrix(ret, robj_TRUE,
(LOGICAL(simplify)[0] == NA_LOGICAL)?robj_na_strings
:robj_empty_strings,
robj_n_min))
}
STRI__UNPROTECT_ALL
return ret;
STRI__ERROR_HANDLER_END(
if (collator) ucol_close(collator);
)
}
|
