blocks|key|1378215|text|有效的方法是比较极限|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1378216|(x.first+<=+y.last)+and+(y.first+<=+x.last)|code-block|syntax|javascript|1378217|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

The efficient way is to compare the limits

<pre><code>(x.first &lt;= y.last) and (y.first &lt;= x.last)
</code></pre>

blocks|key|1378257|text|如果一个范围包括第二个范围的开始或结束，则它们会重叠。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1378258|(x+===+y.first)+or+(x+===+y.last)|code-block|syntax|javascript|1378259|与以下内容相同：|1378260|x.include?(y.first)+or+x.include?(y.last)|1378261|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|N|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|O|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|K|3|-4|5|6|7|Q|8|@]|9|@]|A|$]]]|L|$]]

If a range includes either the beginning or the end of a second range, then they overlap.

<pre><code>(x === y.first) or (x === y.last)
</code></pre>

is the same as this:

<pre><code>x.include?(y.first) or x.include?(y.last)
</code></pre>

blocks|key|1593479|text|如果您要检查重叠，那么我会这样做|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1593480|(x.include?+y.first)+or+(x.include?+y.last)|code-block|syntax|javascript|1593481|因为一个范围必须至少包括另一个范围的一端。对我来说，这比公认的连词答案更直观，尽管不如MarkusQ的极限比较有效。|1593482|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|M|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

If you're checking for overlap, then I'd just do

<pre><code>(x.include? y.first) or (x.include? y.last)
</code></pre>

as one range will have to include at least one of the ends of the other. This is more intuitive to me than the accepted conjuction answer, though not quite as efficient as MarkusQ's limit comparison.

blocks|key|1593533|text|在大范围内使用时要小心，但这是一种优雅的方式：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1593534|(x.to_a+&+y.to_a).empty?|code-block|syntax|javascript|1593535|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Be careful using this with large ranges but this is an elegant way to do it:

<pre><code>(x.to_a &amp; y.to_a).empty?
</code></pre>

blocks|key|1378355|text|您还可以将范围转换为sets，因为您在这里基本上是在做设置交集。如果要处理两个以上的范围，可能会更容易。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1378356|x+=+(1..10).to_set
y+=+(5..15).to_set
!(x+&+y).empty?+#returns+true+(true+==+overlap,+false+==+no+overlap)|code-block|syntax|javascript|1378357|entityMap|0|LINK|mutability|MUTABLE|url|http://www.ruby-doc.org/stdlib/libdoc/set/rdoc/index.html^0|A|4|0|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@$A|R|B|S|1|T]]|C|$]]|$1|D|3|E|5|F|7|U|8|@]|9|@]|C|$G|H]]|$1|I|3|-4|5|6|7|V|8|@]|9|@]|C|$]]]|J|$K|$5|L|M|N|C|$O|P]]]]

You could also convert the ranges to <a href="http://www.ruby-doc.org/stdlib/libdoc/set/rdoc/index.html" rel="nofollow">sets</a>, since you're basically doing set intersection here. Might be easier if you are dealing with more than two ranges.

<pre><code>x = (1..10).to_set
y = (5..15).to_set
!(x &amp; y).empty? #returns true (true == overlap, false == no overlap)
</code></pre>

blocks|key|1378387|text|一些有用的枚举方法：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1378388|#+x+is+a+'subset'+of+y
x.all?{%7Cn%7C+y.include?+n}
#+x+and+y+overlap
x.any?{%7Cn%7C+y.include?+n}
#+x+and+y+do+not+overlap
x.none?{%7Cn%7C+y.include?+n}
#+x+and+y+overlap+one+time
x.one?{%7Cn%7C+y.include?+n}|code-block|syntax|javascript|1378389|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Some helpful enumerable methods:

<pre><code># x is a 'subset' of y
x.all?{|n| y.include? n}
# x and y overlap
x.any?{|n| y.include? n}
# x and y do not overlap
x.none?{|n| y.include? n}
# x and y overlap one time
x.one?{|n| y.include? n}
</code></pre>

blocks|key|1593625|text|此方法可用于以有效的方式测试多个范围之间的重叠：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1593626|def+range_overlap?(ranges)
++sorted_ranges+=+ranges.sort
++sorted_ranges.each_cons(2).each+do+%7Cr1,+r2%7C
++++return+true+if+r2.first+<=+r1.last
++end
++return+false
end


