splay_tree 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 3fb742e0b556b47b38822511385221c6b753f7ff
+  data.tar.gz: 3b4815cae5de148ff8ca12b8b780ad3713d2a406
+SHA512:
+  metadata.gz: 202309dfa438b35db3e859167679a8bba623ac1f0d50c94ba0d335b05a75421d2978567991646dc637a7fa0bfabdd1b07af3d66d1f9952c7e352635a81c270cd
+  data.tar.gz: 88fa044eb915009af13333272c38c868c10fb2d915b25b0396eb61d20be19ca1ac0157d451ccbc6d09820906688ce4aec1cb4e63dff8399ea86a73edca932cdb

data/.gitignore

@@ -0,0 +1,14 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+*.bundle
+*.so
+*.o
+*.a
+mkmf.log

data/.rspec

@@ -0,0 +1,3 @@
+--color
+--require spec_helper
+--warnings

data/.ruby-version

@@ -0,0 +1 @@
+2.0.0

data/.travis.yml

@@ -0,0 +1,21 @@
+language: ruby
+bundler_args: --without yard benchmarks
+script: "bundle exec rake ci"
+rvm:
+  - 1.9.3
+  - 2.0.0
+  - 2.1.0
+  - ruby-head
+matrix:
+  include:
+    - rvm: jruby-19mode
+    - rvm: jruby-20mode
+    - rvm: jruby-21mode
+    - rvm: jruby-head
+    - rvm: rbx-2
+  allow_failures:
+    - rvm: ruby-head
+    - rvm: jruby-head
+  fast_finish: true
+branches:
+  only: master

data/Gemfile

