MatchQ tests whether something matches a pattern.
{a, x, b} matches the pattern
{_, x, _}:
{a, b, c} doesn’t match, because it has b in the middle, rather than x:
Any list with two elements matches the pattern
{_, _}:
A list with three elements doesn
’t match the pattern
{_, _}:
MatchQ lets you test one thing at a time against a pattern.
Cases lets you pick out all the elements (
“cases
”) in a list that match a particular pattern.
Find all elements that match the pattern
{_, _}:
Find all elements that match
{b, _} (i.e. cases of
b followed by something):
This is what you get if you test whether each element matches
{b, _}:
Find all cases of either a or b, followed by something:
Let’s look at another example, based on creating a list, then picking out elements that match particular patterns.
Create a list by getting the digits of a range of numbers:
Find cases that end in 5:
Find cases with 1 or 2 in the middle:
The notation __ (
“double blank
”) in a pattern indicates any sequence of things.
Find cases consisting of any sequence, ending with b:
Find sequences ending with a or b, or beginning with c:
Patterns aren’t just about lists; they can involve anything.
Pick out cases that match the pattern
f[_]:
Replace b with
Red in a list:
You can give a list of replacements to use:
The “blank” pattern _ matches absolutely anything. This means, for example, that
{_,_} matches any list of two elements. But what if you want to insist that the two elements be the same? You can do that using a pattern like
{x_,x_}.
{_, _} matches any list of two elements, whether the elements are the same or not:
{x_, x_} matches only lists of two identical elements:
x_ is an example of a
named pattern. Named patterns are especially important in replacements, because they give one way to make use of parts of what one
’s replacing.
Use the named pattern
x_ in a replacement:
The form ab is usually called a
rule. If
x_ appears on the left-hand side of a rule, then whatever the
x_ matches can be referred to on the right-hand side as
x.
Use
x in the right-hand side of the rule to refer to what
x_ matches:
You can use rules inside
Cases as well.
Pick out elements in the list that match
f[x_], and give the result of replacing them by
x+10:
Later on, we
’ll see how named patterns are crucial to defining your own functions in the Wolfram Language.
_ | | pattern standing for anything (“blank”) |
__ | | pattern standing for any sequence (“double blank”) |
x_ | | pattern named x |
a|b | | pattern matching a or b |
MatchQ[expr,pattern] | | test whether expr matches a pattern |
Cases[list,pattern] | | find cases of a pattern in a list |
lhsrhs | | rule for transforming lhs into rhs |
expr/.lhsrhs | | replace lhs by rhs in expr |
32.1Find lists of length 3 or more beginning with 1 and ending with 9 in
IntegerDigits[Range[1000]].
»
32.3In the digit lists for the first 1000 squares, find those that begin with 9 and end with 0 or 1.
»
32.5Make a list of the digits of 2^1000, replacing all zeros by
Red.
»
32.6Remove the vowels a, e, i, o and u from the list of characters in
“The Wolfram Language
”.
»
No. They just have to be consistent inside a given pattern. Different patterns can reuse the same name for different purposes, and the name can also appear outside the pattern.
What else can be used to define patterns?
What
’s the difference between
| and
||?
p|q is a pattern construct, that matches either
p or
q.
p||q is a logic construct, that tests whether
p or
q is
True.
If
/. has several replacements, which one will it use?
It uses the first one that applies. If replacements apply to multiple levels of an expression,
/. will use it on the outermost level.