UnicodeRegexMatch (Unicode function) - Revision history

Alex at 22:05, 21 January 2022

2022-01-21T22:05:22Z

@@ Line 19: / Line 19: @@
 <tr><th><var>Options</var></th>
 <td>This is an optional, but [[Notation conventions for methods#Named parameters|name required]], parameter supplying a string of single-letter options, which may be specified in uppercase or lowercase, in any combination, and blank-separated or not as you prefer. For more information about these options, see [[Regex_processing#Common_regex_options|Common regex options]].
-<table class="syntaxNested">
+</td></tr>
 <tr><th><var>CaptureList</var></th>
@@ Line 99: / Line 87: @@
 ==See also==
 {{Template:Unicode:UnicodeRegexMatch footer}}

JAL: /* Finding the first position of one of several characters */ typos

2016-05-12T18:00:36Z

Finding the first position of one of several characters: typos

← Older revision		Revision as of 18:00, 12 May 2016
Line 53:		Line 53:
	%regexU = '[aeiou]'; * Scan for any lowercase vowel		%regexU = '[aeiou]'; * Scan for any lowercase vowel
	%strU = 'At the centre of it all, your eyes'		%strU = 'At the centre of it all, your eyes'
	%iU = %~~str~~:unicodeRegexMatch(%regexU)		%iU = %strU:unicodeRegexMatch(%regexU)
	if %iU then		if %iU then
	printText Before vowel: {%strU:unicodeLeft(%i - 2)}		printText Before vowel: {%strU:unicodeLeft(%iU - 2)}
	printText The vowel: {%strU:unicodeChar(%i-1)}		printText The vowel: {%strU:unicodeChar(%iU-1)}
	printText After vowel: {%strU:unicodeSubstring(%i)}		printText After vowel: {%strU:unicodeSubstring(%iU)}
	...		...
	</p>		</p>

JAL: /* Finding the first position of one of several characters */ typos

2016-05-12T17:59:39Z

Finding the first position of one of several characters: typos

← Older revision		Revision as of 17:59, 12 May 2016
Line 53:		Line 53:
	%regexU = '[aeiou]'; * Scan for any lowercase vowel		%regexU = '[aeiou]'; * Scan for any lowercase vowel
	%strU = 'At the centre of it all, your eyes'		%strU = 'At the centre of it all, your eyes'
	%iU = %str:unicodeRegexMatch(%~~regex~~)		%iU = %str:unicodeRegexMatch(%regexU)
	if %iU then		if %iU then
	printText Before vowel: {%strU:unicodeLeft(%i - 2)}		printText Before vowel: {%strU:unicodeLeft(%i - 2)}

JAL: /* Finding the first position of one of several characters */ minor formatting

2016-05-12T17:58:12Z

Finding the first position of one of several characters: minor formatting

← Older revision		Revision as of 17:58, 12 May 2016
Line 50:		Line 50:
	====Finding the first position of one of several characters====		====Finding the first position of one of several characters====
	A common programming problem is to "scan" a string and find the first position that is one of several characters. This can be readily accomplished with <var>UnicodeRegexMatch</var>. Here is an example:		A common programming problem is to "scan" a string and find the first position that is one of several characters. This can be readily accomplished with <var>UnicodeRegexMatch</var>. Here is an example:
	<p class="code">%regexU = '[aeiou]'; * Scan for any lowercase vowel		<p class="code"> ...
			%regexU = '[aeiou]'; * Scan for any lowercase vowel
	%strU = 'At the centre of it all, your eyes'		%strU = 'At the centre of it all, your eyes'
	%iU = %str:unicodeRegexMatch(%regex)		%iU = %str:unicodeRegexMatch(%regex)
Line 57:		Line 58:
	printText The vowel: {%strU:unicodeChar(%i-1)}		printText The vowel: {%strU:unicodeChar(%i-1)}
	printText After vowel: {%strU:unicodeSubstring(%i)}		printText After vowel: {%strU:unicodeSubstring(%i)}
			...
	</p>		</p>
	The result of the above fragment is:		The result of the above fragment is:

JAL: /* Finding the first position of one of several characters */ add "lowercase"

2016-05-12T17:02:21Z

Finding the first position of one of several characters: add "lowercase"

← Older revision		Revision as of 17:02, 12 May 2016
Line 50:		Line 50:
	====Finding the first position of one of several characters====		====Finding the first position of one of several characters====
	A common programming problem is to "scan" a string and find the first position that is one of several characters. This can be readily accomplished with <var>UnicodeRegexMatch</var>. Here is an example:		A common programming problem is to "scan" a string and find the first position that is one of several characters. This can be readily accomplished with <var>UnicodeRegexMatch</var>. Here is an example:
	<p class="code">%regexU = '[aeiou]'; * Scan for any vowel		<p class="code">%regexU = '[aeiou]'; * Scan for any lowercase vowel
	%strU = 'At the centre of it all, your eyes'		%strU = 'At the centre of it all, your eyes'
	%iU = %str:unicodeRegexMatch(%regex)		%iU = %str:unicodeRegexMatch(%regex)

JAL: /* Finding the first position of one of several characters */ typos

2016-05-12T16:59:56Z

Finding the first position of one of several characters: typos

← Older revision		Revision as of 16:59, 12 May 2016
Line 50:		Line 50:
	====Finding the first position of one of several characters====		====Finding the first position of one of several characters====
	A common programming problem is to "scan" a string and find the first position that is one of several characters. This can be readily accomplished with <var>UnicodeRegexMatch</var>. Here is an example:		A common programming problem is to "scan" a string and find the first position that is one of several characters. This can be readily accomplished with <var>UnicodeRegexMatch</var>. Here is an example:
	<p class="code">%~~regex~~ = '[aeiou]'; * Scan for any vowel		<p class="code">%regexU = '[aeiou]'; * Scan for any vowel
	%~~str~~ = '~~That quick brown fox~~'		%strU = 'At the centre of it all, your eyes'
	%i = %str:unicodeRegexMatch(%regex)		%iU = %str:unicodeRegexMatch(%regex)
	if %i then		if %iU then
	printText Before vowel: {%~~str~~:unicodeLeft(%i - 2)}		printText Before vowel: {%strU:unicodeLeft(%i - 2)}
	printText The vowel: {%~~str~~:unicodeChar(%i-1)}		printText The vowel: {%strU:unicodeChar(%i-1)}
	printText After vowel: {%~~str~~:unicodeSubstring(%i)}		printText After vowel: {%strU:unicodeSubstring(%i)}
	</p>		</p>
	The result of the above fragment is:		The result of the above fragment is:
	<p class="output">Before vowel: Th		<p class="output">Before vowel: At th
	The vowel: a		The vowel: e
	After vowel: ~~t quick brown fox~~		After vowel: centre of it all, your eyes
	</p>		</p>
	Notes:		Notes:
Line 67:		Line 67:
	<li>The position returned by <var>UnicodeRegexMatch</var> is the position of the character after the first successful match. </li>		<li>The position returned by <var>UnicodeRegexMatch</var> is the position of the character after the first successful match. </li>
	</ul>		</ul>

	====Finding the first position that is not one of several characters====		====Finding the first position that is not one of several characters====
	A programming task similar to that in the preceding example is finding the position of the first character that is not one of a set of characters. This task is readily accomplished with <var>UnicodeRegexMatch</var>. Here is an example:		A programming task similar to that in the preceding example is finding the position of the first character that is not one of a set of characters. This task is readily accomplished with <var>UnicodeRegexMatch</var>. Here is an example:

JAL: link repair

2016-05-11T22:36:37Z

link repair

← Older revision		Revision as of 22:36, 11 May 2016
Line 39:		Line 39:
	==Usage notes==		==Usage notes==
	<ul>		<ul>
	<li>It is strongly recommended that you protect your environment from regular expression processing demands on PDL and STBL space by setting, say, <code>UTABLE LPDLST 3000</code> and <code>UTABLE LSTBL 9000</code>. See [[Regex processing#~~User Language~~ programming considerations\|~~User Language~~ programming considerations]].</li>		<li>It is strongly recommended that you protect your environment from regular expression processing demands on PDL and STBL space by setting, say, <code>UTABLE LPDLST 3000</code> and <code>UTABLE LSTBL 9000</code>. See [[Regex processing#SOUL programming considerations\|SOUL programming considerations]].</li>

	<li>For information about additional methods that support regular expressions, see [[Regex processing]].</li>		<li>For information about additional methods that support regular expressions, see [[Regex processing]].</li>

JAL: remove errant item

2016-05-11T18:59:23Z

remove errant item

← Older revision		Revision as of 18:59, 11 May 2016
Line 91:		Line 91:
	one benefit of <var>UnicodeRegexMatch</var>: since the input is Unicode,		one benefit of <var>UnicodeRegexMatch</var>: since the input is Unicode,
	the circumflex character can simply be specified directly without concern whether the program was entered with [[Unicode#Code points.2C character set mappings\|codepage 1047 or 0037]]. </p></li>		the circumflex character can simply be specified directly without concern whether the program was entered with [[Unicode#Code points.2C character set mappings\|codepage 1047 or 0037]]. </p></li>

	~~<li>The right-hand side of that statement (<code>'[' '5F':HexToString 'aeiou]'</code>) uses the [[Implicit concatenation\|implicit concatenation]] feature. </li>~~

	<li>This use of <var>UnicodeRegexMatch</var> is like the standard <var class="product">SOUL</var> <var>[[$Verify]]</var> function, although it indicates not just whether all characters in the given string are in the regex, but also the position (plus one) of the first character that is not in the regex. </li>		<li>This use of <var>UnicodeRegexMatch</var> is like the standard <var class="product">SOUL</var> <var>[[$Verify]]</var> function, although it indicates not just whether all characters in the given string are in the regex, but also the position (plus one) of the first character that is not in the regex. </li>

JAL: finish unfinished sentence

2016-05-11T18:57:21Z

finish unfinished sentence

← Older revision		Revision as of 18:57, 11 May 2016
Line 2:		Line 2:

	The <var>UnicodeRegexMatch</var> [[Intrinsic classes\|intrinsic]] function determines whether a given pattern (regular expression, or "regex") matches within a given string according to the [[Regex_processing#Regex_rules\|rules]] of regular expression matching.		The <var>UnicodeRegexMatch</var> [[Intrinsic classes\|intrinsic]] function determines whether a given pattern (regular expression, or "regex") matches within a given string according to the [[Regex_processing#Regex_rules\|rules]] of regular expression matching.

	~~This page is [[under construction]].~~

	==Syntax==		==Syntax==
Line 38:		Line 36:
	<td>This argument is available for Rocket development testing purposes only. It is not an ordinary user parameter.</td></tr>		<td>This argument is available for Rocket development testing purposes only. It is not an ordinary user parameter.</td></tr>
	</table>		</table>

	~~===Exceptions===~~
	~~<var>UnicodeRegexMatch</var> can throw the following exceptions:~~
	~~<dl>~~
	~~<dt><var>[[InvalidRegex_class\|InvalidRegex]]</var>~~
	<dd>Thrown if the <var class="term">regex</var> parameter does not contain a valid regular expression. The exception object indicates the position of the character in the <var class="term">regex</var> parameter where it was determined that the regular expression is invalid, and a description of the nature of the error.
	~~</dl>~~

	==Usage notes==		==Usage notes==
Line 96:		Line 87:
	<li>The regex is specified with the following statement:		<li>The regex is specified with the following statement:
	<p class="code">%regex = '[^aeiou]'</p>		<p class="code">%regex = '[^aeiou]'</p>
			<p>
	Comparing this to the [[RegexMatch (String function)#circumflex\|example using circumflex]] for <var>RegexMatch</var> illustrates		Comparing this to the [[RegexMatch (String function)#circumflex\|example using circumflex]] for <var>RegexMatch</var> illustrates
	one benefit of <var>UnicodeRegexMatch</var>: since the input is Unicode,		one benefit of <var>UnicodeRegexMatch</var>: since the input is Unicode,
			the circumflex character can simply be specified directly without concern whether the program was entered with [[Unicode#Code points.2C character set mappings\|codepage 1047 or 0037]]. </p></li>

	<li>The right-hand side of that statement (<code>'[' '5F':HexToString 'aeiou]'</code>) uses the [[Implicit concatenation\|implicit concatenation]] feature ~~introduced in version 7~~.~~9 of the <var class="product">Sirius Mods~~</~~var~~>.		<li>The right-hand side of that statement (<code>'[' '5F':HexToString 'aeiou]'</code>) uses the [[Implicit concatenation\|implicit concatenation]] feature. </li>

	<li>This use of <var>UnicodeRegexMatch</var> is like the standard <var class="product">SOUL</var> <var>[[$Verify]]</var> function, although it indicates not just whether all characters in the given string are in the regex, but also the position (plus one) of the first character that is not in the regex.		<li>This use of <var>UnicodeRegexMatch</var> is like the standard <var class="product">SOUL</var> <var>[[$Verify]]</var> function, although it indicates not just whether all characters in the given string are in the regex, but also the position (plus one) of the first character that is not in the regex. </li>
	</ul>		</ul>

	==See also==		==See also==
	{{Template:Unicode:UnicodeRegexMatch footer}}		{{Template:Unicode:UnicodeRegexMatch footer}}

JAL: /* Usage notes */ typo

2016-05-10T23:41:36Z

Usage notes: typo

← Older revision		Revision as of 23:41, 10 May 2016
Line 48:		Line 48:
	==Usage notes==		==Usage notes==
	<ul>		<ul>
	<li>It is strongly recommended that you protect your environment from regular expression processing demands on PDL and STBL space by setting, say, <code>UTABLE LPDLST 3000</code> and <code>UTABLE LSTBL 9000</code>. See [[~~Regex_processing~~#~~User_Language_programming_considerations~~\|User Language programming considerations]].</li>		<li>It is strongly recommended that you protect your environment from regular expression processing demands on PDL and STBL space by setting, say, <code>UTABLE LPDLST 3000</code> and <code>UTABLE LSTBL 9000</code>. See [[Regex processing#User Language programming considerations\|User Language programming considerations]].</li>

	<li>For information about additional methods that support regular expressions, see [[~~Regex_processing~~]].</li>		<li>For information about additional methods that support regular expressions, see [[Regex processing]].</li>

	<li><var>UnicodeRegexMatch</var> may be something of a misnomer. It does not determine if a string matches a regular expression, it determines if a string <b><i>contains</i></b> a substring that matches a regular expression. <var>UnicodeRegexMatch</var> behaves more like a matching method if the regular expression is "anchored" (begins with a caret (<tt>^</tt>) and ends with a dollar sign (<tt>$</tt>)), or if the <var>C</var> option indicates XML Schema mode.</li>		<li><var>UnicodeRegexMatch</var> may be something of a misnomer. It does not determine if a string matches a regular expression, it determines if a string <b><i>contains</i></b> a substring that matches a regular expression. <var>UnicodeRegexMatch</var> behaves more like a matching method if the regular expression is "anchored" (begins with a caret (<tt>^</tt>) and ends with a dollar sign (<tt>$</tt>)), or if the <var>C</var> option indicates XML Schema mode.</li>
	</ul>		</ul>

	==Examples==		==Examples==