In the Part-1 we learned the following topics on Scala<\/p>\n
- \n
- Scala Features<\/li>\n
- Variables and Methods<\/li>\n
- Condition and Loops<\/li>\n
- Variables and Type Inference<\/li>\n
- Classes and Objects<\/li>\n<\/ul>\n
Keeping up the same pace, we will learn the following topics in the 2nd part of the Scala series.<\/p>\n
- \n
- Functions Representation<\/li>\n
- Collections<\/li>\n
- Sequence and Sets<\/li>\n
- Tuples and Maps<\/li>\n
- Higher Order Functions<\/li>\n
- Build Tool – SBT<\/li>\n<\/ul>\n
Functions Representation<\/h2>\n
We have already discussed functions. We can write a function in different styles in Scala. The first style is the usual way of defining a function.<\/span><\/p>\n
scala> def add(x : int, y : int) : Int = {\r\n return x + y\r\n }<\/pre>\nPlease note that the return type is specified as Int.<\/span><\/p>\n
In the second style, please note that the return type is omitted, also there is no “return” keyword. The Scala compiler will infer the return type of the function in this case.<\/span><\/p>\n
scala> def add(x : int, y : int) = { \/\/return type is inferred\r\n x + y \/\/\"return\" keyword is optional\r\n }<\/pre>\nIf the function body has just one statement, then the curly braces are optional. In the third style, please note that there are no curly braces.<\/span><\/p>\n
def add(x : Int, y : Int) = x + y<\/pre>\n
<\/p>\n
Collections Overview<\/h2>\n
Scala collections provide different ways to store data.<\/span><\/p>\n
The Scala collections hierarchy represents a structure of collections that can contain data in different ways.<\/span><\/p>\n
![\"\"](\"http:\/\/blog.cloudxlab.com\/wp-content\/uploads\/2018\/01\/collections.png\")
<\/p>\nAt the top is the “traversable”, something that can be traversed. Next in the hierarchy is the iterable. It contains data that can be iterated or looped over. Beyond iterable, we have a Sequence, a set, and a map. The sequence consists of linear Sequence and indexed Sequence.<\/span><\/p>\n
In Linear Sequence, we iterate over one by one to find the elements that we want. A linked list is an example of linear Sequence. An indexed Sequence gives the ability to directly access the value inside of a sequence.<\/span><\/p>\n
Collections – Sequence and Sets<\/h2>\n
A sequence is an ordered collection of data. Elements in the sequence may or may not be indexed. Examples of sequence are array, list, and vector<\/span><\/p>\n
Sequence – Array<\/h3>\n
Below are the properties of array<\/p>\n
- \n
- An array contains elements of the same type. <\/span><\/li>\n
- Arrays are fixed in size and contain an ordered sequence of data. <\/span><\/li>\n
- Array values are contiguous in memory, which means that the values are stored in consecutive memory addresses. <\/span><\/li>\n
- Array elements are indexed by position.<\/span><\/li>\n<\/ul>\n
scala> var languages = Array(\"Ruby\", \"SQL\", \"Python\")<\/pre>\n
In the above code, variable language is an array which contains 3 elements of string type “Ruby”, “SQL” and “Python”. <\/span><\/p>\n
We can access the array elements by their indexes. <\/span><\/p>\n
scala> var languages = Array(\"Ruby\", \"SQL\", \"Python\")\r\n\r\nScala> languages(0)\r\nres0: String = Ruby<\/pre>\n
Please note that arrays have a zero-based index. Which means to access the first element, languages(0) must be used. <\/span><\/p>\n
Also, arrays in Scala are mutable. We can change the values at specific indexes.\u00a0<\/span><\/p>\n
To iterate over array elements we can use the ‘for’ loop. Let’s iterate over languages array. <\/span><\/p>\n
scala> for(x <- languages) {\r\n println(x);\r\n }\r\nRuby\r\nC++\r\nPython<\/pre>\nAs you can see, each element of the languages array gets printed on the screen. The left arrow operator is called generator. We’re iterating over the languages array one by one, assigning the element’s value to x and printing x.<\/span><\/p>\n
![\"Practice](\"http:\/\/blog.cloudxlab.com\/wp-content\/uploads\/2018\/01\/Practice-lab-1.png\")
<\/h3>\nSequence – List<\/h3>\n
List in Scala represents a linked list having elements such that each element has a value and pointer to the next element. These lists have poor performance as data could be located anywhere in the memory. <\/span><\/p>\n
Compared to an array, a list is very flexible, as you do not have to worry about exceeding the size of the list. <\/span><\/p>\n
Theoretically, lists are unbounded in size, but practically their size is limited by the amount of memory allocated to the JVM.<\/span><\/p>\n
Let us do a hands-on and create a list of integers 1, 2 and 3. <\/span><\/p>\n
scala> var number_list = List(1, 2, 3)<\/pre>\n
To add a new element to the list, type number_list :+ 4<\/span><\/p>\n
scala> var number_list = List(1, 2, 3)\r\n\r\nscala> number_list :+ 4\r\nres0: List[Int] = List(1,2,3,4)<\/pre>\n
As you can see, element 4 is added to the list. <\/span><\/p>\n
Let us try to change the value at index 1.<\/span><\/p>\n
scala> number_list(1) = 7\r\n<console>:13: error: value update is not a member of List[Int]\r\n number_list(1) = 7\r\n ^<\/pre>\n
We’ve got an error. We can not change the value since lists are immutable.<\/p>\n
Sets<\/h3>\n
A set in Scala is a bag of data with no duplicates. Also, the ordering is not guaranteed in sets.<\/span><\/p>\n
Let us create a set with integers 76, 5, 9, 1 and 2. <\/span><\/p>\n
scala> var set = Set(76, 5, 9, 1, 2)\r\nset: scala.collection.immutable.Set[Int] = Set(5, 1, 9, 2, 76)<\/pre>\n
Let us add 9 to it. <\/span><\/p>\n
scala> var set = Set(76, 5, 9, 1, 2)\r\nset: scala.collection.immutable.Set[Int] = Set(5, 1, 9, 2, 76)\r\n\r\nscala> set = set + 9\r\nset: scala.collection.immutable.Set[Int] = Set(5, 1, 9, 2, 76)<\/pre>\n
Since duplicates are not allowed in sets, 9 is not added to the set. <\/span><\/p>\n
Let’s add 20. <\/span><\/p>\n
scala> var set = Set(76, 5, 9, 1, 2)\r\nset: scala.collection.immutable.Set[Int] = Set(5, 1, 9, 2, 76)\r\n\r\nscala> set = set + 20\r\nset: scala.collection.immutable.Set[Int] = Set(5, 20, 1, 9, 2, 76)<\/pre>\n
We can see that 20 is added to the set. Note the order of 20. As discussed, set does not guarantee the\u00a0ordering. set(5) will result in boolean true as 5 is present in the set. set(14) will result in boolean false as 14 is not present in the set.<\/span><\/p>\n
Collections – Tuples and Maps<\/h2>\n
Tuples<\/h3>\n
Unlike an array and list, tuples can hold elements of different data types. Let’s create a tuple with elements 14, 45.69 and “Australia”). We can create it either with<\/span><\/p>\n
scala> var t = (14, 45.69, \"Australia\")\r\nt: (Int, Double, String) = (14, 45, 69, Australia)<\/pre>\n
or with <\/span><\/p>\n
scala> var t = Tuple3(14, 45.69, \"Australia\")\r\nt: (Int, Double, String) = (14, 45, 69, Australia)<\/pre>\n
In the second syntax, we are explicitly specifying that tuple will contain 3 elements.<\/span><\/p>\n
Tuples can be accessed using a 1-based accessor for each value. To access the first element, type t._1. <\/span><\/p>\n
scala> t._1\r\nres0: Int = 14<\/pre>\n
Likewise, you can access the third element by t._3<\/span><\/p>\n
Please note that Tuples are immutable. <\/span><\/p>\n
Maps<\/h3>\n
Scala maps are a collection of key\/value pairs. Maps allow indexing values by a specific key for fast access. You can think of a Scala map as a Java Hashmap and Python dictionary.<\/span><\/p>\n
Let’s do a hands-on on Scala maps. We will start by creating a Colors map that contains key\/value pair of two colors and their hex code. <\/span><\/p>\n
scala> var colors = Map(\"red\" -> \"#FF0000\", \"yellow\" -> \"#FFFF00\")\r\n<\/pre>\n
To see the hex code of color yellow, type colors(“yellow”). <\/span><\/p>\n
scala> var colors = Map(\"red\" -> \"#FF0000\", \"yellow\" -> \"#FFFF00\")\r\n\r\nscala> colors(\"yellow\")\r\nres0: String = #FFFF00<\/pre>\n
As you can see, the hex code of yellow is #FFFF00. <\/span><\/p>\n
We can add new key\/value pairs using += operator. Let’s add color green and its hex value. <\/span><\/p>\n
scala> colors += \"green\" -> \"#000000\"<\/pre>\n
Type colors to see the list of updated key\/value pairs. <\/span><\/p>\n
scala> colors\r\nres0: scala.collection.immutable.Map(String.String) = Map(red -> #FF0000, yellow -> #FFFF00, green ->\r\n#008000)<\/pre>\n
We can also remove key\/value pair using -= operator. Let’s remove key “red”. <\/span><\/p>\n
scala> colors -= \"red\"\r\n\r\nscala> colors\r\nres0: scala.collection.immutable.Map(String.String) = Map(yellow -> #FFFF00, green -> #008000)<\/pre>\n
You can see that key “red” is no more in the map.<\/span><\/p>\n
Scala provides two types of maps – immutable and mutable. Please note by default, Scala uses the immutable Maps. It means that you can not change the value of a key. If you want to use the mutable maps, import scala.collection.mutable.Map class explicitly<\/span><\/p>\n
Higher Order Functions<\/b><\/h2>\n
In Scala, a higher-order function is a function which takes another function as an argument. A higher-order function describes “how” the work is to be done in a collection.<\/span><\/p>\n
Higher Order Function – Map<\/h3>\n
Let’s learn the higher order function map. <\/span><\/p>\n
![\"\"](\"http:\/\/blog.cloudxlab.com\/wp-content\/uploads\/2018\/01\/Scala-Introduction-1-1024x767.png\")
<\/p>\nThe map applies the function to each value in the collection and returns a new collection. Say we have a list of integers 3, 7, 13 and 16 and we want to add one to each value in the list. Using higher order map function, we can map over the list and add one to each value. As displayed on the image above, we have a new list with values 4, 8, 14 and 17.<\/span><\/p>\n
Let’s do a hands-on. Define a list of integers 1, 2 and 3.\u00a0<\/span><\/p>\n
scala> var list = List(1,2,3)<\/pre>\n
Let’s add 1 to each element using the map function.\u00a0 <\/span><\/p>\n
scala> list.map(x => x + 1)\r\nres0: List[Int] = List(2, 3, 4)<\/pre>\n
As you can see, we have a new list with integers 2, 3 and 4<\/span><\/p>\n
Here map function adds one to every value in the list. Each value in the list has the name “x”. There is another syntax to define the map, where instead of giving a name to every value being used in the function, we use a placeholder underscore to represent the value.<\/span><\/p>\n
scala> list.map(_+ 1)<\/pre>\n
Higher Order Function – flatMap<\/h3>\n
flatMap takes a function as an argument and this function must return a collection. The collection could be empty.<\/span><\/p>\n
The flatMap is called on a collection. The flatMap applies the function passed to it as an argument on each value in the collection just like map.<\/span><\/p>\n
The returned collections from each call of function are then merged together to form a new collection.<\/span><\/p>\n
Let’s understand it with an example<\/span><\/p>\n
Let’s define a list of languages. <\/span><\/p>\n
var list = List(\"Python\", \"Go\")<\/pre>\n
Here, we have a list of strings. A string is nothing but a sequence of characters. <\/span><\/p>\n
Now, we define a flatMap.<\/span><\/p>\n
scala> list.flatMap(lang => lang + \"#\")\r\nres0: List(Char) = List(P, y, t, h, o, n, #, G, o, #)<\/pre>\n
flatMap appends “#” to every string in the list and then flattens down the string to characters. As you can see, # is appended to python and go and then “python#” and “go#” flatten down into the sequence of characters. <\/span><\/p>\n
We can also define the same function using flatMap(_+ “#”) where the underscore is a placeholder for each value in the list.<\/span><\/p>\n
So, the size of output collection could be larger than the size of input collection.<\/span><\/p>\n
While in the case of map the input and output collection were of the same size.<\/span><\/p>\n
Higher Order Function – Filter<\/h3>\n
Let’s learn the higher order function Filter. The filter applies a function to each value in the collection and returns a new collection with values that satisfy a condition specified in the function. Let’s understand it with an example.<\/span><\/p>\n
We have a list of languages Scala, R, Python, Go and SQL. To filter out languages which contain capital S, we use the following command<\/span><\/p>\n
scala> var list = List(\"Scala\", \"R\", \"Python\", \"Go\", \"SQL\")\r\n\r\nscala> list.filter(lang => lang.contains(\"S\"))\r\nres0: List(String) = List(Scala, SQL)<\/pre>\n
As you can see we have a new list now with only Scala and SQL as values. Each value in the list has name “lang”<\/span><\/p>\n
Each of the previous higher order functions returned a new collection after applying the transformation. But at times we do not want the functions to return a new collection. It is a waste of memory resources on JVM if we do not want a return value. Higher order function ‘foreach’ allows us to apply a function to each value of collection without returning a new collection. <\/span><\/p>\n
Let’s say we have a list of values 1 and 2 and we just want to print each value in the list. We can use foreach function for this as we are not interested in the return value. To use foreach higher order function, type<\/span><\/p>\n
scala> var list = List(1,2)\r\nlist: List[Int] = List(1,2)\r\n\r\nscala> var list.foreach(println)\r\n1\r\n2<\/pre>\n
As you can see value 1 and 2 are printed on the screen.<\/span><\/p>\n
Higher Order Function – Reduce<\/h3>\n
Reduce is a very important concept in the MapReduce world. Let’s say we have a list and we want to reduce it to add values together. Let’s understand it with an example. <\/span><\/p>\n
In our example, reduce adds the first two elements 3 and 7 which results in 10. Then it adds 10 to the next element which is 13 resulting in 23. Then it adds 23 to the next element in the list which is 16. <\/span><\/p>\n
scala> var list = List(3, 7, 13, 16)\r\n\r\nscala> list.reduce((x, y) => x + y)\r\nres0: Int = 39\r\n<\/pre>\n
As you can see, that final result of the reduce function is 39<\/span><\/p>\n
Here the reduce function takes two values named x and y and adds them.<\/span><\/p>\n
We can also define the reduce function using list.reduce(<\/span> + <\/span><\/i>). Here the two underscores are placeholders for the two values.<\/span><\/p>\n
Build Tool – SBT<\/h2>\n
So far, we have just compiled and run one .scala file. If we are working on a big project containing hundreds of source files, it becomes really tedious to compile these files manually. We’ll then need a build tool to manage the compilation of all these files. SBT is a build tool for Scala and Java projects, similar to Java’s Maven or ant. <\/span><\/p>\n
SBT is already installed on CloudxLab<\/a> so you can compile your Scala project directly on it.<\/span><\/p>\n
Let’s understand how to use SBT to build a Scala project. We’ve provided a sample code on the CloudxLab GitHub repository<\/a>. Clone the CloudxLab GitHub repository in your home folder in CloudxLab.<\/span><\/p>\n
Follow the instructions given in the video below.<\/p>\n
<\/p>\n
\n - Arrays are fixed in size and contain an ordered sequence of data. <\/span><\/li>\n
- An array contains elements of the same type. <\/span><\/li>\n