asana2flowdock 1.0.0

data/vendor/bundle/ruby/1.9.1/gems/sequel-4.15.0/lib/sequel/plugins/list.rb

@@ -0,0 +1,189 @@
+module Sequel
+  module Plugins
+    # The list plugin allows for model instances to be part of an ordered list,
+    # based on a position field in the database.  It can either consider all
+    # rows in the table as being from the same list, or you can specify scopes
+    # so that multiple lists can be kept in the same table.
+    # 
+    # Basic Example:
+    #
+    #   class Item < Sequel::Model(:items)
+    #     plugin :list # will use :position field for position
+    #     plugin :list, :field=>:pos # will use :pos field for position
+    #   end
+    #   
+    #   item = Item[1]
+    # 
+    #   # Get the next or previous item in the list
+    # 
+    #   item.next
+    #   item.prev
+    # 
+    #   # Modify the item's position, which may require modifying other items in
+    #   # the same list
+    # 
+    #   item.move_to(3)
+    #   item.move_to_top
+    #   item.move_to_bottom
+    #   item.move_up
+    #   item.move_down
+    # 
+    # You can provide a <tt>:scope</tt> option to scope the list.  This option
+    # can be a symbol or array of symbols specifying column name(s), or a proc
+    # that accepts a model instance and returns a dataset representing the list
+    # the object is in.
+    # 
+    # For example, if each item has a +user_id+ field, and you want every user
+    # to have their own list:
+    #
+    #   Item.plugin :list, :scope=>:user_id
+    # 
+    # Note that using this plugin modifies the order of the model's dataset to
+    # sort by the position and scope fields.  Also note that this plugin is subject to
+    # race conditions, and is not safe when concurrent modifications are made
+    # to the same list.
+    #
+    # Additionally, note that unlike ruby arrays, the list plugin assumes that the
+    # first entry in the list has position 1, not position 0.
+    #
+    # Copyright (c) 2007-2010 Sharon Rosner, Wayne E. Seguin, Aman Gupta, Adrian Madrid, Jeremy Evans
+    module List
+      # Set the +position_field+ and +scope_proc+ attributes for the model,
+      # using the <tt>:field</tt> and <tt>:scope</tt> options, respectively.
+      # The <tt>:scope</tt> option can be a symbol, array of symbols, or a proc that
+      # accepts a model instance and returns a dataset representing the list.
+      # Also, modify the model dataset's order to order by the position and scope fields.
+      def self.configure(model, opts = OPTS)
+        model.position_field = opts[:field] || :position
+        model.dataset = model.dataset.order_prepend(model.position_field)
+        
+        model.scope_proc = case scope = opts[:scope]
+        when Symbol
+          model.dataset = model.dataset.order_prepend(scope)
+          proc{|obj| obj.model.filter(scope=>obj.send(scope))}
+        when Array
+          model.dataset = model.dataset.order_prepend(*scope)
+          proc{|obj| obj.model.filter(scope.map{|s| [s, obj.send(s)]})}
+        else
+          scope
+        end
+      end
+
+      module ClassMethods
+        # The column name holding the position in the list, as a symbol.
+        attr_accessor :position_field
+
+        # A proc that scopes the dataset, so that there can be multiple positions 
+        # in the list, but the positions are unique with the scoped dataset. This
+        # proc should accept an instance and return a dataset representing the list.
+        attr_accessor :scope_proc
+
+        Plugins.inherited_instance_variables(self, :@position_field=>nil, :@scope_proc=>nil)
+      end
+
+      module InstanceMethods
+        # The model object at the given position in the list containing this instance.
+        def at_position(p)
+          list_dataset.first(position_field => p)
+        end
+
+        # Set the value of the position_field to the maximum value plus 1 unless the
+        # position field already has a value.
+        def before_create
+          unless send(position_field)
+            send("#{position_field}=", list_dataset.max(position_field).to_i+1)
+          end
+          super
+        end
+
+        # When destroying an instance, move all entries after the instance down
+        # one position, so that there aren't any gaps
+        def after_destroy
+          super
+
+          f = Sequel.expr(position_field)
+          list_dataset.where(f > position_value).update(f => f - 1)
+        end
+
+        # Find the last position in the list containing this instance.
+        def last_position
+          list_dataset.max(position_field).to_i
+        end
+
+        # A dataset that represents the list containing this instance.
+        def list_dataset
+          model.scope_proc ? model.scope_proc.call(self) : model.dataset
+        end
+
+        # Move this instance down the given number of places in the list,
+        # or 1 place if no argument is specified.
+        def move_down(n = 1)
+          move_to(position_value + n)
+        end
+
+        # Move this instance to the given place in the list.  Raises an
+        # exception if target is less than 1 or greater than the last position in the list.
+        def move_to(target, lp = nil)
+          current = position_value
+          if target != current
+            checked_transaction do
+              ds = list_dataset
+              op, ds = if target < current
+                raise(Sequel::Error, "Moving too far up (target = #{target})") if target < 1
+                [:+, ds.filter(position_field=>target...current)]
+              else
+                lp ||= last_position
+                raise(Sequel::Error, "Moving too far down (target = #{target}, last_position = #{lp})") if target > lp
+                [:-, ds.filter(position_field=>(current + 1)..target)]
+              end
+              ds.update(position_field => Sequel::SQL::NumericExpression.new(op, position_field, 1))
+              update(position_field => target)
+            end
+          end
+          self
+        end
+
+        # Move this instance to the bottom (last position) of the list.
+        def move_to_bottom
+          lp = last_position 
+          move_to(lp, lp)
+        end
+
+        # Move this instance to the top (first position, position 1) of the list.
+        def move_to_top
+          move_to(1)
+        end
+
+        # Move this instance the given number of places up in the list, or 1 place
+        # if no argument is specified.
+        def move_up(n = 1)
+          move_to(position_value - n) 
+        end
+
+        # The model instance the given number of places below this model instance
+        # in the list, or 1 place below if no argument is given.
+        def next(n = 1)
+          n == 0 ? self : at_position(position_value + n)
+        end
+
+        # The value of the model's position field for this instance.
+        def position_value
+          send(position_field)
+        end
+
+        # The model instance the given number of places below this model instance
+        # in the list, or 1 place below if no argument is given.
+        def prev(n = 1)
+          self.next(n * -1)
+        end
+
+        private
+
+        # The model's position field, an instance method for ease of use.
+        def position_field
+          model.position_field
+        end
+      end
+    end
+  end
+end

