sbf-dm-validations 1.3.0.beta

data/lib/data_mapper/validation/rule_set.rb

@@ -0,0 +1,157 @@
+require 'forwardable'
+require 'data_mapper/support/ordered_set'
+# TODO: can I use Equalizer without introducing a dependency on dm-core?
+# require 'data_mapper/support/equalizer'
+
+module DataMapper
+  module Validation
+
+    class RuleSet
+      # Holds a collection of Rule instances to be run against
+      # Resources to validate the Resources in a specific context
+
+      extend Equalizer
+      extend Forwardable
+      include Enumerable
+
+      # @api public
+      attr_reader :rules
+
+      # @api private
+      attr_reader :attribute_index
+
+      # @api public
+      attr_accessor :optimize
+
+      equalize :rules
+
+      # @api public
+      def_delegators :attribute_index, :[], :fetch
+
+      # @api public
+      def_delegators :rules, :each, :empty?
+
+      def initialize(optimize = false)
+        @optimize = optimize
+
+        @rules           = OrderedSet.new
+        @attribute_index = Hash.new { |h,k| h[k] = [] }
+      end
+
+      def <<(rule)
+        unless rules.include?(rule)
+          rules << rule
+          attribute_index[rule.attribute_name] << rule
+        end
+        self
+      end
+
+      # Execute all rules in this context against the resource.
+      #
+      # @param [Object] resource
+      #   the resource to be validated
+      #
+      # @return [Array(Violation)]
+      #   an Array of Violations
+      def validate(resource)
+        rules = rules_for_resource(resource)
+        rules.map { |rule| rule.validate(resource) }.compact
+      end
+
+      # Assimilate all the rules from another RuleSet into the receiver
+      #
+      # @param [RuleSet, Array] rules
+      #   The other RuleSet whose rules are to be assimilated
+      #
+      # @return [RuleSet]
+      #   +self+, the receiver
+      def concat(rules)
+        rules.each { |rule| self << rule.dup }
+        self
+      end
+
+      def inspect
+        "#<#{ self.class } {#{ rules.map { |e| e.inspect }.join( ', ' ) }}>"
+      end
+
+    private
+
+      def rules_for_resource(resource)
+        executable_rules = rules.entries.select { |r| r.execute?(resource) }
+
+        # By default we start the list with the full set of executable
+        # rules.
+        #
+        # In the case of a new Resource or regular ruby class instance,
+        # everything needs to be validated completely, and no eager-loading
+        # logic should apply.
+        #
+        # @see #optimized_rules_for_persisted_resource
+        if resource.kind_of?(DataMapper::Resource)
+          if optimize && !resource.new?
+            optimized_rules =
+              optimized_rules_for_persisted_resource(resource, executable_rules)
+            load_validated_properties(resource, optimized_rules)
+            optimized_rules
+          else
+            load_validated_properties(resource, executable_rules)
+            executable_rules
+          end
+        else
+          executable_rules
+        end
+      end
+
+      # Only validate dirty properties on persisted Resources.
+      # Eager load lazy properties that are not yet loaded.
+      #
+      # In the case of a DM::Resource that isn't new, we optimize:
+      #
+      #   1. Eager-load all lazy, not-yet-loaded properties that need
+      #      validation, all at once.
+      #
+      #   2. Limit run rules to
+      #      - those applied to dirty attributes only,
+      #      - those that should always run (presence/absence)
+      #      - those that don't reference any real properties (attribute-less
+      #        block rules, validations in virtual attributes)
+      def optimized_rules_for_persisted_resource(resource, executable_rules)
+        attrs       = resource.attributes(:name)
+        # TODO: update Resource#dirty_attributes to accept :name arg
+        dirty_attrs = Hash[resource.dirty_attributes.map { |p, value| [p.name, value] }]
+        rules       = executable_rules.select { |r|
+          !attrs.include?(r.attribute_name) || dirty_attrs.include?(r.attribute_name)
+        }
+
+        # Finally include any rules that should always run or don't
+        # reference any real properties (field-less block vaildators).
+        rules |= all_rules.select do |v|
+          # TODO: extract this to a #always_validate? interface on Rule
+          #   instead of a #kind_of? test here in RuleSet
+          v.kind_of?(Rule::Block)    ||
+          v.kind_of?(Rule::Method)   ||
+          v.kind_of?(Rule::Presence) ||
+          v.kind_of?(Rule::Absence)
+        end
+
+        rules
+      end
+
+      # Load all lazy, not-yet-loaded properties that need validation,
+      # all at once.
+      def load_validated_properties(resource, rules)
+        properties = resource.model.properties
+
+        properties_to_load = rules.map { |rule|
+          properties[rule.attribute_name]
+        }.compact.select { |property|
+          # TODO: isn't Property#loaded? sufficient?
+          property.lazy? && !property.loaded?(resource)
+        }
+
+        resource.__send__(:eager_load, properties_to_load)
+      end
+    end # class RuleSet
+
+  end # module Validation
+end # module DataMapper

