manasimu 0.0.26 → 0.0.27

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: f194c1efd40c93772541e4aa6bf1164ff46a836a91887e848944548ed5afabde
-  data.tar.gz: 1716988949899acf5972599c371dd95696748311afd728d1bcd6a9040c2ef901
+  metadata.gz: 4f594d88260d5a385a6c371967d6dba160e1078a3b0df93afeb6b260ae24298c
+  data.tar.gz: 3d5ad358c02c73e33802222f9729bd5c457249678eadb85f90420ff6703bb26f
 SHA512:
-  metadata.gz: 14ffb32574c728c83f737d234205e37a85748ba08a68fe952e5a3945a5fb8715ed3791105fa89971f7c874b76de8e9ca8a6168ec7a7d64992f1482adc8ec8f17
-  data.tar.gz: 5e2a6b2740ec5259ab5d60625b6201b05707022735808e75fd1d1d3753ff591db9b9a651401f48b3b91367ebf6baa9c58f0f6448d6ac73bd33a67f381bc13a1b
+  metadata.gz: 11c10118e360fa088964054f4f3083a6dc493528970083ca0af3b24b5729caeae89becb979d23ac872e99f83c6f7b6ac287b9feff70f8c2d724019865f1ba539
+  data.tar.gz: 187a68ae85b566b9e8e592da86aa9e1338ee030b582211045be954e225ed450d3796fd171379e5862706f233a65b4bf506113d2cbc302d9af079924a97fbae39

data/lib/manasimu/card.rb

@@ -298,6 +298,15 @@ class CardType
     @contents[0].names
   end
 
+  @name_ja_split = nil
+  def name_ja_split
+    return @name_ja_split if @name_ja_split
+    c = @contents[0]
+    return "" if not c.names
+    return "" if not c.names[0]
+    @name_ja_split = c.names[0].split(' // ')[0]
+  end
+
   def playable?(lands, capas)
     return [false, [], []] if lands.empty?
     return [false, [], []] if converted_mana_cost > lands.length
@@ -385,6 +394,14 @@ class CardType
     [played_count, drawed_count, can_played_count, mana_sources_count]
   end
 
+  def <=>(o)
+    a = @contents[0]
+    b = o.contents[0]
+    d = a.set_code <=> b.set_code
+    return d if d != 0
+    a.number <=> b.number
+  end
+
   def to_s
     @contents.map {|c| c.to_s}.join(",")
   end
@@ -399,6 +416,10 @@ class CardTypeAggregate
     @memo = []
   end
 
+  def sort!
+    @memo.sort!
+  end
+
   def find(set_code, number)
     ret = @memo.bsearch do |c|
       a = c.contents[0]
@@ -415,6 +436,10 @@ class CardTypeAggregate
     end
   end
 
+  def length
+    @memo.length
+  end
+
   def add(card_type)
     @memo << card_type
   end
@@ -439,7 +464,7 @@ class Content
   def initialize(hash)
     @name = hash[:name]
     @names = hash[:names]
-    @number = hash[:number]
+    @number = hash[:number].to_i
     @side = hash[:side]
     @set_code = hash[:set_code]
     @mana_cost = hash[:mana_cost]
@@ -455,7 +480,7 @@ class Content
   end
 
   def to_s
-    "[#{@name}] [#{@types}] [#{@color_identity}] [#{@mana_cost}]"
+    "[#{@name}] [#{@names}] [#{@types}] [#{@color_identity}] [#{@mana_cost}]"
   end
 
   def to_factory

data/lib/manasimu/data.rb

@@ -74,64 +74,144 @@ class Deck
       distinct_types << type
     end
 
+    en = -1
+    ja = 0
 
-    [-1, 4].each do |j|
+    [en, ja].each do |language|
 
       distinct_types.sort! do |a,b| 
-        if j < 0
+        if language == en
           a.name <=> b.name 
-        elsif a.names[j] and b.names[j]
-          a.names[j] <=> b.names[j]
-        elsif not a.names[j] and not b.names[j]
-          0
-        elsif a.names[j]
-          -1
+        elsif language == ja
+          d = a.name_ja_split.length <=> b.name_ja_split.length
+          if d == 0
+            a.name_ja_split <=> b.name_ja_split
+          else
+            d
+          end
         else
-          1
+          # none
         end
       end
 
       lines.each do |line|
         line.chomp!
-        search_type = distinct_types.bsearch do |type|
-          if j < 0
-            name = type.name.split(' // ')[0]
-          elsif type.names[j]
-            name = type.names[j].split(' // ')[0]
-          end
+        line.chomp.strip!
+        line.chomp.lstrip!
+        line.gsub!(/ \d+$/, '')
 
-          if name
-            flag = true
-            name.chars.each_with_index do |nc,i|
-              if line.length > i
-                lc = line.chars[i]
-                if nc > lc
+        if line =~ /^[\/,\|\d-]*$/ or line =~ /^x\d+$/
+          next 
+        end
+
+        search_type = 
+          if language == en
+            # binary search
+            distinct_types.bsearch do |type|
+              name = type.name.split(' // ')[0]
+              flag = true
+              name.chars.each_with_index do |nc,i|
+                if line.length > i
+                  lc = line.chars[i]
+                  if nc > lc
+                    flag = true
+                    break
+                  elsif nc < lc
+                    flag = false
+                    break
+                  else
+                    # continue
+                  end
+                else
                   flag = true
                   break
