Game Development Reference
In-Depth Information
30 }
31 }
32 //-------------------------------------------------------
The following are the comments for code sample 6-19:
•
Line 05
: The
RegularExpressions
namespace must be included in all source
files using regular expression searches.
•
Lines 09 and 13
: The string
Search
defines the regular expression itself. The
string
txt
defines the larger string to be searched by the regular expression.
The string
Search
searches for all occurrences of the words,
day
and
way
.
•
Line 19
: The method
Regex.Match
is called to apply a regular expression
search on the string
txt
. The results are stored in the local variable
m
.
This variable can be iterated to scan for all results.
•
Line 25
: The results in
m
will include three matches (not two) based on the
string
txt
. These will include
day
as found in to
day
as well as
day
and
way
by themselves.
More information on regular expressions can be found online at
Infinite arguments
Though not technically a part of .NET or Mono, our exploration of both these libraries
has touched several times on functions that accept seemingly an endless chain of
arguments, such as the
String.Format
function. With
String.Format
, it's possible
to plug in as many object arguments as you need for inclusion into a formatted string.
In this section, I want to take a small (and very quick) diversion to show that you can
code your own functions that accept and process limitless arguments; they're simple to
create. Refer to the following code sample 6-20 for a function that can sum a potentially
limitless array of integers:
01 public int Sum(params int[] Numbers)
02 {
03 int Answer = 0;
04
05 for(int i=0; i<Numbers.Length; i++)
06 Answer += Numbers[i];
07
08 return Answer;
09 }
