Scala – Pattern Matching & Case Classes

Pattern matching is also applied to case classes. Rather patter matching is always discussed along with case classes. Let’s see how we can apply pattern matching to case classes. Let’s look at an example. See Below In the above example, there is a Person case class defined and a match-case pattern matching function is defined which checks the lastName element of the Person class. If the lastName is Doe it prints that it has “Found a Doe!” and if it lastName is Cole it prints it has “Found a Cole!!”, otherwise, it prints “Unknown Last Name”. Let’s start to mix up – In one of the first blog entry of Pattern matching we had discussed Or clause in values. We can use it in case classes as well. See Below The result is whenever the lastName is Cole or Doe it will print “Found a Doe or Cole!”. Now let’s apply … Read more

Scala – Pattern Matching & Collections

Pattern matching is not just limited to simple types it can also be applied to collections as well. Let’s see how it can be applied to Lists. See Below In the above example, we want to check if the list of 3 elements starts with 10 or not. This logic works fine when the list has just 3 elements. But fails if the list has more than 3 elements. The last print shows the failure condition.  Extending the logic so that lists of any size can be checked. See Below. In the above code, the only change we made was in the second line of the function and introduced _* – is a special instance of type ascription which tells the compiler to treat a single argument of a sequence type as a variable argument sequence. It is not as complicated as it sounds essentially it means you can pass multiple … Read more

Scala – Pattern Matching – Values, Types & Variables

Pattern matching in Scala is one of the most widely used and discussed topics. In simple terms, it is similar to the switch-case. Let’s use that familiarity to get a simple understanding of pattern matching and build up from there. Let’s first look at a simple match-case expression and see how it works. In the above example, we have a function called multiply, which takes a parameter and returns a value. If the value is 4 it will multiply the value by 3. Underscore _ acts as a catch-all for any other values and it will multiply by 2. This is simple. But what if we want to apply the same logic for more than one patterns. Writing individual case statements would make the code unnecessarily long. Let’s apply an OR logic to the expression. In the above example, we have a function called multiply, which takes a parameter and returns … Read more

Scala – Case Classes

Computing is all about logic and data. Various languages provide different ways to handle data. Primitive data types like Int, String and Boolean are usually never enough to represent anything meaningful by themselves. For example – If we were to capture the details of a Person – it will consist of many attributes. First Name, Last Name, Age, email Id etc. The real-world data is more complex and is made up of different primitive data types. Scala provides a clean way of putting and aggregating all this data together into immutable structures called case classes. Case classes are defined as normal classes except the definition is pre-fixed by a modifier case. Case classes provide a lot of boilerplate code, which reduces the amount of code which needs to be written to handle complex aggregated data. Cases classes are also very useful in pattern matching and if you are working with … Read more

Scala Currying & Partially Applied Functions

Currying is a concept rooted in mathematics and has also found it is way in computer science. Currying is a process of translating a function taking multiple arguments to a set of functions accepting only one argument. It is named after Haskell Curry! Currying in computer science is also done in a similar manner. You can read more on the background here. h(x)(y)(z) = f(x,y,z) h = curry(f) Let’s see how we can apply currying in Scala. Well, it’s not difficult to curry a function. See Below If you just pass addCurried(10) you would get an error. Which is not good and to be fair the function did require all the parameters to evaluate. Getting around this is simple with partially applied functions, these should not be confused with partial functions. See Below Another example of a partially applied function How about currying an existing function. That is also possible via Function.curried. It … Read more

Scala Partial Functions

As I was learning Scala and first read the phrase Partial Function had a weird thing about it. How can a function be partial??  I started digging into the documentation and online. What came out was a surprisingly very clean solution to a problem which every programmer encountered. Every function or method which is written usually applies some validation rule to make sure that the parameters which are passed to it are valid. It makes the code a bit messy. We had the logic validating the parameters and then the actual business logic which is invoked if the parameters were correct. That means that the function only works on a subset of parameters. Partial functions provide a much better solution. So now let’s look at the definition of a partial function. Quoting from Scala Doc A partial function of type PartialFunction[A, B] is a unary function where the domain does not … Read more

Scala Functions – Higher Order Functions & Function Literals

Higher Order Functions are supported by many languages including Haskell, Scala, F#, Go, Javascript. Higher Order Function is a fancy name for a function which accepts functions as parameters.!! How is that? Well – that is because functions in Scala are treated as first class values – that means in Scala they can be assigned as values, passed as parameters and returned from functions. Functions are said to be higher order functions if they do atleast one of the following Accept functions as parameters Returns functions as a result The map function is one of the most popular higher order function.  Most Scala programmers have come across this function in their lives. Before we get any deeper into functions – let’s look at another type of functions called function literals. They are more famously known as anonymous functions. Function literals are functions which do not have any name and are created, passed and returned … Read more

Scala Functions – Introduction

Introduction Functions in any language can be defined as a group of statements that constitute a logic which is performed repeatedly during the execution of a program. Functions in scala are no different.Scala identifies both functions and methods. They are both treated a bit differently. Finally, scala does support functional programming(FP) paradigms and this blog entry tries to take you through some of the FP paradigms and get you a good brief. They follow the following format def functionName ([list of parameters]) : [return type] = {  function body  return expression} An example of  a function in Scala. See Below In addition to that, scala also simplifies creation of code. In functions,  it removes the need to write boilerplate code. Every programmer likes less code. Speaking of less code some of the stuff scala does away with  is No need of semi-colons Simple functions do not need curly braces. return … Read more

Scala Collection – Operators

To be honest there are no operators in Scala :). Every method in scala is an operator! But for some simplicity let’s just call them collection operators. Below are some of the operators which are common to all scala collections. The examples are mostly done using Arrays but can be applied to collections as well. length operator distinct – More importantly it returns an array of elements. range, fill head, tail, last head operator returns the first element of the array. tail returns all the elements but the first element.last returns the last element of an array Let’s look at some more interesting ones filter is a transformer and returns a new collection. It requires a predicate function which is applied to every element in the collection and if it evaluates to true then that element is returned. filterNot is exactly the opposite and would return if the condition evaluates to false. In … Read more

Scala Collections – Streams, Maps & Sets

Streams Stream is similar to a List however, it can have unlimited elements. It is a Traversable but lazy in nature. A Stream in Scala consists of a head and tail which is lazily computed i.e elements are only evaluated when they are needed. Hence it can be inferred, laziness helps to make streams infinite. Transformer functions like map, filter etc are also applied lazily although care should be taken that not all functions are lazy – i.e max, sum etc. Elements can be added to a stream as below. Keep in mind that when you are adding an element to the stream we also need to append Stream.empty Additionally also checkout the #::: that is only required after the stream name and then it is #:: Transformer methods are lazily evaluated as show below – e.g filter Transformer methods are lazily evaluated as show below – e.g map Sets Set … Read more