data/lib/data_mapper/validation/support/object.rb

@@ -0,0 +1,19 @@
+# TODO: remove Object#try_call
+class Object
+  # If receiver is callable, calls it and returns result.
+  # If not, just returns receiver itself
+  #
+  # @return [Object]
+  # @api private
+  def try_call(*args)
+    if self.respond_to?(:call)
+      self.call(*args)
+    else
+      self
+    end
+  end
+
+  def validatable?
+    false
+  end
+end

data/lib/data_mapper/validation/support/ordered_hash.rb

@@ -0,0 +1,434 @@
+module DataMapper; module Validation
+  # TITLE:
+  #
+  #   OrderedHash (originally Dictionary)
+  #
+  # AUTHORS:
+  #
+  #   - Jan Molic
+  #   - Thomas Sawyer
+  #
+  # CREDIT:
+  #
+  #   - Andrew Johnson (merge, to_a, inspect, shift and Hash[])
+  #   - Jeff Sharpe    (reverse and reverse!)
+  #   - Thomas Leitner (has_key? and key?)
+  #
+  # LICENSE:
+  #
+  #   Copyright (c) 2005 Jan Molic, Thomas Sawyer
+  #
+  #   Ruby License
+  #
+  #   This module is free software. You may use, modify, and/or redistribute this
+  #   software under the same terms as Ruby.
+  #
+  #   This program is distributed in the hope that it will be useful, but WITHOUT
+  #   ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+  #   FOR A PARTICULAR PURPOSE.
+  #
+  #   Originally ported from OrderHash 2.0, Copyright (c) 2005 jan molic
+  #
+  # LOG:
+  #
+  #   - 2007.10.31 trans
+  #     Fixed initialize so the constructor blocks correctly effected dictionary
+  #     rather then just the internal hash.
+
+  # = Dictionary
+  #
+  # The Dictionary class is a Hash that preserves order.
+  # So it has some array-like extensions also. By defualt
+  # a Dictionary object preserves insertion order, but any
+  # order can be specified including alphabetical key order.
+  #
+  # == Usage
+  #
+  # Just require this file and use Dictionary instead of Hash.
+  #
+  #   # You can do simply
+  #   hsh = Dictionary.new
+  #   hsh['z'] = 1
+  #   hsh['a'] = 2
+  #   hsh['c'] = 3
+  #   p hsh.keys     #=> ['z','a','c']
+  #
+  #   # or using Dictionary[] method
+  #   hsh = Dictionary['z', 1, 'a', 2, 'c', 3]
+  #   p hsh.keys     #=> ['z','a','c']
+  #
+  #   # but this doesn't preserve order
+  #   hsh = Dictionary['z'=>1, 'a'=>2, 'c'=>3]
+  #   p hsh.keys     #=> ['a','c','z']
+  #
+  #   # Dictionary has useful extensions: push, pop and unshift
+  #   p hsh.push('to_end', 15)       #=> true, key added
+  #   p hsh.push('to_end', 30)       #=> false, already - nothing happen
+  #   p hsh.unshift('to_begin', 50)  #=> true, key added
+  #   p hsh.unshift('to_begin', 60)  #=> false, already - nothing happen
+  #   p hsh.keys                     #=> ["to_begin", "a", "c", "z", "to_end"]
+  #   p hsh.pop                      #=> ["to_end", 15], if nothing remains, return nil
+  #   p hsh.keys                     #=> ["to_begin", "a", "c", "z"]
+  #   p hsh.shift                    #=> ["to_begin", 30], if nothing remains, return nil
+  #
+  # == Usage Notes
+  #
+  # * You can use #order_by to set internal sort order.
+  # * #<< takes a two element [k,v] array and inserts.
+  # * Use ::auto which creates Dictionay sub-entries as needed.
+  # * And ::alpha which creates a new Dictionary sorted by key.
+  class OrderedHash
+
+    include Enumerable
+
+    class << self
+      #--
+      # TODO is this needed? Doesn't the super class do this?
+      #++
+      def [](*args)
+        hsh = new
+        if Hash === args[0]
+          hsh.replace(args[0])
+        elsif (args.size % 2) != 0
+          raise ArgumentError, "odd number of elements for Hash"
+        else
+          while !args.empty?
+            hsh[args.shift] = args.shift
+          end
+        end
+        hsh
+      end
+
+      # Like #new but the block sets the order.
+      #
+      def new_by(*args, &blk)
+        new(*args).order_by(&blk)
+      end
+
+      # Alternate to #new which creates a dictionary sorted by key.
+      #
+      #   d = Dictionary.alpha
+      #   d["z"] = 1
+      #   d["y"] = 2
+      #   d["x"] = 3
+      #   d  #=> {"x"=>3,"y"=>2,"z"=>2}
+      #
+      # This is equivalent to:
+      #
+      #   Dictionary.new.order_by { |key,value| key }
+      def alpha(*args, &block)
+        new(*args, &block).order_by_key
+      end
+
+      # Alternate to #new which auto-creates sub-dictionaries as needed.
+      #
+      #   d = Dictionary.auto
+      #   d["a"]["b"]["c"] = "abc"  #=> { "a"=>{"b"=>{"c"=>"abc"}}}
+      #
+      def auto(*args)
+        #AutoDictionary.new(*args)
+        leet = lambda { |hsh, key| hsh[key] = new(&leet) }
+        new(*args, &leet)
+      end
+    end
+
+     # New Dictiionary.
+    def initialize(*args, &blk)
+      @order = []
+      @order_by = nil
+      if blk
+        dict = self                                  # This ensure autmatic key entry effect the
+        oblk = lambda{ |hsh, key| blk[dict,key] }    # dictionary rather then just the interal hash.
+        @hash = Hash.new(*args, &oblk)
+      else
+        @hash = Hash.new(*args)
+      end
+    end
+
+    def order
+      reorder if @order_by
+      @order
+    end
+
+    # Keep dictionary sorted by a specific sort order.
+    def order_by( &block )
+      @order_by = block
+      order
+      self
+    end
+
+    # Keep dictionary sorted by key.
+    #
+    #   d = Dictionary.new.order_by_key
+    #   d["z"] = 1
+    #   d["y"] = 2
+    #   d["x"] = 3
+    #   d  #=> {"x"=>3,"y"=>2,"z"=>2}
+    #
+    # This is equivalent to:
+    #
+    #   Dictionary.new.order_by { |key,value| key }
+    #
+    # The initializer Dictionary#alpha also provides this.
+    def order_by_key
+      @order_by = lambda { |k,v| k }
+      order
+      self
+    end
+
+    # Keep dictionary sorted by value.
+    #
+    #   d = Dictionary.new.order_by_value
+    #   d["z"] = 1
+    #   d["y"] = 2
+    #   d["x"] = 3
+    #   d  #=> {"x"=>3,"y"=>2,"z"=>2}
+    #
+    # This is equivalent to:
+    #
+    #   Dictionary.new.order_by { |key,value| value }
+    def order_by_value
+      @order_by = lambda { |k,v| v }
+      order
+      self
+    end
+
+    #
+    def reorder
+      if @order_by
+        assoc = @order.collect{ |k| [k,@hash[k]] }.sort_by(&@order_by)
+        @order = assoc.collect{ |k,v| k }
+      end
+      @order
+    end
+
+    def ==(hsh2)
+      if hsh2.is_a?( Dictionary )
+        @order == hsh2.order &&
+        @hash  == hsh2.instance_variable_get("@hash")
+      else
+        false
+      end
+    end
+
+    def [] k
+      @hash[ k ]
+    end
+
+    def fetch(k, *a, &b)
+      @hash.fetch(k, *a, &b)
+    end
+
+    # Store operator.
+    #
+    #   h[key] = value
+    #
+    # Or with additional index.
+    #
+    #  h[key,index] = value
+    def []=(k, i=nil, v=nil)
+      if v
+        insert(i,k,v)
+      else
+        store(k,i)
+      end
+    end
+
+    def insert( i,k,v )
+      @order.insert( i,k )
+      @hash.store( k,v )
+    end
+
+    def store( a,b )
+      @order.push( a ) unless @hash.has_key?( a )
+      @hash.store( a,b )
+    end
+
+    def clear
+      @order = []
+      @hash.clear
+    end
+
+    def delete( key )
+      @order.delete( key )
+      @hash.delete( key )
+    end
+
+    def each_key
+      order.each { |k| yield( k ) }
+      self
+    end
+
+    def each_value
+      order.each { |k| yield( @hash[k] ) }
+      self
+    end
+
+    def each
+      order.each { |k| yield( k,@hash[k] ) }
+      self
+    end
+    alias each_pair each
+
+    def delete_if
+      order.clone.each { |k| delete k if yield(k,@hash[k]) }
+      self
+    end
+
+    def values
+      ary = []
+      order.each { |k| ary.push @hash[k] }
+      ary
+    end
+
+    def keys
+      order
+    end
+
+    def invert
+      hsh2 = self.class.new
+      order.each { |k| hsh2[@hash[k]] = k }
+      hsh2
+    end
+
+    def reject( &block )
+      self.dup.delete_if(&block)
+    end
+
+    def reject!( &block )
+      hsh2 = reject(&block)
+      self == hsh2 ? nil : hsh2
+    end
+
+    def replace( hsh2 )
+      @order = hsh2.order
+      @hash = hsh2.hash
+    end
+
+    def shift
+      key = order.first
+      key ? [key,delete(key)] : super
+    end
+
+    def unshift( k,v )
+      unless @hash.include?( k )
+        @order.unshift( k )
+        @hash.store( k,v )
+        true
+      else
+        false
+      end
+    end
+
+    def <<(kv)
+      push( *kv )
+    end
+
+    def push( k,v )
+      unless @hash.include?( k )
+        @order.push( k )
+        @hash.store( k,v )
+        true
+      else
+        false
+      end
+    end
+
+    def pop
+      key = order.last
+      key ? [key,delete(key)] : nil
+    end
+
+    def inspect
+      ary = []
+      each {|k,v| ary << k.inspect + "=>" + v.inspect}
+      '{' + ary.join(", ") + '}'
+    end
+
+    def dup
+      a = []
+      each{ |k,v| a << k; a << v }
+      self.class[*a]
+    end
+
+    def update( hsh2 )
+      hsh2.each { |k,v| self[k] = v }
+      reorder
+      self
+    end
+    alias :merge! update
+
+    def merge( hsh2 )
+      self.dup.update(hsh2)
+    end
+
+    def select
+      ary = []
+      each { |k,v| ary << [k,v] if yield k,v }
+      ary
+    end
+
+    def reverse!
+      @order.reverse!
+      self
+    end
+
+    def reverse
+      dup.reverse!
+    end
+
+    def first
+      @hash[order.first]
+    end
+
+    def last
+      @hash[order.last]
+    end
+
+    def length
+      @order.length
+    end
+    alias :size :length
+
+    def empty?
+      @hash.empty?
+    end
+
+    def has_key?(key)
+      @hash.has_key?(key)
+    end
+
+    def key?(key)
+      @hash.key?(key)
+    end
+
+    def to_a
+      ary = []
+      each { |k,v| ary << [k,v] }
+      ary
+    end
+
+    def to_json
+      buf = "["
+      map do |k,v|
+        buf << k.to_json
+        buf << ", "
+        buf << v.to_json
+      end.join(", ")
+      buf << "]"
+      buf
+    end
+
+    def to_s
+      self.to_a.to_s
+    end
+
+    def to_hash
+      @hash.dup
+    end
+
+    def to_h
+      @hash.dup
+    end
+  end
+end; end

data/lib/data_mapper/validation/version.rb

@@ -0,0 +1,5 @@
+module DataMapper
+  module Validation
+    VERSION = '1.3.0.beta'
+  end
+end