splay_tree 0.3.0 → 0.4.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 7db3333f96bcd04b3f7766c56b55b450adf0005f8f6e89f3502e7d741bf39e53
-  data.tar.gz: 6af03f7dc28f3fde8921cfc16d3a45836e867103934ef63309dbee2937896936
+  metadata.gz: ed0680c1501171f807509e9967af1a0f1cc34d5126ec8d72e2cdbc72da87df7f
+  data.tar.gz: 15fb0c87e206c6c0898ce1af4b45bd30ef94433b749ce5a118cee01ef4a85e4a
 SHA512:
-  metadata.gz: 25ab7c5a533c1e9408d14b88851361093d33c43389823933474607b80a615adf2e7970bf2a021278597b53856a6d72e68324e1f1a051939d6284ecd4f3a00006
-  data.tar.gz: 801cecc487afd61c56cab1edfa94cbe3f95b40903e8b95941879c6974a1b6bf12250a7fa988c5c9a17d74eeba44229af2058cd8589ac12a87deeae76cd071d1c
+  metadata.gz: c1ca27ad3a3864f4b980deb35040e0a303ce85a5c0e66c9e320bb0fb7f6ca7d2378a05fe16f34ccb9bc1a2b58cf5ab71a0a678b4aa7c0e03becbb7ec72db7a84
+  data.tar.gz: c4d3122df89f96c7fb288b78b08373ec81f275af98910ca5216936cab09387ba49a04e5f7f00d51871fc1551f3cc23f8d056a69ed34530e347373fea021e94e8

data/CHANGELOG.md

@@ -1,5 +1,11 @@
 # Change log
 
+## [v0.4.0] - 2021-03-29
+
+### Changed
+* Change gemspec to remove test and rake files to reduce gem size
+* Change to remove bundler as a dev dependency and relax rspec upper constraint
+
 ## [v0.3.0] - 2019-02-26
 
 * Change to limit to Ruby >= 2.0.0
@@ -16,6 +22,7 @@
 
 * Initial implementation and release
 
+[v0.4.0]: https://github.com/piotrmurach/splay_tree/compare/v0.3.0...v0.4.0
 [v0.3.0]: https://github.com/piotrmurach/splay_tree/compare/v0.2.0...v0.3.0
 [v0.2.0]: https://github.com/piotrmurach/splay_tree/compare/v0.1.0...v0.2.0
 [v0.1.0]: https://github.com/piotrmurach/splay_tree/compare/v0.1.0

data/LICENSE.txt

@@ -1,4 +1,4 @@
-Copyright (c) 2014 Piotr Murach
+Copyright (c) 2014 Piotr Murach (piotrmurach.com)
 
 MIT License
 

data/README.md