def+test(r)
++puts+r.inspect,+range_overlap?(r)
++puts+'================'
++r+=+r.reverse
++puts+r.inspect,+range_overlap?(r)
++puts+'================'
end


test+[[1,9],+[10,+33]]
test+[[1,10],+[5,+8]]
test+[[1,10],+[10,+33]]|code-block|syntax|javascript|1593627|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

This method can be used to test overlap between multiple ranges in an efficient way:

<pre><code>def range_overlap?(ranges)
 sorted_ranges = ranges.sort
 sorted_ranges.each_cons(2).each do |r1, r2|
 return true if r2.first &lt;= r1.last
 end
 return false
end


def test(r)
 puts r.inspect, range_overlap?(r)
 puts '================'
 r = r.reverse
 puts r.inspect, range_overlap?(r)
 puts '================'
end


test [[1,9], [10, 33]]
test [[1,10], [5, 8]]
test [[1,10], [10, 33]]
</code></pre>

blocks|key|1593655|text|Rails有Range#overlaps?|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1593656|def+overlaps?(other)
++cover?(other.first)+%7C%7C+other.cover?(first)
end|code-block|syntax|javascript|1593657|entityMap|0|LINK|mutability|MUTABLE|url|http://apidock.com/rails/Range/overlaps%253F^0|6|F|0|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@$A|R|B|S|1|T]]|C|$]]|$1|D|3|E|5|F|7|U|8|@]|9|@]|C|$G|H]]|$1|I|3|-4|5|6|7|V|8|@]|9|@]|C|$]]]|J|$K|$5|L|M|N|C|$O|P]]]]

Rails has <a href="http://apidock.com/rails/Range/overlaps%3F" rel="nofollow noreferrer">Range#overlaps?</a>

<pre><code>def overlaps?(other)
 cover?(other.first) || other.cover?(first)
end
</code></pre>

blocks|key|1593688|text|如果你使用的是Ruby2.6，你可以在另一个Range中使用Range#cover?。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1593689|(1..5).cover?(2..3)+++++#=>+true
(1..5).cover?(0..6)+++++#=>+false
(1..5).cover?(1...6)++++#=>+true|code-block|syntax|javascript|1593690|entityMap|0|LINK|mutability|MUTABLE|url|https://ruby-doc.org/core-2.6.0.preview2/Range.html#method-i-cover-3F^0|M|5|U|C|U|C|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@$9|T|A|U|B|C]|$9|V|A|W|B|C]]|D|@$9|X|A|Y|1|Z]]|E|$]]|$1|F|3|G|5|H|7|10|8|@]|D|@]|E|$I|J]]|$1|K|3|-4|5|6|7|11|8|@]|D|@]|E|$]]]|L|$M|$5|N|O|P|E|$Q|R]]]]

If you're using Ruby 2.6, you can use <a href="https://ruby-doc.org/core-2.6.0.preview2/Range.html#method-i-cover-3F" rel="nofollow noreferrer"><code>Range#cover?</code></a> with another <code>Range</code>.

<pre><code>(1..5).cover?(2..3) #=&gt; true
(1..5).cover?(0..6) #=&gt; false
(1..5).cover?(1...6) #=&gt; true
</code></pre>

If I have two ranges that overlap:

<pre><code>x = 1..10
y = 5..15
</code></pre>

When I say:

<pre><code>puts x.include? y 
</code></pre>

the output is: 

<pre><code>false 
</code></pre>

because the two ranges only overlap partially.

But if I want it to be "true" when there is partial overlap between two ranges, how would I write that? In other words I need a way to know when one range contains a subset of another range. I assume there's an elegant way to write this in Ruby but the only solutions I can think of are verbose.

(Ruby) How do you check whether a range contains a subset of another range?

如果我有两个重叠的范围：x = 1..10y = 5..15当我说：puts x.include? y 输出为：false 因为这两个范围只有部分重叠。但如果当两个范围之间存在部分重叠时，我希望它为"true“，我该如何编写呢？换句话说，我需要一种方法来知道一个范围何时包含另一个范围的子集。我假设有一种用Ruby编写代...

问(Ruby)如何检查一个范围是否包含另一个范围的子集？
EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问(Ruby)如何检查一个范围是否包含另一个范围的子集？EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问(Ruby)如何检查一个范围是否包含另一个范围的子集？
EN