dry-validation 0.13.3 → 1.0.0.alpha1

data/lib/dry/validation/input_processor_compiler.rb

@@ -1,137 +0,0 @@
-require 'dry/types'
-require 'dry/types/compiler'
-
-module Dry
-  module Validation
-    class InputProcessorCompiler
-      attr_reader :type_compiler
-
-      DEFAULT_TYPE_NODE = [:definition, [String, {}]].freeze
-
-      def initialize
-        @type_compiler = Dry::Types::Compiler.new(Dry::Types)
-      end
-
-      def call(ast)
-        type_compiler.(hash_node(schema_ast(ast)))
-      end
-
-      def schema_ast(ast)
-        ast.map { |node| visit(node) }
-      end
-
-      def visit(node, *args)
-        send(:"visit_#{node[0]}", node[1], *args)
-      end
-
-      def visit_rule(node, *args)
-        _, rule = node
-        visit(rule, *args)
-      end
-
-      def visit_type(type, *args)
-        if type.is_a?(Types::Constructor)
-          constructor(type)
-        elsif type.respond_to?(:rule)
-          visit(type.rule.to_ast, *args)
-        end
-      end
-
-      def constructor(type)
-        fn_id = type.__send__(:register_fn, type.fn)
-        [:constructor, [[:definition, [type.primitive, {}]], fn_id, {}]]
-      end
-
-      def visit_schema(schema, *args)
-        hash_node(schema.input_processor_ast(identifier))
-      end
-
-      def visit_or(node, *args)
-        left, right = node
-        [:sum, [visit(left, *args), visit(right, *args), {}]]
-      end
-
-      def visit_and(node, first = true)
-        if first
-          name, type = node.map { |n| visit(n, false) }.uniq
-
-          if name.is_a?(Array)
-            type
-          else
-            [:member, [name, type]]
-          end
-        else
-          result = node.map { |n| visit(n, first) }.uniq
-
-          if result.size == 1
-            result.first
-          else
-            result.select { |r| r != self.class::DEFAULT_TYPE_NODE }.last
-          end
-        end
-      end
-
-      def visit_implication(node, *args)
-        left, right = node
-
-        key = visit(left)
-
-        if key.is_a?(Symbol)
-          [:member, [key, visit(right, false)]]
-        else
-          [:sum, [key, visit(right, false), {}]]
-        end
-      end
-
-      def visit_not(node, *args)
-        visit(node, *args)
-      end
-
-      def visit_key(node, *args)
-        _, other = node
-        visit(other, *args)
-      end
-
-      def visit_val(node, *args)
-        visit(node, *args)
-      end
-
-      def visit_set(node, *)
-        hash_node(node.map { |n| visit(n) })
-      end
-
-      def visit_each(node, *args)
-        array_node(visit(node, *args))
-      end
-
-      def visit_predicate(node, *)
-        id, args = node
-
-        if id == :key?
-          args[0][1]
-        else
-          type(id, args.map(&:last))
-        end
-      end
-
-      def type(predicate, args)
-        default = self.class::PREDICATE_MAP[:default]
-
-        type_value = if predicate == :type?
-                       const = args[0]
-                       self.class::CONST_MAP[const] || Types.identifier(const)
-                     else
-                       self.class::PREDICATE_MAP[predicate] || default
-                     end
-
-        require 'dry/types/compat/int' unless Types.container.key?(type_value)
-
-        Types[type_value].to_ast
-      end
-    end
-  end
-end
-
-require 'dry/validation/input_processor_compiler/sanitizer'
-require 'dry/validation/input_processor_compiler/json'
-require 'dry/validation/input_processor_compiler/params'

data/lib/dry/validation/input_processor_compiler/json.rb

@@ -1,45 +0,0 @@
-module Dry
-  module Validation
-    class InputProcessorCompiler::JSON < InputProcessorCompiler
-      PREDICATE_MAP = {
-        default: 'string',
-        none?: 'json.nil',
-        bool?: 'bool',
-        str?: 'string',
-        int?: 'integer',
-        float?: 'float',
-        decimal?: 'json.decimal',
-        date?: 'json.date',
-        date_time?: 'json.date_time',
-        time?: 'json.time'
-      }.freeze
-
-      CONST_MAP = {
-        NilClass => 'nil',
-        String => 'string',
-        Integer => 'integer',
-        Float => 'float',
-        BigDecimal => 'json.decimal',
-        Array => 'json.array',
-        Hash => 'json.hash',
-        Date => 'json.date',
-        DateTime => 'json.date_time',
-        Time => 'json.time',
-        TrueClass => 'true',
-        FalseClass => 'false'
-      }.freeze
-
-      def identifier
-        :json
-      end
-
-      def hash_node(schema)
-        [:json_hash, [schema, {}]]
-      end
-
-      def array_node(members)
-        [:json_array, [members, {}]]
-      end
-    end
-  end
-end

data/lib/dry/validation/input_processor_compiler/params.rb

