dawg 0.0.5 → 0.0.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
-SHA1:
-  metadata.gz: 4d659506ed1f7cf665b2a419cfaae3a88fb84ea6
-  data.tar.gz: c50623e855882d66e358d2c821a5dbaaaf74c3b6
+SHA256:
+  metadata.gz: 313d11f89980b52175bb0bc2234f6a933afea84048466698697015181d5fa0c4
+  data.tar.gz: 9db52e8deb0f228cb56ce5ee6225ef138b7cad3c9caa9c1ce96013fd2710a081
 SHA512:
-  metadata.gz: df82f68a09db9fb1ddf78133896de75eb03a4713099eae605d5aac7c876f637226847ec7d5100db742ce44c84b5a5ef7dba2b6419e3082029fc067021fa002c0
-  data.tar.gz: 6fd58c9076ceb71704403fc7fd525878c31b1e3999dc406d4ea24a9ab10e770bf60e079f40f89a0798ba9f4a7bba18b9b26bfb0f87af3bca6a8dee63d3854075
+  metadata.gz: 0252d63616bd675da494d07bf22bb3cc23a080f88e01f4a6832bda3141ec3b21dc0be3c75e98758f8853efd7f5d72f5d1dedb15eedc9976d3913eac56c43977e
+  data.tar.gz: 21af8978cf0a0a7454b25230371f3c25b9de40f5185037c05ec22dacbae7b0592953824d014d37998546539aa59aeff7a2704be5253d83ca3200680019262641

data/lib/dawg/finder.rb

@@ -8,12 +8,9 @@ module Dawg
       node = @the_node
       word.each_char do |letter|
         next_node = node[letter]
-        if next_node != nil
-          node = next_node
-          next
-        else
-          return false
-        end
+        return fasel if next_node.nil?
+
+        node = next_node
       end
       node.final
     end
@@ -21,32 +18,35 @@ module Dawg
     # get all words with given prefix
     def query(word)
       node = @the_node
-      results = []
-      word.split("").each do |letter|
+
+      word.split('').each do |letter|
         next_node = node[letter]
-        if next_node != nil
-          node = next_node
-          next
-        else
-          return ['']
+        return [] if next_node.nil?
+
+        node = next_node
+      end
+
+      Enumerator.new do |result|
+        result << Word.new(word, node.final).to_s if node.final
+        get_childs(node).each do |s|
+          current_word = (Word.new(word) + s)
+          result << current_word.to_s if current_word.final
         end
       end
-      results << Word.new(word, node.final)
-      results += get_childs(node).map{|s| Word.new(word) + s}
-      results.select{|r| r.final}.map{|r| r.to_s }
     end
 
     def get_childs(node)
-      results = []
-      node.each_edge do |letter|
-        next_node = node[letter]
-        if next_node != nil
-          results += get_childs(next_node).map{|s| Word.new(letter) + s}
-          results << Word.new(letter, next_node.final)
+      Enumerator.new do |result|
+        node.each_edge do |letter|
+          next_node = node[letter]
+          next if next_node.nil?
+
+          get_childs(next_node).each do |s|
+            result << Word.new(letter) + s
+          end
+          result << Word.new(letter, next_node.final)
         end
       end
-      results
     end
   end
-
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: dawg
 version: !ruby/object:Gem::Version
-  version: 0.0.5
+  version: 0.0.6
 platform: ruby
 authors:
 - Maksatbek Manurov
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-03-23 00:00:00.000000000 Z
+date: 2020-02-04 00:00:00.000000000 Z
 dependencies: []
 description: Basic deterministic acyclic finite state automaton in ruby
 email:
@@ -44,8 +44,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: 
-rubygems_version: 2.4.5.1
+rubygems_version: 3.0.3
 signing_key: 
 specification_version: 4
 summary: Deterministic acyclic finite state automaton