0
@@ -7,11 +7,6 @@ RAILS_ENV = "development" unless defined? RAILS_ENV
0
 require 'active_record'
0
 require 'ultrasphinx'
0
 
0
-module Ambition::Adapters
0
-  module AmbitiousSphinx
0
-  end
0
-end
0
-
0
 %w(base page query select sort slice).each do |f|
0
   require "ambition/adapters/ambitious_sphinx/#{f}"
0
 end

0
@@ -1,28 +1,32 @@
0
-module Ambition::Adapters::AmbitiousSphinx
0
-  # Helper for the other
0
-  class Base
0
-    # Does the string have an Ultrasphinx field?
0
-    def has_field? str
0
-      str =~ /:/
0
-    end
0
+module Ambition
0
+  module Adapters
0
+    module AmbitiousSphinx
0
+      # Helper for the other
0
+      class Base
0
+        # Does the string have an Ultrasphinx field?
0
+        def has_field? str
0
+          str =~ /:/
0
+        end
0
     
0
-    # Does the string have any Ultrasphinx operators?
0
-    def has_operator? str
0
-      str =~ /(AND|OR|NOT)/
0
-    end
0
+        # Does the string have any Ultrasphinx operators?
0
+        def has_operator? str
0
+          str =~ /(AND|OR|NOT)/
0
+        end
0
     
0
-    # Should this string be quotified? It needs to happen if the string doesn't
0
-    # have an operator or a field.
0
-    def needs_quoting? str
0
-      not (has_operator?(str) or has_field?(str))
0
-    end
0
+        # Should this string be quotified? It needs to happen if the string doesn't
0
+        # have an operator or a field.
0
+        def needs_quoting? str
0
+          not (has_operator?(str) or has_field?(str))
0
+        end
0
     
0
-    # Quote the string if it needs it.
0
-    def quotify str
0
-      if needs_quoting?(str)
0
-        %Q("#{str}")
0
-      else
0
-        str
0
+        # Quote the string if it needs it.
0
+        def quotify str
0
+          if needs_quoting?(str)
0
+            %Q("#{str}")
0
+          else
0
+            str
0
+          end
0
+        end
0
       end
0
     end
0
   end

0
@@ -1,48 +1,52 @@
0
-module Ambition::Adapters::AmbitiousSphinx
0
-  # Responsible for taking the clauses that Ambition has generated, and ultimately doing a
0
-  # Ultrasphinx::Search based on them
0
-  class Query < Base
0
-    def kick
0
-      Ultrasphinx::Search.new(to_hash).results
0
-    end
0
+module Ambition
0
+  module Adapters
0
+    module AmbitiousSphinx
0
+      # Responsible for taking the clauses that Ambition has generated, and ultimately doing a
0
+      # Ultrasphinx::Search based on them
0
+      class Query < Base
0
+        def kick
0
+          Ultrasphinx::Search.new(to_hash).results
0
+        end
0
 
0
-    # Some magic to add pagination. This gets called if you were to do:
0
-    #
0
-    #   Meal.select {'bacon'}.page(5)
0
-    #
0
-    # When +page+ is invoked, it's actually being invoked on +Ambition::Context+.
0
-    # It has +method_missing+? voodoo which will try to pass the method onto
0
-    # the +Query+. That's this class.
0
-    def page(number)
0
-      stash[:page] = number
0
-      context
0
-    end
0
+        # Some magic to add pagination. This gets called if you were to do:
0
+        #
0
+        #   Meal.select {'bacon'}.page(5)
0
+        #
0
+        # When +page+ is invoked, it's actually being invoked on +Ambition::Context+.
0
+        # It has +method_missing+? voodoo which will try to pass the method onto
0
+        # the +Query+. That's this class.
0
+        def page(number)
0
+          stash[:page] = number
0
+          context
0
+        end
0
 
0
-    # Not entirely sure when this is used, so unimplemented so far.
0
-    def size
0
-      raise "Not implemented yet."
0
-    end
0
+        # Not entirely sure when this is used, so unimplemented so far.
0
+        def size
0
+          raise "Not implemented yet."
0
+        end
0
     
0
-    # Builds a hash of options for Ultrasphinx::Search based on the clauses Ambition has generated.
0
-    def to_hash
0
-      hash = {}
0
+        # Builds a hash of options for Ultrasphinx::Search based on the clauses Ambition has generated.
0
+        def to_hash
0
+          hash = {}
0
 
0
-      unless (query = clauses[:select]).blank?
0
-        query_s = query.join(' ').squeeze(' ').strip 
0
-        hash[:query] = quotify(query_s)
0
-      end
0
+          unless (query = clauses[:select]).blank?
0
+            query_s = query.join(' ').squeeze(' ').strip 
0
+            hash[:query] = quotify(query_s)
0
+          end
0
       
0
-      unless (page = stash[:page]).blank?
0
-        hash[:page] = page
0
-      end
0
+          unless (page = stash[:page]).blank?
0
+            hash[:page] = page
0
+          end
0
 
0
-      hash
0
-    end
0
+          hash
0
+        end
0
 
0
-    # Prints out the query that would be executed.
0
-    def to_s
0
-      hash = to_hash
0
-      hash[:query]
0
+        # Prints out the query that would be executed.
0
+        def to_s
0
+          hash = to_hash
0
+          hash[:query]
0
+        end
0
+      end
0
     end
0
   end
0
-end
0
+end
0
\ No newline at end of file

0
@@ -1,104 +1,108 @@
0
-module Ambition::Adapters::AmbitiousSphinx
0
-  # Select is responsible for taking pure Ruby, and mangling it until it resembles
0
-  # the syntax that Ultrasphinx[http://blog.evanweaver.com/files/doc/fauna/ultrasphinx/files/README.html] uses.
0
-  class Select < Base
0
-    # Handles method calls, like
0
-    #
0
-    #   u.name
0
-    def call(method)
0
-      "#{method.to_s}:"
0
-    end
0
+module Ambition
0
+  module Adapters
0
+    module AmbitiousSphinx
0
+      # Select is responsible for taking pure Ruby, and mangling it until it resembles
0
+      # the syntax that Ultrasphinx[http://blog.evanweaver.com/files/doc/fauna/ultrasphinx/files/README.html] uses.
0
+      class Select < Base
0
+        # Handles method calls, like
0
+        #
0
+        #   u.name
0
+        def call(method)
0
+          "#{method.to_s}:"
0
+        end
0
 
0
-    # Should we be supporting chained calls like:
0
-    #
0
-    #   u.name.downcase
0
-    #
0
-    # ?
0
-    # 
0
-    # I don't think Sphinx would be able to handle this.
0
-    def chained_call(*methods)
0
-      raise "Not implemented yet."
0
-    end
0
+        # Should we be supporting chained calls like:
0
+        #
0
+        #   u.name.downcase
0
+        #
0
+        # ?
0
+        # 
0
+        # I don't think Sphinx would be able to handle this.
0
+        def chained_call(*methods)
0
+          raise "Not implemented yet."
0
+        end
0
 
0
-    # Handles generating an Ultrasphinx query for code like:
0
-    #
0
-    #   'foo' && 'bar'
0
-    def both(left, right)
0
-      "#{quotify left} AND #{quotify right}"
0
-    end
0
+        # Handles generating an Ultrasphinx query for code like:
0
+        #
0
+        #   'foo' && 'bar'
0
+        def both(left, right)
0
+          "#{quotify left} AND #{quotify right}"
0
+        end
0
 
0
-    # Handles generating an Ultrasphinx query for code like:
0
-    #
0
-    #   'foo' || 'bar'
0
-    def either(left, right)
0
-      "#{quotify left} OR #{quotify right}"
0
-    end
0
+        # Handles generating an Ultrasphinx query for code like:
0
+        #
0
+        #   'foo' || 'bar'
0
+        def either(left, right)
0
+          "#{quotify left} OR #{quotify right}"
0
+        end
0
 
