Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Learning Scala Programming
  • Table Of Contents Toc
  • Feedback & Rating feedback
Learning Scala Programming

Learning Scala Programming

By : Sharma
2 (3)
close
close
Learning Scala Programming

Learning Scala Programming

2 (3)
By: Sharma

Overview of this book

Scala is a general-purpose programming language that supports both functional and object-oriented programming paradigms. Due to its concise design and versatility, Scala's applications have been extended to a wide variety of fields such as data science and cluster computing. You will learn to write highly scalable, concurrent, and testable programs to meet everyday software requirements. We will begin by understanding the language basics, syntax, core data types, literals, variables, and more. From here you will be introduced to data structures with Scala and you will learn to work with higher-order functions. Scala's powerful collections framework will help you get the best out of immutable data structures and utilize them effectively. You will then be introduced to concepts such as pattern matching, case classes, and functional programming features. From here, you will learn to work with Scala's object-oriented features. Going forward, you will learn about asynchronous and reactive programming with Scala, where you will be introduced to the Akka framework. Finally, you will learn the interoperability of Scala and Java. After reading this book, you'll be well versed with this language and its features, and you will be able to write scalable, concurrent, and reactive programs in Scala.
Table of Contents (16 chapters)
close
close

Tail call optimization


We are familiar with the limitations recursion brings with it. We are aware that each function call, if not tail recursive, builds a new stack frame. For scenarios where we have to deal with a large number of function calls, this could possibly result in a stack overflow, which is undesirable. So, what's suggested in this kind of scenario is to make the recursive function call the last statement in your function definition, the Scala compiler then does the rest for you. Take a look at the following:

import scala.annotation.tailrec

object TailRecursion { 
  def main(args: Array[String]): Unit = { 
      val list = List("Alex", "Bob", "Chris", "David", "Raven", "Stuart") 
    someRecursiveMethod(list) 
 
  } 
 
  /* 
      You have a sorted list of names of employees, within a company. 
      print all names until the name "Raven" comes 
  */ 
  @tailrec 
  def someRecursiveMethod(list: List[String]): Unit = { 
      list match { 
        case Nil => println("Can...

Unlock full access

Continue reading for free

A Packt free trial gives you instant online access to our library of over 7000 practical eBooks and videos, constantly updated with the latest in tech

Create a Note

Modal Close icon
You need to login to use this feature.
notes
bookmark search playlist download font-size

Change the font size

margin-width

Change margin width

day-mode

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Delete Bookmark

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete

Delete Note

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete

Edit Note

Modal Close icon
Write a note (max 255 characters)
Cancel
Update Note

Confirmation

Modal Close icon
claim successful

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY