square-arel 2.0.9.20110222133018

data/lib/arel/nodes/intersect.rb

@@ -0,0 +1,7 @@
+module Arel
+  module Nodes
+    class Intersect < Arel::Nodes::Binary
+    end
+  end
+end
+

data/lib/arel/nodes/join.rb

@@ -0,0 +1,13 @@
+module Arel
+  module Nodes
+    class Join < Arel::Nodes::Node
+      attr_accessor :left, :right, :constraint
+
+      def initialize left, right, constraint
+        @left       = left
+        @right      = right
+        @constraint = constraint
+      end
+    end
+  end
+end

data/lib/arel/nodes/less_than.rb

@@ -0,0 +1,6 @@
+module Arel
+  module Nodes
+    class LessThan < Arel::Nodes::Binary
+    end
+  end
+end

data/lib/arel/nodes/less_than_or_equal.rb

@@ -0,0 +1,6 @@
+module Arel
+  module Nodes
+    class LessThanOrEqual < Arel::Nodes::Binary
+    end
+  end
+end

data/lib/arel/nodes/limit.rb

@@ -0,0 +1,7 @@
+module Arel
+  module Nodes
+    class Limit < Arel::Nodes::Unary
+    end
+  end
+end
+

data/lib/arel/nodes/lock.rb

@@ -0,0 +1,6 @@
+module Arel
+  module Nodes
+    class Lock < Arel::Nodes::Unary
+    end
+  end
+end

data/lib/arel/nodes/matches.rb

@@ -0,0 +1,6 @@
+module Arel
+  module Nodes
+    class Matches < Arel::Nodes::Binary
+    end
+  end
+end

data/lib/arel/nodes/max.rb

@@ -0,0 +1,6 @@
+module Arel
+  module Nodes
+    class Max < Arel::Nodes::Function
+    end
+  end
+end

data/lib/arel/nodes/min.rb

@@ -0,0 +1,6 @@
+module Arel
+  module Nodes
+    class Min < Arel::Nodes::Function
+    end
+  end
+end

data/lib/arel/nodes/node.rb

@@ -0,0 +1,44 @@
+module Arel
+  module Nodes
+    ###
+    # Abstract base class for all AST nodes
+    class Node
+      ###
+      # Factory method to create a Nodes::Not node that has the recipient of
+      # the caller as a child.
+      def not
+        Nodes::Not.new Nodes::Grouping.new self
+      end
+
+      ###
+      # Factory method to create a Nodes::Grouping node that has an Nodes::Or
+      # node as a child.
+      def or right
+        Nodes::Grouping.new Nodes::Or.new(self, right)
+      end
+
+      ###
+      # Factory method to create an Nodes::And node.
+      def and right
+        Nodes::And.new self, right
+      end
+
+      # FIXME: this method should go away.  I don't like people calling
+      # to_sql on non-head nodes.  This forces us to walk the AST until we
+      # can find a node that has a "relation" member.
+      #
+      # Maybe we should just use `Table.engine`?  :'(
+      def to_sql engine = Table.engine
+        viz = Visitors.for engine
+        viz.accept self
+      end
+
+      # Iterate through AST, nodes will be yielded depth-first
+      def each &block
+        return enum_for(:each) unless block_given?
+
+        Visitors::DepthFirst.new(block).accept self
+      end
+    end
+  end
+end

data/lib/arel/nodes/not.rb

@@ -0,0 +1,6 @@
+module Arel
+  module Nodes
+    class Not < Arel::Nodes::Unary
+    end
+  end
+end

data/lib/arel/nodes/not_equal.rb

@@ -0,0 +1,6 @@
+module Arel
+  module Nodes
+    class NotEqual < Arel::Nodes::Binary
+    end
+  end
+end

data/lib/arel/nodes/not_in.rb

@@ -0,0 +1,6 @@
+module Arel
+  module Nodes
+    class NotIn < Arel::Nodes::Binary
+    end
+  end
+end

data/lib/arel/nodes/offset.rb

@@ -0,0 +1,7 @@
+module Arel
+  module Nodes
+    class Offset < Arel::Nodes::Unary
+      alias :value :expr
+    end
+  end
+end

data/lib/arel/nodes/on.rb

@@ -0,0 +1,6 @@
+module Arel
+  module Nodes
+    class On < Arel::Nodes::Unary
+    end
+  end
+end

data/lib/arel/nodes/or.rb

@@ -0,0 +1,6 @@
+module Arel
+  module Nodes
+    class Or < Arel::Nodes::Binary
+    end
+  end
+end

data/lib/arel/nodes/ordering.rb

