|
5582
|
1 /* |
|
|
2 |
|
7017
|
3 Copyright (C) 2005, 2006, 2007 David Bateman |
|
7016
|
4 Copyright (C) 2002, 2003, 2004, 2005 Paul Kienzle |
|
|
5 |
|
|
6 This file is part of Octave. |
|
5582
|
7 |
|
|
8 Octave is free software; you can redistribute it and/or modify it |
|
|
9 under the terms of the GNU General Public License as published by the |
|
7016
|
10 Free Software Foundation; either version 3 of the License, or (at your |
|
|
11 option) any later version. |
|
5582
|
12 |
|
|
13 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
16 for more details. |
|
|
17 |
|
|
18 You should have received a copy of the GNU General Public License |
|
7016
|
19 along with Octave; see the file COPYING. If not, see |
|
|
20 <http://www.gnu.org/licenses/>. |
|
5582
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #ifdef HAVE_CONFIG_H |
|
|
25 #include <config.h> |
|
|
26 #endif |
|
|
27 |
|
5773
|
28 #include <algorithm> |
|
5765
|
29 #include <sstream> |
|
|
30 |
|
5582
|
31 #include "defun-dld.h" |
|
|
32 #include "error.h" |
|
|
33 #include "gripes.h" |
|
|
34 #include "oct-obj.h" |
|
|
35 #include "utils.h" |
|
|
36 |
|
|
37 #include "Cell.h" |
|
|
38 #include "oct-map.h" |
|
|
39 #include "str-vec.h" |
|
5785
|
40 #include "quit.h" |
|
|
41 #include "parse.h" |
|
5582
|
42 |
|
7173
|
43 #if defined (HAVE_PCRE) |
|
5582
|
44 #include <pcre.h> |
|
7117
|
45 #elif defined (HAVE_REGEX) |
|
|
46 #if defined (__MINGW32__) |
|
5582
|
47 #define __restrict |
|
|
48 #endif |
|
7237
|
49 #if defined (HAVE_SYS_TYPES_H) |
|
|
50 #include <sys/types.h> |
|
|
51 #endif |
|
5582
|
52 #include <regex.h> |
|
|
53 #endif |
|
|
54 |
|
5785
|
55 // The regexp is constructed as a linked list to avoid resizing the |
|
|
56 // return values in arrays at each new match. |
|
|
57 |
|
|
58 // FIXME don't bother collecting and composing return values the user |
|
|
59 // doesn't want. |
|
|
60 |
|
|
61 class regexp_elem |
|
5582
|
62 { |
|
5785
|
63 public: |
|
5787
|
64 regexp_elem (const string_vector& _named_token, const Cell& _t, |
|
|
65 const std::string& _m, const Matrix& _te, double _s, |
|
|
66 double _e) : |
|
5785
|
67 named_token (_named_token), t (_t), m (_m), te (_te), s (_s), e (_e) { } |
|
|
68 |
|
|
69 regexp_elem (const regexp_elem &a) : named_token (a.named_token), t (a.t), |
|
|
70 m (a.m), te (a.te), s (a.s), e (a.e) |
|
|
71 { } |
|
|
72 |
|
|
73 string_vector named_token; |
|
|
74 Cell t; |
|
|
75 std::string m; |
|
|
76 Matrix te; |
|
|
77 double s; |
|
|
78 double e; |
|
|
79 }; |
|
|
80 |
|
|
81 typedef std::list<regexp_elem>::const_iterator const_iterator; |
|
|
82 |
|
|
83 static int |
|
|
84 octregexp_list (const octave_value_list &args, const std::string &nm, |
|
|
85 bool case_insensitive, std::list<regexp_elem> &lst, |
|
|
86 string_vector &named, int &nopts) |
|
|
87 { |
|
|
88 int sz = 0; |
|
5582
|
89 #if defined (HAVE_REGEX) || defined (HAVE_PCRE) |
|
|
90 int nargin = args.length(); |
|
|
91 bool once = false; |
|
5779
|
92 bool lineanchors = false; |
|
|
93 bool dotexceptnewline = false; |
|
|
94 bool freespacing = false; |
|
5582
|
95 |
|
5785
|
96 nopts = nargin - 2; |
|
|
97 |
|
5582
|
98 std::string buffer = args(0).string_value (); |
|
|
99 if (error_state) |
|
|
100 { |
|
|
101 gripe_wrong_type_arg (nm.c_str(), args(0)); |
|
5785
|
102 return 0; |
|
5582
|
103 } |
|
|
104 |
|
|
105 std::string pattern = args(1).string_value (); |
|
|
106 if (error_state) |
|
|
107 { |
|
|
108 gripe_wrong_type_arg (nm.c_str(), args(1)); |
|
5785
|
109 return 0; |
|
5582
|
110 } |
|
|
111 |
|
|
112 for (int i = 2; i < nargin; i++) |
|
|
113 { |
|
|
114 std::string str = args(i).string_value(); |
|
|
115 if (error_state) |
|
|
116 { |
|
|
117 error ("%s: optional arguments must be strings", nm.c_str()); |
|
|
118 break; |
|
|
119 } |
|
|
120 std::transform (str.begin (), str.end (), str.begin (), tolower); |
|
|
121 if (str.find("once", 0) == 0) |
|
|
122 { |
|
|
123 once = true; |
|
|
124 nopts--; |
|
|
125 } |
|
5779
|
126 else if (str.find("matchcase", 0) == 0) |
|
|
127 { |
|
|
128 case_insensitive = false; |
|
|
129 nopts--; |
|
|
130 } |
|
|
131 else if (str.find("ignorecase", 0) == 0) |
|
|
132 { |
|
|
133 case_insensitive = true; |
|
|
134 nopts--; |
|
|
135 } |
|
5785
|
136 else if (str.find("dotall", 0) == 0) |
|
5779
|
137 { |
|
5785
|
138 dotexceptnewline = false; |
|
|
139 nopts--; |
|
|
140 } |
|
|
141 else if (str.find("stringanchors", 0) == 0) |
|
|
142 { |
|
|
143 lineanchors = false; |
|
5779
|
144 nopts--; |
|
|
145 } |
|
|
146 else if (str.find("literalspacing", 0) == 0) |
|
|
147 { |
|
|
148 freespacing = false; |
|
|
149 nopts--; |
|
|
150 } |
|
5785
|
151 #if HAVE_PCRE |
|
|
152 // Only accept these options with pcre |
|
|
153 else if (str.find("dotexceptnewline", 0) == 0) |
|
|
154 { |
|
|
155 dotexceptnewline = true; |
|
|
156 nopts--; |
|
|
157 } |
|
|
158 else if (str.find("lineanchors", 0) == 0) |
|
|
159 { |
|
|
160 lineanchors = true; |
|
|
161 nopts--; |
|
|
162 } |
|
|
163 else if (str.find("freespacing", 0) == 0) |
|
|
164 { |
|
|
165 freespacing = true; |
|
|
166 nopts--; |
|
|
167 } |
|
5582
|
168 else if (str.find("start", 0) && str.find("end", 0) && |
|
|
169 str.find("tokenextents", 0) && str.find("match", 0) && |
|
|
170 str.find("tokens", 0) && str.find("names", 0)) |
|
|
171 error ("%s: unrecognized option", nm.c_str()); |
|
|
172 #else |
|
5779
|
173 else if (str.find("names", 0) == 0 || |
|
|
174 str.find("dotexceptnewline", 0) == 0 || |
|
|
175 str.find("lineanchors", 0) == 0 || |
|
|
176 str.find("freespacing", 0) == 0) |
|
5785
|
177 error ("%s: %s not implemented in this version", str.c_str(), nm.c_str()); |
|
5582
|
178 else if (str.find("start", 0) && str.find("end", 0) && |
|
|
179 str.find("tokenextents", 0) && str.find("match", 0) && |
|
|
180 str.find("tokens", 0)) |
|
|
181 error ("%s: unrecognized option", nm.c_str()); |
|
|
182 #endif |
|
|
183 } |
|
|
184 |
|
|
185 if (!error_state) |
|
|
186 { |
|
5785
|
187 Cell t; |
|
|
188 std::string m; |
|
|
189 double s, e; |
|
5582
|
190 |
|
|
191 // named tokens "(?<name>...)" are only treated with PCRE not regex. |
|
|
192 #if HAVE_PCRE |
|
|
193 // The syntax of named tokens in pcre is "(?P<name>...)" while we need |
|
|
194 // a syntax "(?<name>...)", so fix that here. Also an expression like |
|
|
195 // "(?<first>\w+)\s+(?<last>\w+)|(?<last>\w+),\s+(?<first>\w+)" should |
|
|
196 // be perfectly legal, while pcre does not allow the same named token |
|
5619
|
197 // name on both sides of the alternative. Also fix that here by replacing |
|
|
198 // name tokens by dummy names, and dealing with the dummy names later. |
|
5582
|
199 |
|
5619
|
200 size_t pos = 0; |
|
|
201 size_t new_pos; |
|
|
202 int nnames = 0; |
|
|
203 int inames = 0; |
|
5765
|
204 std::ostringstream buf; |
|
5619
|
205 Array<int> named_idx; |
|
5582
|
206 |
|
5619
|
207 while ((new_pos = pattern.find ("(?<",pos)) != NPOS) |
|
|
208 { |
|
|
209 size_t tmp_pos = pattern.find_first_of ('>',new_pos); |
|
5582
|
210 |
|
5619
|
211 if (tmp_pos == NPOS) |
|
|
212 { |
|
|
213 error ("syntax error in pattern"); |
|
|
214 break; |
|
|
215 } |
|
|
216 |
|
|
217 std::string tmp_name = pattern.substr(new_pos+3,tmp_pos-new_pos-3); |
|
|
218 bool found = false; |
|
|
219 |
|
|
220 for (int i = 0; i < nnames; i++) |
|
|
221 if (named(i) == tmp_name) |
|
|
222 { |
|
|
223 named_idx.resize(inames+1); |
|
|
224 named_idx(inames) = i; |
|
|
225 found = true; |
|
|
226 break; |
|
|
227 } |
|
|
228 if (! found) |
|
|
229 { |
|
|
230 named_idx.resize(inames+1); |
|
|
231 named_idx(inames) = nnames; |
|
|
232 named.append(tmp_name); |
|
|
233 nnames++; |
|
|
234 } |
|
|
235 |
|
|
236 if (new_pos - pos > 0) |
|
|
237 buf << pattern.substr(pos,new_pos-pos); |
|
|
238 if (inames < 10) |
|
|
239 buf << "(?P<n00" << inames++; |
|
|
240 else if (inames < 100) |
|
|
241 buf << "(?P<n0" << inames++; |
|
|
242 else |
|
|
243 buf << "(?P<n" << inames++; |
|
|
244 pos = tmp_pos; |
|
|
245 } |
|
|
246 |
|
5765
|
247 buf << pattern.substr(pos); |
|
5619
|
248 |
|
|
249 if (error_state) |
|
5785
|
250 return 0; |
|
5582
|
251 |
|
|
252 // Compile expression |
|
|
253 pcre *re; |
|
|
254 const char *err; |
|
|
255 int erroffset; |
|
5765
|
256 std::string buf_str = buf.str (); |
|
|
257 re = pcre_compile (buf_str.c_str (), |
|
5779
|
258 (case_insensitive ? PCRE_CASELESS : 0) | |
|
|
259 (dotexceptnewline ? 0 : PCRE_DOTALL) | |
|
|
260 (lineanchors ? PCRE_MULTILINE : 0) | |
|
|
261 (freespacing ? PCRE_EXTENDED : 0), |
|
5765
|
262 &err, &erroffset, NULL); |
|
5582
|
263 |
|
|
264 if (re == NULL) { |
|
|
265 error("%s: %s at position %d of expression", nm.c_str(), |
|
|
266 err, erroffset); |
|
5785
|
267 return 0; |
|
5582
|
268 } |
|
|
269 |
|
|
270 int subpatterns; |
|
|
271 int namecount; |
|
|
272 int nameentrysize; |
|
|
273 char *nametable; |
|
|
274 int idx = 0; |
|
|
275 |
|
|
276 pcre_fullinfo(re, NULL, PCRE_INFO_CAPTURECOUNT, &subpatterns); |
|
|
277 pcre_fullinfo(re, NULL, PCRE_INFO_NAMECOUNT, &namecount); |
|
|
278 pcre_fullinfo(re, NULL, PCRE_INFO_NAMEENTRYSIZE, &nameentrysize); |
|
|
279 pcre_fullinfo(re, NULL, PCRE_INFO_NAMETABLE, &nametable); |
|
|
280 |
|
|
281 OCTAVE_LOCAL_BUFFER(int, ovector, (subpatterns+1)*3); |
|
|
282 OCTAVE_LOCAL_BUFFER(int, nidx, namecount); |
|
|
283 |
|
|
284 for (int i = 0; i < namecount; i++) |
|
|
285 { |
|
|
286 // Index of subpattern in first two bytes MSB first of name. |
|
5619
|
287 // Extract index. |
|
5779
|
288 nidx[i] = (static_cast<int>(nametable[i*nameentrysize])) << 8 | |
|
|
289 static_cast<int>(nametable[i*nameentrysize+1]); |
|
5582
|
290 } |
|
|
291 |
|
|
292 while(true) |
|
|
293 { |
|
5785
|
294 OCTAVE_QUIT; |
|
|
295 |
|
5582
|
296 int matches = pcre_exec(re, NULL, buffer.c_str(), |
|
|
297 buffer.length(), idx, |
|
|
298 (idx ? PCRE_NOTBOL : 0), |
|
|
299 ovector, (subpatterns+1)*3); |
|
|
300 |
|
|
301 if (matches < 0 && matches != PCRE_ERROR_NOMATCH) |
|
|
302 { |
|
|
303 error ("%s: internal error calling pcre_exec", nm.c_str()); |
|
|
304 pcre_free(re); |
|
5785
|
305 return 0; |
|
5582
|
306 } |
|
|
307 else if (matches == PCRE_ERROR_NOMATCH) |
|
|
308 break; |
|
5779
|
309 else if (ovector[1] <= ovector[0]) |
|
|
310 break; |
|
5582
|
311 else |
|
|
312 { |
|
5619
|
313 int pos_match = 0; |
|
5785
|
314 Matrix te(matches-1,2); |
|
5582
|
315 for (int i = 1; i < matches; i++) |
|
|
316 { |
|
5619
|
317 if (ovector[2*i] >= 0 && ovector[2*i+1] > 0) |
|
|
318 { |
|
5785
|
319 te(pos_match,0) = double (ovector[2*i]+1); |
|
|
320 te(pos_match++,1) = double (ovector[2*i+1]); |
|
5619
|
321 } |
|
5582
|
322 } |
|
5785
|
323 te.resize(pos_match,2); |
|
|
324 s = double (ovector[0]+1); |
|
|
325 e = double (ovector[1]); |
|
5582
|
326 |
|
|
327 const char **listptr; |
|
|
328 int status = pcre_get_substring_list(buffer.c_str(), ovector, |
|
|
329 matches, &listptr); |
|
|
330 |
|
|
331 if (status == PCRE_ERROR_NOMEMORY) { |
|
|
332 error("%s: cannot allocate memory in pcre_get_substring_list", |
|
|
333 nm.c_str()); |
|
|
334 pcre_free(re); |
|
5785
|
335 return 0; |
|
5582
|
336 } |
|
|
337 |
|
5619
|
338 Cell cell_t (dim_vector(1,pos_match)); |
|
|
339 pos_match = 0; |
|
5582
|
340 for (int i = 1; i < matches; i++) |
|
5619
|
341 if (ovector[2*i] >= 0 && ovector[2*i+1] > 0) |
|
|
342 cell_t(pos_match++) = std::string(*(listptr+i)); |
|
5582
|
343 |
|
5785
|
344 m = std::string(*listptr); |
|
|
345 t = cell_t; |
|
|
346 |
|
|
347 string_vector named_tokens(nnames); |
|
5619
|
348 if (namecount > 0) |
|
|
349 for (int i = 1; i < matches; i++) |
|
|
350 { |
|
|
351 if (ovector[2*i] >= 0 && ovector[2*i+1] > 0) |
|
|
352 { |
|
5785
|
353 named_tokens(named_idx(i-1)) = |
|
|
354 std::string(*(listptr+nidx[i-1])); |
|
5619
|
355 } |
|
|
356 } |
|
5582
|
357 |
|
|
358 pcre_free_substring_list(listptr); |
|
|
359 |
|
5785
|
360 regexp_elem new_elem (named_tokens, t, m, te, s, e); |
|
|
361 lst.push_back (new_elem); |
|
|
362 idx = ovector[1]; |
|
|
363 sz++; |
|
|
364 |
|
5582
|
365 if (once) |
|
|
366 break; |
|
|
367 |
|
|
368 } |
|
|
369 } |
|
|
370 |
|
|
371 pcre_free(re); |
|
|
372 #else |
|
|
373 regex_t compiled; |
|
|
374 int err=regcomp(&compiled, pattern.c_str(), REG_EXTENDED | |
|
|
375 (case_insensitive ? REG_ICASE : 0)); |
|
|
376 if (err) |
|
|
377 { |
|
|
378 int len = regerror(err, &compiled, NULL, 0); |
|
5760
|
379 OCTAVE_LOCAL_BUFFER (char, errmsg, len); |
|
|
380 regerror(err, &compiled, errmsg, len); |
|
|
381 error("%s: %s in pattern (%s)", nm.c_str(), errmsg, |
|
|
382 pattern.c_str()); |
|
5582
|
383 regfree(&compiled); |
|
5785
|
384 return 0; |
|
5582
|
385 } |
|
|
386 |
|
|
387 int subexpr = 1; |
|
|
388 int idx = 0; |
|
|
389 for (unsigned int i=0; i < pattern.length(); i++) |
|
|
390 subexpr += ( pattern[i] == '(' ? 1 : 0 ); |
|
|
391 OCTAVE_LOCAL_BUFFER (regmatch_t, match, subexpr ); |
|
|
392 |
|
|
393 while(true) |
|
|
394 { |
|
5785
|
395 OCTAVE_QUIT; |
|
|
396 |
|
5582
|
397 if (regexec(&compiled, buffer.c_str() + idx, subexpr, |
|
|
398 match, (idx ? REG_NOTBOL : 0)) == 0) |
|
|
399 { |
|
|
400 // Count actual matches |
|
|
401 int matches = 0; |
|
|
402 while (matches < subexpr && match[matches].rm_so >= 0) |
|
|
403 matches++; |
|
|
404 |
|
5785
|
405 s = double (match[0].rm_so+1+idx); |
|
|
406 e = double (match[0].rm_eo+idx); |
|
|
407 Matrix te(matches-1,2); |
|
5582
|
408 for (int i = 1; i < matches; i++) |
|
|
409 { |
|
5785
|
410 te(i-1,0) = double (match[i].rm_so+1+idx); |
|
|
411 te(i-1,1) = double (match[i].rm_eo+idx); |
|
5582
|
412 } |
|
|
413 |
|
5785
|
414 m = buffer.substr (match[0].rm_so+idx, |
|
5582
|
415 match[0].rm_eo-match[0].rm_so); |
|
|
416 |
|
|
417 Cell cell_t (dim_vector(1,matches-1)); |
|
|
418 for (int i = 1; i < matches; i++) |
|
|
419 cell_t(i-1) = buffer.substr (match[i].rm_so+idx, |
|
|
420 match[i].rm_eo-match[i].rm_so); |
|
5785
|
421 t = cell_t; |
|
5582
|
422 |
|
|
423 idx += match[0].rm_eo; |
|
5785
|
424 |
|
5866
|
425 string_vector sv; |
|
|
426 regexp_elem new_elem (sv, t, m, te, s, e); |
|
5785
|
427 lst.push_back (new_elem); |
|
5582
|
428 sz++; |
|
|
429 |
|
|
430 if (once) |
|
|
431 break; |
|
|
432 } |
|
|
433 else |
|
|
434 break; |
|
|
435 } |
|
|
436 regfree(&compiled); |
|
|
437 #endif |
|
5785
|
438 } |
|
|
439 #else |
|
|
440 error ("%s: not available in this version of Octave", nm.c_str()); |
|
|
441 #endif |
|
|
442 return sz; |
|
|
443 } |
|
5582
|
444 |
|
5785
|
445 static octave_value_list |
|
|
446 octregexp (const octave_value_list &args, int nargout, const std::string &nm, |
|
|
447 bool case_insensitive) |
|
|
448 { |
|
|
449 octave_value_list retval; |
|
|
450 int nargin = args.length(); |
|
|
451 std::list<regexp_elem> lst; |
|
|
452 string_vector named; |
|
|
453 int nopts; |
|
|
454 int sz = octregexp_list (args, nm, case_insensitive, lst, named, nopts); |
|
|
455 |
|
|
456 if (! error_state) |
|
|
457 { |
|
|
458 // Converted the linked list in the correct form for the return values |
|
|
459 |
|
|
460 octave_idx_type i = 0; |
|
|
461 #ifdef HAVE_PCRE |
|
|
462 Octave_map nmap; |
|
|
463 if (sz == 1) |
|
|
464 { |
|
|
465 for (int j = 0; j < named.length(); j++) |
|
|
466 nmap.assign (named(j), lst.begin()->named_token(j)); |
|
|
467 retval(5) = nmap; |
|
|
468 } |
|
|
469 else |
|
|
470 { |
|
|
471 for (int j = 0; j < named.length (); j++) |
|
|
472 { |
|
|
473 i = 0; |
|
|
474 Cell tmp(dim_vector (1, sz)); |
|
|
475 for (const_iterator p = lst.begin(); p != lst.end(); p++) |
|
|
476 tmp(i++) = p->named_token(j); |
|
|
477 nmap.assign (named(j), octave_value (tmp)); |
|
|
478 } |
|
|
479 retval(5) = nmap; |
|
|
480 } |
|
|
481 #else |
|
|
482 retval(5) = Octave_map(); |
|
|
483 #endif |
|
|
484 |
|
|
485 Cell t (dim_vector(1, sz)); |
|
|
486 i = 0; |
|
|
487 for (const_iterator p = lst.begin(); p != lst.end(); p++) |
|
|
488 t(i++) = p->t; |
|
5582
|
489 retval(4) = t; |
|
5785
|
490 |
|
|
491 Cell m (dim_vector(1, sz)); |
|
|
492 i = 0; |
|
|
493 for (const_iterator p = lst.begin(); p != lst.end(); p++) |
|
|
494 m(i++) = p->m; |
|
5582
|
495 retval(3) = m; |
|
5785
|
496 |
|
|
497 |
|
|
498 Cell te (dim_vector(1, sz)); |
|
|
499 i = 0; |
|
|
500 for (const_iterator p = lst.begin(); p != lst.end(); p++) |
|
|
501 te(i++) = p->te; |
|
5582
|
502 retval(2) = te; |
|
5785
|
503 |
|
|
504 NDArray e (dim_vector(1, sz)); |
|
|
505 i = 0; |
|
|
506 for (const_iterator p = lst.begin(); p != lst.end(); p++) |
|
|
507 e(i++) = p->e; |
|
5582
|
508 retval(1) = e; |
|
5785
|
509 |
|
|
510 NDArray s (dim_vector(1, sz)); |
|
|
511 i = 0; |
|
|
512 for (const_iterator p = lst.begin(); p != lst.end(); p++) |
|
|
513 s(i++) = p->s; |
|
5582
|
514 retval(0) = s; |
|
|
515 |
|
|
516 // Alter the order of the output arguments |
|
|
517 if (nopts > 0) |
|
|
518 { |
|
|
519 int n = 0; |
|
|
520 octave_value_list new_retval; |
|
|
521 new_retval.resize(nargout); |
|
|
522 |
|
|
523 OCTAVE_LOCAL_BUFFER (int, arg_used, 6); |
|
5785
|
524 for (int j = 0; j < 6; j++) |
|
|
525 arg_used[j] = false; |
|
5582
|
526 |
|
5785
|
527 for (int j = 2; j < nargin; j++) |
|
5582
|
528 { |
|
|
529 int k = 0; |
|
5785
|
530 std::string str = args(j).string_value(); |
|
5582
|
531 std::transform (str.begin (), str.end (), str.begin (), tolower); |
|
5779
|
532 if (str.find("once", 0) == 0 |
|
|
533 || str.find("stringanchors", 0) == 0 |
|
|
534 || str.find("lineanchors", 0) == 0 |
|
|
535 || str.find("matchcase", 0) == 0 |
|
|
536 || str.find("ignorecase", 0) == 0 |
|
|
537 || str.find("dotall", 0) == 0 |
|
|
538 || str.find("dotexceptnewline", 0) == 0 |
|
|
539 || str.find("literalspacing", 0) == 0 |
|
|
540 || str.find("freespacing", 0) == 0 |
|
|
541 ) |
|
5582
|
542 continue; |
|
|
543 else if (str.find("start", 0) == 0) |
|
|
544 k = 0; |
|
|
545 else if (str.find("end", 0) == 0) |
|
|
546 k = 1; |
|
|
547 else if (str.find("tokenextents", 0) == 0) |
|
|
548 k = 2; |
|
|
549 else if (str.find("match", 0) == 0) |
|
|
550 k = 3; |
|
|
551 else if (str.find("tokens", 0) == 0) |
|
|
552 k = 4; |
|
|
553 else if (str.find("names", 0) == 0) |
|
|
554 k = 5; |
|
|
555 |
|
|
556 new_retval(n++) = retval(k); |
|
|
557 arg_used[k] = true; |
|
|
558 |
|
|
559 if (n == nargout) |
|
|
560 break; |
|
|
561 } |
|
|
562 |
|
|
563 // Fill in the rest of the arguments |
|
|
564 if (n < nargout) |
|
|
565 { |
|
5785
|
566 for (int j = 0; j < 6; j++) |
|
5582
|
567 { |
|
5785
|
568 if (! arg_used[j]) |
|
|
569 new_retval(n++) = retval(j); |
|
5582
|
570 } |
|
|
571 } |
|
|
572 |
|
|
573 retval = new_retval; |
|
|
574 } |
|
|
575 } |
|
|
576 |
|
|
577 return retval; |
|
|
578 } |
|
|
579 |
|
6361
|
580 static octave_value_list |
|
|
581 octcellregexp (const octave_value_list &args, int nargout, const std::string &nm, |
|
|
582 bool case_insensitive) |
|
|
583 { |
|
|
584 octave_value_list retval; |
|
|
585 |
|
|
586 if (args(0).is_cell()) |
|
|
587 { |
|
|
588 OCTAVE_LOCAL_BUFFER (Cell, newretval, nargout); |
|
|
589 octave_value_list new_args = args; |
|
|
590 Cell cellstr = args(0).cell_value(); |
|
|
591 if (args(1).is_cell()) |
|
|
592 { |
|
|
593 Cell cellpat = args(1).cell_value(); |
|
|
594 |
|
|
595 if (cellpat.numel() == 1) |
|
|
596 { |
|
|
597 for (int j = 0; j < nargout; j++) |
|
|
598 newretval[j].resize(cellstr.dims()); |
|
|
599 |
|
|
600 new_args(1) = cellpat(0); |
|
|
601 |
|
|
602 for (octave_idx_type i = 0; i < cellstr.numel (); i++) |
|
|
603 { |
|
|
604 new_args(0) = cellstr(i); |
|
|
605 octave_value_list tmp = octregexp (new_args, nargout, nm, |
|
|
606 case_insensitive); |
|
|
607 |
|
|
608 if (error_state) |
|
|
609 break; |
|
|
610 |
|
|
611 for (int j = 0; j < nargout; j++) |
|
|
612 newretval[j](i) = tmp(j); |
|
|
613 } |
|
|
614 } |
|
|
615 else if (cellstr.numel() == 1) |
|
|
616 { |
|
|
617 for (int j = 0; j < nargout; j++) |
|
|
618 newretval[j].resize(cellpat.dims()); |
|
|
619 |
|
|
620 new_args(0) = cellstr(0); |
|
|
621 |
|
|
622 for (octave_idx_type i = 0; i < cellpat.numel (); i++) |
|
|
623 { |
|
|
624 new_args(1) = cellpat(i); |
|
|
625 octave_value_list tmp = octregexp (new_args, nargout, nm, |
|
|
626 case_insensitive); |
|
|
627 |
|
|
628 if (error_state) |
|
|
629 break; |
|
|
630 |
|
|
631 for (int j = 0; j < nargout; j++) |
|
|
632 newretval[j](i) = tmp(j); |
|
|
633 } |
|
|
634 } |
|
|
635 else if (cellstr.numel() == cellpat.numel()) |
|
|
636 { |
|
|
637 |
|
|
638 if (cellstr.dims() != cellpat.dims()) |
|
|
639 error ("%s: Inconsistent cell array dimensions", nm.c_str()); |
|
|
640 else |
|
|
641 { |
|
|
642 for (int j = 0; j < nargout; j++) |
|
|
643 newretval[j].resize(cellstr.dims()); |
|
|
644 |
|
|
645 for (octave_idx_type i = 0; i < cellstr.numel (); i++) |
|
|
646 { |
|
|
647 new_args(0) = cellstr(i); |
|
|
648 new_args(1) = cellpat(i); |
|
|
649 |
|
|
650 octave_value_list tmp = octregexp (new_args, nargout, nm, |
|
|
651 case_insensitive); |
|
|
652 |
|
|
653 if (error_state) |
|
|
654 break; |
|
|
655 |
|
|
656 for (int j = 0; j < nargout; j++) |
|
|
657 newretval[j](i) = tmp(j); |
|
|
658 } |
|
|
659 } |
|
|
660 } |
|
|
661 else |
|
|
662 error ("regexp: cell array arguments must be scalar or equal size"); |
|
|
663 } |
|
|
664 else |
|
|
665 { |
|
|
666 for (int j = 0; j < nargout; j++) |
|
|
667 newretval[j].resize(cellstr.dims()); |
|
|
668 |
|
|
669 for (octave_idx_type i = 0; i < cellstr.numel (); i++) |
|
|
670 { |
|
|
671 new_args(0) = cellstr(i); |
|
|
672 octave_value_list tmp = octregexp (new_args, nargout, nm, case_insensitive); |
|
|
673 |
|
|
674 if (error_state) |
|
|
675 break; |
|
|
676 |
|
|
677 for (int j = 0; j < nargout; j++) |
|
|
678 newretval[j](i) = tmp(j); |
|
|
679 } |
|
|
680 } |
|
|
681 |
|
|
682 if (!error_state) |
|
|
683 for (int j = 0; j < nargout; j++) |
|
|
684 retval(j) = octave_value (newretval[j]); |
|
|
685 } |
|
|
686 else if (args(1).is_cell()) |
|
|
687 { |
|
|
688 OCTAVE_LOCAL_BUFFER (Cell, newretval, nargout); |
|
|
689 octave_value_list new_args = args; |
|
|
690 Cell cellpat = args(1).cell_value(); |
|
|
691 |
|
|
692 for (int j = 0; j < nargout; j++) |
|
|
693 newretval[j].resize(cellpat.dims()); |
|
|
694 |
|
|
695 for (octave_idx_type i = 0; i < cellpat.numel (); i++) |
|
|
696 { |
|
|
697 new_args(1) = cellpat(i); |
|
|
698 octave_value_list tmp = octregexp (new_args, nargout, nm, case_insensitive); |
|
|
699 |
|
|
700 if (error_state) |
|
|
701 break; |
|
|
702 |
|
|
703 for (int j = 0; j < nargout; j++) |
|
|
704 newretval[j](i) = tmp(j); |
|
|
705 } |
|
|
706 |
|
|
707 if (!error_state) |
|
|
708 for (int j = 0; j < nargout; j++) |
|
|
709 retval(j) = octave_value (newretval[j]); |
|
|
710 } |
|
|
711 else |
|
|
712 retval = octregexp (args, nargout, nm, case_insensitive); |
|
|
713 |
|
|
714 return retval; |
|
|
715 |
|
|
716 } |
|
|
717 |
|
5582
|
718 DEFUN_DLD (regexp, args, nargout, |
|
|
719 "-*- texinfo -*-\n\ |
|
|
720 @deftypefn {Loadable Function} {[@var{s}, @var{e}, @var{te}, @var{m}, @var{t}, @var{nm}] =} regexp (@var{str}, @var{pat})\n\ |
|
|
721 @deftypefnx {Loadable Function} {[@dots{}] =} regexp (@var{str}, @var{pat}, @var{opts}, @dots{})\n\ |
|
|
722 \n\ |
|
|
723 Regular expression string matching. Matches @var{pat} in @var{str} and\n\ |
|
|
724 returns the position and matching substrings or empty values if there are\n\ |
|
|
725 none.\n\ |
|
|
726 \n\ |
|
|
727 The matched pattern @var{pat} can include any of the standard regex\n\ |
|
|
728 operators, including:\n\ |
|
|
729 \n\ |
|
|
730 @table @code\n\ |
|
|
731 @item .\n\ |
|
|
732 Match any character\n\ |
|
|
733 @item * + ? @{@}\n\ |
|
|
734 Repetition operators, representing\n\ |
|
|
735 @table @code\n\ |
|
|
736 @item *\n\ |
|
|
737 Match zero or more times\n\ |
|
|
738 @item +\n\ |
|
|
739 Match one or more times\n\ |
|
|
740 @item ?\n\ |
|
|
741 Match zero or one times\n\ |
|
|
742 @item @{@}\n\ |
|
|
743 Match range operator, which is of the form @code{@{@var{n}@}} to match exactly\n\ |
|
|
744 @var{n} times, @code{@{@var{m},@}} to match @var{m} or more times,\n\ |
|
|
745 @code{@{@var{m},@var{n}@}} to match between @var{m} and @var{n} times.\n\ |
|
|
746 @end table\n\ |
|
|
747 @item [@dots{}] [^@dots{}]\n\ |
|
|
748 List operators, where for example @code{[ab]c} matches @code{ac} and @code{bc}\n\ |
|
|
749 @item ()\n\ |
|
|
750 Grouping operator\n\ |
|
|
751 @item |\n\ |
|
|
752 Alternation operator. Match one of a choice of regular expressions. The\n\ |
|
7001
|
753 alternatives must be delimited by the grouping operator @code{()} above\n\ |
|
5582
|
754 @item ^ $\n\ |
|
|
755 Anchoring operator. @code{^} matches the start of the string @var{str} and\n\ |
|
|
756 @code{$} the end\n\ |
|
|
757 @end table\n\ |
|
|
758 \n\ |
|
|
759 In addition the following escaped characters have special meaning. It should\n\ |
|
|
760 be noted that it is recommended to quote @var{pat} in single quotes rather\n\ |
|
|
761 than double quotes, to avoid the escape sequences being interpreted by octave\n\ |
|
|
762 before being passed to @code{regexp}.\n\ |
|
|
763 \n\ |
|
|
764 @table @code\n\ |
|
|
765 @item \\b\n\ |
|
|
766 Match a word boundary\n\ |
|
|
767 @item \\B\n\ |
|
|
768 Match within a word\n\ |
|
|
769 @item \\w\n\ |
|
|
770 Matches any word character\n\ |
|
|
771 @item \\W\n\ |
|
|
772 Matches any non word character\n\ |
|
|
773 @item \\<\n\ |
|
|
774 Matches the beginning of a word\n\ |
|
|
775 @item \\>\n\ |
|
|
776 Matches the end of a word\n\ |
|
|
777 @item \\s\n\ |
|
|
778 Matches any whitespace character\n\ |
|
|
779 @item \\S\n\ |
|
|
780 Matches any non whitespace character\n\ |
|
|
781 @item \\d\n\ |
|
|
782 Matches any digit\n\ |
|
|
783 @item \\D\n\ |
|
|
784 Matches any non-digit\n\ |
|
|
785 @end table\n\ |
|
|
786 \n\ |
|
|
787 The outputs of @code{regexp} by default are in the order as given below\n\ |
|
|
788 \n\ |
|
|
789 @table @asis\n\ |
|
|
790 @item @var{s}\n\ |
|
|
791 The start indices of each of the matching substrings\n\ |
|
|
792 \n\ |
|
|
793 @item @var{e}\n\ |
|
|
794 The end indices of each matching substring\n\ |
|
|
795 \n\ |
|
|
796 @item @var{te}\n\ |
|
|
797 The extents of each of the matched token surrounded by @code{(@dots{})} in\n\ |
|
|
798 @var{pat}.\n\ |
|
|
799 \n\ |
|
|
800 @item @var{m}\n\ |
|
|
801 A cell array of the text of each match.\n\ |
|
|
802 \n\ |
|
|
803 @item @var{t}\n\ |
|
|
804 A cell array of the text of each token matched.\n\ |
|
|
805 \n\ |
|
|
806 @item @var{nm}\n\ |
|
|
807 A structure containing the text of each matched named token, with the name\n\ |
|
|
808 being used as the fieldname. A named token is denoted as\n\ |
|
|
809 @code{(?<name>@dots{})}\n\ |
|
|
810 @end table\n\ |
|
|
811 \n\ |
|
|
812 Particular output arguments or the order of the output arguments can be\n\ |
|
|
813 selected by additional @var{opts} arguments. These are strings and the\n\ |
|
|
814 correspondence between the output arguments and the optional argument\n\ |
|
|
815 are\n\ |
|
|
816 \n\ |
|
|
817 @multitable @columnfractions 0.2 0.3 0.3 0.2\n\ |
|
|
818 @item @tab 'start' @tab @var{s} @tab\n\ |
|
|
819 @item @tab 'end' @tab @var{e} @tab\n\ |
|
|
820 @item @tab 'tokenExtents' @tab @var{te} @tab\n\ |
|
|
821 @item @tab 'match' @tab @var{m} @tab\n\ |
|
|
822 @item @tab 'tokens' @tab @var{t} @tab\n\ |
|
|
823 @item @tab 'names' @tab @var{nm} @tab\n\ |
|
|
824 @end multitable\n\ |
|
|
825 \n\ |
|
|
826 A further optional argument is 'once', that limits the number of returned\n\ |
|
5779
|
827 matches to the first match. Additional arguments are\n\ |
|
|
828 \n\ |
|
|
829 @table @asis\n\ |
|
|
830 @item matchcase\n\ |
|
|
831 Make the matching case sensitive.\n\ |
|
|
832 @item ignorecase\n\ |
|
|
833 Make the matching case insensitive.\n\ |
|
|
834 @item stringanchors\n\ |
|
|
835 Match the anchor characters at the beginning and end of the string.\n\ |
|
|
836 @item lineanchors\n\ |
|
|
837 Match the anchor characters at the beginning and end of the line.\n\ |
|
|
838 @item dotall\n\ |
|
|
839 The character @code{.} matches the newline character.\n\ |
|
|
840 @item dotexceptnewline\n\ |
|
|
841 The character @code{.} matches all but the newline character.\n\ |
|
|
842 @item freespacing\n\ |
|
|
843 The pattern can include arbitrary whitespace and comments starting with\n\ |
|
|
844 @code{#}.\n\ |
|
|
845 @item literalspacing\n\ |
|
|
846 The pattern is taken literally.\n\ |
|
|
847 @end table\n\ |
|
5582
|
848 @end deftypefn") |
|
|
849 { |
|
6361
|
850 octave_value_list retval; |
|
|
851 int nargin = args.length(); |
|
|
852 |
|
|
853 if (nargin < 2) |
|
|
854 print_usage (); |
|
|
855 else if (args(0).is_cell() || args(1).is_cell()) |
|
|
856 retval = octcellregexp (args, nargout, "regexp", false); |
|
|
857 else |
|
|
858 retval = octregexp (args, nargout, "regexp", false); |
|
|
859 |
|
|
860 return retval; |
|
5582
|
861 } |
|
|
862 |
|
|
863 /* |
|
|
864 |
|
|
865 ## seg-fault test |
|
|
866 %!assert(regexp("abcde","."),[1,2,3,4,5]) |
|
|
867 |
|
|
868 ## Check that anchoring of pattern works correctly |
|
|
869 %!assert(regexp('abcabc','^abc'),1); |
|
|
870 %!assert(regexp('abcabc','abc$'),4); |
|
5785
|
871 %!assert(regexp('abcabc','^abc$'),zeros(1,0)); |
|
5582
|
872 |
|
|
873 %!test |
|
|
874 %! [s, e, te, m, t] = regexp(' No Match ', 'f(.*)uck'); |
|
5785
|
875 %! assert (s,zeros(1,0)) |
|
|
876 %! assert (e,zeros(1,0)) |
|
|
877 %! assert (te,cell(1,0)) |
|
|
878 %! assert (m, cell(1,0)) |
|
|
879 %! assert (t, cell(1,0)) |
|
5582
|
880 |
|
|
881 %!test |
|
|
882 %! [s, e, te, m, t] = regexp(' FiRetrUck ', 'f(.*)uck'); |
|
5785
|
883 %! assert (s,zeros(1,0)) |
|
|
884 %! assert (e,zeros(1,0)) |
|
|
885 %! assert (te,cell(1,0)) |
|
|
886 %! assert (m, cell(1,0)) |
|
|
887 %! assert (t, cell(1,0)) |
|
5582
|
888 |
|
|
889 %!test |
|
|
890 %! [s, e, te, m, t] = regexp(' firetruck ', 'f(.*)uck'); |
|
|
891 %! assert (s,2) |
|
|
892 %! assert (e,10) |
|
|
893 %! assert (te{1},[3,7]) |
|
|
894 %! assert (m{1}, 'firetruck') |
|
|
895 %! assert (t{1}{1}, 'iretr') |
|
|
896 |
|
|
897 %!test |
|
|
898 %! [s, e, te, m, t] = regexp('short test string','\w*r\w*'); |
|
|
899 %! assert (s,[1,12]) |
|
|
900 %! assert (e,[5,17]) |
|
|
901 %! assert (size(te), [1,2]) |
|
|
902 %! assert (isempty(te{1})) |
|
|
903 %! assert (isempty(te{2})) |
|
|
904 %! assert (m{1},'short') |
|
|
905 %! assert (m{2},'string') |
|
|
906 %! assert (size(t), [1,2]) |
|
|
907 %! assert (isempty(t{1})) |
|
|
908 %! assert (isempty(t{2})) |
|
|
909 |
|
|
910 %!test |
|
|
911 %! [s, e, te, m, t] = regexp('short test string','\w*r\w*','once'); |
|
|
912 %! assert (s,1) |
|
|
913 %! assert (e,5) |
|
|
914 %! assert (size(te), [1,1]) |
|
|
915 %! assert (isempty(te{1})) |
|
|
916 %! assert (m{1},'short') |
|
|
917 %! ## Matlab gives [1,0] here but that seems wrong. |
|
|
918 %! assert (size(t), [1,1]) |
|
|
919 |
|
|
920 %!test |
|
|
921 %! [m, te, e, s, t] = regexp('short test string','\w*r\w*','once', 'match', 'tokenExtents', 'end', 'start', 'tokens'); |
|
|
922 %! assert (s,1) |
|
|
923 %! assert (e,5) |
|
|
924 %! assert (size(te), [1,1]) |
|
|
925 %! assert (isempty(te{1})) |
|
|
926 %! assert (m{1},'short') |
|
|
927 %! ## Matlab gives [1,0] here but that seems wrong. |
|
|
928 %! assert (size(t), [1,1]) |
|
|
929 |
|
5619
|
930 %!test |
|
5582
|
931 %! ## This test is expected to fail if PCRE is not installed |
|
5620
|
932 %! if (!isempty(findstr(octave_config_info ("DEFS"),"HAVE_PCRE"))) |
|
5619
|
933 %! [s, e, te, m, t, nm] = regexp('short test string','(?<word1>\w*t)\s*(?<word2>\w*t)'); |
|
|
934 %! assert (s,1) |
|
|
935 %! assert (e,10) |
|
|
936 %! assert (size(te), [1,1]) |
|
|
937 %! assert (te{1}, [1 5; 7, 10]) |
|
|
938 %! assert (m{1},'short test') |
|
|
939 %! assert (size(t),[1,1]) |
|
|
940 %! assert (t{1}{1},'short') |
|
|
941 %! assert (t{1}{2},'test') |
|
|
942 %! assert (size(nm), [1,1]) |
|
|
943 %! assert (!isempty(fieldnames(nm))) |
|
|
944 %! assert (sort(fieldnames(nm)),{'word1';'word2'}) |
|
|
945 %! assert (nm.word1,'short') |
|
|
946 %! assert (nm.word2,'test') |
|
|
947 %! endif |
|
5582
|
948 |
|
5619
|
949 %!test |
|
5582
|
950 %! ## This test is expected to fail if PCRE is not installed |
|
5620
|
951 %! if (!isempty(findstr(octave_config_info ("DEFS"),"HAVE_PCRE"))) |
|
5619
|
952 %! [nm, m, te, e, s, t] = regexp('short test string','(?<word1>\w*t)\s*(?<word2>\w*t)', 'names', 'match', 'tokenExtents', 'end', 'start', 'tokens'); |
|
|
953 %! assert (s,1) |
|
|
954 %! assert (e,10) |
|
|
955 %! assert (size(te), [1,1]) |
|
|
956 %! assert (te{1}, [1 5; 7, 10]) |
|
|
957 %! assert (m{1},'short test') |
|
|
958 %! assert (size(t),[1,1]) |
|
|
959 %! assert (t{1}{1},'short') |
|
|
960 %! assert (t{1}{2},'test') |
|
|
961 %! assert (size(nm), [1,1]) |
|
|
962 %! assert (!isempty(fieldnames(nm))) |
|
|
963 %! assert (sort(fieldnames(nm)),{'word1';'word2'}) |
|
|
964 %! assert (nm.word1,'short') |
|
|
965 %! assert (nm.word2,'test') |
|
|
966 %! endif |
|
|
967 |
|
|
968 %!test |
|
|
969 %! ## This test is expected to fail if PCRE is not installed |
|
5620
|
970 %! if (!isempty(findstr(octave_config_info ("DEFS"),"HAVE_PCRE"))) |
|
5619
|
971 %! [t, nm] = regexp("John Davis\nRogers, James",'(?<first>\w+)\s+(?<last>\w+)|(?<last>\w+),\s+(?<first>\w+)','tokens','names'); |
|
|
972 %! assert (size(t), [1,2]); |
|
|
973 %! assert (t{1}{1},'John'); |
|
|
974 %! assert (t{1}{2},'Davis'); |
|
|
975 %! assert (t{2}{1},'Rogers'); |
|
|
976 %! assert (t{2}{2},'James'); |
|
|
977 %! assert (size(nm), [1,1]); |
|
|
978 %! assert (nm.first{1},'John'); |
|
|
979 %! assert (nm.first{2},'James'); |
|
|
980 %! assert (nm.last{1},'Davis'); |
|
|
981 %! assert (nm.last{2},'Rogers'); |
|
|
982 %! endif |
|
5582
|
983 |
|
5779
|
984 %!assert(regexp("abc\nabc",'.'),[1:7]) |
|
|
985 %!assert(regexp("abc\nabc",'.','dotall'),[1:7]) |
|
|
986 %!test |
|
|
987 %! if (!isempty(findstr(octave_config_info ("DEFS"),"HAVE_PCRE"))) |
|
|
988 %! assert(regexp("abc\nabc",'(?s).'),[1:7]) |
|
|
989 %! assert(regexp("abc\nabc",'.','dotexceptnewline'),[1,2,3,5,6,7]) |
|
|
990 %! assert(regexp("abc\nabc",'(?-s).'),[1,2,3,5,6,7]) |
|
|
991 %! endif |
|
|
992 |
|
|
993 %!assert(regexp("caseCaSe",'case'),1) |
|
|
994 %!assert(regexp("caseCaSe",'case',"matchcase"),1) |
|
|
995 %!assert(regexp("caseCaSe",'case',"ignorecase"),[1,5]) |
|
|
996 %!test |
|
|
997 %! if (!isempty(findstr(octave_config_info ("DEFS"),"HAVE_PCRE"))) |
|
|
998 %! assert(regexp("caseCaSe",'(?-i)case'),1) |
|
|
999 %! assert(regexp("caseCaSe",'(?i)case'),[1,5]) |
|
|
1000 %! endif |
|
|
1001 |
|
|
1002 %!assert (regexp("abc\nabc",'c$'),7) |
|
|
1003 %!assert (regexp("abc\nabc",'c$',"stringanchors"),7) |
|
|
1004 %!test |
|
|
1005 %! if (!isempty(findstr(octave_config_info ("DEFS"),"HAVE_PCRE"))) |
|
|
1006 %! assert (regexp("abc\nabc",'(?-m)c$'),7) |
|
|
1007 %! assert (regexp("abc\nabc",'c$',"lineanchors"),[3,7]) |
|
|
1008 %! assert (regexp("abc\nabc",'(?m)c$'),[3,7]) |
|
|
1009 %! endif |
|
|
1010 |
|
|
1011 %!assert (regexp("this word",'s w'),4) |
|
|
1012 %!assert (regexp("this word",'s w','literalspacing'),4) |
|
|
1013 %!test |
|
|
1014 %! if (!isempty(findstr(octave_config_info ("DEFS"),"HAVE_PCRE"))) |
|
|
1015 %! assert (regexp("this word",'(?-x)s w','literalspacing'),4) |
|
5785
|
1016 %! assert (regexp("this word",'s w','freespacing'),zeros(1,0)) |
|
|
1017 %! assert (regexp("this word",'(?x)s w'),zeros(1,0)) |
|
5779
|
1018 %! endif |
|
|
1019 |
|
5582
|
1020 %!error regexp('string', 'tri', 'BadArg'); |
|
|
1021 %!error regexp('string'); |
|
|
1022 |
|
6361
|
1023 %!assert(regexp({'asdfg-dfd';'-dfd-dfd-';'qasfdfdaq'},'-'),{6;[1,5,9];zeros(1,0)}) |
|
|
1024 %!assert(regexp({'asdfg-dfd','-dfd-dfd-','qasfdfdaq'},'-'),{6,[1,5,9],zeros(1,0)}) |
|
|
1025 %!assert(regexp({'asdfg-dfd';'-dfd-dfd-';'qasfdfdaq'},{'-';'f';'q'}),{6;[3,7];[1,9]}) |
|
|
1026 %!assert(regexp('Strings',{'t','s'}),{2,7}) |
|
|
1027 |
|
5582
|
1028 */ |
|
|
1029 |
|
6549
|
1030 DEFUN_DLD (regexpi, args, nargout, |
|
5582
|
1031 "-*- texinfo -*-\n\ |
|
|
1032 @deftypefn {Loadable Function} {[@var{s}, @var{e}, @var{te}, @var{m}, @var{t}, @var{nm}] =} regexpi (@var{str}, @var{pat})\n\ |
|
|
1033 @deftypefnx {Loadable Function} {[@dots{}] =} regexpi (@var{str}, @var{pat}, @var{opts}, @dots{})\n\ |
|
|
1034 \n\ |
|
|
1035 Case insensitive regular expression string matching. Matches @var{pat} in\n\ |
|
|
1036 @var{str} and returns the position and matching substrings or empty values\n\ |
|
|
1037 if there are none. See @code{regexp} for more details\n\ |
|
|
1038 @end deftypefn") |
|
|
1039 { |
|
6361
|
1040 octave_value_list retval; |
|
|
1041 int nargin = args.length(); |
|
|
1042 |
|
|
1043 if (nargin < 2) |
|
|
1044 print_usage (); |
|
|
1045 else if (args(0).is_cell() || args(1).is_cell()) |
|
|
1046 retval = octcellregexp (args, nargout, "regexpi", true); |
|
|
1047 else |
|
|
1048 retval = octregexp (args, nargout, "regexpi", true); |
|
|
1049 |
|
|
1050 return retval; |
|
5582
|
1051 } |
|
|
1052 |
|
|
1053 /* |
|
|
1054 |
|
|
1055 ## seg-fault test |
|
|
1056 %!assert(regexpi("abcde","."),[1,2,3,4,5]) |
|
|
1057 |
|
|
1058 ## Check that anchoring of pattern works correctly |
|
|
1059 %!assert(regexpi('abcabc','^abc'),1); |
|
|
1060 %!assert(regexpi('abcabc','abc$'),4); |
|
5785
|
1061 %!assert(regexpi('abcabc','^abc$'),zeros(1,0)); |
|
5582
|
1062 |
|
|
1063 %!test |
|
|
1064 %! [s, e, te, m, t] = regexpi(' No Match ', 'f(.*)uck'); |
|
5785
|
1065 %! assert (s,zeros(1,0)) |
|
|
1066 %! assert (e,zeros(1,0)) |
|
|
1067 %! assert (te,cell(1,0)) |
|
|
1068 %! assert (m, cell(1,0)) |
|
|
1069 %! assert (t, cell(1,0)) |
|
5582
|
1070 |
|
|
1071 %!test |
|
|
1072 %! [s, e, te, m, t] = regexpi(' FiRetrUck ', 'f(.*)uck'); |
|
|
1073 %! assert (s,2) |
|
|
1074 %! assert (e,10) |
|
|
1075 %! assert (te{1},[3,7]) |
|
|
1076 %! assert (m{1}, 'FiRetrUck') |
|
|
1077 %! assert (t{1}{1}, 'iRetr') |
|
|
1078 |
|
|
1079 %!test |
|
|
1080 %! [s, e, te, m, t] = regexpi(' firetruck ', 'f(.*)uck'); |
|
|
1081 %! assert (s,2) |
|
|
1082 %! assert (e,10) |
|
|
1083 %! assert (te{1},[3,7]) |
|
|
1084 %! assert (m{1}, 'firetruck') |
|
|
1085 %! assert (t{1}{1}, 'iretr') |
|
|
1086 |
|
|
1087 %!test |
|
|
1088 %! [s, e, te, m, t] = regexpi('ShoRt Test String','\w*r\w*'); |
|
|
1089 %! assert (s,[1,12]) |
|
|
1090 %! assert (e,[5,17]) |
|
|
1091 %! assert (size(te), [1,2]) |
|
|
1092 %! assert (isempty(te{1})) |
|
|
1093 %! assert (isempty(te{2})) |
|
|
1094 %! assert (m{1},'ShoRt') |
|
|
1095 %! assert (m{2},'String') |
|
|
1096 %! assert (size(t), [1,2]) |
|
|
1097 %! assert (isempty(t{1})) |
|
|
1098 %! assert (isempty(t{2})) |
|
|
1099 |
|
|
1100 %!test |
|
|
1101 %! [s, e, te, m, t] = regexpi('ShoRt Test String','\w*r\w*','once'); |
|
|
1102 %! assert (s,1) |
|
|
1103 %! assert (e,5) |
|
|
1104 %! assert (size(te), [1,1]) |
|
|
1105 %! assert (isempty(te{1})) |
|
|
1106 %! assert (m{1},'ShoRt') |
|
|
1107 %! ## Matlab gives [1,0] here but that seems wrong. |
|
|
1108 %! assert (size(t), [1,1]) |
|
|
1109 |
|
|
1110 %!test |
|
|
1111 %! [m, te, e, s, t] = regexpi('ShoRt Test String','\w*r\w*','once', 'match', 'tokenExtents', 'end', 'start', 'tokens'); |
|
|
1112 %! assert (s,1) |
|
|
1113 %! assert (e,5) |
|
|
1114 %! assert (size(te), [1,1]) |
|
|
1115 %! assert (isempty(te{1})) |
|
|
1116 %! assert (m{1},'ShoRt') |
|
|
1117 %! ## Matlab gives [1,0] here but that seems wrong. |
|
|
1118 %! assert (size(t), [1,1]) |
|
|
1119 |
|
5619
|
1120 %!test |
|
5582
|
1121 %! ## This test is expected to fail if PCRE is not installed |
|
5620
|
1122 %! if (!isempty(findstr(octave_config_info ("DEFS"),"HAVE_PCRE"))) |
|
5619
|
1123 %! [s, e, te, m, t, nm] = regexpi('ShoRt Test String','(?<word1>\w*t)\s*(?<word2>\w*t)'); |
|
|
1124 %! assert (s,1) |
|
|
1125 %! assert (e,10) |
|
|
1126 %! assert (size(te), [1,1]) |
|
|
1127 %! assert (te{1}, [1 5; 7, 10]) |
|
|
1128 %! assert (m{1},'ShoRt Test') |
|
|
1129 %! assert (size(t),[1,1]) |
|
|
1130 %! assert (t{1}{1},'ShoRt') |
|
|
1131 %! assert (t{1}{2},'Test') |
|
|
1132 %! assert (size(nm), [1,1]) |
|
|
1133 %! assert (!isempty(fieldnames(nm))) |
|
|
1134 %! assert (sort(fieldnames(nm)),{'word1';'word2'}) |
|
|
1135 %! assert (nm.word1,'ShoRt') |
|
|
1136 %! assert (nm.word2,'Test') |
|
|
1137 %! endif |
|
5582
|
1138 |
|
5619
|
1139 %!test |
|
5582
|
1140 %! ## This test is expected to fail if PCRE is not installed |
|
5620
|
1141 %! if (!isempty(findstr(octave_config_info ("DEFS"),"HAVE_PCRE"))) |
|
5619
|
1142 %! [nm, m, te, e, s, t] = regexpi('ShoRt Test String','(?<word1>\w*t)\s*(?<word2>\w*t)', 'names', 'match', 'tokenExtents', 'end', 'start', 'tokens'); |
|
|
1143 %! assert (s,1) |
|
|
1144 %! assert (e,10) |
|
|
1145 %! assert (size(te), [1,1]) |
|
|
1146 %! assert (te{1}, [1 5; 7, 10]) |
|
|
1147 %! assert (m{1},'ShoRt Test') |
|
|
1148 %! assert (size(t),[1,1]) |
|
|
1149 %! assert (t{1}{1},'ShoRt') |
|
|
1150 %! assert (t{1}{2},'Test') |
|
|
1151 %! assert (size(nm), [1,1]) |
|
|
1152 %! assert (!isempty(fieldnames(nm))) |
|
|
1153 %! assert (sort(fieldnames(nm)),{'word1';'word2'}) |
|
|
1154 %! assert (nm.word1,'ShoRt') |
|
|
1155 %! assert (nm.word2,'Test') |
|
|
1156 %! endif |
|
5582
|
1157 |
|
5779
|
1158 %!assert(regexpi("abc\nabc",'.'),[1:7]) |
|
|
1159 %!assert(regexpi("abc\nabc",'.','dotall'),[1:7]) |
|
|
1160 %!test |
|
|
1161 %! if (!isempty(findstr(octave_config_info ("DEFS"),"HAVE_PCRE"))) |
|
|
1162 %! assert(regexpi("abc\nabc",'(?s).'),[1:7]) |
|
|
1163 %! assert(regexpi("abc\nabc",'.','dotexceptnewline'),[1,2,3,5,6,7]) |
|
|
1164 %! assert(regexpi("abc\nabc",'(?-s).'),[1,2,3,5,6,7]) |
|
|
1165 %! endif |
|
|
1166 |
|
|
1167 %!assert(regexpi("caseCaSe",'case'),[1,5]) |
|
|
1168 %!assert(regexpi("caseCaSe",'case',"matchcase"),1) |
|
|
1169 %!assert(regexpi("caseCaSe",'case',"ignorecase"),[1,5]) |
|
|
1170 %!test |
|
|
1171 %! if (!isempty(findstr(octave_config_info ("DEFS"),"HAVE_PCRE"))) |
|
|
1172 %! assert(regexpi("caseCaSe",'(?-i)case'),1) |
|
|
1173 %! assert(regexpi("caseCaSe",'(?i)case'),[1,5]) |
|
|
1174 %! endif |
|
|
1175 |
|
|
1176 %!assert (regexpi("abc\nabc",'c$'),7) |
|
|
1177 %!assert (regexpi("abc\nabc",'c$',"stringanchors"),7) |
|
|
1178 %!test |
|
|
1179 %! if (!isempty(findstr(octave_config_info ("DEFS"),"HAVE_PCRE"))) |
|
|
1180 %! assert (regexpi("abc\nabc",'(?-m)c$'),7) |
|
|
1181 %! assert (regexpi("abc\nabc",'c$',"lineanchors"),[3,7]) |
|
|
1182 %! assert (regexpi("abc\nabc",'(?m)c$'),[3,7]) |
|
|
1183 %! endif |
|
|
1184 |
|
|
1185 %!assert (regexpi("this word",'s w'),4) |
|
|
1186 %!assert (regexpi("this word",'s w','literalspacing'),4) |
|
|
1187 %!test |
|
|
1188 %! if (!isempty(findstr(octave_config_info ("DEFS"),"HAVE_PCRE"))) |
|
|
1189 %! assert (regexpi("this word",'(?-x)s w','literalspacing'),4) |
|
5785
|
1190 %! assert (regexpi("this word",'s w','freespacing'),zeros(1,0)) |
|
|
1191 %! assert (regexpi("this word",'(?x)s w'),zeros(1,0)) |
|
5779
|
1192 %! endif |
|
|
1193 |
|
5582
|
1194 %!error regexpi('string', 'tri', 'BadArg'); |
|
|
1195 %!error regexpi('string'); |
|
|
1196 |
|
6361
|
1197 %!assert(regexpi({'asdfg-dfd';'-dfd-dfd-';'qasfdfdaq'},'-'),{6;[1,5,9];zeros(1,0)}) |
|
|
1198 %!assert(regexpi({'asdfg-dfd','-dfd-dfd-','qasfdfdaq'},'-'),{6,[1,5,9],zeros(1,0)}) |
|
|
1199 %!assert(regexpi({'asdfg-dfd';'-dfd-dfd-';'qasfdfdaq'},{'-';'f';'q'}),{6;[3,7];[1,9]}) |
|
|
1200 %!assert(regexpi('Strings',{'t','s'}),{2,[1,7]}) |
|
|
1201 |
|
5582
|
1202 */ |
|
|
1203 |
|
6361
|
1204 |
|
|
1205 static octave_value |
|
|
1206 octregexprep (const octave_value_list &args, const std::string &nm) |
|
5785
|
1207 { |
|
6361
|
1208 octave_value retval; |
|
5785
|
1209 int nargin = args.length(); |
|
|
1210 |
|
|
1211 // Make sure we have string,pattern,replacement |
|
|
1212 const std::string buffer = args(0).string_value (); |
|
|
1213 if (error_state) return retval; |
|
|
1214 const std::string pattern = args(1).string_value (); |
|
|
1215 if (error_state) return retval; |
|
|
1216 const std::string replacement = args(2).string_value (); |
|
|
1217 if (error_state) return retval; |
|
|
1218 |
|
|
1219 // Pack options excluding 'tokenize' and various output |
|
|
1220 // reordering strings into regexp arg list |
|
|
1221 octave_value_list regexpargs(nargin-1,octave_value()); |
|
|
1222 regexpargs(0) = args(0); |
|
|
1223 regexpargs(1) = args(1); |
|
|
1224 int len=2; |
|
|
1225 for (int i = 3; i < nargin; i++) |
|
|
1226 { |
|
|
1227 const std::string opt = args(i).string_value(); |
|
|
1228 if (opt != "tokenize" && opt != "start" && opt != "end" |
|
|
1229 && opt != "tokenextents" && opt != "match" && opt != "tokens" |
|
|
1230 && opt != "names" && opt != "warnings") |
|
|
1231 { |
|
|
1232 regexpargs(len++) = args(i); |
|
|
1233 } |
|
|
1234 } |
|
|
1235 regexpargs.resize(len); |
|
|
1236 |
|
|
1237 // Identify replacement tokens; build a vector of group numbers in |
|
|
1238 // the replacement string so that we can quickly calculate the size |
|
|
1239 // of the replacement. |
|
|
1240 int tokens = 0; |
|
|
1241 for (size_t i=1; i < replacement.size(); i++) |
|
|
1242 { |
|
|
1243 if (replacement[i-1]=='$' && isdigit(replacement[i])) |
|
|
1244 { |
|
|
1245 tokens++, i++; |
|
|
1246 } |
|
|
1247 } |
|
|
1248 std::vector<int> token(tokens); |
|
|
1249 int kk = 0; |
|
|
1250 for (size_t i = 1; i < replacement.size(); i++) |
|
|
1251 { |
|
|
1252 if (replacement[i-1]=='$' && isdigit(replacement[i])) |
|
|
1253 { |
|
|
1254 token[kk++] = replacement[i]-'0'; |
|
|
1255 i++; |
|
|
1256 } |
|
|
1257 } |
|
|
1258 |
|
|
1259 // Perform replacement |
|
|
1260 std::string rep; |
|
|
1261 if (tokens > 0) |
|
|
1262 { |
|
|
1263 std::list<regexp_elem> lst; |
|
|
1264 string_vector named; |
|
|
1265 int nopts; |
|
6361
|
1266 int sz = octregexp_list (regexpargs, nm , false, lst, named, nopts); |
|
5785
|
1267 |
|
|
1268 if (error_state) |
|
|
1269 return retval; |
|
|
1270 if (sz == 0) |
|
|
1271 { |
|
6361
|
1272 retval = args(0); |
|
5785
|
1273 return retval; |
|
|
1274 } |
|
|
1275 |
|
|
1276 // Determine replacement length |
|
|
1277 const size_t replen = replacement.size() - 2*tokens; |
|
|
1278 int delta = 0; |
|
|
1279 const_iterator p = lst.begin(); |
|
|
1280 for (int i = 0; i < sz; i++) |
|
|
1281 { |
|
|
1282 OCTAVE_QUIT; |
|
|
1283 |
|
|
1284 const Matrix pairs(p->te); |
|
|
1285 size_t pairlen = 0; |
|
|
1286 for (int j = 0; j < tokens; j++) |
|
|
1287 { |
|
|
1288 if (token[j] == 0) |
|
|
1289 pairlen += static_cast<size_t>(p->e - p->s) + 1; |
|
|
1290 else if (token[j] <= pairs.rows()) |
|
|
1291 pairlen += static_cast<size_t>(pairs(token[j]-1,1) - |
|
|
1292 pairs(token[j]-1,0)) + 1; |
|
|
1293 } |
|
|
1294 delta += static_cast<int>(replen + pairlen) - |
|
|
1295 static_cast<int>(p->e - p->s + 1); |
|
|
1296 p++; |
|
|
1297 } |
|
|
1298 |
|
|
1299 // Build replacement string |
|
|
1300 rep.reserve(buffer.size()+delta); |
|
|
1301 size_t from = 0; |
|
|
1302 p = lst.begin(); |
|
|
1303 for (int i=0; i < sz; i++) |
|
|
1304 { |
|
|
1305 OCTAVE_QUIT; |
|
|
1306 |
|
|
1307 const Matrix pairs(p->te); |
|
|
1308 rep.append(&buffer[from], static_cast<size_t>(p->s - 1) - from); |
|
|
1309 from = static_cast<size_t>(p->e - 1) + 1; |
|
|
1310 for (size_t j = 1; j < replacement.size(); j++) |
|
|
1311 { |
|
|
1312 if (replacement[j-1]=='$' && isdigit(replacement[j])) |
|
|
1313 { |
|
|
1314 int k = replacement[j]-'0'; |
|
|
1315 if (k == 0) |
|
|
1316 { |
|
|
1317 // replace with entire match |
|
|
1318 rep.append(&buffer[static_cast<size_t>(p->e - 1)], |
|
|
1319 static_cast<size_t>(p->e - p->s) + 1); |
|
|
1320 } |
|
|
1321 else if (k <= pairs.rows()) |
|
|
1322 { |
|
|
1323 // replace with group capture |
|
|
1324 rep.append(&buffer[static_cast<size_t>(pairs(k-1,0)-1)], |
|
|
1325 static_cast<size_t>(pairs(k-1,1) - |
|
|
1326 pairs(k-1,0))+1); |
|
|
1327 } |
|
|
1328 else |
|
|
1329 { |
|
|
1330 // replace with nothing |
|
|
1331 } |
|
|
1332 j++; |
|
|
1333 } |
|
|
1334 else |
|
|
1335 { |
|
|
1336 rep.append(1,replacement[j-1]); |
|
|
1337 } |
|
|
1338 if (j+1 == replacement.size()) |
|
|
1339 { |
|
|
1340 rep.append(1,replacement[j]); |
|
|
1341 } |
|
|
1342 } |
|
|
1343 p++; |
|
|
1344 } |
|
|
1345 rep.append(&buffer[from],buffer.size()-from); |
|
|
1346 } |
|
|
1347 else |
|
|
1348 { |
|
|
1349 std::list<regexp_elem> lst; |
|
|
1350 string_vector named; |
|
|
1351 int nopts; |
|
6361
|
1352 int sz = octregexp_list (regexpargs, nm, false, lst, named,nopts); |
|
5785
|
1353 |
|
|
1354 if (error_state) |
|
|
1355 return retval; |
|
|
1356 if (sz == 0) |
|
|
1357 { |
|
6361
|
1358 retval = args(0); |
|
5785
|
1359 return retval; |
|
|
1360 } |
|
|
1361 |
|
|
1362 // Determine replacement length |
|
|
1363 const size_t replen = replacement.size(); |
|
|
1364 int delta = 0; |
|
|
1365 const_iterator p = lst.begin(); |
|
|
1366 for (int i = 0; i < sz; i++) |
|
|
1367 { |
|
|
1368 OCTAVE_QUIT; |
|
|
1369 delta += static_cast<int>(replen) - |
|
|
1370 static_cast<int>(p->e - p->s + 1); |
|
|
1371 p++; |
|
|
1372 } |
|
|
1373 |
|
|
1374 // Build replacement string |
|
|
1375 rep.reserve(buffer.size()+delta); |
|
|
1376 size_t from = 0; |
|
|
1377 p = lst.begin(); |
|
|
1378 for (int i=0; i < sz; i++) |
|
|
1379 { |
|
|
1380 OCTAVE_QUIT; |
|
|
1381 rep.append(&buffer[from], static_cast<size_t>(p->s - 1) - from); |
|
|
1382 from = static_cast<size_t>(p->e - 1) + 1; |
|
|
1383 rep.append(replacement); |
|
|
1384 p++; |
|
|
1385 } |
|
|
1386 rep.append(&buffer[from],buffer.size()-from); |
|
|
1387 } |
|
|
1388 |
|
6361
|
1389 retval = rep; |
|
|
1390 return retval; |
|
|
1391 } |
|
|
1392 |
|
6549
|
1393 DEFUN_DLD (regexprep, args, , |
|
6361
|
1394 "-*- texinfo -*-\n\ |
|
6678
|
1395 @deftypefn {Loadable Function} {@var{string} =} regexprep (@var{string}, @var{pat}, @var{repstr}, @var{options})\n\ |
|
6361
|
1396 Replace matches of @var{pat} in @var{string} with @var{repstr}.\n\ |
|
|
1397 \n\ |
|
|
1398 \n\ |
|
7007
|
1399 The replacement can contain @code{$i}, which substitutes\n\ |
|
6361
|
1400 for the ith set of parentheses in the match string. E.g.,\n\ |
|
|
1401 @example\n\ |
|
|
1402 \n\ |
|
|
1403 regexprep(\"Bill Dunn\",'(\\w+) (\\w+)','$2, $1')\n\ |
|
|
1404 \n\ |
|
|
1405 @end example\n\ |
|
|
1406 returns \"Dunn, Bill\"\n\ |
|
|
1407 \n\ |
|
|
1408 @var{options} may be zero or more of\n\ |
|
|
1409 @table @samp\n\ |
|
|
1410 \n\ |
|
|
1411 @item once\n\ |
|
7001
|
1412 Replace only the first occurrence of @var{pat} in the result.\n\ |
|
6361
|
1413 \n\ |
|
|
1414 @item warnings\n\ |
|
|
1415 This option is present for compatibility but is ignored.\n\ |
|
|
1416 \n\ |
|
|
1417 @item ignorecase or matchcase\n\ |
|
|
1418 Ignore case for the pattern matching (see @code{regexpi}).\n\ |
|
|
1419 Alternatively, use (?i) or (?-i) in the pattern.\n\ |
|
|
1420 \n\ |
|
|
1421 @item lineanchors and stringanchors\n\ |
|
|
1422 Whether characters ^ and $ match the beginning and ending of lines.\n\ |
|
|
1423 Alternatively, use (?m) or (?-m) in the pattern.\n\ |
|
|
1424 \n\ |
|
|
1425 @item dotexceptnewline and dotall\n\ |
|
|
1426 Whether . matches newlines in the string.\n\ |
|
|
1427 Alternatively, use (?s) or (?-s) in the pattern.\n\ |
|
|
1428 \n\ |
|
|
1429 @item freespacing or literalspacing\n\ |
|
|
1430 Whether whitespace and # comments can be used to make the regular expression more readable.\n\ |
|
|
1431 Alternatively, use (?x) or (?-x) in the pattern.\n\ |
|
|
1432 \n\ |
|
|
1433 @end table\n\ |
|
|
1434 @seealso{regexp,regexpi}\n\ |
|
|
1435 @end deftypefn") |
|
|
1436 { |
|
|
1437 octave_value_list retval; |
|
|
1438 int nargin = args.length(); |
|
|
1439 |
|
|
1440 if (nargin < 3) |
|
|
1441 { |
|
|
1442 print_usage (); |
|
|
1443 return retval; |
|
|
1444 } |
|
|
1445 |
|
|
1446 if (args(0).is_cell() || args(1).is_cell() || args(2).is_cell()) |
|
|
1447 { |
|
|
1448 Cell str; |
|
|
1449 Cell pat; |
|
|
1450 Cell rep; |
|
6495
|
1451 dim_vector dv0; |
|
|
1452 dim_vector dv1(1,1); |
|
6361
|
1453 |
|
|
1454 if (args(0).is_cell()) |
|
|
1455 str = args(0).cell_value(); |
|
|
1456 else |
|
|
1457 str = Cell (args(0)); |
|
|
1458 |
|
|
1459 if (args(1).is_cell()) |
|
|
1460 pat = args(1).cell_value(); |
|
|
1461 else |
|
|
1462 pat = Cell (args(1)); |
|
|
1463 |
|
|
1464 if (args(2).is_cell()) |
|
|
1465 rep = args(2).cell_value(); |
|
|
1466 else |
|
|
1467 rep = Cell (args(2)); |
|
|
1468 |
|
6495
|
1469 dv0 = str.dims(); |
|
|
1470 if (pat.numel() != 1) |
|
6361
|
1471 { |
|
6495
|
1472 dv1 = pat.dims(); |
|
|
1473 if (rep.numel() != 1 && dv1 != rep.dims()) |
|
6361
|
1474 error ("regexprep: Inconsistent cell array dimensions"); |
|
|
1475 } |
|
|
1476 else if (rep.numel() != 1) |
|
6495
|
1477 dv1 = rep.dims(); |
|
6361
|
1478 |
|
|
1479 if (!error_state) |
|
|
1480 { |
|
6495
|
1481 Cell ret (dv0); |
|
6361
|
1482 octave_value_list new_args = args; |
|
|
1483 |
|
6495
|
1484 for (octave_idx_type i = 0; i < dv0.numel(); i++) |
|
|
1485 { |
|
|
1486 new_args(0) = str(i); |
|
|
1487 if (pat.numel() == 1) |
|
|
1488 new_args(1) = pat(0); |
|
|
1489 if (rep.numel() == 1) |
|
|
1490 new_args(2) = rep(0); |
|
|
1491 for (octave_idx_type j = 0; j < dv1.numel(); j++) |
|
|
1492 { |
|
|
1493 if (pat.numel() != 1) |
|
|
1494 new_args(1) = pat(j); |
|
|
1495 if (rep.numel() != 1) |
|
|
1496 new_args(2) = rep(j); |
|
|
1497 new_args(0) = octregexprep (new_args, "regexprep"); |
|
6361
|
1498 |
|
6495
|
1499 if (error_state) |
|
|
1500 break; |
|
|
1501 } |
|
6361
|
1502 |
|
|
1503 if (error_state) |
|
|
1504 break; |
|
6495
|
1505 |
|
|
1506 ret(i) = new_args(0); |
|
6361
|
1507 } |
|
|
1508 |
|
|
1509 if (!error_state) |
|
|
1510 retval = octave_value (ret); |
|
|
1511 } |
|
|
1512 } |
|
|
1513 else |
|
|
1514 retval = octregexprep (args, "regexprep"); |
|
|
1515 |
|
5785
|
1516 return retval; |
|
|
1517 } |
|
|
1518 |
|
|
1519 /* |
|
|
1520 %!test # Replace with empty |
|
|
1521 %! xml = '<!-- This is some XML --> <tag v="hello">some stuff<!-- sample tag--></tag>'; |
|
|
1522 %! t = regexprep(xml,'<[!?][^>]*>',''); |
|
|
1523 %! assert(t,' <tag v="hello">some stuff</tag>') |
|
|
1524 |
|
|
1525 %!test # Replace with non-empty |
|
|
1526 %! xml = '<!-- This is some XML --> <tag v="hello">some stuff<!-- sample tag--></tag>'; |
|
|
1527 %! t = regexprep(xml,'<[!?][^>]*>','?'); |
|
|
1528 %! assert(t,'? <tag v="hello">some stuff?</tag>') |
|
|
1529 |
|
|
1530 %!test # Check that 'tokenize' is ignored |
|
|
1531 %! xml = '<!-- This is some XML --> <tag v="hello">some stuff<!-- sample tag--></tag>'; |
|
|
1532 %! t = regexprep(xml,'<[!?][^>]*>','','tokenize'); |
|
|
1533 %! assert(t,' <tag v="hello">some stuff</tag>') |
|
|
1534 |
|
|
1535 %!test # Capture replacement |
|
|
1536 %! if (!isempty(findstr(octave_config_info ("DEFS"),"HAVE_PCRE"))) |
|
|
1537 %! data = "Bob Smith\nDavid Hollerith\nSam Jenkins"; |
|
|
1538 %! result = "Smith, Bob\nHollerith, David\nJenkins, Sam"; |
|
|
1539 %! t = regexprep(data,'(?m)^(\w+)\s+(\w+)$','$2, $1'); |
|
|
1540 %! assert(t,result) |
|
|
1541 %! end |
|
|
1542 |
|
|
1543 # Return the original if no match |
|
|
1544 %!assert(regexprep('hello','world','earth'),'hello') |
|
|
1545 |
|
|
1546 ## Test a general replacement |
|
|
1547 %!assert(regexprep("a[b]c{d}e-f=g", "[^A-Za-z0-9_]", "_"), "a_b_c_d_e_f_g"); |
|
|
1548 |
|
|
1549 ## Make sure it works at the beginning and end |
|
|
1550 %!assert(regexprep("a[b]c{d}e-f=g", "a", "_"), "_[b]c{d}e-f=g"); |
|
|
1551 %!assert(regexprep("a[b]c{d}e-f=g", "g", "_"), "a[b]c{d}e-f=_"); |
|
|
1552 |
|
|
1553 ## Options |
|
|
1554 %!assert(regexprep("a[b]c{d}e-f=g", "[^A-Za-z0-9_]", "_", "once"), "a_b]c{d}e-f=g"); |
|
|
1555 %!assert(regexprep("a[b]c{d}e-f=g", "[^A-Z0-9_]", "_", "ignorecase"), "a_b_c_d_e_f_g"); |
|
|
1556 |
|
|
1557 ## Option combinations |
|
|
1558 %!assert(regexprep("a[b]c{d}e-f=g", "[^A-Z0-9_]", "_", "once", "ignorecase"), "a_b]c{d}e-f=g"); |
|
|
1559 |
|
|
1560 ## End conditions on replacement |
|
|
1561 %!assert(regexprep("abc","(b)",".$1"),"a.bc"); |
|
|
1562 %!assert(regexprep("abc","(b)","$1"),"abc"); |
|
|
1563 %!assert(regexprep("abc","(b)","$1."),"ab.c"); |
|
|
1564 %!assert(regexprep("abc","(b)","$1.."),"ab..c"); |
|
|
1565 |
|
6361
|
1566 ## Test cell array arguments |
|
6503
|
1567 %!assert(regexprep("abc",{"b","a"},"?"),{"??c"}) |
|
6361
|
1568 %!assert(regexprep({"abc","cba"},"b","?"),{"a?c","c?a"}) |
|
6503
|
1569 %!assert(regexprep({"abc","cba"},{"b","a"},{"?","!"}),{"!?c","c?!"}) |
|
6361
|
1570 |
|
5785
|
1571 */ |
|
|
1572 |
|
5582
|
1573 /* |
|
|
1574 ;;; Local Variables: *** |
|
|
1575 ;;; mode: C++ *** |
|
|
1576 ;;; End: *** |
|
|
1577 */ |
