ruby 类方法与实例方法_Ruby Set相交？实例方法

超、凢脫俗 2023-03-05 12:52 178阅读 0赞

ruby 类方法与实例方法

## Ruby Set相交？ 方法 **(**Ruby Set intersect? Method**)** ##

**intersect?(Set) method** is a method which is predefined in Ruby's library. You may call this method as an exact opposite of [Set.disjoint?() method][Set.disjoint_ method]. With the help of this method, we can check whether the two sets are having any common elements. If the sets which we are comparing are having any of the common elements then the method will return true and false in the case only when there are no common elements in both the sets. This method may provide you various advantages while programming with Ruby. Let us see its syntax and example for having a better understanding of how this method is implemented in the Ruby code.

**intersect？(Set)方法**是在Ruby的库中预定义的方法。 您可以将此方法称为[Set.disjoint？()方法][Set.disjoint_ method]的完全相反的[方法][Set.disjoint_ method] 。 借助此方法，我们可以检查这两个集合是否具有任何公共元素。 如果我们正在比较的集合具有任何公共元素，则仅当两个集合中都没有公共元素时，该方法才会返回true和false。 使用Ruby编程时，此方法可能为您提供各种优势。 让我们看一下它的语法和示例，以更好地了解如何在Ruby代码中实现此方法。

**Syntax:**

**句法：**

Set.intersect?(Set)

**Example 1:**

**范例1：**

=begin
    Ruby program to demonstrate the implementation of 
    intersect?() method.
    =end
    
    require 'set'
    
    Vegetable=Set.new(["potato", "brocolli","broccoflower","lentils","peas","fennel","chilli","cabbage"])
    
    Fruits = Set.new(["Apple","Mango","Banana","Orange","Grapes"])
    
    p = Vegetable.intersect?(Fruits)
    
    if p == false
    	puts "There is no common element exists between both the sets."
    else
    	puts "The sets are having common elements."
    end

**Output**

**输出量**

There is no common element exists between both the sets.

**Explanation:**

**说明：**

In the above code, we have declared two instances of Set class known as Vegetable and Fruits. We want to check whether there exist some common elements between both the sets or not. We are proceeding with the help of the **intersect? method**. We know that it returns a Boolean value. So, we are storing its value inside a variable. We are then checking the value of that variable, if it is false then it simply means that there are no common elements between both the sets. This method will give you result as true even if there is only one element that is common between both the instances of Set class.

在上面的代码中，我们声明了Set类的两个实例，这些实例称为Vegetable和Fruits 。 我们要检查这两个集合之间是否存在某些公共元素。 我们在**相交**的帮助下进行**吗？** **方法** 。 我们知道它返回一个布尔值。 因此，我们将其值存储在变量中。 然后，我们正在检查该变量的值，如果它为false，则仅表示这两个集合之间没有公共元素。 即使Set类的两个实例之间只有一个公共元素，此方法也会为您提供真实的结果。

**Example 2:**

**范例2：**

=begin
    Ruby program to show the implementation of intersect?() .
    =end
    
    require 'set'
    
    p = Set[2,3,5].intersect?Set[2,56,4,3,22,66,34]
    
    if p == false
    	puts "There is no common element exists between both the sets."
    else
    	puts "The sets are having common elements."
    end

**Output**

**输出量**

The sets are having common elements.

**Explanation:**

**说明：**

In the above code, we are creating sets at the time of invoking the **intersect? function**. The **function intersect?()** is checking whether both the sets are having some common elements or not. If the sets are having even a single common element then it will return true. We are storing its returned value inside a variable ‘p’. We are checking the value of p, if it is having false then it means that there are some common elements inside both the sets. We are informing the user about this with the help of puts statements.

在上面的代码中，我们在调用**相交**时创建了集合**？** **功能** 。 **函数intersect？()**正在检查这两个集合是否都具有某些公共元素。 如果集合甚至具有单个公共元素，则它将返回true。 我们将其返回值存储在变量“ p”中。 我们正在检查p的值，如果p的值为false，则表示这两个集合内都有一些公共元素。 我们正在puts语句的帮助下通知用户。

> 翻译自: [https://www.includehelp.com/ruby/set-intersect-method-with-example.aspx][https_www.includehelp.com_ruby_set-intersect-method-with-example.aspx]

ruby 类方法与实例方法

[Set.disjoint_ method]: https://www.includehelp.com/ruby/set-disjoint-method-with-example.aspx
[https_www.includehelp.com_ruby_set-intersect-method-with-example.aspx]: https://www.includehelp.com/ruby/set-intersect-method-with-example.aspx