@@ -0,0 +1,16 @@
+source 'https://rubygems.org'
+
+gemspec
+
+group :development do
+  gem 'rake',    '~> 10.3.2'
+  gem 'rspec',   '~> 3.1.0'
+  gem 'yard',    '~> 0.8.7'
+  gem 'timecop', '~> 0.7.1'
+end
+
+group :metrics do
+  gem 'coveralls', '~> 0.7.0'
+  gem 'simplecov', '~> 0.8.2'
+  gem 'yardstick', '~> 0.9.9'
+end

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2014 Piotr Murach
+
+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,92 @@
+# SplayTree
+[![Gem Version](https://badge.fury.io/rb/splay_tree.png)][gem]
+[![Build Status](https://secure.travis-ci.org/peter-murach/splay_tree.png?branch=master)][travis]
+[![Code Climate](https://codeclimate.com/github/peter-murach/splay_tree.png)][codeclimate]
+[![Coverage Status](https://coveralls.io/repos/peter-murach/splay_tree/badge.png)][coverage]
+
+[gem]: http://badge.fury.io/rb/splay_tree
+[travis]: http://travis-ci.org/peter-murach/splay_tree
+[codeclimate]: https://codeclimate.com/github/peter-murach/splay_tree
+[coverage]: https://coveralls.io/r/peter-murach/splay_tree
+
+> Self balancing binary tree that keeps lookup operations fast by optimizing frequently accessed keys. Useful for implementing caches and garbage collection algorithms.
+
+## Features
+
+* Familiar hash like access
+* Easy instantiation with default value
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'splay_tree'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install splay_tree
+
+## 1. Usage
+
+**SplayTree** operations are similar to that of `Hash`:
+
+```ruby
+tree = SplayTree.new
+tree[:foo] = :bar
+
+tree[:foo]   # => :bar
+tree.size    # => 1
+```
+
+### 1.1 insert
+
+In order to add two elements:
+
+```ruby
+tree['a'] = 1
+tree['b'] = 2
+```
+
+### 1.2 fetch
+
+To read value under key:
+
+```ruby
+tree['a']
+```
+
+### 1.3 delete
+
+```ruby
+tree.delete('a')   # => 1
+```
+
+### 1.4 empty?
+
+To check if `tree` contains any elements call `empty?` like so:
+
+```ruby
+tree = SplayTree.new
+tree.empty?   # => true
+
+tree['a'] = 1
+tree.empty?   # => false
+```
+
+## Contributing
+
+1. Fork it ( https://github.com/peter-murach/splay_tree/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 a new Pull Request
+
+## Copyright
+
+Copyright (c) 2014 Piotr Murach. See LICENSE for further details.

data/Rakefile

@@ -0,0 +1,8 @@
+# encoding: utf-8
+
+require "bundler/gem_tasks"
+
+FileList['tasks/**/*.rake'].each(&method(:import))
+
+desc 'Run all specs'
+task ci: %w[ spec ]

data/lib/splay_tree/node.rb

@@ -0,0 +1,137 @@
+# coding: utf-8
+
+class SplayTree
+  # A single tree node representation
+  class Node
+    include Comparable
+
+    UndefinedValue = Module.new
+
+    attr_reader :key
+
+    attr_reader :value
+
+    attr_accessor :left
+
+    attr_accessor :right
+
+    def initialize(key, value)
+      @key, @value = key, value
+      @left = @right = Node::EMPTY
+    end
+
+    # @api private
+    def empty?
+      false
+    end
+
+    # Number of nodes in this subtree
+    #
+    # @return [Integer]
+    #
+    # @api private
+    def size
+      left.size + 1 + right.size
+    end
+
+    # Compare node keys
+    #
+    # @return [Integer]
+    #
+    # @api private
+    def <=>(other)
+      @key <=> other.key
+    end
+
+    # Dump the subtree structure starting from this node
+    #
+    # @return [String]
+    #
+    # @api private
+    def dump
+      left = @left.dump
+      right = @right.dump
+      if !@left.empty? || !@right.empty?
+        '(' + [@key, left || '-', right || '-'].compact.join(' ') + ')'
+      else
+        @key || ''
+      end
+    end
+
+    # Rotate right
+    #
+    #     Y         X
+    #    / \       / \
+    #   X   C  => A   Y
+    #  / \           / \
+    # A   B         B   C
+    #
+    # @api private
+    def rotate_right
+      tmp       = @left
+      @left     = tmp.right
+      tmp.right = self
+      tmp
+    end
+
+    # Rotate left
+    #
+    #   Y            X
+    #  / \          / \
+    # A   X   =>   Y   C
+    #    / \      / \
+    #   B   C    A   B
+    #
+    # @api private
+    def rotate_left
+      tmp      = @right
+      @right   = tmp.left
+      tmp.left = self
+      tmp
+    end
+
+    # Insert new root
+    #
+    # @api private
+    def insert(key, value)
+      case key <=> @key
+      when -1
+        @left = @left.insert(key, value)
+        rotate_right
+      when 0
+        @value = value
+        self
+      when 1
+        @right = @right.insert(key, value)
+        rotate_left
+      else
+        fail TypeError, "Cannot compare: #{key} with #{@key}"
+      end
+    end
+
+    class EmptyNode < Node
+      def initialize
+      end
+
+      def empty?
+        true
+      end
+
+      def size
+        0
+      end
+
+      def to_s
+      end
+
+      def dump
+      end
+
+      def insert(key, value)
+        Node.new(key, value)
+      end
+    end # EmptyNode
+
+    EMPTY = Node::EmptyNode.new.freeze
+  end # Node
+end # SplayTree

data/lib/splay_tree/version.rb

@@ -0,0 +1,5 @@
+# coding: utf-8
+
+class SplayTree
+  VERSION = "0.1.0"
+end # SplayTree

data/lib/splay_tree.rb

@@ -0,0 +1,179 @@
+# coding: utf-8
+
+require 'splay_tree/node'
+require 'splay_tree/version'
+
+class SplayTree
+  UndefinedValue = Module.new
+
+  attr_accessor :default
+
+  def initialize(default = UndefinedValue, &block)
+    if !UndefinedValue.equal?(default) && block
+      fail ArgumentError,
+           'You need to pas seither argument or a block as a default value'
+    end
+    @root  = Node::EMPTY
+    @subtree = Node.new(nil, nil)
+    @default = default
+    @default_block = block
+  end
+
+  # @api public
+  def empty?
+    @root == Node::EMPTY
+  end
+
+  # @api public
+  def size
+    @root.size
+  end
+  alias_method :length, :size
+
+  # Insert a node into a tree with the given key and value
+  # provided that the tree does not already contain the key.
+  # The node becomes the root of the tree.
+  #
+  # @param [Object] key
+  #   the key under which the node is inserted
+  # @param [Object] value
+  #   the value of the node inserted into the tree
+  #
+  # @return [Boolean]
+  #   false if key already exists, true otherwise
+  # @api public
+  def []=(key, value)
+    if @root.empty?
+      @root = Node.new(key, value)
+      return true
+    end
+
+    @root = @root.insert(key, value)
+
+    splay(key)
+  end
+  alias_method :insert, :[]=
+
+  # Find object by the key
+  #
+  # @param [Object] key
+  #   the search key
+  #
+  # @api public
+  def [](key)
+    splay(key) unless @root.empty?
+
+    return default_value if @root.key != key
+
+    @root.value
+  end
+  alias_method :fetch, :[]
+
+  # Check if tree contains a node with a matching key.
+  #
+  # @return [Boolean]
+  #
+  # @api public
+  def key?(key)
+    return false if @root.empty?
+    splay(key)
+    @root.key == key
+  end
+
+  # Delete a node specified by the key from the tree
+  # given the tree contains a node with this key.
+  # The deleted node value is returned. If the node
+  # is not found a nil is returned.
+  #
+  # @param [Object] key
+  #
+  # @return [Object]
+  #   the node's value under the key
+  #
+  # @api public
+  def delete(key)
+    return if empty?
+    splay(key)
+    return if @root.key != key
+    deleted = @root
+    right = @root.right
+    @root = @root.left
+    if @root.empty?
+      @root = right
+    else
+      splay(key) # ensure empty right child
+      @root.right = right
+    end
+    deleted.value
+  end
+
+  # Construct and return two trees t1 and t2, where
+  # t1 contains items in t less than or equal to key,
+  # and t2 contains all items in t greater than key.
+  #
+  # @param [Object] key
+  #
+  # @api public
+  def split(key)
+  end
+
+  # Dump the tree structure in bracket format
+  # (root left right)
+  #
+  # @return [String]
+  #
+  # @api public
+  def dump
+    @root.dump || ''
+  end
+
+  private
+
+  # @api private
+  def default_value
+    if @default != UndefinedValue
+      @default
+    elsif @default_block
+      @default_block.call
+    end
+  end
+
+  # Top-down splaying by breaking down the tree.
+  #
+  # @param [Object] key
+  #   the key at which to splay
+  #
+  # @api private
+  def splay(key)
+    current = @root
+    dummy = left = right = @subtree
+    @subtree.left = @subtree.right = Node::EMPTY
+    loop do
+      break if key == current.key
+      if key < current.key
+        break if current.left.empty?
+        if key < current.left.key
+          current = current.rotate_right
+          break if current.left.empty?
+        end
+        right.left = current
+        right = current
+        current = current.left
+      elsif key > current.key
+        break if current.right.empty?
+        if key > current.right.key
+          current = current.rotate_left
+          break if current.right.empty?
+        end
+        left.right = current
+        left = current
+        current = current.right
+      end
+    end
+    left.right    = current.left
+    right.left    = current.right
+    current.left  = dummy.right
+    current.right = dummy.left
+    @root = current
+  end
+end # SplayTree

data/spec/spec_helper.rb

@@ -0,0 +1,45 @@
+# encoding: utf-8
+
+if RUBY_VERSION > '1.9' and (ENV['COVERAGE'] || ENV['TRAVIS'])
+  require 'simplecov'
+  require 'coveralls'
+
+  SimpleCov.formatter = SimpleCov::Formatter::MultiFormatter[
+    SimpleCov::Formatter::HTMLFormatter,
+    Coveralls::SimpleCov::Formatter
+  ]
+
+  SimpleCov.start do
+    command_name 'spec'
+    add_filter 'spec'
+  end
+end
+
+require 'splay_tree'
+
+RSpec.configure do |config|
+  config.expect_with :rspec do |expectations|
+    expectations.include_chain_clauses_in_custom_matcher_descriptions = true
+  end
+
+  config.mock_with :rspec do |mocks|
+    mocks.verify_partial_doubles = true
+  end
+
+  # Limits the available syntax to the non-monkey patched syntax that is recommended.
+  config.disable_monkey_patching!
+
+  # This setting enables warnings. It's recommended, but in some cases may
+  # be too noisy due to issues in dependencies.
+  config.warnings = true
+
+  if config.files_to_run.one?
+    config.default_formatter = 'doc'
+  end
+
+  config.profile_examples = 2
+
+  config.order = :random
+
+  Kernel.srand config.seed
+end

data/spec/unit/delete_spec.rb

@@ -0,0 +1,43 @@
+# coding: utf-8
+
+require 'spec_helper'
+
+RSpec.describe SplayTree, 'delete' do
+  it "removes element from the tree" do
+    tree = SplayTree.new
+    tree['a'] = 1
+    tree['ab'] = 2
+    tree['abc'] = 3
+    tree['abd'] = 4
+    tree['ac'] = 5
+    tree['b'] = 6
+
+    expect(tree.size).to eq(6)
+    expect(tree.dump).to eq('(b (ac (abd (abc (ab a -) -) -) -) -)')
+    expect(tree.delete('xxx')).to eq(nil)
+
+    expect(tree.delete('abd')).to eq(4)
+    expect(tree.dump).to eq('(abc (ab a -) (ac - b))')
+    expect(tree.size).to eq(5)
+
+    expect(tree.delete('ab')).to eq(2)
+    expect(tree.dump).to eq('(a - (abc - (ac - b)))')
+    expect(tree.size).to eq(4)
+
+    expect(tree.delete('a')).to eq(1)
+    expect(tree.dump).to eq('(abc - (ac - b))')
+    expect(tree.size).to eq(3)
+
+    expect(tree.delete('abc')).to eq(3)
+    expect(tree.dump).to eq('(ac - b)')
+    expect(tree.size).to eq(2)
+
+    expect(tree.delete('ac')).to eq(5)
+    expect(tree.dump).to eq('b')
+    expect(tree.size).to eq(1)
+
+    expect(tree.delete('b')).to eq(6)
+    expect(tree.dump).to eq('')
+    expect(tree.size).to eq(0)
+  end
+end

data/spec/unit/fetch_spec.rb

@@ -0,0 +1,56 @@
+# coding: utf-8
+
+require 'spec_helper'
+
+RSpec.describe SplayTree, 'fetch' do
+  it "removes element from the tree" do
+    tree = SplayTree.new
+    tree['aa'] = 1
+    tree['ab'] = 2
+    tree['bb'] = 3
+    tree['bc'] = 4
+    tree['a'] = 5
+    tree['abc'] = 6
+
+    expect(tree.size).to eq(6)
+    expect(tree.dump).to eq('(abc (a - (ab aa -)) (bc bb -))')
+
+    expect(tree.delete('abc')).to eq(6)
+    expect(tree.dump).to eq('(ab (a - aa) (bc bb -))')
+    expect(tree['aa']).to eq(1)
+    expect(tree['ab']).to eq(2)
+    expect(tree['bb']).to eq(3)
+    expect(tree['bc']).to eq(4)
+    expect(tree['a']).to eq(5)
+    expect(tree['abc']).to eq(nil)
+
+    expect(tree.delete('ab')).to eq(2)
+    expect(tree.dump).to eq('(aa a (bb - bc))')
+    expect(tree['aa']).to eq(1)
+    expect(tree['ab']).to eq(nil)
+    expect(tree['bb']).to eq(3)
+    expect(tree['bc']).to eq(4)
+    expect(tree['a']).to eq(5)
+    expect(tree['abc']).to eq(nil)
+  end
+
+  it "checks for key existance" do
+    tree = SplayTree.new
+    tree['a'] = 1
+    expect(tree.key?('a')).to eq(true)
+  end
+
+  it "accepts keys with comparison operator" do
+    tree = SplayTree.new
+    obj = Module.new
+    tree['a'] = 1
+    expect { tree[obj] = 2 }.to raise_error(TypeError)
+  end
+
+  it "bla" do
+    tree = SplayTree.new
+    tree['a'] = 1
+    tree['b'] = 2
+    expect(tree['x']).to eq(nil)
+  end
+end

data/spec/unit/insert_spec.rb

@@ -0,0 +1,79 @@
+# coding: utf-8
+
+require 'spec_helper'
+
+RSpec.describe SplayTree, 'insert' do
+  it "overrides existing value" do
+    tree = described_class.new
+    tree['a'] = 1
+    tree['a'] = 2
+    expect(tree.size).to eq(1)
+    expect(tree['a']).to eq(2)
+  end
+
+  it "balances out the leaves" do
+    tree = described_class.new
+    tree['a'] = 1
+    tree['b'] = 2
+    tree['c'] = 3
+    tree['d'] = 4
+    tree['e'] = 5
+    expect(tree.dump).to eq('(e (d (c (b a -) -) -) -)')
+    expect(tree['c']).to eq(3)
+    expect(tree.dump).to eq('(c (b a -) (d - e))')
+  end
+
+  it "inserts items to the left" do
+    tree = described_class.new
+    tree['c'] = 1
+    tree['b'] = 2
+    # zig right
+    expect(tree.dump).to eq('(b - c)')
+    tree['a'] = 3
+    # zig right
+    expect(tree.dump).to eq('(a - (b - c))')
+  end
+
+  it "inserts items to the right" do
+    tree = described_class.new
+    tree['a'] = 1
+    expect(tree.dump).to eq('a')
+    tree['b'] = 2
+    # zig left
+    expect(tree.dump).to eq('(b a -)')
+    tree['c'] = 3
+    # zig left
+    expect(tree.dump).to eq('(c (b a -) -)')
+  end
+
+  it "inserts to the left and the right" do
+    tree = described_class.new
+    expect(tree.dump).to eq('')
+    tree['g'] = 1
+    tree['a'] = 2
+    # zig right
+    expect(tree.dump).to eq('(a - g)')
+    tree['w'] = 3
+    expect(tree.dump).to eq('(w (a - g) -)')
+    # zig-zag right
+    tree['d'] = 4
+    expect(tree.dump).to eq('(d a (w g -))')
+  end
+
+  it "builds the tree correctly" do
+    tree = described_class.new
+    tree['b'] = 1
+    tree['a'] = 2
+    expect(tree.dump).to eq("(a - b)")
+    tree['e'] = 3
+    expect(tree.dump).to eq("(e (a - b) -)")
+    tree['f'] = 4
+    expect(tree.dump).to eq("(f (e (a - b) -) -)")
+    tree['g'] = 5
+    expect(tree.dump).to eq("(g (f (e (a - b) -) -) -)")
+    tree['i'] = 6
+    expect(tree.dump).to eq("(i (g (f (e (a - b) -) -) -) -)")
+    tree['d'] = 7
+    expect(tree.dump).to eq("(d (a - b) (i (g (f e -) -) -))")
+  end
+end

data/spec/unit/new_spec.rb

@@ -0,0 +1,49 @@
+# coding: utf-8
+
+require 'spec_helper'
+
+RSpec.describe SplayTree, 'new' do
+  it "creates tree" do
+    tree = described_class.new
+
+    expect(tree.empty?).to be(true)
+    expect(tree.size).to eq(0)
+    expect(tree['a']).to eq(nil)
+
+    tree['a'] = 1
+    expect(tree.empty?).to be(false)
+    expect(tree.size).to eq(1)
+    expect(tree['a']).to eq(1)
+    expect(tree.dump).to eq('a')
+
+    tree['b'] = 2
+    expect(tree.size).to eq(2)
+    expect(tree.dump).to eq('(b a -)')
+
+    tree['c'] = 3
+    expect(tree.size).to eq(3)
+    expect(tree.dump).to eq('(c (b a -) -)')
+
+    tree['d'] = 4
+    expect(tree.size).to eq(4)
+    expect(tree.dump).to eq('(d (c (b a -) -) -)')
+  end
+
+  it "raises error when defualt and block given" do
+    expect {
+      SplayTree.new(0) { :unknown }
+    }.to raise_error(ArgumentError)
+  end
+
+  it "defaults to value" do
+    tree = SplayTree.new(0)
+    expect(tree['a']).to eq(0)
+    expect(tree['b']).to eq(0)
+  end
+
+  it "default to block" do
+    tree = SplayTree.new { ['a'] }
+    expect(tree[1]).to eq(['a'])
+    expect(tree[2]).to eq(['a'])
+  end
+end

data/splay_tree.gemspec

@@ -0,0 +1,22 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'splay_tree/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "splay_tree"
+  spec.version       = SplayTree::VERSION
+  spec.authors       = ["Piotr Murach"]
+  spec.email         = [""]
+  spec.summary       = %q{A self-balancing binary tree with amortized access.}
+  spec.description   = %q{Self balancing binary tree that keeps lookup operations fast by optimizing frequently accessed keys. Useful for implementing caches and garbage collection algorithms.}
+  spec.homepage      = "https://github.com/peter-murach/splay_tree"
+  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.add_development_dependency "bundler", "~> 1.5"
+end

data/tasks/console.rake

@@ -0,0 +1,10 @@
+# encoding: utf-8
+
+desc 'Load gem inside irb console'
+task :console do
+  require 'irb'
+  require 'irb/completion'
+  require File.join(__FILE__, '../../lib/splay_tree')
+  ARGV.clear
+  IRB.start
+end

data/tasks/coverage.rake

@@ -0,0 +1,11 @@
+# encoding: utf-8
+
+desc 'Measure code coverage'
+task :coverage do
+  begin
+    original, ENV['COVERAGE'] = ENV['COVERAGE'], 'true'
+    Rake::Task['spec'].invoke
+  ensure
+    ENV['COVERAGE'] = original
+  end
+end

data/tasks/spec.rake

@@ -0,0 +1,29 @@
+# encoding: utf-8
+
+begin
+  require 'rspec/core/rake_task'
+
+  desc 'Run all specs'
+  RSpec::Core::RakeTask.new(:spec) do |task|
+    task.pattern = 'spec/{unit,integration}{,/*/**}/*_spec.rb'
+  end
+
+  namespace :spec do
+    desc 'Run unit specs'
+    RSpec::Core::RakeTask.new(:unit) do |task|
+      task.pattern = 'spec/unit{,/*/**}/*_spec.rb'
+    end
+
+    desc 'Run integration specs'
+    RSpec::Core::RakeTask.new(:integration) do |task|
+      task.pattern = 'spec/integration{,/*/**}/*_spec.rb'
+    end
+  end
+
+rescue LoadError
+  %w[spec spec:unit spec:integration].each do |name|
+    task name do
+      $stderr.puts "In order to run #{name}, do `gem install rspec`"
+    end
+  end
+end

metadata

@@ -0,0 +1,86 @@
+--- !ruby/object:Gem::Specification
+name: splay_tree
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Piotr Murach
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-12-27 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'
+description: Self balancing binary tree that keeps lookup operations fast by optimizing
+  frequently accessed keys. Useful for implementing caches and garbage collection
+  algorithms.
+email:
+- ''
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- .rspec
+- .ruby-version
+- .travis.yml
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- lib/splay_tree.rb
+- lib/splay_tree/node.rb
+- lib/splay_tree/version.rb
+- spec/spec_helper.rb
+- spec/unit/delete_spec.rb
+- spec/unit/fetch_spec.rb
+- spec/unit/insert_spec.rb
+- spec/unit/new_spec.rb
+- splay_tree.gemspec
+- tasks/console.rake
+- tasks/coverage.rake
+- tasks/spec.rake
+homepage: https://github.com/peter-murach/splay_tree
+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.0.3
+signing_key: 
+specification_version: 4
+summary: A self-balancing binary tree with amortized access.
+test_files:
+- spec/spec_helper.rb
+- spec/unit/delete_spec.rb
+- spec/unit/fetch_spec.rb
+- spec/unit/insert_spec.rb
+- spec/unit/new_spec.rb
+has_rdoc: