intersect()方法用於返回一個新隊列,該隊列由兩個給定隊列中都存在的元素組成。
函數定義: def intersect[B >: A](that: collection.Seq[B]): Queue[A]
返回類型: It returns a new queue that consists of elements that are present in both the given queues.
範例1:
// Scala program of intersect()
// method
// Import Queue
import scala.collection.mutable._
// Creating object
object GfG
{
// Main method
def main(args:Array[String])
{
// Creating queues
val q1 = Queue(1, 3, 2, 7, 6, 5)
val q2 = Queue(1, 13, 2, 17, 6, 15)
// Print the queues
println("Queue_1: " + q1)
println("Queue_2: " + q2)
// Applying intersect method
val result = q1.intersect(q2)
// Display output
print("The elements in both the queues: ")
result.foreach(x => print(x + " "))
}
}
輸出:
Queue_1: Queue(1, 3, 2, 7, 6, 5) Queue_2: Queue(1, 13, 2, 17, 6, 15) The elements in both the queues: 1 2 6
範例2:
// Scala program of intersect()
// method
// Import Queue
import scala.collection.mutable._
// Creating object
object GfG
{
// Main method
def main(args:Array[String])
{
// Creating queues
val q1 = Queue(1, 3, 2, 7, 6, 5)
val q2 = Queue(11, 3, 12, 7, 16, 5)
// Print the queues
println("Queue_1: " + q1)
println("Queue_2: " + q2)
// Applying intersect method
val result = q1.intersect(q2)
// Display output
print("The elements in both the queues: " + result)
}
}
輸出:
Queue_1: Queue(1, 3, 2, 7, 6, 5) Queue_2: Queue(11, 3, 12, 7, 16, 5) The elements in both the queues: Queue(3, 7, 5)
相關用法
- Scala Set intersect()用法及代碼示例
- Scala Stack intersect()用法及代碼示例
- Scala TreeSet intersect()用法及代碼示例
- Scala SortedSet intersect()用法及代碼示例
- Scala Queue min()用法及代碼示例
- Scala Queue max()用法及代碼示例
- Scala Queue contains()用法及代碼示例
- Scala Queue sum()用法及代碼示例
- Scala Queue take()用法及代碼示例
- Scala Queue :+()用法及代碼示例
- Scala Queue last()用法及代碼示例
- Scala Queue ++=()用法及代碼示例
- Scala Queue map()用法及代碼示例
- Scala Queue +=()用法及代碼示例
- Scala Queue +=:()用法及代碼示例
注:本文由純淨天空篩選整理自rupesh_rao大神的英文原創作品 Scala Queue intersect() method with example。非經特殊聲明,原始代碼版權歸原作者所有,本譯文未經允許或授權,請勿轉載或複製。