@@ -0,0 +1,20 @@
+module Arel
+  module Nodes
+    class Ordering < Arel::Nodes::Binary
+      alias :expr :left
+      alias :direction :right
+
+      def initialize expr, direction = :asc
+        super
+      end
+
+      def ascending?
+        direction == :asc
+      end
+
+      def descending?
+        direction == :desc
+      end
+    end
+  end
+end

data/lib/arel/nodes/outer_join.rb

@@ -0,0 +1,6 @@
+module Arel
+  module Nodes
+    class OuterJoin < Arel::Nodes::Join
+    end
+  end
+end

data/lib/arel/nodes/select_core.rb

@@ -0,0 +1,26 @@
+module Arel
+  module Nodes
+    class SelectCore < Arel::Nodes::Node
+      attr_accessor :top, :froms, :projections, :wheres, :groups
+      attr_accessor :having
+
+      def initialize
+        @top         = nil
+        @froms       = nil
+        @projections = []
+        @wheres      = []
+        @groups      = []
+        @having      = nil
+      end
+
+      def initialize_copy other
+        super
+        @froms       = @froms.clone if @froms
+        @projections = @projections.clone
+        @wheres      = @wheres.clone
+        @group       = @groups.clone
+        @having      = @having.clone if @having
+      end
+    end
+  end
+end

data/lib/arel/nodes/select_statement.rb

@@ -0,0 +1,22 @@
+module Arel
+  module Nodes
+    class SelectStatement < Arel::Nodes::Node
+      attr_reader :cores
+      attr_accessor :limit, :orders, :lock, :offset
+
+      def initialize cores = [SelectCore.new]
+        @cores  = cores
+        @orders = []
+        @limit  = nil
+        @lock   = nil
+        @offset = nil
+      end
+
+      def initialize_copy other
+        super
+        @cores  = @cores.map { |x| x.clone }
+        @orders = @orders.map { |x| x.clone }
+      end
+    end
+  end
+end

data/lib/arel/nodes/sql_literal.rb

@@ -0,0 +1,8 @@
+module Arel
+  module Nodes
+    class SqlLiteral < String
+      include Arel::Expressions
+      include Arel::Predications
+    end
+  end
+end

data/lib/arel/nodes/string_join.rb

@@ -0,0 +1,11 @@
+module Arel
+  module Nodes
+    class StringJoin < Arel::Nodes::Join
+      undef :constraint
+
+      def initialize left, right
+        super(left, right, nil)
+      end
+    end
+  end
+end

data/lib/arel/nodes/sum.rb

@@ -0,0 +1,6 @@
+module Arel
+  module Nodes
+    class Sum < Arel::Nodes::Function
+    end
+  end
+end

data/lib/arel/nodes/table_alias.rb

@@ -0,0 +1,13 @@
+module Arel
+  module Nodes
+    class TableAlias < Arel::Nodes::Binary
+      alias :name :left
+      alias :relation :right
+      alias :table_alias :name
+
+      def [] name
+        Attribute.new self, name
+      end
+    end
+  end
+end

data/lib/arel/nodes/top.rb

@@ -0,0 +1,6 @@
+module Arel
+  module Nodes
+    class Top < Arel::Nodes::Unary
+    end
+  end
+end

data/lib/arel/nodes/unary.rb

@@ -0,0 +1,11 @@
+module Arel
+  module Nodes
+    class Unary < Arel::Nodes::Node
+      attr_accessor :expr
+
+      def initialize expr
+        @expr = expr
+      end
+    end
+  end
+end

data/lib/arel/nodes/union.rb

@@ -0,0 +1,7 @@
+module Arel
+  module Nodes
+    class Union < Arel::Nodes::Binary
+    end
+  end
+end
+

data/lib/arel/nodes/union_all.rb

@@ -0,0 +1,7 @@
+module Arel
+  module Nodes
+    class UnionAll < Arel::Nodes::Binary
+    end
+  end
+end
+

data/lib/arel/nodes/unqualified_column.rb

@@ -0,0 +1,16 @@
+module Arel
+  module Nodes
+    class UnqualifiedColumn < Arel::Nodes::Unary
+      alias :attribute :expr
+      alias :attribute= :expr=
+
+      def column
+        @expr.column
+      end
+
+      def name
+        @expr.name
+      end
+    end
+  end
+end

data/lib/arel/nodes/update_statement.rb

@@ -0,0 +1,21 @@
+module Arel
+  module Nodes
+    class UpdateStatement < Arel::Nodes::Node
+      attr_accessor :relation, :wheres, :values, :orders, :limit
+
+      def initialize
+        @relation = nil
+        @wheres   = []
+        @values   = []
+        @orders = []
+        @limit  = nil
+      end
+
+      def initialize_copy other
+        super
+        @wheres = @wheres.clone
+        @values = @values.clone
+      end
+    end
+  end
+end

