ampere 0.1.0

data/.document

@@ -0,0 +1,5 @@
+lib/**/*.rb
+bin/*
+- 
+features/**/*.feature
+LICENSE.txt

data/.rspec

@@ -0,0 +1 @@
+--color

data/.rvmrc

@@ -0,0 +1 @@
+rvm use 1.9.2@ampere

data/Gemfile

@@ -0,0 +1,18 @@
+source "http://rubygems.org"
+# Add dependencies required to use your gem here.
+# Example:
+#   gem "activesupport", ">= 2.3.5"
+
+gem 'redis'
+
+# Add dependencies to develop your gem here.
+# Include everything needed to run rake, tests, features, etc.
+group :development do
+  gem "shoulda", ">= 0"
+  gem "cucumber", ">= 0"
+  gem "bundler", "~> 1.0.0"
+  gem "jeweler", "~> 1.6.4"
+  gem 'simplecov', :require => false, :group => :test
+  gem "rspec"
+  gem "rdoc"
+end

data/Gemfile.lock

@@ -0,0 +1,51 @@
+GEM
+  remote: http://rubygems.org/
+  specs:
+    builder (3.0.0)
+    cucumber (1.1.3)
+      builder (>= 2.1.2)
+      diff-lcs (>= 1.1.2)
+      gherkin (~> 2.6.7)
+      json (>= 1.4.6)
+      term-ansicolor (>= 1.0.6)
+    diff-lcs (1.1.3)
+    gherkin (2.6.8)
+      json (>= 1.4.6)
+    git (1.2.5)
+    jeweler (1.6.4)
+      bundler (~> 1.0)
+      git (>= 1.2.5)
+      rake
+    json (1.6.1)
+    multi_json (1.0.4)
+    rake (0.9.2.2)
+    rdoc (3.11)
+      json (~> 1.4)
+    redis (2.2.2)
+    rspec (2.7.0)
+      rspec-core (~> 2.7.0)
+      rspec-expectations (~> 2.7.0)
+      rspec-mocks (~> 2.7.0)
+    rspec-core (2.7.1)
+    rspec-expectations (2.7.0)
+      diff-lcs (~> 1.1.2)
+    rspec-mocks (2.7.0)
+    shoulda (2.11.3)
+    simplecov (0.5.4)
+      multi_json (~> 1.0.3)
+      simplecov-html (~> 0.5.3)
+    simplecov-html (0.5.3)
+    term-ansicolor (1.0.7)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  bundler (~> 1.0.0)
+  cucumber
+  jeweler (~> 1.6.4)
+  rdoc
+  redis
+  rspec
+  shoulda
+  simplecov

data/LICENSE.txt

