DZone
Thanks for visiting DZone today,
Edit Profile
  • Manage Email Subscriptions
  • How to Post to DZone
  • Article Submission Guidelines
Sign Out View Profile
  • Post an Article
  • Manage My Drafts
Newsletter
Log In / Join
Refcards Trend Reports
Events Video Library
Refcards
Trend Reports

Events

View Events Video Library

Related

  • Modernizing Apache Spark Applications With GenAI: Migrating From Java to Scala
  • Mastering Advanced Aggregations in Spark SQL
  • Thermometer Continuation in Scala
  • Deploying a Scala Play Application to Heroku: A Step-by-Step Guide

Trending

  • Microsoft Fabric Throttling: Diagnose Before You Scale
  • One Database, Two Models: Building AI-Friendly Java Applications With MySQL JSON Duality Views
  • Google Cloud KMS vs. AWS KMS: Java Encryption Guide
  • GenAI Security Gateway: An End-to-End Architecture

Draft This article hasn't been published, so readers can't see it.

In moderation This article is waiting for review, so readers can't see it yet.

Deleted This article has been deleted, so readers can't see it.

  1. DZone
  2. Coding
  3. Languages
  4. Higher-Order Functions in Scala

Higher-Order Functions in Scala

Let's take a look at how to use higher-order functions in Scala.

By 
Jyoti Sachdeva
·
Updated Dec. 19, 18 · Tutorial
Post on X (opens in a new tab) Share on LinkedIn (opens in a new tab)
50.1K Views

Join the DZone community Save articles, join the discussion, and download Refcards and Trend Reports with a free account.

Join for free Already a member? Log in

In this blog, I’m going to explain higher-order functions.

A higher-order function takes other functions as a parameter or returns a function as a result.

This is possible because functions are a first-class value in Scala. What does that mean?

It means that functions can be passed as arguments to other functions, and functions can return other functions.

The map function is a classic example of a higher order function.

val list = List(1,2,3)


Let’s define a function that doubles each value that is given to it.

def doubleValue = (x: Int) => x * x
doubleValue: Int => Int

val doubledList = list.map(x => doubleValue(x))


This example will call List(1,2,3).map(x => doubleValue(x)) and gives us a list with values (1, 4, 9). The function map will be called on each element of the list that will be passed to doubleValue.

We can also give it an anonymous function.

List(1,2,3) map (x => x + 1)


Amap is a function that takes another function(x => x+1) and a list as its arguments and applies the given function to all the elements of the list.

Create Our Own Higher-Order Function:

Example 1

def addition(f: (Int, Int) => Int,a: Int, b:Int): Int = f(a,b)


This addition takes a higher-order function as an input, which, in turn, takes two integers as an input and returns an integer.

val squareSum = (x: Int, y: Int) => (x*x + y*y)
val cubeSum = (x: Int, y: Int) => (x*x*x + y*y*y)
val intSum = (x: Int, y: Int) => (x + y)

val squaredSum = addition(squareSum, 1, 2)
val cubedSum = addition(cubeSum, 1, 2)
val normalSum = addition(intSum, 1, 2)


Note that:

  • addition(squareSum, 1, 2) will call squareSum(1,2).
  • addition(cubeSum, 1, 2) will call cubeSum(1,2).
  • addition(intSum, 1, 2) will call intSum(1,2).

Example 2

def applyPatternToText(text:String,f:String => String): String = {
f(text)
}


The applyPatternToText function takes another function as a parameter.

def appendTag(data:String): String => String = {
_ : String => s"$data"
}


The appendTag function returns a function itself.

val message = "scala"
println( applyPatternToText(message, appendTag(message)))


This will call applyPatternToText (“scala”,appendTag(“scala”)).

f:String => String will be replaced by appendTag(“scala”).

 appendTag(“scala”) will print scala.

Example 3

Let’s take another example to find the sum of a list and product of a list using the higher-order function:

def operateList(list: List[Int], f: (Int, Int) => Int, operation: String): Int = {
def inner(list: List[Int], result: Int): Int = {
list match {
case head :: tail => inner(tail, f(head, result))
case Nil => result
}
}

operation.toLowerCase match {
case "product" => inner(list, 1)
case "sum" => inner(list, 0)
}
}


The operateList (List(1,2,3),(a, b) => a + b, “sum”) will call the inner(List(1,2,3),0).

After match condition, the next call will be inner(List(2,3),f(1,0)), which will give inner(List(2,3),1).

The next call would be inner(List(3),f(2,1)), which will give inner(List(3),3). Then, the next call would be inner(Nil,f(3,3)), which will give inner(Nil,6).

The final result would be 6!

Scala (programming language)

Opinions expressed by DZone contributors are their own.

Related

  • Modernizing Apache Spark Applications With GenAI: Migrating From Java to Scala
  • Mastering Advanced Aggregations in Spark SQL
  • Thermometer Continuation in Scala
  • Deploying a Scala Play Application to Heroku: A Step-by-Step Guide

Partner Resources

×

Comments

Loading comments

The comments didn't load

Please try again in a moment.

Likes

Loading

The next likes didn't load. Please try again.

The likes didn't load

Please try again in a moment.

See who liked this

Log in or join DZone for free to see who liked this article.

Log in Join for free
  • RSS
  • X
  • Facebook

ABOUT US

  • About DZone
  • Support and feedback
  • Community research

ADVERTISE

  • Advertise with DZone

CONTRIBUTE ON DZONE

  • Article Submission Guidelines
  • Become a Contributor
  • Core Program
  • Visit the Writers' Zone

LEGAL

  • Terms of Service
  • Privacy Policy

CONTACT US

  • 3343 Perimeter Hill Drive
  • Suite 215
  • Nashville, TN 37211
  • [email protected]

Let's be friends:

  • RSS
  • X
  • Facebook