@@ -1,49 +0,0 @@
-module Dry
-  module Validation
-    class InputProcessorCompiler::Params < InputProcessorCompiler
-      PREDICATE_MAP = {
-        default: 'string',
-        none?: 'params.nil',
-        bool?: 'params.bool',
-        true?: 'params.true',
-        false?: 'params.false',
-        str?: 'string',
-        int?: 'params.integer',
-        float?: 'params.float',
-        decimal?: 'params.decimal',
-        date?: 'params.date',
-        date_time?: 'params.date_time',
-        time?: 'params.time',
-        hash?: 'params.hash',
-        array?: 'params.array'
-      }.freeze
-
-      CONST_MAP = {
-        NilClass => 'params.nil',
-        String => 'string',
-        Integer => 'params.integer',
-        Float => 'params.float',
-        BigDecimal => 'params.decimal',
-        Array => 'params.array',
-        Hash => 'params.hash',
-        Date => 'params.date',
-        DateTime => 'params.date_time',
-        Time => 'params.time',
-        TrueClass => 'params.true',
-        FalseClass => 'params.false'
-      }.freeze
-
-      def identifier
-        :params
-      end
-
-      def hash_node(schema)
-        [:params_hash, [schema, {}]]
-      end
-
-      def array_node(members)
-        [:params_array, [members, {}]]
-      end
-    end
-  end
-end

data/lib/dry/validation/input_processor_compiler/sanitizer.rb

@@ -1,47 +0,0 @@
-module Dry
-  module Validation
-    class InputProcessorCompiler::Sanitizer < InputProcessorCompiler
-      PREDICATE_MAP = {
-        default: 'string',
-        none?: 'nil',
-        bool?: 'bool',
-        str?: 'string',
-        int?: 'integer',
-        float?: 'float',
-        decimal?: 'decimal',
-        date?: 'date',
-        date_time?: 'date_time',
-        time?: 'time',
-        hash?: 'hash',
-        array?: 'array'
-      }.freeze
-
-      CONST_MAP = {
-        NilClass => 'nil',
-        String => 'string',
-        Integer => 'integer',
-        Float => 'float',
-        BigDecimal => 'decimal',
-        Array => 'array',
-        Hash => 'hash',
-        Date => 'date',
-        DateTime => 'date_time',
-        Time => 'time',
-        TrueClass => 'true',
-        FalseClass => 'false'
-      }.freeze
-
-      def identifier
-        :sanitizer
-      end
-
-      def hash_node(schema)
-        [:hash, [:weak, schema, {}]]
-      end
-
-      def array_node(members)
-        [:array, [members, {}]]
-      end
-    end
-  end
-end

data/lib/dry/validation/message.rb

@@ -1,98 +0,0 @@
-require 'dry/equalizer'
-
-module Dry
-  module Validation
-    class Message
-      include Dry::Equalizer(:predicate, :path, :text, :options)
-
-      attr_reader :predicate, :path, :text, :rule, :args, :options
-
-      class Or
-        attr_reader :left
-
-        attr_reader :right
-
-        attr_reader :path
-
-        attr_reader :messages
-
-        def initialize(left, right, messages)
-          @left = left
-          @right = right
-          @messages = messages
-          @path = left.path
-        end
-
-        def hint?
-          false
-        end
-
-        def root?
-          path.empty?
-        end
-
-        def to_s
-          [left, right].uniq.join(" #{messages[:or].()} ")
-        end
-      end
-
-      class Check < Message
-        def initialize(*args)
-          super
-          @path = [rule] unless rule.to_s.end_with?('?') || path.include?(rule)
-        end
-      end
-
-      def self.[](predicate, path, text, options)
-        if options[:check]
-          Message::Check.new(predicate, path, text, options)
-        else
-          Message.new(predicate, path, text, options)
-        end
-      end
-
-      def initialize(predicate, path, text, options)
-        @predicate = predicate
-        @path = path
-        @text = text
-        @options = options
-        @rule = options[:rule]
-        @args = options[:args] || EMPTY_ARRAY
-
-        if predicate == :key?
-          @path << rule
-        end
-      end
-
-      def to_s
-        text
-      end
-
-      def signature
-        @signature ||= [predicate, args, path].hash
-      end
-
-      def hint?
-        false
-      end
-
-      def root?
-        path.empty?
-      end
-
-      def eql?(other)
-        other.is_a?(String) ? text == other : super
-      end
-    end
-
-    class Hint < Message
-      def self.[](predicate, path, text, options)
-        Hint.new(predicate, path, text, options)
-      end
-
-      def hint?
-        true
-      end
-    end
-  end
-end

data/lib/dry/validation/message_compiler.rb