@@ -0,0 +1,70 @@
+Copyright (c) 2011 Max Thom Stahl
+
+THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT.
+
+1. DEFINITIONS
+
+"Contribution" means:
+
+a) in the case of the initial Contributor, the initial code and documentation distributed under this Agreement, and
+b) in the case of each subsequent Contributor:
+i) changes to the Program, and
+ii) additions to the Program;
+where such changes and/or additions to the Program originate from and are distributed by that particular Contributor. A Contribution 'originates' from a Contributor if it was added to the Program by such Contributor itself or anyone acting on such Contributor's behalf. Contributions do not include additions to the Program which: (i) are separate modules of software distributed in conjunction with the Program under their own license agreement, and (ii) are not derivative works of the Program.
+"Contributor" means any person or entity that distributes the Program.
+
+"Licensed Patents" mean patent claims licensable by a Contributor which are necessarily infringed by the use or sale of its Contribution alone or when combined with the Program.
+
+"Program" means the Contributions distributed in accordance with this Agreement.
+
+"Recipient" means anyone who receives the Program under this Agreement, including all Contributors.
+
+2. GRANT OF RIGHTS
+
+a) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free copyright license to reproduce, prepare derivative works of, publicly display, publicly perform, distribute and sublicense the Contribution of such Contributor, if any, and such derivative works, in source code and object code form.
+b) Subject to the terms of this Agreement, each Contributor hereby grants Recipient a non-exclusive, worldwide, royalty-free patent license under Licensed Patents to make, use, sell, offer to sell, import and otherwise transfer the Contribution of such Contributor, if any, in source code and object code form. This patent license shall apply to the combination of the Contribution and the Program if, at the time the Contribution is added by the Contributor, such addition of the Contribution causes such combination to be covered by the Licensed Patents. The patent license shall not apply to any other combinations which include the Contribution. No hardware per se is licensed hereunder.
+c) Recipient understands that although each Contributor grants the licenses to its Contributions set forth herein, no assurances are provided by any Contributor that the Program does not infringe the patent or other intellectual property rights of any other entity. Each Contributor disclaims any liability to Recipient for claims brought by any other entity based on infringement of intellectual property rights or otherwise. As a condition to exercising the rights and licenses granted hereunder, each Recipient hereby assumes sole responsibility to secure any other intellectual property rights needed, if any. For example, if a third party patent license is required to allow Recipient to distribute the Program, it is Recipient's responsibility to acquire that license before distributing the Program.
+d) Each Contributor represents that to its knowledge it has sufficient copyright rights in its Contribution, if any, to grant the copyright license set forth in this Agreement.
+3. REQUIREMENTS
+
+A Contributor may choose to distribute the Program in object code form under its own license agreement, provided that:
+
+a) it complies with the terms and conditions of this Agreement; and
+b) its license agreement:
+i) effectively disclaims on behalf of all Contributors all warranties and conditions, express and implied, including warranties or conditions of title and non-infringement, and implied warranties or conditions of merchantability and fitness for a particular purpose;
+ii) effectively excludes on behalf of all Contributors all liability for damages, including direct, indirect, special, incidental and consequential damages, such as lost profits;
+iii) states that any provisions which differ from this Agreement are offered by that Contributor alone and not by any other party; and
+iv) states that source code for the Program is available from such Contributor, and informs licensees how to obtain it in a reasonable manner on or through a medium customarily used for software exchange.
+When the Program is made available in source code form:
+
+a) it must be made available under this Agreement; and
+b) a copy of this Agreement must be included with each copy of the Program.
+Contributors may not remove or alter any copyright notices contained within the Program.
+
+Each Contributor must identify itself as the originator of its Contribution, if any, in a manner that reasonably allows subsequent Recipients to identify the originator of the Contribution.
+
+4. COMMERCIAL DISTRIBUTION
+
+Commercial distributors of software may accept certain responsibilities with respect to end users, business partners and the like. While this license is intended to facilitate the commercial use of the Program, the Contributor who includes the Program in a commercial product offering should do so in a manner which does not create potential liability for other Contributors. Therefore, if a Contributor includes the Program in a commercial product offering, such Contributor ("Commercial Contributor") hereby agrees to defend and indemnify every other Contributor ("Indemnified Contributor") against any losses, damages and costs (collectively "Losses") arising from claims, lawsuits and other legal actions brought by a third party against the Indemnified Contributor to the extent caused by the acts or omissions of such Commercial Contributor in connection with its distribution of the Program in a commercial product offering. The obligations in this section do not apply to any claims or Losses relating to any actual or alleged intellectual property infringement. In order to qualify, an Indemnified Contributor must: a) promptly notify the Commercial Contributor in writing of such claim, and b) allow the Commercial Contributor to control, and cooperate with the Commercial Contributor in, the defense and any related settlement negotiations. The Indemnified Contributor may participate in any such claim at its own expense.
+
+For example, a Contributor might include the Program in a commercial product offering, Product X. That Contributor is then a Commercial Contributor. If that Commercial Contributor then makes performance claims, or offers warranties related to Product X, those performance claims and warranties are such Commercial Contributor's responsibility alone. Under this section, the Commercial Contributor would have to defend claims against the other Contributors related to those performance claims and warranties, and if a court requires any other Contributor to pay any damages as a result, the Commercial Contributor must pay those damages.
+
+5. NO WARRANTY
+
+EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED 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. Each Recipient is solely responsible for determining the appropriateness of using and distributing the Program and assumes all risks associated with its exercise of rights under this Agreement , including but not limited to the risks and costs of program errors, compliance with applicable laws, damage to or loss of data, programs or equipment, and unavailability or interruption of operations.
+
+6. DISCLAIMER OF LIABILITY
+
+EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
+
+7. GENERAL
+
+If any provision of this Agreement is invalid or unenforceable under applicable law, it shall not affect the validity or enforceability of the remainder of the terms of this Agreement, and without further action by the parties hereto, such provision shall be reformed to the minimum extent necessary to make such provision valid and enforceable.
+
+If Recipient institutes patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Program itself (excluding combinations of the Program with other software or hardware) infringes such Recipient's patent(s), then such Recipient's rights granted under Section 2(b) shall terminate as of the date such litigation is filed.
+
+All Recipient's rights under this Agreement shall terminate if it fails to comply with any of the material terms or conditions of this Agreement and does not cure such failure in a reasonable period of time after becoming aware of such noncompliance. If all Recipient's rights under this Agreement terminate, Recipient agrees to cease use and distribution of the Program as soon as reasonably practicable. However, Recipient's obligations under this Agreement and any licenses granted by Recipient relating to the Program shall continue and survive.
+
+Everyone is permitted to copy and distribute copies of this Agreement, but in order to avoid inconsistency the Agreement is copyrighted and may only be modified in the following manner. The Agreement Steward reserves the right to publish new versions (including revisions) of this Agreement from time to time. No one other than the Agreement Steward has the right to modify this Agreement. The Eclipse Foundation is the initial Agreement Steward. The Eclipse Foundation may assign the responsibility to serve as the Agreement Steward to a suitable separate entity. Each new version of the Agreement will be given a distinguishing version number. The Program (including Contributions) may always be distributed subject to the version of the Agreement under which it was received. In addition, after a new version of the Agreement is published, Contributor may elect to distribute the Program (including its Contributions) under the new version. Except as expressly stated in Sections 2(a) and 2(b) above, Recipient receives no rights or licenses to the intellectual property of any Contributor under this Agreement, whether expressly, by implication, estoppel or otherwise. All rights in the Program not expressly granted under this Agreement are reserved.
+
+This Agreement is governed by the laws of the State of New York and the intellectual property laws of the United States of America. No party to this Agreement will bring a legal action under this Agreement more than one year after the cause of action arose. Each party waives its rights to a jury trial in any resulting litigation.

