diff_set 0.0.2

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: deaf2800e3064f34e2e8b253ddec8cae53d29951
+  data.tar.gz: d61484cba1501f4f453996829e2347698b28b77a
+SHA512:
+  metadata.gz: 74d052ee5da4650f47ab40a1d491cc14678597b76a4110368daf09b85680de9cf075077a7d16c86e46fe359d0c14797b8f2ff2e8313c6d8b0c2429384992f360
+  data.tar.gz: 80e99fa750b79cae19630c94bb337425b62a2bd2b3f2452a0b7359ce2db5bb0c96574b23141178e079c2eb3b3995815b4012aa23ad06b0ffdde96a71828fa6f2

data/.gitignore

@@ -0,0 +1,24 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp
+.DS_Store
+.rvmrc
+.ruby-version
+*.o
+Makefile
+*.bundle
+*.so

data/.rspec

@@ -0,0 +1,2 @@
+--color
+--format progress

data/Gemfile

@@ -0,0 +1,2 @@
+source 'https://rubygems.org'
+gemspec

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2014 Michael Parrish
+
+MIT License
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,46 @@
+# DiffSet
+
+DiffSet contains a collection of data structures optimized to perform partial set subtractions.
+
+- `DiffSet::RandomSet` Produces a randomized set difference
+
+- `DiffSet::PrioritySet` Produces an ordered set difference
+
+- `DiffSet::PairwiseRandomSet` Presents a random set difference as a list of pairs
+
+- `DiffSet::PairwisePrioritySet` Presents an ordered set difference as a list of pairs
+
+## Installation
+
+1. Install [Boost](http://www.boost.org/):
+
+  - OS X: `brew update && brew install boost`
+  
+  - Ubuntu: `sudo apt-get update && sudo apt-get install libboost-all-dev`
+
+3. Add this line to your application's Gemfile: `gem 'diff_set'`
+
+4. And then execute: `bundle`
+
+To install rice **Ruby must be compiled with shared libraries enabled**
+
+  - rvm:   `rvm reinstall [version] -- --enable-shared`
+
+  - rbenv: `CONFIGURE_OPTS="--enable-shared" rbenv install [version]`
+
+
+## Usage
+
+The API is pretty straightforward, and [the specs](https://github.com/parrish/diff_set/tree/master/spec) have examples.
+
+## Testing
+
+Run the specs with `rake`
+
+## Contributing
+
+1. Fork it ( http://github.com/parrish/diff_set/fork )
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create new Pull Request

data/Rakefile

@@ -0,0 +1,20 @@
+require 'bundler/gem_tasks'
+require 'rake/extensiontask'
+require 'rspec/core/rake_task'
+require 'rubygems/package_task'
+
+GEMSPEC = Gem::Specification.load 'diff_set.gemspec'
+
+Gem::PackageTask.new(GEMSPEC) do |pkg|
+  pkg.need_zip = true
+  pkg.need_tar = true
+end
+
+Rake::ExtensionTask.new('diff_set_ext', GEMSPEC) do |ext|
+  ext.ext_dir = 'ext/diff_set'
+  ext.lib_dir = 'lib/diff_set'
+  ext.source_pattern = '*.{h,cpp}'
+end
+
+RSpec::Core::RakeTask.new :spec
+task default: [:compile, :spec]

data/diff_set.gemspec

@@ -0,0 +1,28 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'diff_set/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = 'diff_set'
+  spec.version       = DiffSet::VERSION
+  spec.authors       = ['Michael Parrish']
+  spec.email         = ['michael@zooniverse.org']
+  spec.summary       = 'DiffSet contains a collection of data structures optimized to perform partial set subtractions'
+  spec.description   = ''
+  spec.homepage      = 'https://github.com/parrish/diff_set'
+  spec.license       = 'MIT'
+  
+  spec.files         = `git ls-files -z`.split("\x0")
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ['lib']
+  spec.extensions    = ['ext/diff_set/extconf.rb']
+  
+  spec.add_development_dependency 'bundler', '~> 1.5'
+  spec.add_development_dependency 'rake'
+  spec.add_development_dependency 'rake-compiler', '~> 0.9.2'
+  spec.add_development_dependency 'rspec'
+  spec.add_development_dependency 'pry'
+  spec.add_runtime_dependency 'rice', '~> 1.6'
+end

data/ext/diff_set/diff_set_ext.cpp

@@ -0,0 +1,39 @@
+#include "rice/Class.hpp"
+#include "rice/Module.hpp"
+#include "rice/ruby_try_catch.hpp"
+#include "rice/Data_Type.hpp"
+#include "rice/Constructor.hpp"
+using namespace Rice;
+
+#include "random_set.h"
+#include "priority_set.h"
+
+extern "C"
+void Init_diff_set_ext() {
+  RUBY_TRY
+  {
+    Module rb_mDiffSet = define_module("DiffSet");
+    
+    Data_Type<RandomSet> rb_cRandomSet = define_class_under<RandomSet>(rb_mDiffSet, "RandomSet")
+      .define_constructor(Constructor<RandomSet>())
+      .define_method("add", &RandomSet::add, (Arg("id"), Arg("priority") = 0.0))
+      .define_method("remove", &RandomSet::remove)
+      .define_method("sample", &RandomSet::sample)
+      .define_method("subtract", &RandomSet::subtract)
+      .define_method("include?", &RandomSet::includes)
+      .define_method("to_a", &RandomSet::to_a)
+      .define_method("size", &RandomSet::size);
+    
+    Data_Type<PrioritySet> rb_cPrioritySet = define_class_under<PrioritySet>(rb_mDiffSet, "PrioritySet")
+      .define_constructor(Constructor<PrioritySet>())
+      .define_method("add", &PrioritySet::add, (Arg("id"), Arg("priority") = 0.0))
+      .define_method("remove", &PrioritySet::remove)
+      .define_method("sample", &PrioritySet::sample)
+      .define_method("subtract", &PrioritySet::subtract)
+      .define_method("include?", &PrioritySet::includes)
+      .define_method("to_a", &PrioritySet::to_a)
+      .define_method("to_h", &PrioritySet::to_h)
+      .define_method("size", &PrioritySet::size);
+  }
+  RUBY_CATCH
+}

data/ext/diff_set/extconf.rb

@@ -0,0 +1,4 @@
+require 'mkmf-rice'
+
+extension_name = 'diff_set'
+create_makefile 'diff_set/diff_set_ext'

data/ext/diff_set/priority_set.cpp

@@ -0,0 +1,99 @@
+#include "priority_set.h"
+
+PrioritySet::PrioritySet() {
+  timeval time;
+  gettimeofday(&time, NULL);
+  long millis = (time.tv_sec * 1000.0) + (time.tv_usec / 1000.0);
+  this->rng.seed((uint)millis);
+}
+
+void PrioritySet::add(int id, double priority) {
+  if(includes(id)) {
+    element_handle handle = this->element_handles[id];
+    (*handle).priority = priority;
+    this->heap.update(handle);
+    return;
+  }
+  
+  static boost::uniform_01<boost::random::mt19937> dist(this->rng);
+  element_handle handle = this->heap.push(element(id, priority, dist()));
+  this->element_handles.insert(std::make_pair<int, element_handle>(id, handle));
+  this->element_set.insert(id);
+}
+
+void PrioritySet::remove(int id) {
+  boost::unordered_set<int>::iterator set_it = this->element_set.find(id);
+  
+  if(set_it != this->element_set.end()) {
+    this->element_set.erase(set_it);
+    element_handle handle = this->element_handles[id];
+    (*handle).priority = std::numeric_limits<int>::min();
+    (*handle).enabled = false;
+    this->heap.decrease(handle);
+  }
+}
+
+Array PrioritySet::sample(int limit) {
+  Array sampled;
+  fibonacci_heap::ordered_iterator it;
+  
+  for(it = this->heap.ordered_begin(); it != this->heap.ordered_end(); it++) {
+    if(it->enabled) {
+      sampled.push(it->id);
+      if(sampled.size() >= (size_t)limit) {
+        break;
+      }
+    }
+  }
+  
+  return sampled;
+}
+
+bool PrioritySet::includes(int id) {
+  boost::unordered_set<int>::const_iterator it;
+  it = this->element_set.find(id);
+  return it != this->element_set.end();
+}
+
+Array PrioritySet::subtract(RandomSet &other, size_t limit) {
+  Array diff;
+  fibonacci_heap::ordered_iterator it;
+  boost::unordered_set<int>::const_iterator in_other;
+  
+  for(it = this->heap.ordered_begin(); it != this->heap.ordered_end(); it++) {
+    if(it->enabled && other.element_set.find(it->id) == other.element_set.end()) {
+      diff.push(it->id);
+      if(diff.size() >= limit) {
+        break;
+      }
+    }
+  }
+  
+  return diff;
+}
+
+Array PrioritySet::to_a() {
+  Array array;
+  fibonacci_heap::ordered_iterator it;
+  for(it = this->heap.ordered_begin(); it != this->heap.ordered_end(); it++) {
+    if(it->enabled) {
+      array.push(it->id);
+    }
+  }
+  return array;
+}
+
+Hash PrioritySet::to_h() {
+  Hash hash;
+  fibonacci_heap::ordered_iterator it;
+  for(it = this->heap.ordered_begin(); it != this->heap.ordered_end(); it++) {
+    if(it->enabled) {
+      hash[it->id] = it->priority;
+    }
+  }
+  return hash;
+}
+
+size_t PrioritySet::size() {
+  return this->element_set.size();
+}

data/ext/diff_set/priority_set.h

@@ -0,0 +1,59 @@
+#ifndef PRIORITY_SET_H
+#define PRIORITY_SET_H
+
+#include "rice/Object.hpp"
+#include "rice/Array.hpp"
+#include "rice/Hash.hpp"
+using namespace Rice;
+
+#include <boost/random.hpp>
+#include <boost/heap/fibonacci_heap.hpp>
+#include <boost/unordered_set.hpp>
+#include <boost/unordered_map.hpp>
+
+#include <sys/time.h>
+#include <limits>
+
+#include "random_set.h"
+
+class PrioritySet {
+public:
+  struct element {
+    int id;
+    double priority;
+    double random;
+    bool enabled;
+    
+    element(int id, double priority, double random) {
+      enabled = true;
+      this->id = id;
+      this->priority = priority;
+      this->random = random;
+    }
+  };
+  
+  struct comparator {
+    bool operator()(const element &a, const element &b) const {
+      return (a.priority < b.priority) || (a.priority == b.priority && a.random < b.random);
+    }
+  };
+  
+  PrioritySet();
+  void add(int id, double priority = 0.0);
+  void remove(int id);
+  Array sample(int limit);
+  bool includes(int id);
+  Array subtract(RandomSet &other, size_t limit);
+  Array to_a();
+  Hash to_h();
+  size_t size();
+protected:
+  typedef boost::heap::fibonacci_heap<element, boost::heap::compare<comparator> > fibonacci_heap;
+  typedef fibonacci_heap::handle_type element_handle;
+  fibonacci_heap heap;
+  boost::unordered_map<int, element_handle > element_handles;
+  boost::unordered_set<int> element_set;
+  boost::random::mt19937 rng;
+};
+
+#endif

data/ext/diff_set/random_set.cpp

@@ -0,0 +1,108 @@
+#include "random_set.h"
+
+RandomSet::RandomSet() {
+  timeval time;
+  gettimeofday(&time, NULL);
+  long millis = (time.tv_sec * 1000.0) + (time.tv_usec / 1000.0);
+  this->rng.seed((uint)millis);
+}
+
+void RandomSet::add(int element, double priority) {
+  this->element_set.insert(element);
+  this->elements.push_back(element);
+}
+
+void RandomSet::remove(int element) {
+  boost::unordered_set<int>::iterator set_it = this->element_set.find(element);
+  
+  if(set_it != this->element_set.end()) {
+    this->element_set.erase(set_it);
+    
+    std::vector<int>::iterator it = iterator_to(element);
+    if(it != this->elements.end()) {
+      this->elements.erase(it);
+    }
+  }
+}
+
+Array RandomSet::sample(int limit) {
+  Array sampled;
+  int swapIndex;
+  int tmp;
+  int upper_bound = (int)this->elements.size() - 1;
+  boost::random::uniform_int_distribution<> dist;
+  
+  for(int i = 0; i < limit && i < (int)this->elements.size(); i++) {
+    dist = boost::random::uniform_int_distribution<>(std::min(i + 1, upper_bound), upper_bound);
+    swapIndex = dist(rng);
+    tmp = this->elements[i];
+    this->elements[i] = this->elements[swapIndex];
+    this->elements[swapIndex] = tmp;
+    sampled.push(this->elements[i]);
+  }
+  
+  return sampled;
+}
+
+bool RandomSet::includes(int element) {
+  boost::unordered_set<int>::const_iterator it;
+  it = this->element_set.find(element);
+  return it != this->element_set.end();
+}
+
+std::vector<int>::iterator RandomSet::iterator_to(int element) {
+  std::vector<int>::iterator it;
+  for(it = this->elements.begin(); it != this->elements.end(); it++) {
+    if(element == *it) {
+      return it;
+    }
+  }
+  
+  return this->elements.end();
+}
+
+Array RandomSet::subtract(RandomSet &other, size_t limit) {
+  Array diff;
+  int element;
+  int swapIndex;
+  int tmp;
+  int upper_bound = (int)this->elements.size() - 1;
+  
+  boost::unordered_set<int>::const_iterator in_other;
+  boost::random::uniform_int_distribution<> dist;
+  
+  for(int i = 0; i < (int)this->elements.size(); i++) {
+    dist = boost::random::uniform_int_distribution<>(std::min(i + 1, upper_bound), upper_bound);
+    swapIndex = dist(rng);
+    tmp = this->elements[i];
+    this->elements[i] = this->elements[swapIndex];
+    this->elements[swapIndex] = tmp;
+    
+    element = this->elements[i];
+    in_other = other.element_set.find(element);
+    
+    if(in_other == other.element_set.end()) {
+      diff.push(element);
+      if(diff.size() >= limit) {
+        break;
+      }
+    }
+  }
+  
+  return diff;
+}
+
+Array RandomSet::to_a() {
+  Array array;
+  
+  std::vector<int>::iterator it;
+  for(it = this->elements.begin(); it != this->elements.end(); it++) {
+    array.push(*it);
+  }
+  
+  return array;
+}
+
+size_t RandomSet::size() {
+  return this->elements.size();
+}

data/ext/diff_set/random_set.h

@@ -0,0 +1,33 @@
+#ifndef RANDOM_SET_H
+#define RANDOM_SET_H
+
+#include "rice/Object.hpp"
+#include "rice/Array.hpp"
+using namespace Rice;
+
+#include <boost/random/mersenne_twister.hpp>
+#include <boost/random/uniform_int_distribution.hpp>
+#include <boost/unordered_set.hpp>
+
+#include <vector>
+#include <sys/time.h>
+
+class RandomSet {
+public:
+  RandomSet();
+  void add(int element, double priority = 0.0);
+  void remove(int element);
+  Array sample(int limit);
+  bool includes(int element);
+  Array subtract(RandomSet &other, size_t limit);
+  Array to_a();
+  size_t size();
+  boost::unordered_set<int> element_set;
+protected:
+  std::vector<int> elements;
+  boost::random::mt19937 rng;
+  
+  std::vector<int>::iterator iterator_to(int element);
+};
+
+#endif

data/lib/diff_set/pairwise.rb

@@ -0,0 +1,23 @@
+module DiffSet
+  module Pairwise
+    def self.included(klass)
+      klass.class_eval do
+        alias_method :_c_subtract, :subtract
+        def subtract(set, limit)
+          _in_pairs _c_subtract(set, 2 * limit)
+        end
+        
+        alias_method :_c_sample, :sample
+        def sample(limit)
+          _in_pairs _c_sample(2 * limit)
+        end
+      end
+    end
+    
+    protected
+    
+    def _in_pairs(list)
+      list.each_slice(2).to_a.reject{ |pair| pair.length != 2 }
+    end
+  end
+end

data/lib/diff_set/pairwise_priority_set.rb

@@ -0,0 +1,5 @@
+module DiffSet
+  class PairwisePrioritySet < PrioritySet
+    include Pairwise
+  end
+end

data/lib/diff_set/pairwise_random_set.rb

@@ -0,0 +1,5 @@
+module DiffSet
+  class PairwiseRandomSet < RandomSet
+    include Pairwise
+  end
+end

data/lib/diff_set/version.rb

@@ -0,0 +1,3 @@
+module DiffSet
+  VERSION = '0.0.2'
+end

data/lib/diff_set.rb

@@ -0,0 +1,10 @@
+require 'diff_set/version'
+require 'diff_set/diff_set_ext'
+
+require 'diff_set/pairwise'
+require 'diff_set/pairwise_random_set'
+require 'diff_set/pairwise_priority_set'
+
+module DiffSet
+  
+end

data/spec/pairwise_priority_set_spec.rb

@@ -0,0 +1,53 @@
+require 'spec_helper'
+
+module DiffSet
+  describe PairwisePrioritySet do
+    it_behaves_like 'a set'
+    
+    let(:set) do
+      ids = (1..5).to_a
+      priorities = ids.reverse
+      
+      PairwisePrioritySet.new.tap do |priority_set|
+        ids.zip(priorities).each{ |id, priority| priority_set.add id, priority }
+      end
+    end
+    
+    let(:other_set) do
+      RandomSet.new.tap do |random_set|
+        1.upto(3).each{ |i| random_set.add i }
+      end
+    end
+    
+    it 'should sample elements in order' do
+      set.sample(2).should == [[1, 2], [3, 4]]
+      set.sample(3).length.should == 2
+    end
+    
+    it 'should not include removed elements in subtractions' do
+      set.add 6, 0
+      set.subtract(other_set, 5).flatten.should == [4, 5]
+      set.remove 5
+      set.subtract(other_set, 5).flatten.should == [4, 6]
+    end
+    
+    it 'should subtract another set' do
+      set.subtract(other_set, 5).length.should == 1
+      set.subtract(other_set, 5).first.should == [4, 5]
+    end
+    
+    it 'should always return pairs' do
+      6.upto(8).each{ |i| set.add i, rand }
+      set.subtract(other_set, 3).each{ |pair| pair.length.should == 2 }
+    end
+    
+    it 'should update the priority' do
+      set.to_a.first.should == 1
+      set.to_h[1].should be_within(0.1).of(5)
+      set.add 1, 0
+      set.to_a.first.should == 2
+      set.to_a.last.should == 1
+      set.to_h[1].should be_within(0.1).of(0)
+    end
+  end
+end

data/spec/pairwise_random_set_spec.rb

@@ -0,0 +1,50 @@
+require 'spec_helper'
+
+module DiffSet
+  describe PairwiseRandomSet do
+    it_behaves_like 'a set'
+    
+    def create_set(elements)
+      PairwiseRandomSet.new.tap do |random_set|
+        1.upto(elements).each{ |i| random_set.add i }
+      end
+    end
+    
+    let(:set){ create_set(5) }
+    let(:other_set){ create_set(3) }
+    
+    it 'should sample pairs of elements' do
+      set.sample(2).collect(&:length).should == [2, 2]
+      set.sample(3).length.should == 2
+    end
+    
+    it 'should not include removed elements in subtractions' do
+      set.remove 5
+      set.subtract(other_set, 5).flatten.should_not include 5
+    end
+    
+    it 'should subtract another set' do
+      set.subtract(other_set, 5).length.should == 1
+      set.subtract(other_set, 5).first.should =~ [4, 5]
+    end
+    
+    it 'should always return pairs' do
+      6.upto(8).each{ |i| set.add i }
+      set.subtract(other_set, 3).each{ |pair| pair.length.should == 2 }
+    end
+    
+    it 'should mutate the order of the elements when sampling' do
+      set_before = set.to_a
+      set.sample 5
+      set_before.should =~ set.to_a
+      set_before.should_not == set.to_a
+    end
+    
+    it 'should mutate the order of the elements on a subtraction' do
+      set_before = set.to_a
+      set.subtract other_set, 5
+      set_before.should =~ set.to_a
+      set_before.should_not == set.to_a
+    end
+  end
+end

data/spec/priority_set_spec.rb

@@ -0,0 +1,45 @@
+require 'spec_helper'
+
+module DiffSet
+  describe PrioritySet do
+    it_behaves_like 'a set'
+    
+    let(:set) do
+      ids = (1..5).to_a
+      priorities = ids.reverse
+      
+      PrioritySet.new.tap do |priority_set|
+        ids.zip(priorities).each{ |id, priority| priority_set.add id, priority }
+      end
+    end
+    
+    let(:other_set) do
+      RandomSet.new.tap do |random_set|
+        1.upto(3).each{ |i| random_set.add i }
+      end
+    end
+    
+    it 'should sample elements in order' do
+      set.sample(5).should == (1..5).to_a
+    end
+    
+    it 'should subtract another set' do
+      set.subtract(other_set, 5).should == [4, 5]
+      set.subtract(other_set, 1).first.should == 4
+    end
+    
+    it 'should not include removed elements in subtractions' do
+      set.remove 5
+      set.subtract(other_set, 5).should == [4]
+    end
+    
+    it 'should update the priority' do
+      set.to_a.first.should == 1
+      set.to_h[1].should be_within(0.1).of(5)
+      set.add 1, 0
+      set.to_a.first.should == 2
+      set.to_a.last.should == 1
+      set.to_h[1].should be_within(0.1).of(0)
+    end
+  end
+end

data/spec/random_set_spec.rb

@@ -0,0 +1,40 @@
+require 'spec_helper'
+
+module DiffSet
+  describe RandomSet do
+    it_behaves_like 'a set'
+    
+    def create_set(elements)
+      RandomSet.new.tap do |random_set|
+        1.upto(elements).each{ |i| random_set.add i }
+      end
+    end
+    
+    let(:set){ create_set(5) }
+    let(:other_set){ create_set(3) }
+    
+    it 'should subtract another set' do
+      set.subtract(other_set, 5).should =~ [4, 5]
+      [4, 5].should include set.subtract(other_set, 1).first
+    end
+    
+    it 'should not include removed elements in subtractions' do
+      set.remove 5
+      set.subtract(other_set, 5).should == [4]
+    end
+    
+    it 'should mutate the order of the elements when sampling' do
+      set_before = set.to_a
+      set.sample 5
+      set_before.should =~ set.to_a
+      set_before.should_not == set.to_a
+    end
+    
+    it 'should mutate the order of the elements on a subtraction' do
+      set_before = set.to_a
+      set.subtract other_set, 5
+      set_before.should =~ set.to_a
+      set_before.should_not == set.to_a
+    end
+  end
+end

data/spec/spec_helper.rb

@@ -0,0 +1,17 @@
+root = File.expand_path File.join(File.dirname(__FILE__), '../')
+%w(lib ext).each do |name|
+  dir = File.join root, name
+  $LOAD_PATH.unshift dir unless $LOAD_PATH.include? dir
+end
+
+require 'pry'
+require 'diff_set'
+
+Dir["./spec/support/**/*.rb"].sort.each{ |f| require f }
+
+RSpec.configure do |config|
+  config.treat_symbols_as_metadata_keys_with_true_values = true
+  config.run_all_when_everything_filtered = true
+  config.filter_run :focus
+  config.order = 'random'
+end

data/spec/support/shared_examples_for_set.rb

@@ -0,0 +1,34 @@
+shared_examples_for 'a set' do
+  it 'should convert to an Array' do
+    set.to_a.should =~ (1..5).to_a
+  end
+  
+  it 'should add elements' do
+    set.add 100
+    set.to_a.should include 100
+  end
+  
+  it 'should remove elements' do
+    set.remove 1
+    set.to_a.should_not include 1
+  end
+  
+  it 'should sample elements' do
+    set.sample(2).length.should == 2
+  end
+  
+  it 'should not include removed elements in samples' do
+    set.remove 5
+    set.sample(5).should_not include 5
+  end
+  
+  it 'should know how many elements it contains' do
+    expect{ set.add 100 }.to change{ set.size }.from(5).to 6
+  end
+  
+  it 'should know if it contains an element' do
+    set.should_not include 100
+    set.add 100
+    set.should include 100
+  end
+end

metadata

@@ -0,0 +1,160 @@
+--- !ruby/object:Gem::Specification
+name: diff_set
+version: !ruby/object:Gem::Version
+  version: 0.0.2
+platform: ruby
+authors:
+- Michael Parrish
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-05-14 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.5'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.5'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rake-compiler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.9.2
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.9.2
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: pry
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rice
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.6'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.6'
+description: ''
+email:
+- michael@zooniverse.org
+executables: []
+extensions:
+- ext/diff_set/extconf.rb
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- diff_set.gemspec
+- ext/diff_set/diff_set_ext.cpp
+- ext/diff_set/extconf.rb
+- ext/diff_set/priority_set.cpp
+- ext/diff_set/priority_set.h
+- ext/diff_set/random_set.cpp
+- ext/diff_set/random_set.h
+- lib/diff_set.rb
+- lib/diff_set/pairwise.rb
+- lib/diff_set/pairwise_priority_set.rb
+- lib/diff_set/pairwise_random_set.rb
+- lib/diff_set/version.rb
+- spec/pairwise_priority_set_spec.rb
+- spec/pairwise_random_set_spec.rb
+- spec/priority_set_spec.rb
+- spec/random_set_spec.rb
+- spec/spec_helper.rb
+- spec/support/shared_examples_for_set.rb
+homepage: https://github.com/parrish/diff_set
+licenses:
+- MIT
+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: DiffSet contains a collection of data structures optimized to perform partial
+  set subtractions
+test_files:
+- spec/pairwise_priority_set_spec.rb
+- spec/pairwise_random_set_spec.rb
+- spec/priority_set_spec.rb
+- spec/random_set_spec.rb
+- spec/spec_helper.rb
+- spec/support/shared_examples_for_set.rb