table_store 0.0.1

data/.gitignore

@@ -0,0 +1,17 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp

data/.rspec

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

data/Gemfile

@@ -0,0 +1,21 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in table-store.gemspec
+gemspec
+
+group :development, :test do
+  gem 'rake'
+  gem 'pry'
+  gem 'rspec'
+  gem 'rspec-given'
+end
+
+group :development do
+  gem 'guard'
+  gem 'guard-rspec'
+  gem 'rb-readline'
+
+  gem 'rb-inotify', :require => false
+  gem 'rb-fsevent', :require => false
+  gem 'rb-fchange', :require => false
+end

data/Guardfile

@@ -0,0 +1,24 @@
+# A sample Guardfile
+# More info at https://github.com/guard/guard#readme
+
+guard 'rspec' do
+  watch(%r{^spec/.+_spec\.rb$})
+  watch(%r{^lib/(.+)\.rb$})     { |m| "spec/lib/#{m[1]}_spec.rb" }
+  watch('spec/spec_helper.rb')  { "spec" }
+
+  # Rails example
+  watch(%r{^app/(.+)\.rb$})                           { |m| "spec/#{m[1]}_spec.rb" }
+  watch(%r{^app/(.*)(\.erb|\.haml)$})                 { |m| "spec/#{m[1]}#{m[2]}_spec.rb" }
+  watch(%r{^app/controllers/(.+)_(controller)\.rb$})  { |m| ["spec/routing/#{m[1]}_routing_spec.rb", "spec/#{m[2]}s/#{m[1]}_#{m[2]}_spec.rb", "spec/acceptance/#{m[1]}_spec.rb"] }
+  watch(%r{^spec/support/(.+)\.rb$})                  { "spec" }
+  watch('config/routes.rb')                           { "spec/routing" }
+  watch('app/controllers/application_controller.rb')  { "spec/controllers" }
+
+  # Capybara features specs
+  watch(%r{^app/views/(.+)/.*\.(erb|haml)$})          { |m| "spec/features/#{m[1]}_spec.rb" }
+
+  # Turnip features and steps
+  watch(%r{^spec/acceptance/(.+)\.feature$})
+  watch(%r{^spec/acceptance/steps/(.+)_steps\.rb$})   { |m| Dir[File.join("**/#{m[1]}.feature")][0] || 'spec/acceptance' }
+end
+

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2013 rw
+
+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,52 @@
+# TableStore
+
+TableStore is an in-memory relational data store. Create tables, and references between them, as if you were using a regular database. By using lazy evaluation, references to other tables will always show the latest values.
+
+Manipulating data along different dimensions is useful, but it's problematic to keep your data structure up-to-date. With a language like C, pointers make this trivial. In Ruby, even though we don't have pointers, we can use metaprogramming to defer evaluation until the time a value is accessed. It's an interesting use of metaprogramming: look at the `lib/lazy` class to see a BasicObject used as a lazy wrapper around values.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'table_store'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install table_store
+
+## Usage
+
+Create two tables:
+
+    require 'table_store'
+    
+    things = TableStore::Table.new
+    colors = TableStore::Table.new
+    
+Create an object that references one of those tables. Here, the `authors` table is referenced twice:
+
+    stop_sign = {:color => colors['red']}
+    things['stop_sign'] = stop_sign
+    
+Because lookup is lazy under the hood, this returns whatever is currently at `colors[:color]`:
+
+    stop_sign[:color]
+    => nil
+    
+When changing the value of `colors['red']`, `stop_sign` sees the change:
+
+    colors['red'] = 'a bright color'
+    stop_sign[:color]
+    => 'a bright color'
+
+## Contributing
+
+1. Fork it
+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 @@
+require "bundler/gem_tasks"

data/lib/lazy.rb

@@ -0,0 +1,18 @@
+# heavily modified from original source:
+# http://www.innig.net/software/ruby/closures-in-ruby
+
+# changes: uses BasicObject so that #send gets passed to the reference
+
+class Lazy < BasicObject
+  def initialize(&ref)
+    @__lazy_reference = ref
+  end
+
+  def send(method, *args, &block)
+    @__lazy_reference.call.send(method, *args, &block)
+  end
+
+  def method_missing(method, *args, &block)
+    @__lazy_reference.call.send(method, *args, &block)
+  end
+end

data/lib/table_store/table.rb

@@ -0,0 +1,26 @@
+module TableStore
+  class Table < Hash
+    class DuplicateKeyError < RuntimeError; end
+
+    def []=(key, value)
+      super(key, value)
+
+      resort_keys!
+
+      value
+    end
+
+    def [](key)
+      Lazy.new { super(key) }
+    end
+
+    def keys
+      @sorted_keys ||= super.sort
+    end
+
+    def resort_keys!
+      @sorted_keys = nil
+      keys
+    end
+  end
+end

data/lib/table_store/version.rb

@@ -0,0 +1,3 @@
+module TableStore
+  VERSION = "0.0.1"
+end

data/lib/table_store.rb

