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
|
/* 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_utf8.h"
#include "stri_container_utf16.h"
#include "stri_container_usearch.h"
#include "stri_container_bytesearch.h"
#include <unicode/uregex.h>
/**
* Returns vector elements if a pattern occurs in a string
*
* @param str character vector
* @param pattern character vector
* @param omit_na single logical value
* @param opts_fixed list
* @return character vector
*
* @version 0.3-1 (Bartek Tartanus, 2014-07-25)
*
* @version 0.3-1 (Marek Gagolewski, 2014-10-17)
* using std::vector<int> to avoid mem-leaks
*
* @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)
* #122: omit_na arg added
*
* @version 0.4-1 (Marek Gagolewski, 2014-12-07)
* #110, #23: opts_fixed arg added
*
* @version 0.5-1 (Marek Gagolewski, 2015-02-14)
* use StriByteSearchMatcher
*
* @version 1.0-3 (Marek Gagolewski, 2016-02-03)
* #216: `negate` arg added
*
* @version 1.7.1 (Marek Gagolewski, 2021-06-17)
* assure LENGTH(pattern) <= LENGTH(str)
*/
SEXP stri_subset_fixed(SEXP str, SEXP pattern, SEXP omit_na, SEXP negate, SEXP opts_fixed)
{
bool negate_1 = stri__prepare_arg_logical_1_notNA(negate, "negate");
uint32_t pattern_flags = StriContainerByteSearch::getByteSearchFlags(opts_fixed);
bool omit_na1 = stri__prepare_arg_logical_1_notNA(omit_na, "omit_na");
PROTECT(str = stri__prepare_arg_string(str, "str"));
PROTECT(pattern = stri__prepare_arg_string(pattern, "pattern"));
if (LENGTH(str) > 0 && LENGTH(str) < LENGTH(pattern))
Rf_error(MSG__WARN_RECYCLING_RULE2);
int vectorize_length = stri__recycling_rule(true, 2, LENGTH(str), LENGTH(pattern));
if (vectorize_length == 0) {
UNPROTECT(2);
return Rf_allocVector(STRSXP, 0);
}
STRI__ERROR_HANDLER_BEGIN(2)
StriContainerUTF8 str_cont(str, vectorize_length);
StriContainerByteSearch pattern_cont(pattern, vectorize_length, pattern_flags);
// BT: this cannot be done with deque, because pattern is reused so i does not
// go like 0,1,2...n but 0,pat_len,2*pat_len,1,pat_len+1 and so on
// MG: agreed
std::vector<int> which(vectorize_length);
int result_counter = 0;
for (R_len_t i = pattern_cont.vectorize_init();
i != pattern_cont.vectorize_end();
i = pattern_cont.vectorize_next(i))
{
STRI__CONTINUE_ON_EMPTY_OR_NA_STR_PATTERN(str_cont, pattern_cont,
{if (omit_na1) which[i] = FALSE; else {
which[i] = NA_LOGICAL;
result_counter++;
}
},
{which[i] = negate_1; if (which[i]) result_counter++;})
StriByteSearchMatcher* matcher = pattern_cont.getMatcher(i);
matcher->reset(str_cont.get(i).c_str(), str_cont.get(i).length());
which[i] = (int)(matcher->findFirst() != USEARCH_DONE);
if (negate_1) which[i] = !which[i];
if (which[i]) result_counter++;
}
SEXP ret;
STRI__PROTECT(ret = stri__subset_by_logical(str_cont, which, result_counter));
STRI__UNPROTECT_ALL
return ret;
STRI__ERROR_HANDLER_END( ;/* do nothing special on error */ )
}
/**
* Substitutes vector elements if a pattern occurs in a string
*
* @param str character vector
* @param pattern character vector
* @param opts_fixed list
* @param value character vector
* @return character vector
*
* @version 1.0-3 (Marek Gagolewski, 2016-02-02)
* #124
*
* @version 1.0-3 (Marek Gagolewski, 2016-02-03)
* #216: `negate` arg added
*
* @version 1.7.1 (Marek Gagolewski, 2021-06-17)
* assure LENGTH(pattern) and LENGTH(value) <= LENGTH(str)
*/
SEXP stri_subset_fixed_replacement(SEXP str, SEXP pattern, SEXP negate, SEXP opts_fixed, SEXP value)
{
bool negate_1 = stri__prepare_arg_logical_1_notNA(negate, "negate");
uint32_t pattern_flags = StriContainerByteSearch::getByteSearchFlags(opts_fixed);
PROTECT(str = stri__prepare_arg_string(str, "str"));
PROTECT(pattern = stri__prepare_arg_string(pattern, "pattern"));
PROTECT(value = stri__prepare_arg_string(value, "value"));
// we are subsetting `str`, therefore recycling is slightly different here
if (LENGTH(value) == 0) Rf_error(MSG__REPLACEMENT_ZERO);
if (LENGTH(pattern) == 0) Rf_error(MSG__WARN_EMPTY_VECTOR);
if (LENGTH(str) == 0) {
UNPROTECT(3);
return Rf_allocVector(STRSXP, 0);
}
if (LENGTH(str) < LENGTH(pattern)) // for LENGTH(value), we emit warning later on
Rf_error(MSG__WARN_RECYCLING_RULE2);
if ((LENGTH(str) % LENGTH(pattern)) != 0)
Rf_warning(MSG__WARN_RECYCLING_RULE);
R_len_t vectorize_length = LENGTH(str);
STRI__ERROR_HANDLER_BEGIN(3)
R_len_t value_length = LENGTH(value);
StriContainerUTF8 value_cont(value, value_length);
StriContainerUTF8 str_cont(str, vectorize_length);
StriContainerByteSearch pattern_cont(pattern, vectorize_length, pattern_flags);
SEXP ret;
STRI__PROTECT(ret = Rf_allocVector(STRSXP, vectorize_length));
std::vector<int> detected(vectorize_length, 0);
for (R_len_t i = pattern_cont.vectorize_init();
i != pattern_cont.vectorize_end();
i = pattern_cont.vectorize_next(i))
{
if (pattern_cont.isNA(i)) {
// behave like `[<-`
detected[i] = false;
continue;
}
STRI__CONTINUE_ON_EMPTY_OR_NA_STR_PATTERN(str_cont, pattern_cont,
{detected[i] = NA_INTEGER;},
{detected[i] = negate_1;} )
StriByteSearchMatcher* matcher = pattern_cont.getMatcher(i);
matcher->reset(str_cont.get(i).c_str(), str_cont.get(i).length());
detected[i] = (((int)(matcher->findFirst() != USEARCH_DONE) && !negate_1) ||
((int)(matcher->findFirst() == USEARCH_DONE) && negate_1));
}
R_len_t k = 0; // we must traverse `str_cont` in order now
for (R_len_t i = 0; i<vectorize_length; ++i) {
if (detected[i] == NA_INTEGER)
SET_STRING_ELT(ret, i, NA_STRING);
else if (detected[i] == 0)
SET_STRING_ELT(ret, i, str_cont.toR(i));
else
SET_STRING_ELT(ret, i, value_cont.toR((k++)%value_length));
}
if ((k % value_length) != 0) Rf_warning(MSG_REPLACEMENT_MULTIPLE);
STRI__UNPROTECT_ALL
return ret;
STRI__ERROR_HANDLER_END(;/* nothing special to be done on error */)
}
|
