abst_int 0.0.3

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 3be8352c028620f8caca5fcf4f4a292070e74872
+  data.tar.gz: 6067963034b62ef44f552c74fa4ad611907543e8
+SHA512:
+  metadata.gz: 5dd3b7a312e3e838b1d27fa011130669ef6d657f03e56c5942a80f34fbdd9e8b908ca7f53b65b3345ab838d9c7199e7fb2d6cda9f89823c1dc5e01354bda6434
+  data.tar.gz: d1d864872303440274a85554f0f3118c96aa531f57bfd1dfd879d38d0ecb39c194a6884bd2f29635d987d41d6bfdb591508f311c1a8fc5bfa8e61cd69675bc3b

data/.coveralls.yml

@@ -0,0 +1 @@
+service_name: travis-ci

data/.gitignore

@@ -0,0 +1,22 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp
+*.bundle
+*.so
+*.o
+*.a
+mkmf.log

data/.pryrc

@@ -0,0 +1,18 @@
+# switch default editor for pry to sublime text
+Pry.config.editor = "sublime"
+
+# format prompt to be <Rails version>@<ruby version>(<object>)>
+Pry.config.prompt = proc do |obj, level, _|
+  prompt = "\e[1;30m"
+  prompt << "#{Rails.version} @ " if defined?(Rails)
+  prompt << "#{RUBY_VERSION}"
+  "#{prompt} (#{obj})>\e[0m"
+end
+
+# use awesome print for all objects in pry
+begin
+  require 'awesome_print'
+  Pry.config.print = proc { |output, value| output.puts "=> #{ap value}" }
+rescue
+  puts "=> Unable to load awesome_print, please type 'gem install awesome_print' or 'sudo gem install awesome_print'."
+end

data/.rspec

@@ -0,0 +1,2 @@
+--color
+--require spec_helper

data/.ruby-version

@@ -0,0 +1 @@
+2.1.2

data/.travis.yml

@@ -0,0 +1,6 @@
+language: ruby
+rvm:
+- 2.1.1
+- 2.0.0
+- 1.9.3
+- jruby-19mode

data/Gemfile