0
-    # Sphinx doesn't support equality.
0
-    def ==(left, right)
0
-      raise "Not applicable to sphinx."
0
-    end
0
+        # Sphinx doesn't support equality.
0
+        def ==(left, right)
0
+          raise "Not applicable to sphinx."
0
+        end
0
 
0
-    # Sphinx doesn't support inequality.
0
-    def not_equal(left, right)
0
-      raise "Not applicable to sphinx."
0
-    end
0
+        # Sphinx doesn't support inequality.
0
+        def not_equal(left, right)
0
+          raise "Not applicable to sphinx."
0
+        end
0
 
0
-    # Handles generating an Ultrasphinx query for code like:
0
-    #
0
-    #   u.name =~ 'bob'
0
-    #
0
-    # Some cavaets:
0
-    #  * left hand side _must_ be a field, like u.name
0
-    #  * right hand side _must not_ be a regular expression. Pattern matching is generally not
0
-    #    supported by full text search engines
0
-    def =~(left, right)
0
-      raise if right.is_a? Regexp
0
-      "#{left}#{quotify right}"
0
-    end
0
+        # Handles generating an Ultrasphinx query for code like:
0
+        #
0
+        #   u.name =~ 'bob'
0
+        #
0
+        # Some cavaets:
0
+        #  * left hand side _must_ be a field, like u.name
0
+        #  * right hand side _must not_ be a regular expression. Pattern matching is generally not
0
+        #    supported by full text search engines
0
+        def =~(left, right)
0
+          raise if right.is_a? Regexp
0
+          "#{left}#{quotify right}"
0
+        end
0
 
0
-    # Handles generating an Ultrasphinx query for code like:
0
-    #
0
-    #   u.name !~ 'bob'
0
-    #
0
-    # Some cavaets:
0
-    #  * left hand side _must_ be a field, like u.name
0
-    #  * right hand side _must not_ be a regular expression. Pattern matching is generally not
0
-    #    supported by full text search engines
0
-    def not_regexp(left, right)
0
-      # could be DRYer, but this is more readable than: "NOT #{self.=~(left,right)}"
0
-      raise if right.is_a? Regexp
0
-      "NOT #{left}#{quotify right}"
0
-    end
0
+        # Handles generating an Ultrasphinx query for code like:
0
+        #
0
+        #   u.name !~ 'bob'
0
+        #
0
+        # Some cavaets:
0
+        #  * left hand side _must_ be a field, like u.name
0
+        #  * right hand side _must not_ be a regular expression. Pattern matching is generally not
0
+        #    supported by full text search engines
0
+        def not_regexp(left, right)
0
+          # could be DRYer, but this is more readable than: "NOT #{self.=~(left,right)}"
0
+          raise if right.is_a? Regexp
0
+          "NOT #{left}#{quotify right}"
0
+        end
0
 
0
-    # Not supported by Sphinx. If you need this kind of comparison, you probably should be
0
-    # using ambitious-activerecord.
0
-    def <(left, right)
0
-      raise "Not applicable to sphinx."
0
-    end
0
+        # Not supported by Sphinx. If you need this kind of comparison, you probably should be
0
+        # using ambitious-activerecord.
0
+        def <(left, right)
0
+          raise "Not applicable to sphinx."
0
+        end
0
 
0
-    # Not supported by Sphinx. If you need this kind of comparison, you probably should be
0
-    # using ambitious-activerecord.
0
-    def >(left, right)
0
-      raise "Not applicable to sphinx."
0
-    end
0
+        # Not supported by Sphinx. If you need this kind of comparison, you probably should be
0
+        # using ambitious-activerecord.
0
+        def >(left, right)
0
+          raise "Not applicable to sphinx."
0
+        end
0
 
