当前位置: 首页>>代码示例 >>用法及示例精选 >>正文


Scala Queue intersect()用法及代码示例


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)


相关用法


注:本文由纯净天空筛选整理自rupesh_rao大神的英文原创作品 Scala Queue intersect() method with example。非经特殊声明,原始代码版权归原作者所有,本译文未经允许或授权,请勿转载或复制。