REFindNoCase()

Uses a regular expression (RE) to search a string for a pattern, starting from a specified position.

The search is case-insensitive.

REFindNoCase( reg_expression=string, string=string, start=number, returnSubExpressions=boolean, scope=string, multiline=boolean );

Returns: any

Argument Description Default
reg_expression
string, required

Regular expression for which to search. Case-insensitive.
string
string, required

String in which to search.
start
number, optional

A positive integer. Position in the string at which to start search. The default value is 1.

1
returnSubExpressions
boolean, optional
  • True: if the regular expression is found, the first array element contains the length and position, respectively, of the first match. If the regular expression contains parentheses that group subexpressions, each subsequent array element contains the length and position, respectively, of the first occurrence of each group. If the regular expression is not found, the arrays each contain one element with the value 0.
  • False: (Default) the function returns the position in the string where the match begins. Default.
scope
string, optional

One: (Default)Returns the first value that matches the regex

All: Returns all values that match the regex
multiline
boolean, optional

If true indicate the regular expression should treat input as having multiple lines. This option affects the interpretation of the ^ and $ metacharacters. When true the ^ metacharacter matches at the beginning of every line, and the $ metacharacter matches at the end of every line. Additionally the . metacharacter will not match newlines when true.

Introduced: 5.3.8.23

false

Examples

writeDump(REFindNoCase("a+c+", "abcaaCCdd"));
	writeDump(REFindNoCase("a+c*", "AbcaAcCdd"));
	writeDump(REFindNoCase("[\?&]rep = ", "report.cfm?rep = 1234&u = 5"));
	writeDump(REFindNoCase("a+", "baaaA"));
	writeDump(REFindNoCase(".*", ""));

<span class="nv">teststring1</span> <span class="o">=</span> <span class="s2">&quot;The cat in the hat hat came back!&quot;</span><span class="p">;</span>
<span class="nv">st1</span> <span class="o">=</span> <span class="nf">REFind</span><span class="p">(</span><span class="s2">&quot;([&#39;[:alpha:]&#39;]+)[ ]+(\1)&quot;</span><span class="p">,</span><span class="nv">teststring1</span><span class="p">,</span><span class="m">1</span><span class="p">,</span><span class="s2">&quot;TRUE&quot;</span><span class="p">);</span>
<span class="nf">writeDump</span><span class="p">(</span><span class="nv">st1</span><span class="p">[</span><span class="s1">&#39;len&#39;</span><span class="p">][</span><span class="m">3</span><span class="p">]);</span>
<span class="nv">teststring2</span> <span class="o">=</span> <span class="s2">&quot;AAAXAAAA&quot;</span><span class="p">;</span>
<span class="nv">st2</span> <span class="o">=</span> <span class="nf">REFind</span><span class="p">(</span><span class="s2">&quot;x&quot;</span><span class="p">,</span><span class="nv">teststring2</span><span class="p">,</span><span class="m">1</span><span class="p">,</span><span class="s2">&quot;TRUE&quot;</span><span class="p">);</span>
<span class="nf">writeDump</span><span class="p">(</span><span class="nf">arrayLen</span><span class="p">(</span><span class="nv">st2</span><span class="p">[</span><span class="s1">&#39;pos&#39;</span><span class="p">]));</span>

See also