range-set 1.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: dd2cdb9481ae14301f8e9725a6caafc29456fc31
+  data.tar.gz: e3ed01f972d39d322c6f454a79f029f38fd70e36
+SHA512:
+  metadata.gz: bb0c5c8346dd7f53f317cdad892403198a62b1c76ac591f9e88788b374d35ab7d6e1d85e4b86292a0262e124274ab5155e6eb818bf4e99c7f736f13f83b30003
+  data.tar.gz: 8da9e79940622f2f5340e9a0050d35cb8ecef7120bce7d8bcf6e23f9272b50c063d2e9cf0d6831f4a313c2fe678e44232862bafcfa220529163282ba8f3bd37c

data/Gemfile

@@ -0,0 +1,12 @@
+source "http://rubygems.org"
+
+gemspec
+
+group :development, :test do
+  gem 'rake'
+end
+
+group :test do
+  gem 'rspec'
+  gem 'rr'
+end

data/History.txt

@@ -0,0 +1,3 @@
+== 1.0.0
+
+* Birthday!

data/LICENSE

@@ -0,0 +1,177 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS

data/README.md

@@ -0,0 +1,93 @@
+
+## range-set [![Build Status](https://secure.travis-ci.org/camertron/range-set.png?branch=master)](http://travis-ci.org/camertron/range-set)
+
+RangeSet is an integer set, implemented under the hood with ranges. The idea is that it's more efficient to store sequential data in ranges rather than as single elements. By definition, RangeSets contain no duplicates.
+
+## Installation
+
+`gem install range-set`
+
+## Usage
+
+```ruby
+require 'range-set'
+```
+
+### Creating Range Sets
+
+Use the `from_array` or `new` methods to create RangeSets:
+
+```ruby
+set = RangeSet.from_array([1, 2, 3, 6, 7, 8, 11, 14, 17, 18, 19])
+set.to_a  # [1..3, 6..8, 11..11, 14..14, 17..19]
+```
+
+The `to_a` method takes a boolean argument that determines whether or not to turn isolated elements into zero-length ranges or leave them as single elements:
+
+```ruby
+set = RangeSet.from_array([1, 2, 3, 6, 7, 8, 11, 14, 17, 18, 19])
+set.to_a(true)  # [1..3, 6..8, 11, 14, 17..19]
+```
+
+### Union
+
+Combining two RangeSets:
+
+```ruby
+set = RangeSet.new([3..10]).union(
+  RangeSet.new([9..11, 1..2, 2..3, 14..18])
+)
+
+set.to_a  # [1..11, 14..18]
+```
+
+### Intersection
+
+Finding the elements common to two RangeSets:
+
+```ruby
+set = RangeSet.new([3..10]).intersection(RangeSet.new([1..7]))
+set.to_a  # [3..7]
+```
+
+### Subtract
+
+Removing the elements contained in one RangeSet from another:
+
+```ruby
+set = RangeSet.new([3..10]).subtract(RangeSet.new([1..5]))
+set.to_a  # [6..10]
+```
+
+### Difference
+
+The difference here means the symmetric difference (i.e. the union without the intersection)
+[http://en.wikipedia.org/wiki/Symmetric_difference](http://en.wikipedia.org/wiki/Symmetric_difference)
+
+```ruby
+set = RangeSet.new([1..10]).difference(RangeSet.new([3..8]))
+set.to_a  # [1..2, 9..10]
+```
+
+### Include
+
+```ruby
+set = RangeSet.new([1..5, 9..16])
+
+set.include?(4)       # true
+set.include?(6)       # false
+set.include?(10..15)  # true
+set.include?(4..6)    # false
+```
+
+## Requirements
+
+No external requirements.
+
+## Running Tests
+
+`bundle exec rake` or `bundle exec rspec`
+
+## License
+
+Licensed under the Apache License, Version 2.0: http://www.apache.org/licenses/LICENSE-2.0

data/Rakefile

@@ -0,0 +1,19 @@
+# encoding: UTF-8
+
+require 'rubygems' unless ENV['NO_RUBYGEMS']
+
+require 'bundler'
+
+require 'rspec/core/rake_task'
+require 'rubygems/package_task'
+
+require './lib/range-set'
+
+Bundler::GemHelper.install_tasks
+
+task :default => :spec
+
+desc 'Run specs'
+RSpec::Core::RakeTask.new do |t|
+  t.pattern = './spec/**/*_spec.rb'
+end

data/lib/range-set.rb

@@ -0,0 +1,234 @@
+# encoding: UTF-8
+
+require 'set'
+
+# An integer set, implemented under the hood with ranges. The idea is
+# that it's more efficient to store sequential data in ranges rather
+# than as single elements. By definition, RangeSets contain no duplicates.
+class RangeSet
+
+  attr_reader :ranges
+
+  class << self
+
+    def from_array(array)
+      new(rangify(array))
+    end
+
+    # Turns an array of integers into ranges. The "compress" option indicates
+    # whether or not to turn isolated elements into zero-length ranges or leave
+    # them as single elements.
+    #
+    # For example:
+    # rangify([1, 2, 4], false) returns [1..2, 4..4]
+    # rangify([1, 2, 4], true) returns [1..2, 4]
+    def rangify(list, compress = false)
+      last_item = nil
+
+      list.sort.inject([]) do |ret, item|
+        if last_item
+          diff = item - last_item
+
+          if diff > 0
+            if diff == 1
+              ret[-1] << item
+            else
+              ret << [item]
+            end
+
+            last_item = item
+          end
+        else
+          ret << [item]
+          last_item = item
+        end
+
+        ret
+      end.map do |sub_list|
+        if compress && sub_list.size == 1
+          sub_list.first
+        else
+          sub_list.first..sub_list.last
+        end
+      end
+    end
+
+  end
+
+  def initialize(ranges)
+    @ranges = ranges
+    flatten
+  end
+
+  def to_a(compress = false)
+    if compress
+      ranges.map do |range|
+        if range.first == range.last
+          range.first
+        else
+          range
+        end
+      end
+    else
+      ranges.dup
+    end
+  end
+
+  def to_full_a
+    ranges.inject([]) do |ret, range|
+      ret + range.to_a
+    end
+  end
+
+  def to_set
+    Set.new(to_full_a)
+  end
+
+  def include?(obj)
+    case obj
+      when Numeric
+        ranges.any? { |range| range.include?(obj) }
+      when Range
+        ranges.any? do |range|
+          range.first <= obj.first && range.last >= obj.last
+        end
+      else
+        false
+    end
+  end
+
+  def empty?
+    ranges.empty?
+  end
+
+  def union(range_set)
+    self.class.new(range_set.ranges + ranges)
+  end
+
+  def intersection(range_set)
+    new_ranges = []
+
+    range_set.ranges.each do |their_range|
+      ranges.each do |our_range|
+        if overlap?(their_range, our_range)
+          if intrsc = find_intersection(our_range, their_range)
+            new_ranges << intrsc
+          end
+        end
+      end
+    end
+
+    self.class.new(new_ranges)
+  end
+
+  def subtract(range_set)
+    return self if range_set.empty?
+    remaining = range_set.ranges.dup
+    current_ranges = ranges.dup
+    new_ranges = []
+
+    while their_range = remaining.shift
+      new_ranges = []
+
+      current_ranges.each do |our_range|
+        if overlap?(their_range, our_range)
+          new_ranges += find_subtraction(their_range, our_range)
+        else
+          new_ranges << our_range
+        end
+      end
+
+      current_ranges = new_ranges
+    end
+
+    self.class.new(new_ranges)
+  end
+
+  # symmetric difference (the union without the intersection)
+  # http://en.wikipedia.org/wiki/Symmetric_difference
+  def difference(range_set)
+    union(range_set).subtract(intersection(range_set))
+  end
+
+  private
+
+  def flatten
+    return if ranges.size <= 1
+
+    sorted_ranges = ranges.sort do |a, b|
+      if is_numeric_range?(a) && is_numeric_range?(b)
+        a.first <=> b.first
+      else
+        1
+      end
+    end
+
+    new_ranges = [sorted_ranges.first]
+
+    sorted_ranges.each do |range|
+      previous_range = new_ranges.pop
+
+      if adjacent?(previous_range, range) || overlap?(previous_range, range)
+        new_ranges.push(
+          [range.first, previous_range.first].min..[range.last, previous_range.last].max
+        )
+      else
+        new_ranges.push(previous_range)
+        new_ranges.push(range)
+      end
+    end
+
+    @ranges = new_ranges
+  end
+
+  # returns true if range1 and range2 are within 1 of each other
+  def adjacent?(range1, range2)
+    is_numeric_range?(range1) && is_numeric_range?(range2) &&
+      (range1.last == range2.first - 1 || range2.first == range1.last + 1)
+  end
+
+  def overlap?(range1, range2)
+    is_numeric_range?(range1) && is_numeric_range?(range2) && (
+      (range1.last >= range2.first && range1.last <= range2.last) ||
+      (range1.first >= range2.first && range1.first <= range2.last) ||
+      (range1.first <= range2.first && range1.last >= range2.last)
+    )
+  end
+
+  def find_intersection(range1, range2)
+    # range2 entirely contains range1
+    if range2.first <= range1.first && range1.last <= range2.last
+      range1.dup
+    elsif range1.last >= range2.first && range1.last <= range2.last
+      range2.first..range1.last
+    elsif range1.first >= range2.first && range1.first <= range2.last
+      range1.first..range2.last
+    elsif range1.first <= range2.first && range1.last >= range2.last
+      [range1.first, range2.first].max..[range1.last, range2.last].min
+    end
+  end
+
+  # subtracts range1 from range2 (range2 - range1)
+  def find_subtraction(range1, range2)
+    # case: range1 contains range2 entirely (also handles equal case)
+    result = if range1.first <= range2.first && range2.last <= range1.last
+      []
+    # case: range1 comes in the middle
+    elsif range2.first <= range1.first && range2.last >= range1.last
+      [range2.first..(range1.first - 1), (range1.last + 1)..range2.last]
+    # case: range1 trails
+    elsif range2.last >= range1.first && range1.last >= range2.last
+      [range2.first..(range1.first - 1)]
+    # case: range1 leads
+    elsif range1.last >= range2.first && range1.first <= range2.first
+      [(range1.last + 1)..range2.last]
+    end
+
+    result.reject { |r| r.first > r.last }
+  end
+
+  def is_numeric_range?(range)
+    range.first.is_a?(Numeric) && range.last.is_a?(Numeric)
+  end
+
+end

data/lib/range-set/version.rb

@@ -0,0 +1,5 @@
+# encoding: UTF-8
+
+class RangeSet
+  VERSION = "1.0.0"
+end

data/range-set.gemspec

@@ -0,0 +1,18 @@
+$:.unshift File.join(File.dirname(__FILE__), 'lib')
+require 'range-set/version'
+
+Gem::Specification.new do |s|
+  s.name     = "range-set"
+  s.version  = ::RangeSet::VERSION
+  s.authors  = ["Cameron Dutro"]
+  s.email    = ["camertron@gmail.com"]
+  s.homepage = "http://github.com/camertron"
+
+  s.description = s.summary = "An efficient set implementation that treats runs of sequential elements as ranges."
+
+  s.platform = Gem::Platform::RUBY
+  s.has_rdoc = true
+
+  s.require_path = 'lib'
+  s.files = Dir["{lib,spec}/**/*", "Gemfile", "History.txt", "LICENSE", "README.md", "Rakefile", "range-set.gemspec"]
+end

data/spec/range-set_spec.rb

@@ -0,0 +1,166 @@
+# encoding: UTF-8
+
+require 'spec_helper'
+
+describe RangeSet do
+  describe "rangify" do
+    it "should identify runs in an array of integers and return an array of ranges" do
+      expect(RangeSet.rangify([1, 2, 3, 6, 7, 8, 11, 14, 17, 18, 19])).
+        to eq([1..3, 6..8, 11..11, 14..14, 17..19])
+    end
+
+    it "should not rangify zero-length values when told to compress" do
+      expect(RangeSet.rangify([1, 2, 3, 5, 8, 11, 12], true)).
+        to eq([1..3, 5, 8, 11..12])
+    end
+  end
+
+  describe "#to_a" do
+    it "should return a copy of the ranges in the set" do
+      set = RangeSet.new([1..10])
+      expect(set.to_a.object_id).not_to eq(set.ranges.object_id)
+    end
+
+    it "should return compressed ranges when asked" do
+      expect(RangeSet.new([1..10, 12..12]).to_a(true)).to eq([1..10, 12])
+    end
+  end
+
+  describe "#to_full_a" do
+    it "expands all ranges" do
+      expect(RangeSet.new([1..5]).to_full_a).to eq([1, 2, 3, 4, 5])
+    end
+  end
+
+  describe "#new" do
+    it "should flatten leading overlapping ranges" do
+      expect(RangeSet.new([3..10, 1..8]).to_a).to eq([1..10])
+    end
+
+    it "should flatten trailing overlapping ranges" do
+      expect(RangeSet.new([1..10, 8..12]).to_a).to eq([1..12])
+    end
+
+    it "should flatten completely overlapping ranges" do
+      expect(RangeSet.new([2..3, 1..10]).to_a).to eq([1..10])
+    end
+
+    it "should join ranges that are within 1 of each other" do
+      expect(RangeSet.new([1..10, 11..15]).to_a).to eq([1..15])
+    end
+  end
+
+  describe "#union" do
+    it "should aggregate the ranges and flatten when necessary" do
+      set = RangeSet.new([3..10]).union(
+        RangeSet.new([9..11, 1..2, 2..3, 14..18])
+      )
+
+      expect(set.to_a).to eq([1..11, 14..18])
+    end
+
+    it "should aggregate the ranges correctly even if they're given in reverse order" do
+      set = RangeSet.new([3..10]).union(RangeSet.new([1..4]))
+      expect(set.to_a).to eq([1..10])
+
+      set = RangeSet.new([1..4]).union(RangeSet.new([3..10]))
+      expect(set.to_a).to eq([1..10])
+    end
+  end
+
+  describe "#intersection" do
+    it "computes the intersection for leading overlapping ranges" do
+      set = RangeSet.new([3..10]).intersection(RangeSet.new([1..7]))
+      expect(set.to_a).to eq([3..7])
+    end
+
+    it "computes the intersection for trailing overlapping ranges" do
+      set = RangeSet.new([1..10]).intersection(RangeSet.new([5..15]))
+      expect(set.to_a).to eq([5..10])
+    end
+
+    it "computes the intersection for two completely overlapping ranges" do
+      set = RangeSet.new([1..10]).intersection(RangeSet.new([3..6]))
+      expect(set.to_a).to eq([3..6])
+    end
+
+    it "returns an empty intersection if no elements exist in both ranges" do
+      set = RangeSet.new([1..10]).intersection(RangeSet.new([15..20]))
+      expect(set.to_a).to eq([])
+    end
+
+    it "returns partial intersections when the range set contains multiple matching ranges" do
+      set = RangeSet.new([1..5, 7..10]).intersection(RangeSet.new([3..8]))
+      expect(set.to_a).to eq([3..5, 7..8])
+    end
+
+    it "doesn't matter what order the ranges are compared in" do
+      set = RangeSet.new([2..3]).intersection(RangeSet.new([1..4]))
+      expect(set.to_a).to eq([2..3])
+
+      set = RangeSet.new([1..4]).intersection(RangeSet.new([2..3]))
+      expect(set.to_a).to eq([2..3])
+    end
+  end
+
+  describe "#subtract" do
+    it "subtracts the intersection for leading overlapping ranges" do
+      set = RangeSet.new([3..10]).subtract(RangeSet.new([1..5]))
+      expect(set.to_a).to eq([6..10])
+    end
+
+    it "subtracts the intersection for trailing overlapping ranges" do
+      set = RangeSet.new([1..7]).subtract(RangeSet.new([3..9]))
+      expect(set.to_a).to eq([1..2])
+    end
+
+    it "subtracts the intersection for completely overlapping ranges (generates two ranges)" do
+      set = RangeSet.new([1..10]).subtract(RangeSet.new([4..6]))
+      expect(set.to_a).to eq([1..3, 7..10])
+    end
+
+    it "subtracts the intersection when the range set contians multiple matching ranges" do
+      set = RangeSet.new([1..5, 7..10]).subtract(RangeSet.new([3..8]))
+      expect(set.to_a).to eq([1..2, 9..10])
+    end
+
+    it "does not change object when subtracting an empty set" do
+      set = RangeSet.new([1..5]).subtract(RangeSet.new([]))
+      expect(set.to_a).to eq([1..5])
+    end
+  end
+
+  describe "#difference" do
+    it "returns the symmetric difference (union - intersection) between completely overlapping ranges" do
+      set = RangeSet.new([1..10]).difference(RangeSet.new([3..8]))
+      expect(set.to_a).to eq([1..2, 9..10])
+    end
+
+    it "returns the symmetric difference between leading overlapping ranges" do
+      set = RangeSet.new([3..10]).difference(RangeSet.new([1..5]))
+      expect(set.to_a).to eq([1..2, 6..10])
+    end
+
+    it "returns the symmetric difference between trailing overlapping ranges" do
+      set = RangeSet.new([1..5]).difference(RangeSet.new([3..8]))
+      expect(set.to_a).to eq([1..2, 6..8])
+    end
+  end
+
+  describe "#include?" do
+    let (:set) { RangeSet.new([1..5, 9..16]) }
+
+    it "returns true if the set completely includes the range, false otherwise" do
+      expect(set).to include(10..15)
+      expect(set).not_to include(3..8)
+      expect(set).not_to include(8..14)
+    end
+
+    it "returns true if the set contains the value, false otherwise" do
+      expect(set).to include(3)
+      expect(set).to include(10)
+      expect(set).not_to include(6)
+      expect(set).not_to include(8)
+    end
+  end
+end

data/spec/spec_helper.rb

@@ -0,0 +1,8 @@
+# encoding: UTF-8
+
+require 'rspec'
+require 'range-set'
+
+RSpec.configure do |config|
+  config.mock_with :rr
+end

metadata

@@ -0,0 +1,55 @@
+--- !ruby/object:Gem::Specification
+name: range-set
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+platform: ruby
+authors:
+- Cameron Dutro
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-06-20 00:00:00.000000000 Z
+dependencies: []
+description: An efficient set implementation that treats runs of sequential elements
+  as ranges.
+email:
+- camertron@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- Gemfile
+- History.txt
+- LICENSE
+- README.md
+- Rakefile
+- lib/range-set.rb
+- lib/range-set/version.rb
+- range-set.gemspec
+- spec/range-set_spec.rb
+- spec/spec_helper.rb
+homepage: http://github.com/camertron
+licenses: []
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.2.2
+signing_key: 
+specification_version: 4
+summary: An efficient set implementation that treats runs of sequential elements as
+  ranges.
+test_files: []