-                elsif nc < lc
-                  flag = false
+                end
+              end
+              flag
+            end
+          else language == ja
+            # Levenshtein distance
+            
+            line.gsub!(/[①②③④⑤⑥⑦⑧⑨⑩⑪⑫⑬●〇▼▽▲△]+/, '')
+            line.chomp!
+            line.strip!
+            line.lstrip!
+
+            len = line.length
+
+            s_index = distinct_types.bsearch_index do |type|
+              name = type.name_ja_split
+              name.length >= len - 2
+            end
+
+            e_index = distinct_types.bsearch_index do |type|
+              name = type.name_ja_split
+              name.length >= len + 2
+            end
+
+            next if not s_index
+
+            min = Float::MAX
+            min_type = nil
+
+            distinct_types[s_index..e_index].each do |type|
+              name = type.name_ja_split
+
+              check_indexies = []
+              if name.length == 1
+                check_indexies[0] = 0
+              elsif name.length == 2
+                check_indexies[0] = 0
+                check_indexies[1] = 1
+              elsif name.length > 0
+                check_indexies[0] = 0
+                check_indexies[1] = (name.length / 2).to_i
+                check_indexies[2] = name.length - 1
+              end
+
+              next if check_indexies.length == 0
+
+              include_some = false
+              check_indexies.each do |idx|
+                if not name[idx].empty? and line.index(name[idx])
+                  include_some = true
                   break
-                else
-                  # continue
                 end
-              else
-                flag = true
+              end
+
+              next if not include_some
+
+              d = levenshtein(line, name)
+              base =  [name.length, line.length].max
+              diff_rate =  d.to_f / base
+              if diff_rate < min
+                min = diff_rate
+                min_type = type
+              end
+              if d == 0
                 break
               end
             end
-            flag
-          else
-            false
+
+            result = nil
+
+            if min_type and min <= 0.3
+              result = min_type
+            end
+
+            result
           end
-        end
+
         if search_type
-          if j < 0
+          if language == en
             a = search_type.name.split(' // ')[0]
-          else
-            a = search_type.names[j].split(' // ')[0]
-          end
-          if line =~ /^#{a}.*$/ and a != 'X'
+            if line =~ /^#{a}.*$/ and a != 'X'
+              ret << search_type
+            end
+          elsif language == ja
             ret << search_type
+          else
+            # none
           end
         end
       end
@@ -142,6 +222,25 @@ class Deck
     ret
   end
 
+  def self.tsearch(arr, line, low, high)
+    if high - low < 1000
+      return [low, high]
+    end
+    c1 = ((low * 2 + high ) / 3).to_i - 1
+    c2 = ((low + high * 2 ) / 3).to_i + 1
+
+    n1 = arr[c1].name_ja_split
+    n2 = arr[c2].name_ja_split
+    
+    y1 = levenshtein(line, n1)
+    y2 = levenshtein(line, n2)
+    if y1 > y2
+      tsearch(arr, line, c1, high)
+    else
+      tsearch(arr, line, low, c2)
+    end
+  end
+
   def self.get_card_details(deck_items)
     cards = []
     card_id = 0
@@ -181,4 +280,26 @@ class Deck
     end
     [cards, clone_card_types]
   end
+
+  def self.levenshtein(first, second)
+    matrix = [(0..first.length).to_a]
+    (1..second.length).each do |j|
+      matrix << [j] + [0] * (first.length)
+    end
+
+    (1..second.length).each do |i|
+      (1..first.length).each do |j|
+        if first[j-1] == second[i-1]
+          matrix[i][j] = matrix[i-1][j-1]
+        else
+          matrix[i][j] = [
+            matrix[i-1][j],
+            matrix[i][j-1],
+            matrix[i-1][j-1],
+          ].min + 1
+        end
+      end
+    end
+    return matrix.last.last
+  end
 end

data/lib/manasimu/expansion.rb

@@ -1,3 +1,14 @@
 class Expansion
   attr_accessor :code, :name, :exists
+
+  def self.load
+    return [] if not File.exists?(File.expand_path( '../../../db/expansions', __FILE__ ))
+    File.open(File.expand_path( '../../../db/expansions', __FILE__ ), "r") do |file|
+      Marshal.load(file)
+    end
+  end
+
+  def ==(other)
+    self.code == other.code and self.exists
+  end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: manasimu
 version: !ruby/object:Gem::Version
-  version: 0.0.26
+  version: 0.0.27
 platform: ruby
 authors:
 - so1itaryrove
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2022-06-04 00:00:00.000000000 Z
+date: 2022-08-13 00:00:00.000000000 Z
 dependencies: []
 description: mtg arrena mana curve simulator
 email: so1itaryrove@gmail.com