I have a case class Node that I have written and create a list from it and I need to find the node that has maximum disk.
I wrote the below code, is there a better way of doing it? Also, in my actual production code, my “nodeList” variable will be not just Option[List[Node]] but Future[Option[List[Node]]]. I guess still the answer/code won’t change much except for the fact that I will do a map/flatMap to go inside the future and do the same thing.
If anyone has a better suggestion to write below code more Scala way, please share your thoughts.
scala> case class Node(disk: Integer, name: String)
defined class Node
scala> val nodeList = Option(List(Node(40, “node1”), Node(200, “node3”),Node(60, “node2”)))
nodeList: Option[List[Node]] = Some(List(Node(40,node1), Node(200,node3), Node(60,node2)))
scala> val maxDisk = nodeList match {
| case None => println(“List is empty”); None
| case Some(lst) => {
| Some(lst.max(Ordering.by((_:Node).disk)))
| }
| }
maxDisk: Option[Node] = Some(Node(200,node3))