enf 0.1.0 → 0.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 0fe4cc422bed7680506a19566446cf892a7a4f2b
-  data.tar.gz: 0032fa20fdc2ef7ac2343bc1587f3f749f8aa764
+  metadata.gz: 3aa05a4afb0adf081ecd35a98ddadf81357da91a
+  data.tar.gz: db6ccc6c863db56f53d83f1ac43a1d51bf73a034
 SHA512:
-  metadata.gz: ba6d389d65cd195790b14bab10fc01af33e9b147046b38a40b3528bd5aeb44efba50bc2492fdfc010200bf97169f81bfd16874333395aeb4023a9d9823095b55
-  data.tar.gz: 65f92d19a83ff8fc5a46543e7847e5596c10933910a660b0fccf39ae79bdbfe76550d3ca4e0252a8d0b5566d36343c5b5669484e5a18511e258a41bd9f7e9f19
+  metadata.gz: 374795893779728a8ff20c8dd353965191f082846f82c20b940854f2ec1bea05c82920979004ba7f3115e46044b65844d605dba2d5c47b3de8b599d4bed5e706
+  data.tar.gz: 6387e0246377d173da7aa5bc6acffa29edbbae42a048ebb353ae000b93e98f493e80947e7c46f212ad108bb50e78dd5e7d2c2752097abab7210d831596a36e7c

data/README.md

@@ -2,6 +2,12 @@
 
 Memory lightweight implementation of a white/black list
 
+## Installation
+
+```
+gem install enf
+```
+
 ## Examples
 
 *Building a dictionnary of all terms used in 'Les misérables'*
@@ -106,7 +112,7 @@ Enf::Elephant are now able to propose completion candidates from a word
 beginning, thanks to the 'suggest' method:
 
 ```ruby
-require 'enf/suggest
+require 'enf/suggest'
 require 'open-uri'
 URI = 'https://www.gutenberg.org/ebooks/135.txt.utf-8'
 

data/lib/enf/suggest.rb

@@ -24,25 +24,32 @@ module Enf
     end
 
     def suggest_impl(start, limit, incompletes, prefix = '', results = Set.new)
-      if start == ''
-        return results if limit != :none && limit < 0
-        results << prefix if @leave || (incompletes && limit == 0)
-        limit = limit - 1 unless limit == :none
-        if limit == :none || limit >= 0
-          @children.each do |key, child|
-            new_prefix = prefix + key
-            results =
-              child.suggest_impl(start, limit, incompletes, new_prefix, results)
-          end
-        end
-      else
-        child = @children.fetch(start[0]) { Silent.instance }
-        results =
-          child.suggest_impl(start[1..-1], limit, incompletes, prefix, results)
+      return complete(limit, incompletes, prefix, results) if start.empty?
+
+      child = @children.fetch(start[0]) { Silent.instance }
+      child.suggest_impl(start[1..-1], limit, incompletes, prefix, results)
+    end
+
+    def complete(limit, incompletes, prefix, results)
+      return results if limit != :none && limit < 0
+      add_current_prefix_if_needed(results, limit, incompletes, prefix)
+      limit = next_limit limit
+      return results unless limit == :none || limit >= 0
+      @children.each do |key, child|
+        results = child.complete(limit, incompletes, prefix + key, results)
       end
       results
     end
 
+    def next_limit(limit)
+      return :none if limit == :none
+      limit - 1
+    end
+
+    def add_current_prefix_if_needed(results, limit, incompletes, prefix)
+      results << prefix if @leave || (incompletes && limit == 0)
+    end
+
     class SuggestParamError < StandardError; end
 
     NEG_VAL_ERR = 'Strictly non negative values accepted only'

data/lib/enf/version.rb

@@ -3,7 +3,7 @@
 module Enf
   # This module holds the Enf version information.
   module Version
-    STRING = '0.1.0'
+    STRING = '0.1.1'
 
     module_function
 

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: enf
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.1.1
 platform: ruby
 authors:
 - Alexandre Ignjatovic
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-07-16 00:00:00.000000000 Z
+date: 2015-07-20 00:00:00.000000000 Z
 dependencies: []
 description: Graph based white/black list implementation. Your elephant won't forget.
 email: alexandre.ignjatovic@gmail.com