F# Grouping Pattern

As the pattern matches contain more and more rules, you might want to combine patterns. There are two ways to combine patterns. First is to use OR represented by a
vertical pipe | , which combines patterns together so the rule will fire if any of the grouped patterns match. Second is to use AND represented by an ampersand &, which combines patterns together so that the rule will fire only if all of the grouped patterns match.

let vowelTest c = match c with |'a'|'e'|'i'|'o'|'u' -> true -> false |_ let describeNumbers x y = match x,y with | 1, _ | _, 1 -> "One of the numbers is one." | (2,_) & (_,2) -> "Both of the numbers is two." -> "Other."

AND pattern has litte use in normal pattern matching, however itz invaluable when using active patterns.

F# Pattern Matching

Pattern matching is logically similar to a switch statement in C#, Java, C++, etc; but itz much more powerful. A pattern match is a series of rules that will execute if the pattern matches the input. The pattern match expression then returns the result of the rule that was matched. So, all rules in a pattern match must return the same type.

In F#, you use match and with keywords with a series of pattern rules, followed by an arrow -> for pattern matching. Herez a sample F# pattern match code for Odd validation.

> let isOdd x = (x % 2 = 1) let describeNumber x = match isOdd x with | true -> printfn “number is odd” | false -> printfn “ number is even”;; > describeNumber 4;; number is even val it : unit = ()

Truth Table
Letz take AND truth table example using type inference on pattern matches. Herez the code:

> let testAND x y = match x, y with | true, true -> true | true, false -> false | false, true -> false | false, false -> true > testAND true false;; val it: bool = true

Match Failure
If no match is found during a pattern matching, an exception of type Microsoft.Fsharp.Core.MatchFailureException is raised. You can avoid this by making sure that all possible cases are coverd. Fortunately, F# compiler will issue a warning when it can determine that pattern match rules are incomplete.

> let testAND x y = match x, y with | true, true -> true // Commented | true, false -> false | false, true -> false | false, false -> true > testAND true false;; Microsoft.Fsharp.Core.MatchFailureExcption: The match cases were incomplete at:.... Stopped due to error

Pattern matching rules are checked in the order they are declared.

F# Symbolic Operator

Letz think of writing add 1 2 in the declarative way in stead of traditional way 1+2 everytime. Itz called as a symbolic operator. F# has not only built-in symbolic operators but also custom defined own symbolic operators. It helps the developers to write code in a cleaner and elegant way. In fact symbolic functions are not as form of operator overloading; rather functions whose names

are made out of symbols.

A symbolic operator can be made up of any sequence!@#$%^&*+-/<=>~| symbols. Herez the code defines a new function ! that computes the factorial of a given number

> let rec(!) x = if x <= 1 then 1 else x * !(x-1);; > !5;; val it : int = 120

To have symbolic operators that come before their parameters are known as prefix notation. You must prefix the function with a tilde ~, exclamation point ! or question mark ? operator. In the below code, the function ~++ is prefixed with a tilde and thus to call it, you write ~++ 1 2 3 rather than 1 ~++ 2 3. This enables you to use symbolic operators that more naturally fit the style of function being defined as:

> let (~++) x y z = x + y + z;; val (~++) : int-> int-> int-> int > ~++ 1 2 3;; val it : int = 6

In addition to allowing you to name functions that map more closely to mathematics, symbolic operators can also be passed around to higher order functions if you simply put parentheses around the symbol.

F# List

Last week Tuples group values into a single entity. List allows you link data together to form a chain. F# define a list as ; delimited values enclosed in brackets as:

let countDown = [9;8;7;6;5;4;3;2;1];;

F# has only two operations. They are (i) cons :: operator, to add an element in front of list (ii) append @ operator, to add at the last. Examples are:

>let countDown = 10::countDown;; val countDown : int list = [10;9;8;7;6;5;4;3;2;1] >let countDown = 0@countDown;; val countDown : int list = [10;9;8;7;6;5;4;3;2;1;0]

List Range

To declare a list of ordered numeric values, List range specifies the lower and upper range as:

>let counter = [1..10];; val counter : int list = [1;2;3;4;5;6;7;8;9;10]

List comprehension

Itz a rich syntax that allows you to generate list inline with F# code. The body of the list comprehension will execute until it terminates, and the list will be made up of elements returned via yield keyword.

let numbersNear x = [ yield x-1 yield x yield x+1 ];;

List.map

List.map function creates a new collection by applying a function to the given collection. Just have a look on attached image example

When you print r1 the example, you should get the output as 2,3,4,5

List.Iter

It iterates thro each element of the list and calls a funtion that you pass as a parameter.