data/vendor/bundle/ruby/1.9.1/gems/sequel-4.15.0/lib/sequel/plugins/many_through_many.rb

@@ -0,0 +1,317 @@
+module Sequel
+  module Plugins
+    # The many_through_many plugin allow you to create an association using multiple join tables.
+    # For example, assume the following associations:
+    #
+    #    Artist.many_to_many :albums
+    #    Album.many_to_many :tags
+    #
+    # The many_through_many plugin would allow this:
+    #
+    #    Artist.plugin :many_through_many
+    #    Artist.many_through_many :tags, [[:albums_artists, :artist_id, :album_id], [:albums_tags, :album_id, :tag_id]]
+    #
+    # Which will give you the tags for all of the artist's albums.
+    #
+    # Let's break down the 2nd argument of the many_through_many call:
+    #
+    #   [[:albums_artists, :artist_id, :album_id],
+    #    [:albums_tags, :album_id, :tag_id]]
+    #
+    # This argument is an array of arrays with three elements.  Each entry in the main array represents a JOIN in SQL:
+    #
+    # first element :: represents the name of the table to join.
+    # second element :: represents the column used to join to the previous table.
+    # third element :: represents the column used to join to the next table.
+    #
+    # So the "Artist.many_through_many :tags" is translated into something similar to:
+    #
+    #   FROM artists
+    #   JOIN albums_artists ON (artists.id = albums_artists.artist_id)
+    #   JOIN albums_tags ON (albums_artists.album_id = albums_tag.album_id)
+    #   JOIN tags ON (albums_tags.tag_id = tags.id)
+    #
+    # The "artists.id" and "tags.id" criteria come from other association options (defaulting to the primary keys of the current and
+    # associated tables), but hopefully you can see how each argument in the array is used in the JOIN clauses. Note that you do
+    # not need to add an entry for the final table (tags in this example), as that comes from the associated class.
+    #
+    # Here are some more examples:
+    #
+    #   # Same as Artist.many_to_many :albums
+    #   Artist.many_through_many :albums, [[:albums_artists, :artist_id, :album_id]]
+    #
+    #   # All artists that are associated to any album that this artist is associated to
+    #   Artist.many_through_many :artists, [[:albums_artists, :artist_id, :album_id], [:albums_artists, :album_id, :artist_id]]
+    #
+    #   # All albums by artists that are associated to any album that this artist is associated to
+    #   Artist.many_through_many :artist_albums, [[:albums_artists, :artist_id, :album_id], \
+    #    [:albums_artists, :album_id, :artist_id], [:albums_artists, :artist_id, :album_id]], \
+    #    :class=>:Album
+    #
+    #   # All tracks on albums by this artist (also could be a many_to_many)
+    #   Artist.many_through_many :tracks, [[:albums_artists, :artist_id, :album_id]], \
+    #    :right_primary_key=>:album_id
+    #
+    # Often you don't want the current object to appear in the array of associated objects.  This is easiest to handle via an :after_load hook:
+    # 
+    #   Artist.many_through_many :artists, [[:albums_artists, :artist_id, :album_id], [:albums_artists, :album_id, :artist_id]],
+    #     :after_load=>proc{|artist, associated_artists| associated_artists.delete(artist)}
+    #
+    # You can also handle it by adding a dataset block that excludes the current record (so it won't be retrieved at all), but
+    # that won't work when eagerly loading, which is why the :after_load proc is recommended instead.
+    #
+    # It's also common to not want duplicate records, in which case the :distinct option can be used:
+    # 
+    #   Artist.many_through_many :artists, [[:albums_artists, :artist_id, :album_id], [:albums, :id, :id], [:albums_artists, :album_id, :artist_id]],
+    #    :distinct=>true
+    # 
+    # In addition to many_through_many, this plugin also adds one_through_many, for an association to a single object through multiple join tables.
+    # This is useful if there are unique constraints on the foreign keys in the join tables that reference back to the current table, or if you want
+    # to set an order on the association and just want the first record.
+    #
+    # Usage:
+    #
+    #   # Make all model subclasses support many_through_many associations
+    #   Sequel::Model.plugin :many_through_many
+    #
+    #   # Make the Album class support many_through_many associations
+    #   Album.plugin :many_through_many
+    module ManyThroughMany
+      # The AssociationReflection subclass for many_through_many associations.
+      class ManyThroughManyAssociationReflection < Sequel::Model::Associations::ManyToManyAssociationReflection
+        Sequel::Model::Associations::ASSOCIATION_TYPES[:many_through_many] = self
+
+        # many_through_many and one_through_many associations can be clones
+        def cloneable?(ref)
+          ref[:type] == :many_through_many || ref[:type] == :one_through_many
+        end
+
+        # The default associated key alias(es) to use when eager loading
+        # associations via eager.
+        def default_associated_key_alias
+          self[:uses_left_composite_keys] ? (0...self[:through].first[:left].length).map{|i| :"x_foreign_key_#{i}_x"} : :x_foreign_key_x
+        end
+
+        %w'associated_key_table predicate_key edges final_edge final_reverse_edge reverse_edges'.each do |meth|
+          class_eval(<<-END, __FILE__, __LINE__+1)
+            def #{meth}
+              cached_fetch(:#{meth}){calculate_edges[:#{meth}]}
+            end
+          END
+        end
+
+        # The alias for the first join table.
+        def join_table_alias
+          final_reverse_edge[:alias]
+        end
+
+        # Many through many associations don't have a reciprocal
+        def reciprocal
+          nil
+        end
+
+        private
+
+        def _associated_dataset
+          ds = associated_class
+          reverse_edges.each{|t| ds = ds.join(t[:table], Array(t[:left]).zip(Array(t[:right])), :table_alias=>t[:alias], :qualify=>:deep)}
+          ft = final_reverse_edge
+          ds.join(ft[:table], Array(ft[:left]).zip(Array(ft[:right])), :table_alias=>ft[:alias], :qualify=>:deep)
+        end
+
+        # Make sure to use unique table aliases when lazy loading or eager loading
+        def calculate_reverse_edge_aliases(reverse_edges)
+          aliases = [associated_class.table_name]
+          reverse_edges.each do |e|
+            table_alias = e[:table]
+            if aliases.include?(table_alias)
+              i = 0
+              table_alias = loop do
+                ta = :"#{table_alias}_#{i}"
+                break ta unless aliases.include?(ta)
+                i += 1
+              end
+            end
+            aliases.push(e[:alias] = table_alias)
+          end
+        end
+
+        # Transform the :through option into a list of edges and reverse edges to use to join tables when loading the association.
+        def calculate_edges
+          es = [{:left_table=>self[:model].table_name, :left_key=>self[:left_primary_key_column]}]
+          self[:through].each do |t|
+            es.last.merge!(:right_key=>t[:left], :right_table=>t[:table], :join_type=>t[:join_type]||self[:graph_join_type], :conditions=>(t[:conditions]||[]).to_a, :block=>t[:block])
+            es.last[:only_conditions] = t[:only_conditions] if t.include?(:only_conditions)
+            es << {:left_table=>t[:table], :left_key=>t[:right]}
+          end
+          es.last.merge!(:right_key=>right_primary_key, :right_table=>associated_class.table_name)
+          edges = es.map do |e| 
+            h = {:table=>e[:right_table], :left=>e[:left_key], :right=>e[:right_key], :conditions=>e[:conditions], :join_type=>e[:join_type], :block=>e[:block]}
+            h[:only_conditions] = e[:only_conditions] if e.include?(:only_conditions)
+            h
+          end
+          reverse_edges = es.reverse.map{|e| {:table=>e[:left_table], :left=>e[:left_key], :right=>e[:right_key]}}
+          reverse_edges.pop
+          calculate_reverse_edge_aliases(reverse_edges)
+          final_reverse_edge = reverse_edges.pop
+          final_reverse_alias = final_reverse_edge[:alias]
+
+          h = {:final_edge=>edges.pop,
+               :final_reverse_edge=>final_reverse_edge,
+               :edges=>edges,
+               :reverse_edges=>reverse_edges,
+               :predicate_key=>qualify(final_reverse_alias, edges.first[:right]),
+               :associated_key_table=>final_reverse_edge[:alias],
+          }
+          h.each{|k, v| cached_set(k, v)}
+          h
+        end
+
+        def filter_by_associations_limit_key
+          fe = edges.first
+          Array(qualify(fe[:table], fe[:right])) + Array(qualify(associated_class.table_name, associated_class.primary_key))
+        end
+      end
+
+      class OneThroughManyAssociationReflection < ManyThroughManyAssociationReflection
+        Sequel::Model::Associations::ASSOCIATION_TYPES[:one_through_many] = self
+        include Sequel::Model::Associations::SingularAssociationReflection
+      end
+
+      module ClassMethods
+        # Create a many_through_many association.  Arguments:
+        # name :: Same as associate, the name of the association.
+        # through :: The tables and keys to join between the current table and the associated table.
+        #            Must be an array, with elements that are either 3 element arrays, or hashes with keys :table, :left, and :right.
+        #            The required entries in the array/hash are:
+        #            :table (first array element) :: The name of the table to join.
+        #            :left (middle array element) :: The key joining the table to the previous table. Can use an
+        #                                            array of symbols for a composite key association.
+        #            :right (last array element) :: The key joining the table to the next table. Can use an
+        #                                           array of symbols for a composite key association.
+        #            If a hash is provided, the following keys are respected when using eager_graph:
+        #            :block :: A proc to use as the block argument to join.
+        #            :conditions :: Extra conditions to add to the JOIN ON clause.  Must be a hash or array of two pairs.
+        #            :join_type :: The join type to use for the join, defaults to :left_outer.
+        #            :only_conditions :: Conditions to use for the join instead of the ones specified by the keys.
+        # opts :: The options for the associaion.  Takes the same options as many_to_many.
+        def many_through_many(name, through, opts=OPTS, &block)
+          associate(:many_through_many, name, opts.merge(through.is_a?(Hash) ? through : {:through=>through}), &block)
+        end
+
+        # Creates a one_through_many association.  See many_through_many for arguments.
+        def one_through_many(name, through, opts=OPTS, &block)
+          associate(:one_through_many, name, opts.merge(through.is_a?(Hash) ? through : {:through=>through}), &block)
+        end
+
+        private
+
+        # Create the association methods and :eager_loader and :eager_grapher procs.
+        def def_many_through_many(opts)
+          one_through_many = opts[:type] == :one_through_many
+          opts[:read_only] = true
+          opts[:after_load].unshift(:array_uniq!) if opts[:uniq]
+          opts[:cartesian_product_number] ||= one_through_many ? 0 : 2
+          opts[:through] = opts[:through].map do |e|
+            case e
+            when Array
+              raise(Error, "array elements of the through option/argument for many_through_many associations must have at least three elements") unless e.length == 3
+              {:table=>e[0], :left=>e[1], :right=>e[2]}
+            when Hash
+              raise(Error, "hash elements of the through option/argument for many_through_many associations must contain :table, :left, and :right keys") unless e[:table] && e[:left] && e[:right]
+              e
+            else
+              raise(Error, "the through option/argument for many_through_many associations must be an enumerable of arrays or hashes")
+            end
+          end
+
+          left_key = opts[:left_key] = opts[:through].first[:left]
+          opts[:left_keys] = Array(left_key)
+          opts[:uses_left_composite_keys] = left_key.is_a?(Array)
+          left_pk = (opts[:left_primary_key] ||= self.primary_key)
+          raise(Error, "no primary key specified for #{inspect}") unless left_pk
+          opts[:eager_loader_key] = left_pk unless opts.has_key?(:eager_loader_key)
+          opts[:left_primary_keys] = Array(left_pk)
+          lpkc = opts[:left_primary_key_column] ||= left_pk
+          lpkcs = opts[:left_primary_key_columns] ||= Array(lpkc)
+          opts[:dataset] ||= opts.association_dataset_proc
+
+          opts[:left_key_alias] ||= opts.default_associated_key_alias
+          opts[:eager_loader] ||= opts.method(:default_eager_loader)
+
+          join_type = opts[:graph_join_type]
+          select = opts[:graph_select]
+          graph_block = opts[:graph_block]
+          only_conditions = opts[:graph_only_conditions]
+          use_only_conditions = opts.include?(:graph_only_conditions)
+          conditions = opts[:graph_conditions]
+          opts[:eager_grapher] ||= proc do |eo|
+            ds = eo[:self]
+            iq = eo[:implicit_qualifier]
+            egls = eo[:limit_strategy]
+            if egls && egls != :ruby
+              associated_key_array = opts.associated_key_array
+              orig_egds = egds = eager_graph_dataset(opts, eo)
+              opts.reverse_edges.each{|t| egds = egds.join(t[:table], Array(t[:left]).zip(Array(t[:right])), :table_alias=>t[:alias], :qualify=>:deep)}
+              ft = opts.final_reverse_edge
+              egds = egds.join(ft[:table], Array(ft[:left]).zip(Array(ft[:right])), :table_alias=>ft[:alias], :qualify=>:deep).
+                select_all(egds.first_source).
+                select_append(*associated_key_array)
+              egds = opts.apply_eager_graph_limit_strategy(egls, egds)
+              ds.graph(egds, associated_key_array.map{|v| v.alias}.zip(Array(lpkcs)) + conditions, :qualify=>:deep, :table_alias=>eo[:table_alias], :implicit_qualifier=>iq, :join_type=>eo[:join_type]||join_type, :join_only=>eo[:join_only], :from_self_alias=>eo[:from_self_alias], :select=>select||orig_egds.columns, &graph_block)
+            else
+              opts.edges.each do |t|
+                ds = ds.graph(t[:table], t.fetch(:only_conditions, (Array(t[:right]).zip(Array(t[:left])) + t[:conditions])), :select=>false, :table_alias=>ds.unused_table_alias(t[:table]), :join_type=>eo[:join_type]||t[:join_type], :join_only=>eo[:join_only], :qualify=>:deep, :implicit_qualifier=>iq, :from_self_alias=>eo[:from_self_alias], &t[:block])
+                iq = nil
+              end
+              fe = opts.final_edge
+              ds.graph(opts.associated_class, use_only_conditions ? only_conditions : (Array(opts.right_primary_key).zip(Array(fe[:left])) + conditions), :select=>select, :table_alias=>eo[:table_alias], :qualify=>:deep, :join_type=>eo[:join_type]||join_type, :join_only=>eo[:join_only], &graph_block)
+            end
+          end
+        end
+
+        # Use def_many_through_many, since they share pretty much the same code.
+        def def_one_through_many(opts)
+          def_many_through_many(opts)
+        end
+      end
+
+      module DatasetMethods
+        private
+
+        # Use a subquery to filter rows to those related to the given associated object
+        def many_through_many_association_filter_expression(op, ref, obj)
+          lpks = ref[:left_primary_key_columns]
+          lpks = lpks.first if lpks.length == 1
+          lpks = ref.qualify(model.table_name, lpks)
+          edges = ref.edges
+          first, rest = edges.first, edges[1..-1]
+          ds = model.db[first[:table]].select(*Array(ref.qualify(first[:table], first[:right])))
+          rest.each{|e| ds = ds.join(e[:table], e.fetch(:only_conditions, (Array(e[:right]).zip(Array(e[:left])) + e[:conditions])), :table_alias=>ds.unused_table_alias(e[:table]), :qualify=>:deep, &e[:block])}
+          last_alias = if rest.empty?
+            first[:table]
+          else
+            last_join = ds.opts[:join].last
+            last_join.table_alias || last_join.table
+          end
+
+          meths = if obj.is_a?(Sequel::Dataset)
+            ref.qualify(obj.model.table_name, ref.right_primary_keys)
+          else
+            ref.right_primary_key_methods
+          end
+
+          expr = association_filter_key_expression(ref.qualify(last_alias, Array(ref.final_edge[:left])), meths, obj)
+          unless expr == SQL::Constants::FALSE
+            ds = ds.where(expr).exclude(SQL::BooleanExpression.from_value_pairs(ds.opts[:select].zip([]), :OR))
+            expr = SQL::BooleanExpression.from_value_pairs(lpks=>ds)
+            expr = add_association_filter_conditions(ref, obj, expr)
+          end
+
+          association_filter_handle_inversion(op, expr, Array(lpks))
+        end
+        alias one_through_many_association_filter_expression many_through_many_association_filter_expression
+      end
+    end
+  end
+end