@@ -1,24 +1,24 @@
 # SplayTree
 
 [![Gem Version](https://badge.fury.io/rb/splay_tree.svg)][gem]
-[![Build Status](https://secure.travis-ci.org/piotrmurach/splay_tree.svg?branch=master)][travis]
+[![Actions CI](https://github.com/piotrmurach/splay_tree/workflows/CI/badge.svg?branch=master)][gh_actions_ci]
 [![Build status](https://ci.appveyor.com/api/projects/status/smfi5r38ihtn9gom?svg=true)][appveyor]
 [![Maintainability](https://api.codeclimate.com/v1/badges/32d2351f6c349a58d8da/maintainability)][codeclimate]
 [![Coverage Status](https://coveralls.io/repos/github/piotrmurach/splay_tree/badge.svg?branch=master)][coverage]
 [![Inline docs](http://inch-ci.org/github/piotrmurach/splay_tree.svg)][inchpages]
 
 [gem]: http://badge.fury.io/rb/splay_tree
-[travis]: http://travis-ci.org/piotrmurach/splay_tree
+[gh_actions_ci]: https://github.com/piotrmurach/splay_tree/actions?query=workflow%3ACI
 [appveyor]: https://ci.appveyor.com/project/piotrmurach/splay-tree
 [codeclimate]: https://codeclimate.com/github/piotrmurach/splay_tree/maintainability
 [coverage]: https://coveralls.io/github/piotrmurach/splay_tree
 [inchpages]: http://inch-ci.org/github/piotrmurach/splay_tree
 
-> Self balancing binary tree that keeps lookup operations fast by optimizing frequently accessed keys. Useful for implementing caches and garbage collection algorithms.
+> A self-balancing binary tree optimised for fast access to frequently used nodes. Useful for implementing caches and garbage collection algorithms.
 
 ## Features
 
-* Familiar hash like access
+* Familiar `Hash` like access
 * Easy instantiation with default value
 
 ## Installation
@@ -26,7 +26,7 @@
 Add this line to your application's Gemfile:
 
 ```ruby
-gem 'splay_tree'
+gem "splay_tree"
 ```
 
 And then execute:
@@ -55,103 +55,115 @@ Or install it yourself as:
 tree = SplayTree.new
 tree[:foo] = :bar
 
-tree[:foo]   # => :bar
-tree.size    # => 1
+tree[:foo]  # => :bar
+tree.size   # => 1
 ```
 
 ### 1.1 insert
 
-In order to associate the value with the given key do:
+To assign a value to a given key do the following:
 
 ```ruby
 tree = SplayTree.new
-tree["a"] = 1
-tree["b"] = 2
+tree[:foo] = 1
+tree[:bar] = 2
 ```
 
-Note: Inserted key will be subjected to splaying, which means the tree will be rearranged to help with quicker access on subsequent calls.
+Note: The inserted key will be subjected to splaying, which means the tree will be rearranged to help with quicker access on subsequent calls.
 
 ### 1.2 fetch
 
-To retrieve a value from the tree corresponding to the key do:
+To retrieve a value at a given key do:
 
 ```ruby
 tree = SplayTree.new
-tree["a"]    #  => nil
+tree[:foo]  #  => nil
 
-tree["a"] = 1
-tree["a"]    #  => 1
+tree[:foo] = 1
+tree[:foo]  #  => 1
 ```
 
 Note: Frequently accessed keys will move nearer to the root where they can be accessed more quickly.
 
 ### 1.3 default
 
-**SplayTree** allows you to set default value if key does not exist. This can be done during initialization or using `default` method:
+You can set a default value for a missing key. This can be done during initialization:
 
 ```ruby
 tree = SplayTree.new
-tree.default          # => UndefinedValue
+tree.default  # => UndefinedValue
 
-tree = SplayTree.new("foo")
-tree.default          # => "foo"
-tree["a"]             # => "foo"
+tree = SplayTree.new(1)
+tree.default  # => 1
+tree[:foo]    # => 1
 ```
 
-You can also use block to set default value:
+Or using `default` method:
 
 ```ruby
 tree = SplayTree.new
-tree.default_proc    # => nil
+tree.default = 1
 
-tree = SplayTree.new { "foo" }
-tree.default_proc    # => "foo"
-tree["a"]            # => "foo"
+tree[:foo] # => 1
+```
+
+You can also use a block to set the default value:
+
+```ruby
+tree = SplayTree.new
+tree.default_proc  # => nil
+
+tree = SplayTree.new { 1 }
+tree.default_proc  # => #<Proc...>
+tree[:foo]         # => 1
 ```
 
 ### 1.4 delete
 
-In order to remove an entry from the splay tree use `delete`. If the value is not found the default value is returned and `nil` otherwise.
+In order to remove an entry from a splay tree use `delete` method. If a key is not found, the default value is returned, otherwise `nil`.
 
 ```ruby
 tree = SplayTree.new
-tree['a'] = 1
-tree.delete('a')   # => 1
-tree.delete('z')   # => nil
+tree[:foo] = 1
+tree.delete(:foo)  # => 1
+tree.delete(:bar)  # => nil
 ```
 
 ### 1.5 empty?
 
-To check if `tree` contains any elements call `empty?` like so:
+Use `empty?` to check if a tree contains any elements:
 
 ```ruby
 tree = SplayTree.new
-tree.empty?   # => true
+tree.empty?  # => true
 
-tree["a"] = 1
-tree.empty?   # => false
+tree[:foo] = 1
+tree.empty?  # => false
 ```
 
 ### 1.6 each
 
-In order to iterate over all tree nodes use `each` method like so:
+Use `each` method to iterate over all tree nodes like so:
 
 ```ruby
 tree = SplayTree.new
-tree['a'] = 1
-tree['b'] = 2
+tree[:foo] = 1
+tree[:bar] = 2
 
 tree.each { |key, value| puts "#{key}: #{value}" }
+# =>
+# bar: 2
+# foo: 1
 ```
 
-In addition you can use `each_key`, `each_value` to enumerate only keys and values respectively.
+You can also use `each_key` and `each_value` to enumerate only keys or values:
 
 ```ruby
 tree.each_key { |key| ... }
 tree.each_value { |value| ... }
 ```
 
-If no block is provided, an enumerator is returned instead.
+If no block is given, an enumerator is returned instead.
 
 ## Contributing
 
@@ -161,6 +173,10 @@ If no block is provided, an enumerator is returned instead.
 4. Push to the branch (`git push origin my-new-feature`)
 5. Create a new Pull Request
 
+## Code of Conduct
+
+Everyone interacting in the SplayTree project’s codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/piotrmurach/splay_tree/blob/master/CODE_OF_CONDUCT.md).
+
 ## Copyright
 
 Copyright (c) 2014 Piotr Murach. See LICENSE for further details.

data/lib/splay_tree.rb

@@ -1,7 +1,7 @@
 # frozen_string_literal: true
 
-require_relative 'splay_tree/node'
-require_relative 'splay_tree/version'
+require_relative "splay_tree/node"
+require_relative "splay_tree/version"
 
 class SplayTree
   include Enumerable
@@ -195,8 +195,10 @@ class SplayTree
   # @api public
   def delete(key)
     return if empty?
+
     splay(key)
     return if @root.key != key
+
     deleted = @root
     right = @root.right
     @root = @root.left
@@ -226,7 +228,7 @@ class SplayTree
   #
   # @api public
   def dump
-    @root.dump || ''
+    @root.dump || ""
   end
 
   # Export tree as hash
@@ -235,7 +237,7 @@ class SplayTree
   #
   # @api public
   def to_hash
-    reduce({}) { |acc, (k, v)| acc[k] = v; acc }
+    each_with_object({}) { |(k, v), acc| acc[k] = v }
   end
 
   private
@@ -261,8 +263,10 @@ class SplayTree
     @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?
@@ -272,6 +276,7 @@ class SplayTree
         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?

data/lib/splay_tree/node.rb

@@ -55,15 +55,15 @@ class SplayTree
     # Iterate over subtree nodes
     #
     # @api private
-    def each_key(&block)
-      each { |k, v| yield k }
+    def each_key
+      each { |k, _| yield k }
     end
 
     # Iterate over subtree nodes
     #
     # @api private
-    def each_value(&block)
-      each { |k, v| yield v }
+    def each_value
+      each { |_, v| yield v }
     end
 
     # Dump the subtree structure starting from this node
@@ -75,9 +75,9 @@ class SplayTree
       left = @left.dump
       right = @right.dump
       if !@left.empty? || !@right.empty?
-        '(' + [@key, left || '-', right || '-'].compact.join(' ') + ')'
+        "(" + [@key, left || "-", right || "-"].compact.join(" ") + ")"
       else
-        @key || ''
+        @key || ""
       end
     end
 
@@ -128,12 +128,12 @@ class SplayTree
         @right = @right.insert(key, value)
         rotate_left
       else
-        fail TypeError, "Cannot compare: #{key} with #{@key}"
+        raise TypeError, "Cannot compare: #{key} with #{@key}"
       end
     end
 
     class EmptyNode < Node
-      def initialize
+      def initialize(*)
       end
 
       def empty?

data/lib/splay_tree/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 class SplayTree
-  VERSION = '0.3.0'
+  VERSION = "0.4.0"
 end # SplayTree

metadata

@@ -1,29 +1,15 @@
 --- !ruby/object:Gem::Specification
 name: splay_tree
 version: !ruby/object:Gem::Version
-  version: 0.3.0
+  version: 0.4.0
 platform: ruby
 authors:
 - Piotr Murach
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2019-02-26 00:00:00.000000000 Z
+date: 2021-03-29 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
@@ -42,49 +28,42 @@ dependencies:
   name: rspec
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '3.0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '3.0'
-description: Self balancing binary tree that keeps lookup operations fast by optimizing
-  frequently accessed keys. Useful for implementing caches and garbage collection
-  algorithms.
+description: A self-balancing binary tree optimised for fast access to frequently
+  used nodes. Useful for implementing caches and garbage collection algorithms.
 email:
-- me@piotrmurach.com
+- piotr@piotrmurach.com
 executables: []
 extensions: []
-extra_rdoc_files: []
+extra_rdoc_files:
+- README.md
+- CHANGELOG.md
+- LICENSE.txt
 files:
 - CHANGELOG.md
 - LICENSE.txt
 - README.md
-- Rakefile
-- benchmarks/speed.rb
 - lib/splay_tree.rb
 - lib/splay_tree/node.rb
 - lib/splay_tree/version.rb
-- spec/spec_helper.rb
-- spec/unit/default_spec.rb
-- spec/unit/delete_spec.rb
-- spec/unit/each_spec.rb
-- spec/unit/fetch_spec.rb
-- spec/unit/insert_spec.rb
-- spec/unit/new_spec.rb
-- spec/unit/to_hash_spec.rb
-- splay_tree.gemspec
-- tasks/console.rake
-- tasks/coverage.rake
-- tasks/spec.rake
 homepage: https://github.com/piotrmurach/splay_tree
 licenses:
 - MIT
-metadata: {}
+metadata:
+  bug_tracker_uri: https://github.com/piotrmurach/splay_tree/issues
+  changelog_uri: https://github.com/piotrmurach/splay_tree/blob/master/CHANGELOG.md
+  documentation_uri: https://www.rubydoc.info/gems/splay_tree
+  homepage_uri: https://github.com/piotrmurach/splay_tree
+  source_code_uri: https://github.com/piotrmurach/splay_tree
 post_install_message: 
 rdoc_options: []
 require_paths:
@@ -100,9 +79,9 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: 
-rubygems_version: 2.7.3
+rubygems_version: 3.1.2
 signing_key: 
 specification_version: 4
-summary: A self-balancing binary tree with amortized access.
+summary: A self-balancing binary tree optimised for fast access to frequently used
+  nodes.
 test_files: []

data/Rakefile

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

data/benchmarks/speed.rb

@@ -1,41 +0,0 @@
-# frozen_string_literal: true
-
-require 'benchmark/ips'
-require 'securerandom'
-
-require_relative '../lib/splay_tree'
-
-def generate_key(size)
-  SecureRandom.hex(size)
-end
-
-def insert_key(tree)
-  key = generate_key(10)
-  tree[key] = 1
-  key
-end
-
-def run(bench, object)
-  name = object.class.name
-
-  key = nil
-
-  bench.report("#{name} insert") do
-    key = insert_key(object)
-  end
-
-  bench.report("#{name} find") do
-    object[key]
-  end
-
-  bench.report("#{name} delete") do
-    object.delete(key)
-  end
-end
-
-Benchmark.ips do |bench|
-  bench.config(time: 5, warmpu: 2)
-
-  run(bench, SplayTree.new)
-  run(bench, Hash.new)
-end

data/spec/spec_helper.rb

@@ -1,45 +0,0 @@
-# frozen_string_literal: true
-
-if 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/default_spec.rb

@@ -1,28 +0,0 @@
-# coding: utf-8
-
-require 'spec_helper'
-
-RSpec.describe SplayTree, '.default' do
-  it "sets the default value on initialize" do
-    tree = SplayTree.new('foo')
-    expect(tree.default).to eq('foo')
-    expect(tree['a']).to eq('foo')
-    expect(tree.default_proc).to eq(nil)
-  end
-
-  it "sets the default value on assigment" do
-    tree = SplayTree.new
-    tree.default = 'foo'
-    expect(tree.default).to eq('foo')
-    expect(tree['a']).to eq('foo')
-    expect(tree.default_proc).to eq(nil)
-  end
-
-  it "sets the default_proc to be executed on each key lookup" do
-    block = -> { 'foo' }
-    tree = SplayTree.new(&block)
-    expect(tree.default).to eq(SplayTree::UndefinedValue)
-    expect(tree.default_proc).to eq(block)
-    expect(tree['a']).to eq('foo')
-  end
-end

data/spec/unit/delete_spec.rb

@@ -1,43 +0,0 @@
-# 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/each_spec.rb

@@ -1,55 +0,0 @@
-# coding: utf-8
-
-require 'spec_helper'
-
-RSpec.describe SplayTree, '.each' do
-  subject(:tree) { described_class.new }
-
-  before {
-    tree['a'] = 1
-    tree['b'] = 2
-    tree['c'] = 3
-  }
-
-  it "enumartes all pairs" do
-    yielded = []
-    expect {
-      tree.each { |k, v| yielded << [k, v] }
-    }.to change { yielded }.from([]).to([['a', 1], ['b', 2], ['c', 3]])
-    expect(tree.to_a).to eq(yielded)
-  end
-
-  it "returns enumerator for all pairs without block" do
-    expect(tree.each.to_a).to eq([['a', 1], ['b', 2], ['c', 3]])
-  end
-
-  it "enumerates all keys" do
-    yielded = []
-    expect {
-      tree.each_key { |k| yielded << k }
-    }.to change { yielded }.from([]).to(['a', 'b', 'c'])
-  end
-
-  it "returns enumerator for all keys without block" do
-    expect(tree.each_key.to_a).to eq(['a', 'b', 'c'])
-  end
-
-  it "enumerates all values" do
-    yielded = []
-    expect {
-      tree.each_value { |v| yielded << v }
-    }.to change { yielded }.from([]).to([1, 2, 3])
-  end
-
-  it "returns enumerator for all values without block" do
-    expect(tree.each_value.to_a).to eq([1, 2, 3])
-  end
-
-  it "populates all keys" do
-    expect(tree.keys).to eq(['a', 'b', 'c'])
-  end
-
-  it "populates all values" do
-    expect(tree.values).to eq([1, 2, 3])
-  end
-end

data/spec/unit/fetch_spec.rb

@@ -1,56 +0,0 @@
-# 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

@@ -1,79 +0,0 @@
-# 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

@@ -1,49 +0,0 @@
-# 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/spec/unit/to_hash_spec.rb

@@ -1,12 +0,0 @@
-# coding: utf-8
-
-require 'spec_helper'
-
-RSpec.describe SplayTree, '.to_hash' do
-  it "exports tree as hash" do
-    tree = SplayTree.new
-    hash = {'a' => 1, 'ab' => 2, 'abc' => 3, 'abd' => 4, 'ac' => 5, 'b' => 6}
-    hash.each { |k, v| tree[k] = v }
-    expect(tree.to_hash).to eq(hash)
-  end
-end

data/splay_tree.gemspec

@@ -1,25 +0,0 @@
-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         = ["me@piotrmurach.com"]
-  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/piotrmurach/splay_tree"
-  spec.license       = "MIT"
-
-  spec.files         = Dir['{lib,spec,benchmarks}/**/*.rb']
-  spec.files        += Dir['tasks/*', 'splay_tree.gemspec']
-  spec.files        += Dir['README.md', 'CHANGELOG.md', 'LICENSE.txt', 'Rakefile']
-  spec.require_paths = ["lib"]
-
-  spec.required_ruby_version = '>= 2.0.0'
-
-  spec.add_development_dependency "bundler", ">= 1.5"
-  spec.add_development_dependency "rake"
-  spec.add_development_dependency "rspec", "~> 3.0"
-end

data/tasks/console.rake

@@ -1,10 +0,0 @@
-# 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

@@ -1,11 +0,0 @@
-# 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

@@ -1,29 +0,0 @@
-# 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