learning scala Function Recursive Tail Call

最新推荐文章于 2025-09-12 12:19:17 发布

weixin_30737363

最新推荐文章于 2025-09-12 12:19:17 发布

阅读量73

点赞数

CC 4.0 BY-SA版权

文章标签： scala

原文链接：http://www.cnblogs.com/lianghong881018/p/11174361.html

博客介绍可使用Scala库，从字面上看是在调用递归函数，还给出了代码及结果，并附上转载链接。

可以使用scala库，可以从字面上看出是在调用递归函数：

code

import scala.util.control.TailCalls._




  val arrayDonuts: Array[String] = Array("Vanilla Donut", "Strawberry Donut", "Plain Donut", "Glazed Donut")


  println("\nStep : How to define a tail recursive function using scala.util.control.TailCalls._")
  def tailSearch(donutName: String, donuts: Array[String], index: Int): TailRec[Option[Boolean]] = {
    if(donuts.length == index) {
      done(None) // NOTE: done is imported from scala.util.control.TailCalls._
    } else if(donuts(index) == donutName) {
      done(Some(true))
    } else {
      val nextIndex = index + 1
      tailcall(tailSearch(donutName, donuts, nextIndex)) // NOTE: tailcall is imported from scala.util.control.TailCalls._
    }
  }



  println("\nStep : How to call tail recursive function using scala.util.control.TailCalls._")
  val tailFound = tailcall(tailSearch("Glazed Donut", arrayDonuts, 0))
  println(s"Find Glazed Donut using TailCall = ${tailFound.result}") // NOTE: our returned value is wrapped so we need to get it by calling result

  val tailNotFound = tailcall(tailSearch("Chocolate Donut", arrayDonuts, 0))
  println(s"Find Chocolate Donut using TailCall = ${tailNotFound.result}")

resule:

Step : How to define a tail recursive function using scala.util.control.TailCalls._

Step : How to call tail recursive function using scala.util.control.TailCalls._
Find Glazed Donut using TailCall = Some(true)
Find Chocolate Donut using TailCall = None

转载于:https://www.cnblogs.com/lianghong881018/p/11174361.html