@@ -0,0 +1,5 @@
+require 'table_store/table'
+require 'table_store/version'
+require 'lazy'
+
+module TableStore; end

data/spec/lib/table_store/table_spec.rb

@@ -0,0 +1,53 @@
+require 'spec_helper'
+require 'lib/table_store/table'
+
+describe TableStore::Table do
+  Given(:klazz) { TableStore::Table }
+  Given(:table) { klazz.new }
+
+  context 'before first insertion' do
+    Then { table.empty?.should be_true }
+  end
+
+  context 'inserting first element' do
+    Given { table[0] = :foo }
+    Then { table.keys.should == [0] }
+    Then { table.empty?.should be_false }
+  end
+
+  context 'inserting many elements' do
+    Given { table[0] = :foo }
+    Given { table[1] = :bar }
+
+    Then { table.keys.should == [0, 1] }
+
+    Given { table[0].send(:should) == :foo }
+    Given { table[1].send(:should) == :bar }
+
+    Then { table.empty?.should be_false }
+  end
+
+  context 'out of order insertion' do
+    Given { table[1] = :one }
+    Given { table[0] = :zero }
+
+    Then { table.keys.should == [0, 1] }
+  end
+
+  describe 'lazy relational evaluation' do
+    Given(:parent_key) { 0 }
+    Given(:parent)     { {:child => table[1]} }
+    Given(:child_key)  { 1 }
+    Given(:child)      { Object.new }
+
+    before { table[parent_key] = parent }
+
+    it 'gets current value at the reference' do
+      table[parent_key][:child].send(:should) == nil
+
+      table[child_key] = child
+
+      table[parent_key][:child].send(:should) == child
+    end
+  end
+end

data/spec/lib/table_store_spec.rb

@@ -0,0 +1,21 @@
+require 'spec_helper'
+require 'lib/table_store'
+
+describe TableStore do
+  class Book < Hash; end
+  class Author < String; end
+
+  context 'multiple tables referencing each other' do
+    Given(:books) { TableStore::Table.new }
+    Given(:authors) { TableStore::Table.new }
+
+    context 'with one reference' do
+      Given(:book) { Book.new }
+      Given(:author) { Author.new('Suess') }
+      before { authors[0] = author }
+      before { book['author'] = authors[0] }
+
+      Then { book['author'].send(:should) == author }
+    end
+  end
+end

data/spec/spec_helper.rb

@@ -0,0 +1,20 @@
+$LOAD_PATH << '.'
+require 'rspec-given'
+
+# This file was generated by the `rspec --init` command. Conventionally, all
+# specs live under a `spec` directory, which RSpec adds to the `$LOAD_PATH`.
+# Require this file using `require "spec_helper"` to ensure that it is only
+# loaded once.
+#
+# See http://rubydoc.info/gems/rspec-core/RSpec/Core/Configuration
+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
+
+  # Run specs in random order to surface order dependencies. If you find an
+  # order dependency and want to debug it, you can fix the order by providing
+  # the seed, which is printed after each run.
+  #     --seed 1234
+  config.order = 'random'
+end

data/table_store.gemspec

@@ -0,0 +1,21 @@
+# -*- encoding: utf-8 -*-
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'table_store/version'
+
+Gem::Specification.new do |gem|
+  gem.name          = "table_store"
+  gem.version       = TableStore::VERSION
+  gem.authors       = ["rw"]
+  gem.email         = ["me@rwinslow.com"]
+  gem.description   = %q{Tabular in-memory data structure.}
+  gem.summary       = %q{In-memory tables that use sorted hashes to provide relational access.}
+  gem.homepage      = ""
+
+  gem.files         = `git ls-files`.split($/)
+  gem.executables   = gem.files.grep(%r{^bin/}).map{ |f| File.basename(f) }
+  gem.test_files    = gem.files.grep(%r{^(test|spec|features)/})
+  gem.require_paths = ["lib"]
+
+  gem.add_dependency 'rbtree'
+end

metadata

@@ -0,0 +1,85 @@
+--- !ruby/object:Gem::Specification
+name: table_store
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+  prerelease: 
+platform: ruby
+authors:
+- rw
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-02-17 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rbtree
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: Tabular in-memory data structure.
+email:
+- me@rwinslow.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- .rspec
+- Gemfile
+- Guardfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- lib/lazy.rb
+- lib/table_store.rb
+- lib/table_store/table.rb
+- lib/table_store/version.rb
+- spec/lib/table_store/table_spec.rb
+- spec/lib/table_store_spec.rb
+- spec/spec_helper.rb
+- table_store.gemspec
+homepage: ''
+licenses: []
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+      segments:
+      - 0
+      hash: 263633794864903711
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+      segments:
+      - 0
+      hash: 263633794864903711
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.25
+signing_key: 
+specification_version: 3
+summary: In-memory tables that use sorted hashes to provide relational access.
+test_files:
+- spec/lib/table_store/table_spec.rb
+- spec/lib/table_store_spec.rb
+- spec/spec_helper.rb