0
-    # Not supported by Sphinx. If you need this kind of comparison, you probably should be
0
-    # using ambitious-activerecord.
0
-    def >=(left, right)
0
-      raise "Not applicable to sphinx."
0
-    end
0
+        # Not supported by Sphinx. If you need this kind of comparison, you probably should be
0
+        # using ambitious-activerecord.
0
+        def >=(left, right)
0
+          raise "Not applicable to sphinx."
0
+        end
0
 
0
-    # Not supported by Sphinx. If you need this kind of comparison, you probably should be
0
-    # using ambitious-activerecord.
0
-    def <=(left, right)
0
-      raise "Not applicable to sphinx."
0
-    end
0
+        # Not supported by Sphinx. If you need this kind of comparison, you probably should be
0
+        # using ambitious-activerecord.
0
+        def <=(left, right)
0
+          raise "Not applicable to sphinx."
0
+        end
0
 
0
-    # Not supported by Sphinx. If you need this kind of comparison, you probably should be
0
-    # using ambitious-activerecord.
0
-    def include?(left, right)
0
-      raise "Not applicable to sphinx."
0
+        # Not supported by Sphinx. If you need this kind of comparison, you probably should be
0
+        # using ambitious-activerecord.
0
+        def include?(left, right)
0
+          raise "Not applicable to sphinx."
0
+        end
0
+      end
0
     end
0
   end
0
 end

0
@@ -1,9 +1,13 @@
0
-module Ambition::Adapters::AmbitiousSphinx
0
-  # Slice would normally handle slicing, but we don't support it yet.
0
-  class Slice < Base
0
-    # Not implemented
0
-    def slice(start, length)
0
-      raise "Not implemented."
0
+module Ambition
0
+  module Adapters
0
+    module AmbitiousSphinx
0
+      # Slice would normally handle slicing, but we don't support it yet.
0
+      class Slice < Base
0
+        # Not implemented
0
+        def slice(start, length)
0
+          raise "Not implemented."
0
+        end
0
+      end
0
     end
0
   end
0
 end

0
@@ -1,34 +1,38 @@
0
-module Ambition::Adapters::AmbitiousSphinx
0
-  # +Sort+ would normally handle sorting, but we don't support it yet.
0
-  class Sort < Base
0
-    # Not implemented
0
-    def sort_by(method)
0
-      raise "Not implemented."
0
-    end
0
+module Ambition
0
+  module Adapters
0
+    module AmbitiousSphinx
0
+      # +Sort+ would normally handle sorting, but we don't support it yet.
0
+      class Sort < Base
0
+        # Not implemented
0
+        def sort_by(method)
0
+          raise "Not implemented."
0
+        end
0
 
0
-    # Not implemented
0
-    def reverse_sort_by(method)
0
-      raise "Not implemented."
0
-    end
0
+        # Not implemented
0
+        def reverse_sort_by(method)
0
+          raise "Not implemented."
0
+        end
0
 
0
-    # Not implemented
0
-    def chained_sort_by(receiver, method)
0
-      raise "Not implemented."
0
-    end
0
+        # Not implemented
0
+        def chained_sort_by(receiver, method)
0
+          raise "Not implemented."
0
+        end
0
 
0
-    # Not implemented
0
-    def chained_reverse_sort_by(receiver, method)
0
-      raise "Not implemented."
0
-    end
0
+        # Not implemented
0
+        def chained_reverse_sort_by(receiver, method)
0
+          raise "Not implemented."
0
+        end
0
 
0
-    # Not implemented
0
-    def to_proc(symbol)
0
-      raise "Not implemented."
0
-    end
0
+        # Not implemented
0
+        def to_proc(symbol)
0
+          raise "Not implemented."
0
+        end
0
 
0
-    # Not implemented
0
-    def rand
0
-      raise "Not implemented."
0
+        # Not implemented
0
+        def rand
0
+          raise "Not implemented."
0
+        end
0
+      end
0
     end
0
   end
0
-end
0
+end
0
\ No newline at end of file