interval_set 0.1.0 → 0.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: e161c0a76439ab2e80de1567dfd7a4b4613a7340
-  data.tar.gz: 83fcb9323b1b21792bb8db45aaf2b1d202117055
+  metadata.gz: c2ef851831406ab98e7b1e6f61f7a1d17dba05d0
+  data.tar.gz: 968ef3f0967f7ebef2e1966feb7b60cbfb97ad2f
 SHA512:
-  metadata.gz: 46f4169b72e0a1ce24cffedf7fe56f3fd058ecff04d4db92660ad77e94816844d63b044cf21e363a7abf73ffc0765d64df3cadd2dc0e45a90566fed54de0b0a0
-  data.tar.gz: c99c4d21c9bdd2a03b23d5cc7e904dd6222a3884e38142bf90789abaa0e64a5910ff62dc3e7a5fc5083cc029f8f4d0ceb2bee6b285e6a9d8c2dbfd1efc7ef055
+  metadata.gz: d369094a12515dba67e051057c1ec9f09242b9c935e8224a8c5af836937555e815eecd6001793108a6bc19bbd20f6e637b894789c30b3089f4da4c401231d31a
+  data.tar.gz: 138af7c1155d6c9572b9fd299f84604d288d1238df417356149a9a87819305957b92c7084aa82a058a4a421d91dda61b135a4c8ba902c6b96fb74d88b5ee8edd

data/.travis.yml

@@ -1,5 +1,12 @@
 sudo: false
 language: ruby
 rvm:
+  - 1.9.2
+  - 1.9.3
+  - 2.0
+  - 2.1
+  - 2.2
+  - 2.3
   - 2.4.1
+  - ruby-head
 before_install: gem install bundler -v 1.16.0

data/Gemfile.lock

@@ -1,7 +1,7 @@
 PATH
   remote: .
   specs:
-    interval_set (0.1.0)
+    interval_set (0.1.1)
       treemap-fork (~> 1.0, >= 1.0.4.2)
 
 GEM

data/README.md

@@ -1,5 +1,7 @@
 # IntervalSet
 