data/lib/arel/nodes/values.rb

@@ -0,0 +1,14 @@
+module Arel
+  module Nodes
+    class Values < Arel::Nodes::Binary
+      alias :expressions :left
+      alias :expressions= :left=
+      alias :columns :right
+      alias :columns= :right=
+
+      def initialize exprs, columns = []
+        super
+      end
+    end
+  end
+end

data/lib/arel/predications.rb

@@ -0,0 +1,183 @@
+module Arel
+  module Predications
+    def as other
+      Nodes::As.new self, other
+    end
+
+    def not_eq other
+      Nodes::NotEqual.new self, other
+    end
+
+    def not_eq_any others
+      grouping_any :not_eq, others
+    end
+
+    def not_eq_all others
+      grouping_all :not_eq, others
+    end
+
+    def eq other
+      Nodes::Equality.new self, other
+    end
+
+    def eq_any others
+      grouping_any :eq, others
+    end
+
+    def eq_all others
+      grouping_all :eq, others
+    end
+
+    def in other
+      case other
+      when Arel::SelectManager
+        Arel::Nodes::In.new(self, other.ast)
+      when Range
+        if other.exclude_end?
+          left  = Nodes::GreaterThanOrEqual.new(self, other.begin)
+          right = Nodes::LessThan.new(self, other.end)
+          Nodes::And.new left, right
+        else
+          Nodes::Between.new(self, Nodes::And.new(other.begin, other.end))
+        end
+      else
+        Nodes::In.new self, other
+      end
+    end
+
+    def in_any others
+      grouping_any :in, others
+    end
+
+    def in_all others
+      grouping_all :in, others
+    end
+
+    def not_in other
+      case other
+      when Arel::SelectManager
+        Arel::Nodes::NotIn.new(self, other.ast)
+      when Range
+        if other.exclude_end?
+          left  = Nodes::LessThan.new(self, other.begin)
+          right = Nodes::GreaterThanOrEqual.new(self, other.end)
+          Nodes::Or.new left, right
+        else
+          left  = Nodes::LessThan.new(self, other.begin)
+          right = Nodes::GreaterThan.new(self, other.end)
+          Nodes::Or.new left, right
+        end
+      else
+        Nodes::NotIn.new self, other
+      end
+    end
+
+    def not_in_any others
+      grouping_any :not_in, others
+    end
+
+    def not_in_all others
+      grouping_all :not_in, others
+    end
+
+    def matches other
+      Nodes::Matches.new self, other
+    end
+
+    def matches_any others
+      grouping_any :matches, others
+    end
+
+    def matches_all others
+      grouping_all :matches, others
+    end
+
+    def does_not_match other
+      Nodes::DoesNotMatch.new self, other
+    end
+
+    def does_not_match_any others
+      grouping_any :does_not_match, others
+    end
+
+    def does_not_match_all others
+      grouping_all :does_not_match, others
+    end
+
+    def gteq right
+      Nodes::GreaterThanOrEqual.new self, right
+    end
+
+    def gteq_any others
+      grouping_any :gteq, others
+    end
+
+    def gteq_all others
+      grouping_all :gteq, others
+    end
+
+    def gt right
+      Nodes::GreaterThan.new self, right
+    end
+
+    def gt_any others
+      grouping_any :gt, others
+    end
+
+    def gt_all others
+      grouping_all :gt, others
+    end
+
+    def lt right
+      Nodes::LessThan.new self, right
+    end
+
+    def lt_any others
+      grouping_any :lt, others
+    end
+
+    def lt_all others
+      grouping_all :lt, others
+    end
+
+    def lteq right
+      Nodes::LessThanOrEqual.new self, right
+    end
+
+    def lteq_any others
+      grouping_any :lteq, others
+    end
+
+    def lteq_all others
+      grouping_all :lteq, others
+    end
+
+    def asc
+      Nodes::Ordering.new self, :asc
+    end
+
+    def desc
+      Nodes::Ordering.new self, :desc
+    end
+
+    private
+
+    def grouping_any method_id, others
+      others = others.dup
+      first = send method_id, others.shift
+
+      Nodes::Grouping.new others.inject(first) { |memo,expr|
+        Nodes::Or.new(memo, send(method_id, expr))
+      }
+    end
+
+    def grouping_all method_id, others
+      others = others.dup
+      first = send method_id, others.shift
+
+      Nodes::Grouping.new others.inject(first) { |memo,expr|
+        Nodes::And.new(memo, send(method_id, expr))
+      }
+    end
+  end
+end