@@ -0,0 +1,8 @@
+source 'https://rubygems.org'
+
+group :test do
+  gem 'coveralls', :require => false
+end
+
+# Specify your gem's dependencies in abst_int.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2014 Yuutetu
+
+MIT License
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,34 @@
+# AbstInt
+
+[![Coverage Status](https://coveralls.io/repos/yuutetu/abst_int/badge.png?branch=master)](https://coveralls.io/r/yuutetu/abst_int?branch=master)
+[![Travis Status](https://travis-ci.org/yuutetu/abst_int.svg?branch=master)](https://travis-ci.org/yuutetu/abst_int)
+[![Code Climate](https://codeclimate.com/github/yuutetu/abst_int.png)](https://codeclimate.com/github/yuutetu/abst_int)
+[![Dependency Status](https://gemnasium.com/yuutetu/abst_int.svg)](https://gemnasium.com/yuutetu/abst_int)
+
+TODO: Write a gem description
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'abst_int'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install abst_int
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Contributing
+
+1. Fork it ( https://github.com/[my-github-username]/abst_int/fork )
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create a new Pull Request

data/Rakefile

@@ -0,0 +1,12 @@
+require "bundler/gem_tasks"
+require 'rubygems'
+require 'rake'
+$:.unshift  File.join(File.dirname(__FILE__), "lib")
+
+require 'rspec/core'
+require 'rspec/core/rake_task'
+
+task :default => :spec
+
+desc "Run all specs in spec directory"
+RSpec::Core::RakeTask.new(:spec)

data/abst_int.gemspec

@@ -0,0 +1,26 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'abst_int/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "abst_int"
+  spec.version       = AbstInt::VERSION
+  spec.authors       = ["Yuutetu"]
+  spec.email         = ["yuutetu@gmail.com"]
+  spec.summary       = %q{Abstract Integer}
+  spec.description   = %q{AbstInt provide abstract integer. This can be used to test exhaustively.}
+  spec.homepage      = "https://github.com/yuutetu/abst_int"
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files -z`.split("\x0")
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.6"
+  spec.add_development_dependency "rake"
+  spec.add_development_dependency "rspec"
+  spec.add_development_dependency "pry"
+  spec.add_development_dependency "pry-doc"
+end

data/lib/abst_int.rb

@@ -0,0 +1,83 @@
+require "abst_int/version"
+require "abst_int/or_set"
+require "abst_int/integer"
+
+class AbstInt
+
+  class MultiResultError < StandardError
+  end
+
+  attr_reader :terms
+
+  def initialize terms = AbstInt::OrSet.new(1, true)
+    @terms = terms
+  end
+
+  def + abst_int_or_int
+    terms = to_set abst_int_or_int
+    return AbstInt.new(self.terms + terms)
+  end
+
+  def - abst_int_or_int
+    terms = to_set abst_int_or_int
+    return AbstInt.new(self.terms - terms)
+  end
+
+  def * abst_int_or_int
+    terms = to_set abst_int_or_int
+    return AbstInt.new(self.terms * terms)
+  end
+
+  def / abst_int_or_int
+    raise "not implement"
+  end
+
+  def % num
+    return self.terms % num
+  end
+
+  def | abst_int_or_int
+    terms = to_set abst_int_or_int
+    return AbstInt.new(self.terms | terms)
+  end
+
+  def & abst_int_or_int
+    terms = to_set abst_int_or_int
+    return AbstInt.new(self.terms & terms)
+  end
+
+  def not
+    return AbstInt.new(self.terms.not)
+  end
+
+  def to_s
+    @terms.to_s
+  end
+
+  def object
+    AbstInt::Integer.new self
+  end
+
+  private
+  def to_set abst_int_or_int
+    case abst_int_or_int
+    when ::Integer
+      terms = AbstInt::OrSet.new(abst_int_or_int)
+    when AbstInt
+      terms = abst_int_or_int.terms
+    when AbstInt::Integer
+      terms = abst_int_or_int._terms
+    end
+    return terms
+  end
+end
+
+class Fixnum
+  def mul_with_abst_int num
+    return num * self if (num.is_a? AbstInt) || (num.is_a? AbstInt::Integer)
+    self.mul_without_abst_int num
+  end
+
+  alias :mul_without_abst_int :*
+  alias :* :mul_with_abst_int
+end

data/lib/abst_int/calculus_model/dfa.rb

@@ -0,0 +1,287 @@
+require "set"
+require "abst_int/or_set"
+
+class Object
+  def try key, *args
+    send key, *args
+  end
+end
+
+class NilClass
+  def try key, *args
+    nil
+  end
+
+  def [] some
+    return some
+  end
+
+  def + some
+    return some
+  end
+
+  def | some
+    return some
+  end
+end
+
+module AbstInt::CalculusModel
+  class Dfa
+    def initialize
+      @states = Set.new
+      @initial_state = nil
+      @final_states = Set.new
+      @inputs = Set.new
+      @transition = {}
+    end
+
+    def set_initial state
+      @states << state
+      @initial_state = state
+    end
+
+    def add_final state
+      @states << state
+      @final_states << state
+    end
+
+    # [state] 1,2,3
+    # [input] 'a', 'b', 'c'
+    def add_trans state1, input, state2
+      @states << state1 << state2
+      @inputs << input
+      @transition[state1] ||= {}
+      @transition[state1][input] = state2
+    end
+
+    def & another_dfa
+      dfa = AbstInt::CalculusModel::Dfa.new
+      dfa.set_initial [self.initial_state, another_dfa.initial_state]
+      dfa = generate_inter_dfa another_dfa, dfa, [self.initial_state, another_dfa.initial_state], Set.new
+      dfa.each_states do |states|
+        dfa.add_final states if self.final?(states[0]) && another_dfa.final?(states[1])
+      end
+      return dfa
+    end
+
+    def not
+      cloned_self = self.perfect
+      cloned_self.final_states = cloned_self.states - cloned_self.final_states
+      return cloned_self
+    end
+
+    def final? state
+      @final_states.include? state
+    end
+
+    def each_states &block
+      @states.each &block
+    end
+
+    def to_orset
+      return generate_orset
+    end
+
+    def equal_transition? dfa
+      @transition == dfa.transition
+    end
+
+    def self.filter_dfa
+      dfa = AbstInt::CalculusModel::Dfa.new
+      dfa.set_initial 'A'
+      dfa.add_trans 'A', 'a', 'A'
+      dfa.add_trans 'A', 'b', 'B'
+      dfa.add_trans 'B', 'b', 'B'
+      dfa.add_final 'A'
+      dfa.add_final 'B'
+      return dfa
+    end
+
+    def accept? str
+      result = rec_accept? str, @initial_state
+      return result
+    end
+
+    protected
+    def rec_accept? str, state
+      if str.length == 0
+        return @final_states.include?(state)
+      else
+        head = str[0]
+        rest = str[1..-1]
+        return nil if @transition.try(:[], state).try(:[], head).nil?
+        return self.rec_accept?(rest, @transition.try(:[], state).try(:[], head))
+      end
+    end
+
+    def transition
+      @transition
+    end
+
+    def initial_state
+      @initial_state
+    end
+
+    def final_states
+      @final_states
+    end
+
+    def final_states= final_states
+      @final_states = final_states
+    end
+
+    def states
+      @states
+    end
+
+    def perfect
+      cloned_self = AbstInt::CalculusModel::Dfa.new
+      cloned_self.set_initial self.initial_state
+      self.final_states.each do |state|
+        cloned_self.add_final state
+      end
+      @states.each do |state|
+        @inputs.each do |input|
+          if @transition.try(:[], state).try(:[], input).nil?
+            cloned_self.add_trans state, input, :reject
+          else
+            cloned_self.add_trans state, input, @transition[state][input]
+          end
+        end
+      end
+      return cloned_self
+    end
+
+    private
+    def generate_inter_dfa another_dfa, dfa, state, state_set
+      return dfa if state_set.include? state
+      @inputs.each do |input|
+        return dfa if self.transition.try(:[], state[0]).try(:[], input).nil?
+        return dfa if another_dfa.transition.try(:[], state[1]).try(:[], input).nil?
+        next_state = [self.transition[state[0]][input], another_dfa.transition[state[1]][input]]
+        dfa.add_trans state, input, next_state
+        dfa = generate_inter_dfa another_dfa, dfa, next_state, (state_set << state)
+      end
+      return dfa
+    end
+
+    def generate_orset
+
+      # アルファベットを数字に変更
+      current_dfa = AbstInt::CalculusModel::Dfa.new
+      current_dfa.set_initial @initial_state
+      @final_states.each do |state|
+        current_dfa.add_final state
+      end
+      @transition.each do |state1, value|
+        value.each do |input, state2|
+          case input
+          when 'a'
+            current_dfa.add_trans state1, AbstInt::OrSet.new(1), state2
+          when 'b'
+            current_dfa.add_trans state1, AbstInt::OrSet.new(-1), state2
+          end
+        end
+      end
+
+      remove_states = @states - ([@initial_state] + @final_states.to_a)
+
+      remove_states.each do |state|
+        current_dfa = self_remain_state_for_ofset_dfa! state, current_dfa
+      end
+
+      removed_dfa_without_final = current_dfa
+      current_dfa = nil
+      current_orset = nil
+
+      @final_states.each do |final|
+        current_dfa = removed_dfa_without_final
+        remove_states = current_dfa.states - [@initial_state, final]
+        remove_states.each do |state|
+          current_dfa = self_remain_state_for_ofset_dfa! state, current_dfa
+        end
+        if @initial_state == final then
+          current_dfa.transition[@initial_state].each do |input, state2|
+            if state2 == final
+              current_orset = current_orset | input.star
+            end
+          end
+        else
+          trans_cache = {}
+          current_dfa.transition.each do |state1, value|
+            value.each do |input, state2|
+              trans_cache[state1] ||= {}
+              trans_cache[state1][state2] = input
+            end
+          end
+          match_orset = (trans_cache[@initial_state][@initial_state] | (trans_cache[@initial_state][final] + trans_cache[final][final].try(:star) + trans_cache[final][@initial_state])).try(:star) + trans_cache[@initial_state][final] + trans_cache[final][final].try(:star)
+          current_orset = current_orset | match_orset
+        end
+      end
+
+      return current_orset
+    end
+
+    def cache_check start, goal, pass_states
+      return @cache.try(:[], start).try(:[], goal).try(:[], pass_states)
+    end
+
+    def save_cache start, goal, pass_states, result
+      @cache ||= {}
+      @cache[start] ||= {}
+      @cache[start][goal] ||= {}
+      @cache[start][goal][pass_states] = result
+      return nil
+    end
+
+    protected
+    def self_remain_state_for_ofset_dfa! state, current_dfa
+      new_dfa = AbstInt::CalculusModel::Dfa.new
+      in_states, out_states = Set.new, Set.new
+      current_dfa.transition.each do |state1, value|
+        value.each do |input, state2|
+          (out_states << state2; next) if state1 == state && state2 != state
+          (in_states  << state1; next) if state1 != state && state2 == state
+          new_dfa.add_trans state1, input, state2
+        end
+      end
+
+      trans_cache = {}
+      current_dfa.transition.each do |state1, value|
+        value.each do |input, state2|
+          if in_states.include?(state1) ||
+             out_states.include?(state2) ||
+             state == state1 ||
+             state == state2 then
+            trans_cache[state1] ||= {}
+            trans_cache[state1][state2] = input
+          end
+        end
+      end
+
+      in_states.each do |in_state|
+        out_states.each do |out_state|
+          right_orset = nil
+          if trans_cache.try(:[], in_state).try(:[], state) && trans_cache.try(:[], state).try(:[], out_state) then
+            if trans_cache.try(:[], state).try(:[], state) then
+              right_orset = trans_cache[in_state][state] + trans_cache[state][out_state].star + trans_cache[state][out_state]
+            else
+              right_orset = trans_cache[in_state][state] + trans_cache[state][out_state]
+            end
+          end
+          if trans_cache.try(:[], in_state).try(:[], out_state) && right_orset then
+            new_orset = trans_cache[in_state][out_state] | right_orset
+          elsif right_orset then
+            new_orset = right_orset
+          else
+            new_orset = trans_cache[in_state][out_state]
+          end
+
+          new_dfa.add_trans in_state, new_orset, out_state if new_orset
+        end
+      end
+
+      return new_dfa
+    end
+  end
+end