+[![Build Status](https://travis-ci.org/rjasper/ruby-interval_set.svg?branch=master)](https://travis-ci.org/rjasper/ruby-interval_set)
+
 IntervalSet implements a set of sorted non-overlapping ranges. A range's start is always interpreted as inclusive while the end is exclusive.
 
 ## Installation
@@ -27,89 +29,89 @@ http://www.rubydoc.info/gems/interval_set
 Create a interval set:
 
 ```ruby
-IntervalSet.new              # -> []
-IntervalSet[]                # -> []
-IntervalSet[0...1]           # -> [0...1]
-IntervalSet[0...1, 2...3]    # -> [0...1, 2...3]
-IntervalSet[0...1, 1...2]    # -> [0...2]
+IntervalSet.new             # -> []
+IntervalSet[]               # -> []
+IntervalSet[0...1]          # -> [0...1]
+IntervalSet[0...1, 2...3]   # -> [0...1, 2...3]
+IntervalSet[0...1, 1...2]   # -> [0...2]
 
 array = [0...1, 2...3]
-IntervalSet[*array]          # -> [0...1, 2...3]
+IntervalSet[*array]         # -> [0...1, 2...3]
 ```
 
 Add a range:
 
 ```ruby
-IntervalSet.new << (0...1)   # -> [0...1]
-IntervalSet.new.add(0...1)   # -> [0...1]
-
-i = IntervalSet.new          # -> []
-i << (0...1)              # -> [0...1]
-i << (2...3)              # -> [0...1, 2...3]
-i << (1...2)              # -> [0...3]
-i << (-1...4)             # -> [-1...4]
+IntervalSet.new << (0...1)  # -> [0...1]
+IntervalSet.new.add(0...1)  # -> [0...1]
+
+i = IntervalSet.new         # -> []
+i << (0...1)                # -> [0...1]
+i << (2...3)                # -> [0...1, 2...3]
+i << (1...2)                # -> [0...3]
+i << (-1...4)               # -> [-1...4]
 ```
 
 Remove a range:
 
 ```ruby
-i = IntervalSet[0...10]      # -> [0...10]
-i >> (2...8)              # -> [0...2, 8...10]
-i.remove(0...2)           # -> [8...10]
+i = IntervalSet[0...10]     # -> [0...10]
+i >> (2...8)                # -> [0...2, 8...10]
+i.remove(0...2)             # -> [8...10]
 ```
 
 Get bounds:
 
 ```ruby
-i = IntervalSet[0...1, 2...3]  # -> [0...1, 2...3]
-i.min                     # -> 0
-i.max                     # -> 3
-i.bounds                  # -> 0...3
+i = IntervalSet[0...1, 2...3] # -> [0...1, 2...3]
+i.min                       # -> 0
+i.max                       # -> 3
+i.bounds                    # -> 0...3
 ```
 
 Check empty:
 
 ```ruby
-IntervalSet[].empty?         # -> true
+IntervalSet[].empty?        # -> true
 
-i = IntervalSet[0...1]       # -> [0...1]
-i.empty?                  # -> false
-i >> (0...1)              # -> []
-i.empty?                  # -> true
+i = IntervalSet[0...1]      # -> [0...1]
+i.empty?                    # -> false
+i >> (0...1)                # -> []
+i.empty?                    # -> true
 ```
 
 Count ranges:
 
 ```ruby
-i = IntervalSet[]            # -> []
-i.count                   # -> 0
-i << (0...1)              # -> [0...1]
-i.count                   # -> 1
-i << (2...3)              # -> [0...1, 2...3]
-i.count                   # -> 2
-i << (1...2)              # -> [0...3]
-i.count                   # -> 1
+i = IntervalSet[]           # -> []
+i.count                     # -> 0
+i << (0...1)                # -> [0...1]
+i.count                     # -> 1
+i << (2...3)                # -> [0...1, 2...3]
+i.count                     # -> 2
+i << (1...2)                # -> [0...3]
+i.count                     # -> 1
 ```
 
 Check inclusion:
 
 ```ruby
-i = IntervalSet[0...1]       # -> [0...1]
+i = IntervalSet[0...1]      # -> [0...1]
 
-i.include?(0)             # -> true
-i.include?(0.5)           # -> true
-i.include?(1)             # -> false ; a range's end is exclusive
+i.include?(0)               # -> true
+i.include?(0.5)             # -> true
+i.include?(1)               # -> false ; a range's end is exclusive
 ```
 
 Check intersection:
 
 ```ruby
-i = IntervalSet[0...1]       # -> [0...1]
+i = IntervalSet[0...1]      # -> [0...1]
 
 # Ranges only need a single common element with the interval set
-i.intersect?(0...1)       # -> true
-i.intersect?(0...2)       # -> true
-i.intersect?(1...2)       # -> false ; the start of a range is inclusive but the end exclusive
+i.intersect?(0...1)         # -> true
+i.intersect?(0...2)         # -> true
+i.intersect?(1...2)         # -> false ; the start of a range is inclusive but the end exclusive
 
 # The same applies for interval sets
 i.intersect?(IntervalSet[0...1])        # -> true
@@ -188,7 +190,7 @@ end
 Shift by a given amount:
 
 ```ruby
-IntervalSet[0...1].shift(1)    # -> [1...2] 
+IntervalSet[0...1].shift(1)     # -> [1...2] 
 ```
 
 Note that `shift(0)` will not be optimized since IntervalSet does not assume numbers as element type.
@@ -199,7 +201,7 @@ Buffer left and right:
 IntervalSet[1...2].buffer(1, 2) # -> [0...4]
 
 # Negative values will shrink the ranges:
-IntervalSet[0...4].buffer(-1, -2) # -> [1...2]
+IntervalSet[0...4].buffer(-1, -2)     # -> [1...2]
 IntervalSet[1...2].buffer(-0.5, -0.5) # -> []
 ```
 
@@ -220,22 +222,22 @@ IntervalSet[0...1, 10...12] * IntervalSet[-2...1, 1...2]  # -> [-2...3, 8...14]
 Copy another interval set:
 
 ```ruby
-a = IntervalSet[0...1]       # -> [0...1] 
-b = IntervalSet[2...3]       # -> [2...3] 
+a = IntervalSet[0...1]      # -> [0...1] 
+b = IntervalSet[2...3]      # -> [2...3] 
 
 a.copy(b)
 
-a                         # -> [2...3] 
-b                         # -> [2...3] 
+a                           # -> [2...3] 
+b                           # -> [2...3] 
 ```
 
 Clone another interval set:
 
 ```ruby
-a = IntervalSet[0...1]       # -> [0...1] 
-b = a.clone               # -> [0...1] 
+a = IntervalSet[0...1]      # -> [0...1] 
+b = a.clone                 # -> [0...1] 
 b << (2...3)
-b                         # -> [0...1, 2...3] 
+b                           # -> [0...1, 2...3] 
 ```
 
 Use other types:
@@ -245,10 +247,10 @@ a = Date.parse('2000-01-01')
 b = Date.parse('2000-01-02')
 c = Date.parse('2000-01-03') 
  
-i = IntervalSet[a...b]       # -> [2000-01-01...2000-01-02]
+i = IntervalSet[a...b]      # -> [2000-01-01...2000-01-02]
 
-i << (b...c)              # -> [2000-01-01...2000-01-03] 
-i.shift!(1)               # -> [2000-01-02...2000-01-04]
+i << (b...c)                # -> [2000-01-01...2000-01-03] 
+i.shift!(1)                 # -> [2000-01-02...2000-01-04]
 ```
 
 

data/interval_set.gemspec

@@ -13,6 +13,8 @@ Gem::Specification.new do |spec|
   spec.homepage      = 'https://github.com/rjasper/ruby-interval_set'
   spec.license       = 'MIT'
 
+  spec.required_ruby_version = '>= 1.9.2'
+
   spec.files         = `git ls-files -z`.split("\x0").reject do |f|
     f.match(%r{^(test|spec|features)/})
   end

data/lib/interval_set/version.rb

@@ -1,3 +1,3 @@
 class IntervalSet
-  VERSION = '0.1.0'
+  VERSION = '0.1.1'
 end

data/lib/interval_set.rb

@@ -1,4 +1,4 @@
-require_relative 'interval_set/version'
+require 'interval_set/version'
 require 'treemap-fork'
 
 # IntervalSet implements a set of sorted non-overlapping ranges.
@@ -7,13 +7,13 @@ class IntervalSet
   include Enumerable
 
   # Builds a new IntervalSet from the supplied ranges. Overlapping ranges will be merged.
-  #   IntervalSet[]                # -> []
-  #   IntervalSet[0...1]           # -> [0...1]
-  #   IntervalSet[0...1, 2...3]    # -> [0...1, 2...3]
-  #   IntervalSet[0...1, 1...2]    # -> [0...2]
+  #   IntervalSet[]               # -> []
+  #   IntervalSet[0...1]          # -> [0...1]
+  #   IntervalSet[0...1, 2...3]   # -> [0...1, 2...3]
+  #   IntervalSet[0...1, 1...2]   # -> [0...2]
   #
   #   array = [0...1, 2...3]
-  #   IntervalSet[*array]          # -> [0...1, 2...3]
+  #   IntervalSet[*array]         # -> [0...1, 2...3]
   #
   # @param ranges [Range[]] a list of ranges to be added to the new IntervalSet
   # @return [IntervalSet] a new IntervalSet containing the supplied ranges.
@@ -107,7 +107,7 @@ class IntervalSet
 
   # Returns +true+ if this IntervalSet contains the given element.
   #
-  #   i = IntervalSet[0...1]         # -> [0...1]
+  #   i = IntervalSet[0...1]      # -> [0...1]
   #
   #   i.include?(0)               # -> true
   #   i.include?(0.5)             # -> true
@@ -239,7 +239,7 @@ class IntervalSet
   # Returns +true+ if the given object has any common elements with
   # this IntervalSet.
   #
-  #   i = IntervalSet[0...1]         # -> [0...1]
+  #   i = IntervalSet[0...1]      # -> [0...1]
   #
   #   # Ranges only need a single common element with the interval set
   #   i.intersect?(0...1)         # -> true
@@ -265,7 +265,7 @@ class IntervalSet
 
   # Counts the number of ranges contained by this IntervalSet.
   #
-  #   i = IntervalSet[]              # -> []
+  #   i = IntervalSet[]           # -> []
   #   i.count                     # -> 0
   #   i << (0...1)                # -> [0...1]
   #   i.count                     # -> 1
@@ -282,10 +282,10 @@ class IntervalSet
   # Adds the other object's elements to this IntervalSet.
   # The result is stored in this IntervalSet.
   #
-  #   IntervalSet.new.add(0...1)     # -> [0...1]
-  #   IntervalSet.new << (0...1)     # -> [0...1]
+  #   IntervalSet.new.add(0...1)  # -> [0...1]
+  #   IntervalSet.new << (0...1)  # -> [0...1]
   #
-  #   i = IntervalSet.new            # -> []
+  #   i = IntervalSet.new         # -> []
   #   i << (0...1)                # -> [0...1]
   #   i << (2...3)                # -> [0...1, 2...3]
   #   i << (1...2)                # -> [0...3]
@@ -310,7 +310,7 @@ class IntervalSet
   # Removes the other object's elements from this IntervalSet.
   # The result is stored in this IntervalSet.
   #
-  #   i = IntervalSet[0...10]        # -> [0...10]
+  #   i = IntervalSet[0...10]     # -> [0...10]
   #   i.remove(0...2)             # -> [8...10]
   #   i >> (2...8)                # -> [0...2, 8...10]
   #
@@ -334,7 +334,7 @@ class IntervalSet
   # The result is stored in this IntervalSet.
   #
   #   i = IntervalSet[0...2, 3...5].intersect(1...5) # -> [1...2, 3...5]
-  #   i                                           # -> [1...2, 3...5]
+  #   i                                              # -> [1...2, 3...5]
   #
   # @param other [Range, IntervalSet] the other object.
   # @return [IntervalSet] self.
@@ -460,7 +460,7 @@ class IntervalSet
   # any pair of elements from both sets. A ∗ B = { a + b | a ∈ A ∧ b ∈ B }
   #
   #   # Convolve with a range (effectively buffers the set)
-  #   IntervalSet[0...4].convolve!(-1...2)  # -> [-1...6]
+  #   IntervalSet[0...4].convolve!(-1...2) # -> [-1...6]
   #
   #   # Convolving with empty or reversed ranges result in an empty set.
   #   IntervalSet[0...4].convolve!(0...0)  # -> []
@@ -489,11 +489,11 @@ class IntervalSet
   # any pair of elements from both sets. A ∗ B = { a + b | a ∈ A ∧ b ∈ B }
   #
   #   # Convolve with a range (effectively buffers the set)
-  #   IntervalSet[0...4] * (-1...2)  # -> [-1...6]
+  #   IntervalSet[0...4] * (-1...2) # -> [-1...6]
   #
   #   # Convolving with empty or reversed ranges result in an empty set.
-  #   IntervalSet[0...4] * (0...0)   # -> []
-  #   IntervalSet[0...4] * (1...0)   # -> []
+  #   IntervalSet[0...4] * (0...0)  # -> []
+  #   IntervalSet[0...4] * (1...0)  # -> []
   #
   #   # Convolve with a interval set
   #   IntervalSet[0...1, 10...12] * IntervalSet[-2...1, 1...2]  # -> [-2...3, 8...14]
@@ -509,7 +509,7 @@ class IntervalSet
   # Shifts this IntervalSet by the given amount.
   # The result is stored in this IntervalSet.
   #
-  #   IntervalSet[0...1].shift(1)    # -> [1...2]
+  #   IntervalSet[0...1].shift(1)   # -> [1...2]
   #
   # Note that +shift(0)+ will not be optimized since IntervalSet does
   # not assume numbers as element type.
@@ -528,7 +528,7 @@ class IntervalSet
   # Shifts this IntervalSet by the given amount.
   # The result is stored in a new IntervalSet.
   #
-  #   IntervalSet[0...1].shift!(1)   # -> [1...2]
+  #   IntervalSet[0...1].shift!(1)  # -> [1...2]
   #
   # Note that +shift!(0)+ will not be optimized since IntervalSet does
   # not assume numbers as element type.
@@ -567,11 +567,11 @@ class IntervalSet
   # Buffers this IntervalSet by adding a left and right margin to each range.
   # The result is stored in a new IntervalSet.
   #
-  #   IntervalSet[1...2].buffer(1, 2)        # -> [0...4]
+  #   IntervalSet[1...2].buffer(1, 2)       # -> [0...4]
   #
   #   # negative values will shrink the ranges
-  #   IntervalSet[0...4].buffer(-1, -2)      # -> [1...2]
-  #   IntervalSet[1...2].buffer(-0.5, -0.5)  # -> []
+  #   IntervalSet[0...4].buffer(-1, -2)     # -> [1...2]
+  #   IntervalSet[1...2].buffer(-0.5, -0.5) # -> []
   #
   # @param left [Object] margin added to the left side of each range.
   # @param right [Object] margin added to the right side of each range.

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: interval_set
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.1.1
 platform: ruby
 authors:
 - Rico Jasper
@@ -105,7 +105,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
-      version: '0'
+      version: 1.9.2
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="