data/README.md

@@ -0,0 +1,89 @@
+# Ampere — A Redis ORM for Ruby
+
+Ampere is an ActiveRecord-style ORM for the Redis key/value data store. 
+
+This is under active development right now and not very far along. Stay
+tuned for further developments.
+
+## Usage
+
+Write a model class and make it inherit from the `Ampere::Model` class.
+These work pretty similarly to how they do in ActiveRecord or Mongoid.
+
+    class Car < Ampere::Model
+      field :make
+      field :model
+      field :year
+
+      has_one :engine
+      has_many :passengers
+    end
+
+    class Engine < Ampere::Model
+      field :displacement
+      field :cylinders
+      field :configuration
+      
+      belongs_to :car
+    end
+    
+    class Passenger < Ampere::Model
+      field :name
+      field :seat
+      
+      belongs_to :car
+    end
+
+This will define attr accessors for each field. Then to instantiate it,
+
+    Post.new :title    => "BREAKING: Kitties Are Awesome", 
+             :contents => "This just in! Kitties are super adorable, and super great."
+
+Later, when you want to retrieve it, you can use the where() method (although this will
+be slower if one of the keys you are searching by isn't indexed).
+
+    post = Post.where(:title => "BREAKING: Kitties Are Awesome").first
+
+### Indexes
+
+Indexes work similar to Mongoid. They are non-unique.
+
+    class Student < Ampere::Model
+      field :last_name
+      field :first_name
+      
+      index :last_name
+    end
+
+This will create an index of the last names of students, and lookups by
+last_name will happen faster.
+
+You can also define indices on multiple fields.
+    
+    class Student < Ampere::Model
+      field :last_name
+      field :first_name
+      
+      index [:last_name, :first_name]
+    end
+
+Queries performed on compound indices will always run faster than queries on multiple
+individual indices, which will always run faster than queries on unindexed fields. 
+
+_**Warning:**_ If you query on an un-indexed field, the returned result set will not be
+evaluated lazily!
+
+## Contributing to ampere
+ 
+  * Check out the latest master to make sure the feature hasn't been implemented or the bug hasn't been fixed yet
+  * Check out the issue tracker to make sure someone already hasn't requested it and/or contributed it
+  * Fork the project
+  * Start a feature/bugfix branch
+  * Commit and push until you are happy with your contribution
+  * Make sure to add tests for it. This is important so I don't break it in a future version unintentionally.
+  * Please try not to mess with the Rakefile, version, or history. If you want to have your own version, or is otherwise necessary, that is fine, but please isolate to its own commit so I can cherry-pick around it.
+
+## Copyright
+
+Copyright (c) 2011 Max Thom Stahl. See LICENSE.txt for further details.
+

data/Rakefile

@@ -0,0 +1,49 @@
+# encoding: utf-8
+
+require 'rubygems'
+require 'bundler'
+begin
+  Bundler.setup(:default, :development)
+rescue Bundler::BundlerError => e
+  $stderr.puts e.message
+  $stderr.puts "Run `bundle install` to install missing gems"
+  exit e.status_code
+end
+require 'rake'
+
+require 'jeweler'
+Jeweler::Tasks.new do |gem|
+  # gem is a Gem::Specification... see http://docs.rubygems.org/read/chapter/20 for more options
+  gem.name = "ampere"
+  gem.homepage = "http://github.com/mstahl/ampere"
+  gem.license = "EPL"
+  gem.summary = %Q{A pure Ruby ORM for Redis.}
+  gem.description = %Q{An ActiveRecord/Mongoid-esque object model for the Redis key/value data store.}
+  gem.email = "max@villainousindustri.es"
+  gem.authors = ["Max Thom Stahl"]
+  # dependencies defined in Gemfile
+end
+Jeweler::RubygemsDotOrgTasks.new
+
+require 'rake/testtask'
+Rake::TestTask.new(:test) do |test|
+  test.libs << 'lib' << 'test'
+  test.pattern = 'test/**/test_*.rb'
+  test.verbose = true
+end
+
+require 'cucumber/rake/task'
+Cucumber::Rake::Task.new(:features)
+
+task :default => :test
+
+require 'rdoc/task'
+# Rake::RDocTask.new do |rdoc|
+RDoc::Task.new do |rdoc|
+  version = File.exist?('VERSION') ? File.read('VERSION') : ""
+
+  rdoc.rdoc_dir = 'rdoc'
+  rdoc.title = "ampere #{version}"
+  rdoc.rdoc_files.include('README*')
+  rdoc.rdoc_files.include('lib/**/*.rb')
+end

data/VERSION

@@ -0,0 +1 @@
+0.1.0

data/features/ampere.feature

@@ -0,0 +1,9 @@
+Feature: something something
+  In order to something something
+  A user something something
+  something something something
+
+  Scenario: something something
+    Given inspiration
+    When I create a sweet new gem
+    Then everyone should see how awesome I am

data/features/support/env.rb

@@ -0,0 +1,15 @@
+require 'bundler'
+begin
+  Bundler.setup(:default, :development)
+rescue Bundler::BundlerError => e
+  $stderr.puts e.message
+  $stderr.puts "Run `bundle install` to install missing gems"
+  exit e.status_code
+end
+
+$LOAD_PATH.unshift(File.dirname(__FILE__) + '/../../lib')
+require 'ampere'
+
+require 'test/unit/assertions'
+
+World(Test::Unit::Assertions)

data/lib/ampere.rb

@@ -0,0 +1,26 @@
+require "redis"
+require "pp"
+
+module Ampere
+  @@connection = nil
+  
+  def self.connect(options = {})
+    @@connection = Redis.connect(options)
+  end
+  
+  def self.disconnect
+    return unless connected?
+    @@connection.quit
+    @@connection = nil
+  end
+  
+  def self.connected?
+    !! @@connection
+  end
+  
+  def self.connection
+    @@connection
+  end
+end
+
+Dir[File.join(File.dirname(__FILE__), 'ampere', '**', '*.rb')].each {|f| require f}

data/lib/ampere/collection.rb

@@ -0,0 +1,71 @@
+# require 'pp'
+
+module Ampere
+  # Collections are search results from queries. They can be used like arrays,
+  # but you cannot add anything to them. 
+  class Collection
+    attr_reader :raw_array
+    attr_reader :model
+    
+    # Instance methods ########################################################
+    
+    def initialize(model_class, array = [])
+      @raw_array = array
+      @model = model_class
+    end
+    
+    # Index into the search results. Lazily loads models when they're accessed.
+    def [](idx)
+      if @raw_array[idx].is_a?(Ampere::Model) then
+        @raw_array[idx]
+      else
+        # This is still an ID. Find it.
+        @raw_array[idx] = @model.find(@raw_array[idx])
+      end
+    end
+    
+    # Delegates to internal array.
+    def count
+      @raw_array.count
+    end
+    
+    # Delegates to internal array.
+    def empty?
+      @raw_array.empty?
+    end
+    
+    # Returns first item or first n elements.
+    def first(n = 0)
+      if n == 0 then
+        self[0]
+      else
+        (0..(n - 1)).map{|i| self[i]}
+      end
+    end
+    
+    # Returns the last item.
+    def last
+      self[-1]
+    end
+    
+    # Delegates to internal array.
+    def length
+      @raw_array.count
+    end
+    
+    # Finds all the un-found items and returns an applicatively-evaluated array.
+    def to_a
+      @raw_array.map do |m|
+        if m.is_a?(Ampere::Model) then
+          m
+        else
+          @model.find(m)
+        end
+      end
+    end
+    
+    # Class methods ###########################################################
+    
+    
+  end
+end

data/lib/ampere/model.rb

@@ -0,0 +1,315 @@
+module Ampere
+  class Model
+    attr_reader :id
+    
+    @fields         = []
+    @field_defaults = {}
+    @indices        = []
+    
+    ### Instance methods
+    
+    # Compares this model with another one. If they are literally the same object
+    # or have been stored and have the same ID, then they are equal.
+    def ==(other)
+      super or
+        other.instance_of?(self.class) and
+        not id.nil? and
+        other.id == id
+    end
+    
+    # Returns a Hash with all the fields and their values.
+    def attributes
+      {:id => @id}.tap do |hash|
+        self.class.fields.each do |key|
+          hash[key] = self.send(key)
+        end
+      end
+    end
+    
+    # Deletes this instance out of the database.
+    def destroy
+      self.class.delete(@id)
+    end
+    
+    # Delegates to ==().
+    def eql?(other)
+      self == other
+    end
+    
+    # Calculates the hash of this object from the attributes hash instead of
+    # using Object.hash.
+    def hash
+      attributes.hash
+    end
+    
+    # Initialize an instance like this:
+    # 
+    #     Post.new :title => "Kitties: Are They Awesome?"
+    def initialize(hash = {})
+      hash.each do |k, v|
+        if k == 'id' then
+          @id = v
+        else
+          self.send("#{k}=", v)
+        end
+      end
+    end
+    
+    # Returns true if this record has not yet been saved.
+    def new?
+      @id.nil? or not Ampere.connection.exists(@id)
+    end
+    
+    # Reloads this record from the database.
+    def reload
+      if self.new? then
+        raise "Can't reload a new record"
+      end
+      
+      self.class.fields.each do |k|
+        self.send("#{k}=", Ampere.connection.hget(@id, k))
+      end
+      self
+    end
+    
+    # Saves this record to the database.
+    def save
+      # Grab a fresh GUID from Redis by incrementing the "__guid" key
+      if @id.nil? then
+        @id = "#{self.class.to_s.downcase}.#{Ampere.connection.incr('__guid')}"
+      end
+      
+      self.attributes.each do |k, v|
+        Ampere.connection.hset(@id, k, v)
+      end
+      
+      self.class.indices.each do |index|
+        if index.class == String or index.class == Symbol then
+          Ampere.connection.hset(
+            "ampere.index.#{self.class.to_s.downcase}.#{index}", 
+            instance_variable_get("@#{index}"), 
+            ([@id] | (Ampere.connection.hget("ampere.index.#{self.class.to_s.downcase}.#{index}", instance_variable_get("@#{index}")) or "")
+            .split(/:/)).join(":")
+          )
+        elsif index.class == Array then
+          key = index.map{|i| instance_variable_get("@#{i}")}.join(':')
+          val = ([@id] | (Ampere.connection.hget("ampere.index.#{self.class.to_s.downcase}.#{index}", key) or "")
+                .split(/:/)).join(":")
+          Ampere.connection.hset(
+            "ampere.index.#{self.class.to_s.downcase}.#{index.join(':')}",
+            key,
+            val
+          )
+        end
+      end
+      self
+    end
+    
+    def update_attribute(key, value)
+      raise "Cannot update a nonexistent field!" unless self.class.fields.include?(key)
+      self.send("#{key}=", value)
+      Ampere.connection.hset(@id, key, value)
+    end
+    
+    def update_attributes(hash = {})
+      # The efficient way, that I haven't figured out how to do yet:
+      # Ampere.connection.hmset(@id, hash)
+      
+      # The inefficient way I know how to do right now:
+      hash.each do |k, v|
+        update_attribute(k, v)
+      end
+    end
+    
+    ### Class methods
+    
+    # Returns an array of all the records that have been stored.
+    def self.all
+      Ampere.connection.keys("#{to_s.downcase}.*").map{|m| find m}
+    end
+    
+    # Declares a belongs_to relationship to another model.
+    def self.belongs_to(field_name, options = {})
+      has_one field_name, options
+    end
+    
+    # Like @indices, but only returns the compound indices this class defines.
+    def self.compound_indices
+      @indices.select{|i| i.class == Array}
+    end
+    
+    # Returns the number of instances of this record that have been stored.
+    def self.count
+      Ampere.connection.keys("#{to_s.downcase}.*").length
+    end
+    
+    # Instantiates and saves a new record.
+    def self.create(hash = {})
+      new(hash).save
+    end
+    
+    # Deletes the record with the given ID.
+    def self.delete(id)
+      Ampere.connection.del(id)
+    end
+    
+    # Declares a field. See the README for more details.
+    def self.field(name, options = {})
+      @fields         ||= []
+      @field_defaults ||= {}
+      @indices        ||= []
+      
+      @fields << name
+      
+      attr_accessor :"#{name}"
+      
+      # Handle default value
+      @field_defaults[name] = options[:default]
+      
+      define_method :"#{name}" do
+        instance_variable_get("@#{name}") or self.class.field_defaults[name]
+      end
+    end
+    
+    def self.fields
+      @fields
+    end
+    
+    def self.field_defaults
+      @field_defaults
+    end
+    
+    # Finds the record with the given ID, or the first that matches the given conditions
+    def self.find(options = {})
+      if options.class == String then
+        if Ampere.connection.exists(options) then
+          new(Ampere.connection.hgetall(options))
+        else
+          nil
+        end
+      else
+        # TODO Write a handler for this case, even if it's an exception
+        raise "Cannot find by #{options.class} yet"
+      end
+    end
+    
+    # Defines a has_one relationship with another model. See the README for more details.
+    def self.has_one(field_name, options = {})
+      referred_klass_name = (options[:class] or options['class'] or field_name)
+      my_klass_name = to_s.downcase
+      
+      field :"#{field_name}_id"
+      
+      define_method(field_name.to_sym) do
+        return if self.send("#{field_name}_id").nil?
+        eval(referred_klass_name.to_s.capitalize).find(self.send("#{field_name}_id"))
+      end
+      
+      define_method(:"#{field_name}=") do |val|
+        return nil if val.nil?
+        # Set attr with key where referred model is stored
+        self.send("#{field_name}_id=", val.id)
+        # Also update that model's hash with a pointer back to here
+        val.send("#{my_klass_name}_id=", self.send("id"))
+      end
+    end
+    
+    # Defines a has_many relationship with another model. See the README for more details.
+    def self.has_many(field_name, options = {})
+      klass_name = (options[:class] or options['class'] or field_name.to_s.gsub(/s$/, ''))
+      my_klass_name = to_s.downcase
+      
+      define_method(:"#{field_name}") do
+        (Ampere.connection.smembers("#{to_s.downcase}.#{self.id}.has_many.#{field_name}")).map do |id|
+          eval(klass_name.to_s.capitalize).find(id)
+        end
+      end
+      
+      define_method(:"#{field_name}=") do |val|
+        val.each do |v|
+          Ampere.connection.sadd("#{to_s.downcase}.#{self.id}.has_many.#{field_name}", v.id)
+          # Set pointer for belongs_to
+          Ampere.connection.hset(v.id, "#{my_klass_name}_id", self.send("id"))
+        end
+      end
+    end
+    
+    # Defines an index. See the README for more details.
+    def self.index(field_name, options = {})
+      @fields         ||= []
+      @field_defaults ||= {}
+      @indices        ||= []
+      if field_name.class == String or field_name.class == Symbol then
+        raise "Can't index a nonexistent field!" unless @fields.include?(field_name)
+      elsif field_name.class == Array then
+        field_name.each{|f| raise "Can't index a nonexistent field!" unless @fields.include?(f)}
+        field_name.sort!
+      else
+        raise "Can't index a #{field_name.class}"
+      end
+      
+      @indices << field_name
+    end
+    
+    def self.indices
+      @indices
+    end
+    
+    # Finds an array of records which match the given conditions. This method is
+    # much faster when all the fields given are indexed.
+    def self.where(options = {})
+      if options.empty? then
+        Ampere::Collection.new(eval(to_s), [])
+      else
+        indexed_fields    = (options.keys & @indices) + compound_indices_for(options)
+        nonindexed_fields = (options.keys - @indices) - compound_indices_for(options).flatten
+        
+        results = nil
+        
+        unless indexed_fields.empty?
+          indexed_fields.map {|key|
+            if key.class == String or key.class == Symbol then
+              Ampere.connection.hget("ampere.index.#{to_s.downcase}.#{key}", options[key]).split(/:/) #.map {|id| find(id)}
+            else
+              # Compound index
+              Ampere.connection.hget(
+                "ampere.index.#{to_s.downcase}.#{key.join(':')}", 
+                key.map{|k| options[k]}.join(':')
+              ).split(/:/) #.map {|id| find(id)}
+            end
+          }.each {|s|
+            return s if s.empty?
+          
+            if results.nil? then
+              results = s
+            else
+              results &= s
+            end
+          }
+        end
+          
+        unless nonindexed_fields.empty?
+          results = all if results.nil?
+          results.map!{|r| r.class == String ? find(r) : r}
+          nonindexed_fields.each do |key|
+            results.select!{|r| r.send(key) == options[key]}
+          end
+        end
+        
+        # TODO The eval(to_s) trick seems a little... ghetto. 
+        Ampere::Collection.new(eval(to_s), results.reverse)
+      end
+    end
+    
+    private
+    
+    def self.compound_indices_for(query)
+      compound_indices.select{|ci|
+        (query.keys - ci).empty?
+      }
+    end
+    
+    
+  end
+  
+end