@@ -1,188 +0,0 @@
-require 'dry/validation/message'
-require 'dry/validation/message_set'
-require 'dry/validation/message_compiler/visitor_opts'
-
-module Dry
-  module Validation
-    class MessageCompiler
-      attr_reader :messages, :options, :locale, :default_lookup_options
-
-      EMPTY_OPTS = VisitorOpts.new
-      LIST_SEPARATOR = ', '.freeze
-
-      def initialize(messages, options = {})
-        @messages = messages
-        @options = options
-        @full = @options.fetch(:full, false)
-        @hints = @options.fetch(:hints, true)
-        @locale = @options.fetch(:locale, messages.default_locale)
-        @default_lookup_options = { locale: locale }
-      end
-
-      def full?
-        @full
-      end
-
-      def hints?
-        @hints
-      end
-
-      def with(new_options)
-        return self if new_options.empty?
-        self.class.new(messages, options.merge(new_options))
-      end
-
-      def call(ast)
-        MessageSet[ast.map { |node| visit(node) }, failures: options.fetch(:failures, true)]
-      end
-
-      def visit(node, *args)
-        __send__(:"visit_#{node[0]}", node[1], *args)
-      end
-
-      def visit_failure(node, opts = EMPTY_OPTS)
-        rule, other = node
-        visit(other, opts.(rule: rule))
-      end
-
-      def visit_hint(node, opts = EMPTY_OPTS)
-        if hints?
-          visit(node, opts.(message_type: :hint))
-        end
-      end
-
-      def visit_each(node, opts = EMPTY_OPTS)
-        # TODO: we can still generate a hint for elements here!
-        []
-      end
-
-      def visit_not(node, opts = EMPTY_OPTS)
-        visit(node, opts.(not: true))
-      end
-
-      def visit_check(node, opts = EMPTY_OPTS)
-        keys, other = node
-        visit(other, opts.(path: keys.last, check: true))
-      end
-
-      def visit_rule(node, opts = EMPTY_OPTS)
-        name, other = node
-        visit(other, opts.(rule: name))
-      end
-
-      def visit_schema(node, opts = EMPTY_OPTS)
-        node.rule_ast.map { |rule| visit(rule, opts) }
-      end
-
-      def visit_and(node, opts = EMPTY_OPTS)
-        left, right = node.map { |n| visit(n, opts) }
-
-        if right
-          [left, right]
-        else
-          left
-        end
-      end
-
-      def visit_or(node, opts = EMPTY_OPTS)
-        left, right = node.map { |n| visit(n, opts) }
-
-        if [left, right].flatten.map(&:path).uniq.size == 1
-          Message::Or.new(left, right, -> k { messages[k, default_lookup_options] })
-        elsif right.is_a?(Array)
-          right
-        else
-          [left, right]
-        end
-      end
-
-      def visit_predicate(node, base_opts = EMPTY_OPTS)
-        predicate, args = node
-
-        *arg_vals, val = args.map(&:last)
-        tokens = message_tokens(args)
-
-        input = val != Undefined ? val : nil
-
-        options = base_opts.update(lookup_options(arg_vals: arg_vals, input: input))
-        msg_opts = options.update(tokens)
-
-        rule = msg_opts[:rule]
-        path = msg_opts[:path]
-
-        template = messages[rule] || messages[predicate, msg_opts]
-
-        unless template
-          raise MissingMessageError, "message for #{predicate} was not found"
-        end
-
-        text = message_text(rule, template, tokens, options)
-
-        message_class = options[:message_type] == :hint ? Hint : Message
-
-        message_class[
-          predicate, path, text,
-          args: arg_vals,
-          input: input,
-          rule: rule,
-          check: base_opts[:check]
-        ]
-      end
-
-      def visit_key(node, opts = EMPTY_OPTS)
-        name, other = node
-        visit(other, opts.(path: name))
-      end
-
-      def visit_set(node, opts = EMPTY_OPTS)
-        node.map { |el| visit(el, opts) }
-      end
-
-      def visit_implication(node, *args)
-        _, right = node
-        visit(right, *args)
-      end
-
-      def visit_xor(node, opts = EMPTY_OPTS)
-        left, right = node
-        [visit(left, opts), visit(right, opts)].uniq
-      end
-
-      def visit_type(node, opts = EMPTY_OPTS)
-        visit(node.rule.to_ast, opts)
-      end
-
-      def lookup_options(arg_vals: [], input: nil)
-        default_lookup_options.merge(
-          arg_type: arg_vals.size == 1 && arg_vals[0].class,
-          val_type: input.class
-        )
-      end
-
-      def message_text(rule, template, tokens, opts)
-        text = template[template.data(tokens)]
-
-        if full?
-          rule_name = messages.rule(rule, opts) || rule
-          "#{rule_name} #{text}"
-        else
-          text
-        end
-      end
-
-      def message_tokens(args)
-        args.each_with_object({}) { |arg, hash|
-          case arg[1]
-          when Array
-            hash[arg[0]] = arg[1].join(LIST_SEPARATOR)
-          when Range
-            hash["#{arg[0]}_left".to_sym] = arg[1].first
-            hash["#{arg[0]}_right".to_sym] = arg[1].last
-          else
-            hash[arg[0]] = arg[1]
-          end
-        }
-      end
-    end
-  end
-end