rlsm 0.2.2

data/lib/rlsm/exceptions.rb

@@ -0,0 +1,39 @@
+#
+# This file is part of the RLSM gem.
+#
+#(The MIT License)
+#
+#Copyright (c) 2008 Gunther Diemant <g.diemant@gmx.net>
+#
+#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.
+#
+
+
+class RLSMException < Exception
+end
+
+class MonoidException < RLSMException
+end
+
+class DFAException < RLSMException
+end
+
+class RegExpException < RLSMException
+end

data/lib/rlsm/mgen.rb

@@ -0,0 +1,138 @@
+#
+# This file is part of the RLSM gem.
+#
+#(The MIT License)
+#
+#Copyright (c) 2008 Gunther Diemant <g.diemant@gmx.net>
+#
+#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.
+#
+
+require File.join(File.dirname(__FILE__), 'monoid')
+
+#Generates all monoids of a given order. May take some time if order is greater than 5.
+module RLSM
+  class MonoidGenerator
+
+    #Iterates over all monoids of order n.
+    def self.each(n=2)
+      #The pathological cases...
+      if n == 1
+        yield Monoid.new('0')
+        return
+      elsif n == 2
+        yield Monoid.new('01 10')
+        yield Monoid.new('01 11')
+        return
+      end
+      
+      @@n = n-1
+      @@t = ([0]*((n-1)*(n-1)))/(n-1)
+      @@t = table_adjoin_one
+      @@i, @@j = n-1, n-1
+      
+      @@end_reached = false
+      yield Monoid.new(tab_to_str, :normalize => false) if restrictions_satisfied?
+      succ
+
+      while not @@end_reached
+        yield Monoid.new(tab_to_str, :normalize => false)
+        succ
+      end
+    end
+
+    private
+    def self.succ
+      loop do
+        @@t[@@i][@@j] += 1
+        if @@t[@@i][@@j] > @@n
+          @@t[@@i][@@j] = -1
+          if @@i == 1 and @@j == 1
+            @@end_reached = true
+            break
+          elsif @@j == 1
+            @@j = @@n; @@i -= 1
+          else
+            @@j -= 1
+          end
+        else
+          if restrictions_satisfied? and first?
+            if @@i == @@n and @@j == @@n
+              break
+            elsif @@j == @@n
+              @@j = 1; @@i += 1
+            else
+              @@j += 1
+            end
+          end
+        end
+      end
+    end
+
+    def self.first?
+      (1..@@n).to_a.permutations.collect{|p| p.unshift 0}.all? do |p|
+        #if a permutation changes some elements before the given position
+        #and the replacement is undefined no answer can be given
+        last = (@@i-1)*(@@n) + @@j -1
+        
+        index = (0..last).find do |ind|
+          i,j = (ind / (@@n))+1, (ind % (@@n))+1
+          bij = @@t[p.index(i)][p.index(j)]
+          
+          (bij == -1) or @@t[i][j] != p[bij]
+        end
+        
+        if index
+          i,j = (index / (@@n))+1, (index % (@@n))+1
+          bij = @@t[p.index(i)][p.index(j)]
+      
+          (bij == -1) or (@@t[i][j] < p[@@t[p.index(i)][p.index(j)]])
+        else
+          true
+        end
+      end
+    end
+
+    def self.restrictions_satisfied?
+      #Associativity
+      return false unless (0..@@n).to_a.triples.all? do |a,b,c|
+        if [@@t[a][b],
+            @@t[b][c],
+            @@t[a][@@t[b][c]],
+            @@t[@@t[a][b]][c]].include? -1
+          true
+        else
+          @@t[a][@@t[b][c]] == @@t[@@t[a][b]][c]
+        end
+      end
+
+      true
+    end
+
+    def self.table_adjoin_one
+      res = [(1..@@n).to_a] + @@t
+      (0..@@n).to_a.zip(res).collect { |i,x| [i]+x }
+    end
+
+    def self.tab_to_str
+      @@t.collect { |r| r.join(@@n >= 10 ? ',' : '') }.join(' ')
+    end
+  end
+end

data/lib/rlsm/monkey_patching.rb

@@ -0,0 +1,126 @@
+#
+# This file is part of the RLSM gem.
+#
+#(The MIT License)
+#
+#Copyright (c) 2008 Gunther Diemant <g.diemant@gmx.net>
+#
+#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.
+#
+
+
+class Object
+  #Makes a deep copy. Usful for cloning complexer classes.
+  def deep_copy
+    Marshal.load(Marshal.dump(self))
+  end
+end
+
+
+class Array
+  def tuples
+    res = []
+    self.each { |a| self.each { |b| res << [a,b] } }
+
+    res
+  end
+
+  def triples
+    res = []
+    tuples.each { |a,b| self.each { |c| res << [a,b,c] } }
+
+    res
+  end
+
+  #Only syntactic sugar. Adds an element unless the element is already in the array.
+  def add?(x)
+    if x
+      unless include? x
+        push(x).sort
+      end
+    end
+
+    self
+  end
+
+  #Returns the powerset of the array (interpreted as set).
+  def powerset
+    ret = self.inject([[]]) do |acc, x|
+      res = []
+      acc.each { |s| res << s; res << ([x]+s).sort }
+      res
+    end
+
+    ret.sort do |s1,s2|
+      if s1.size == s2.size
+        s1 <=> s2
+      else
+        s1.size <=> s2.size
+      end
+    end
+  end
+
+  #Returns all proper subsets of the array (the array interpreted as a set).
+  def proper_subsets
+    powerset.select { |s| s.size > 0 and s.size < size }
+  end
+
+  #Returns all permutations of the array.
+  def permutations
+    return [self] if size < 2
+    perm = []
+    each { |e| (self - [e]).permutations.each { |p| perm << ([e] + p) } }
+    perm
+  end
+
+  #Returns the Array divided into subarrays each of length +l+. If The size of the array isn't even divisible by +l+, then the last subarray isn't of size +l+.
+  def /(l)
+    res = []
+    
+    each_with_index do |x,i|
+      res << [] if i % l == 0
+      res.last << x
+    end
+
+    res
+  end
+
+  #This is some hack, that in my regexp code, it works for both Strings and Arrays...
+  def each_char(&block)
+    each &block
+  end
+end
+
+class String
+  #Iterates over every character in a string. (Compatibility with 1.9 and convinience)
+  def each_char
+    if block_given?
+      scan(/./m) { |c| yield c }
+    else
+      scan(/./m)
+    end
+  end
+
+  #This is some hack, that in my regexp code, it works for both Strings and Arrays...
+  def reject(&block)
+    tmp = scan(/./m).reject &block
+    tmp.join
+  end
+end