Pattern Matching - Primitive Patterns

Primitive Patterns

The simplest pattern in pattern matching is an explicit value or a variable. For an example, consider a simple function definition in Haskell syntax (function parameters are not in parentheses but are separated by spaces, = is not assignment but definition):

f 0 = 1

Here, 0 is a single value pattern. Now, whenever f is given 0 as argument the pattern matches and the function returns 1. With any other argument, the matching and thus the function fail. As the syntax supports alternative patterns in function definitions, we can continue the definition extending it to take more generic arguments:

f n = n * f (n-1)

Here, the first n is a single variable pattern, which will match absolutely any argument and bind it to name n to be used in the rest of the definition. In Haskell (unlike at least Hope), patterns are tried in order so the first definition still applies in the very specific case of the input being 0, while for any other argument the function returns n * f (n-1) with n being the argument.

The wildcard pattern (often written as _) is also simple: like a variable name, it matches any value, but does not bind the value to any name.

Read more about this topic:  Pattern Matching

Famous quotes containing the words primitive and/or patterns:

    “The sight of a Black nun strikes their sentimentality; and, as I am unalterably rooted in native ground, they consider me a work of primitive art, housed in a magical color; the incarnation of civilized, anti-heathenism, and the fruit of a triumphing idea.”
    —Alice Walker (b. 1944)

    “I’ve begun to appreciate the generational patterns that ripple out from our lives like stones dropped in water, pulsing outward even after we are gone. Although we have but one childhood, we relive it first through our children’s and then our grandchildren’s eyes.”
    —Anne Cassidy (20th century)