trie-substring-search 0.1.0.0 → 0.1.0.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 5923666c4e83e361fcc051b410f1238400ff1c088438118d3f1cf00e82801399
-  data.tar.gz: ccf9b0af6f30c421d71faad210572978f957d40cedeed7e6938bfb4f736b39a2
+  metadata.gz: bc0392fcf9e1035033467b8fc1564f1abd4e675c81404fa5bd2991a2e656c73b
+  data.tar.gz: 6079b695eb1d2c439d06a7c01986654eadc2f30cef41558d6364366b755f75f8
 SHA512:
-  metadata.gz: 5158ee96b40d03627b098f8be180ef25e9abbb8787c226fa0da5c6d57557d2d2991a487ff8973447380649c382c3296a587b18ddef30ee91793a24cd0fc09fde
-  data.tar.gz: 66c0c9a4a1e22d9f2b543a978fe16cf0f65dfdaf13fe5e0c861ce283db53bdf3a1d17c146e3be040a5c32b242563a2ab798a91ef331c090d961306c73e9beae4
+  metadata.gz: 8b0a93ba1d9ad0cc5a61ecb78b4e6f7dcddf07aa384a4a36eccdfd7656a895ce64096444d218fed4c9b3807adcd4e7f94b148399a9ca90facf694e7c97e242cc
+  data.tar.gz: bbd29010d634d023cafee5c4b4a273c0cc964d49d0d69e63767d10c375ab21d7f0db284e146336d82a3136bf42aa4115f0bfbf838b41d5b7ec487aa0000c32c0

data/.drone.yml

@@ -3,7 +3,7 @@ name: default
 
 steps:
   - name: install
-    image: ruby
+    image: ruby:3.2.0
     volumes:
       - name: bundle
         path: /usr/local/bundle

data/.gitignore

@@ -10,4 +10,7 @@
 /spec/tss/trie/search_high_load_spec.rb
 # rspec failure tracking
 .rspec_status
-*.gem
+*.gem
+.ruby-gemset
+.ruby-version
+Gemfile.lock

data/.rubocop.yml

@@ -0,0 +1,16 @@
+
+require:
+  - rubocop
+  - rubocop-rspec
+  - rubocop-performance
+  - rubocop-md
+  - rubocop-rake
+
+AllCops:
+  TargetRubyVersion: 3.1
+  NewCops: enable
+
+Metrics/BlockLength:
+  Max: 250
+  Include:
+    - spec/**/*_spec.rb

data/Gemfile

@@ -1,6 +1,23 @@
+# frozen_string_literal: true
+
 source 'https://rubygems.org'
 
 git_source(:github) { |repo_name| "https://github.com/#{repo_name}" }
 
 # Specify your gem's dependencies in tss.gemspec
 gemspec
+
+gem 'bundler'
+gem 'codecov'
+gem 'pry'
+gem 'rake'
+gem 'rspec'
+gem 'rspec-benchmark'
+gem 'rspec-collection_matchers'
+gem 'rubocop'
+gem 'rubocop-md'
+gem 'rubocop-performance'
+gem 'rubocop-rake'
+gem 'rubocop-rspec'
+gem 'simplecov'
+gem 'simplecov-console'

data/README.md

@@ -7,6 +7,8 @@
 
 ## Installation
 
+Implementation of text syntax analyzer, which represents text as non symetric trie of chars or substrings by dictionary or list of keywords. Similar to Aho-Corasick algorithm, but with modifications, there is removed suffixes and added recovering text from the trie.
+
 Add this line to your application's Gemfile:
 
 ```ruby
@@ -25,12 +27,12 @@ Or install it yourself as:
 
 ```ruby
     # Array of words in the dictionary
-    dictionary = %w[he she her his him he they their she]
+dictionary = %w[he she her his him he they their she]
     # Initialize trie
     # types of trie to build :full, :flat(WIP) and :aho_corasick(WIP)
-    tss = TSS::Trie.new(dictionary, :full)
+tss = TSS::Trie.new(dictionary, :full)
     # Parse text and receive array of all occurrences of words in texts with indexes of word in dictionary
-    tss.parse('he their them height have then their shelter')
+tss.parse('he their them height have then their shelter')
     # => [{:word=>"he", :indexes=>[0, 5]},
     #  {:word=>"their", :indexes=>[7]},
     #  {:word=>"he", :indexes=>[0, 5]},
@@ -42,9 +44,9 @@ Or install it yourself as:
     #  {:word=>"she", :indexes=>[1, 8]},
     #  {:word=>"he", :indexes=>[0, 5]}]
     # Add additional words to the dictionary
-    tss.extend_dictionary(["our", "it", "them"])
+tss.extend_dictionary(%w[our it them])
     # Get end vertex of word 'they'
-    vertex = tss.root.get_child('s').get_child('h').get_child('e')
+vertex = tss.root.get_child('s').get_child('h').get_child('e')
     # => #<ACT::Vertex:0x000055cabb2399d0
     #  @char="e",
     #  @children=[],
@@ -59,10 +61,10 @@ Or install it yourself as:
     #      @char="s",
     #      @children=[#<ACT::Vertex:0x000055cabb239ac0 ...>],
     # get array of indexes of word
-    vertex.end_indexes
+vertex.end_indexes
     # => [1, 8]
     # Recover word from trie with indexes in dictionary
-    tss.backtrace_to_word(vertex)
+tss.backtrace_to_word(vertex)
     # => {:word=>"she", :indexes=>[1, 8]}
 ```
 

data/Rakefile

@@ -1,3 +1,5 @@
+# frozen_string_literal: true
+
 require 'bundler/gem_tasks'
 require 'rspec/core/rake_task'
 

data/bin/console

@@ -1,10 +1,9 @@
 #!/usr/bin/env ruby
+# frozen_string_literal: true
 
 require 'bundler/setup'
 require 'tss/tss'
 require 'tss/tries/full'
-require 'tss/tries/flat'
-require 'tss/tries/ac'
 require 'tss/tries/base'
 require 'tss/trie'
 require 'tss/link'

data/lib/tss/link.rb

@@ -1,3 +1,7 @@
+# frozen_string_literal: true
+
+##
+# TSS module
 module TSS
   ##
   # Class representing links(suffixes) between vertexes
@@ -9,7 +13,8 @@ module TSS
     # Character to simplify search
     attr_reader :char
     ##
-    # Index of word in dictionary if vertex is ending, or nil if vertex is suffix
+    # Index of word in dictionary if vertex is ending, or nil if vertex
+    # is suffix
     attr_accessor :end_index
 
     ##

data/lib/tss/trie-substring-search.code-workspace

@@ -0,0 +1,10 @@
+{
+	"folders": [
+		{
+			"path": "../.."
+		},
+		{
+			"path": "../../../trie-viz"
+		}
+	]
+}

data/lib/tss/trie.rb

@@ -1,7 +1,10 @@
+# frozen_string_literal: true
+
 # TSS module
 module TSS
   ##
-  # Main class for creating Trie Substring Search from array of words of dictionary
+  # Main class for creating Trie Substring Search from array of words of
+  # dictionary
   class Trie
     ##
     # Root vertex
@@ -18,6 +21,7 @@ module TSS
     ##
     # Trie class instance
     attr_reader :trie_instance
+
     ##
     # Initialize new trie and fill it with words from dictionary
     def initialize(dictionary, type = :full)
@@ -28,15 +32,16 @@ module TSS
     end
 
     ##
-    # Executes text analyzis and returns map occurring words with indexes from dictionary
+    # Executes text analyzis and returns map occurring words with indexes from
+    # dictionary
     def parse(text)
       @trie_instance.parse(text)
     end
 
     ##
     # Returns hash with word and indexes at dictionary
-    # * Ending vertex of chain should be used as argument, it means that it should
-    #   contain at least one value in the array of end_indexes attribute
+    # * Ending vertex of chain should be used as argument, it means that it
+    #   should contain at least one value in the array of end_indexes attribute
     def backtrace_to_word(vertex)
       @trie_instance.backtrace_to_word(vertex)
     end
@@ -65,7 +70,8 @@ module TSS
       return :AC if type == :aho_corasick
       return :Flat if type == :flat
 
-      raise ArgumentError, 'Wrong trie type. Possible is: :full, :flat or :aho_corasick'
+      raise ArgumentError, 'Wrong trie type. Possible is: :full, :flat or \
+      :aho_corasick'
     end
   end
 end

data/lib/tss/tries/base.rb

@@ -1,8 +1,14 @@
+# frozen_string_literal: true
+
+##
 # TSS module
 module TSS
+  ##
+  # Tries module
   module Tries
     ##
-    # Main class for creating Aho-Corasick Trie from array of words of dictionary
+    # Main class for creating Aho-Corasick Trie from array of words of
+    # dictionary
     class Base
       ##
       # Root vertex
@@ -37,6 +43,8 @@ module TSS
 
       private
 
+      ##
+      # Stub superclass method for build_trie
       def build_trie
         @root
       end

data/lib/tss/tries/full.rb

@@ -1,11 +1,16 @@
+# frozen_string_literal: false
+
 # TSS module
 module TSS
+  ##
+  # Tries module
   module Tries
     ##
     # Main class for creating Full Trie from array of words of dictionary
     class Full < Base
       ##
-      # Executes text analyze and returns map occurring words with indexes from dictionary
+      # Executes text analyze and returns map occurring words with indexes
+      # from dictionary
       # Example:
       #   >> tss.parse('he their them height have then their shelter')
       #   => [ {:word=>"he", :indexes=>[0, 5]},
@@ -21,22 +26,23 @@ module TSS
       # Arguments:
       #   text: (String)
       def parse(text)
-        text = text.to_s.split('')
+        text = text.to_s.chars
         vm = vertex_map(text) { :vertex }
         exec_branches(text, vm).flatten.compact
       end
 
       ##
-      # Returns hash with vertexes that represents letters of word and indexes of word in dictionary
-      # * Ending vertex of chain should be used as argument, it means that it should
-      #   contain at least one value in the array of end_indexes attribute
+      # Returns hash with vertexes that represents letters of word and indexes
+      # of word in dictionary
+      # * Ending vertex of chain should be used as argument, it means that it
+      # should contain at least one value in the array of end_indexes attribute
       # Example:
       #   backtrace_to_word(vertex)
       # Arguments:
       #   vertex: (TSS::Vertex) - ending vertex of chain of letters
       def backtrace_to_word(vertex)
         if vertex.end_indexes.empty?
-          raise 'Argument should be ending vertex of chain, and contain at'\
+          raise 'Argument should be ending vertex of chain, and contain at' \
                 'least one value in the array of end_indexes attribute'
         else
           chain = backtrace(vertex)
@@ -61,7 +67,7 @@ module TSS
       def exec_branches(text, vertex_map)
         vertex_map.map do |b|
           b[:indexes].map do |index|
-            search(b[:key], text[index + 1..-1])
+            search(b[:key], text[index + 1..])
           end
         end
       end
@@ -74,19 +80,19 @@ module TSS
         return result if vertex.children.empty?
 
         ending = search_rest(vertex, text)
-        !ending.empty? ? (result + ending) : result
+        ending.empty? ? result : (result + ending)
       end
 
       def search_rest(vertex, text)
         result = []
         text.each do |char|
-          current_vertex = vertex.get_child(char)
-          break if current_vertex.nil?
+          c_vertex = vertex.get_child(char)
+          break if c_vertex.nil?
 
-          result << backtrace_to_word(current_vertex) if end_vertex?(current_vertex)
-          break if current_vertex.children.empty?
+          result << backtrace_to_word(c_vertex) if end_vertex?(c_vertex)
+          break if c_vertex.children.empty?
 
-          vertex = current_vertex
+          vertex = c_vertex
         end
         result
       end
@@ -95,7 +101,8 @@ module TSS
         @trie.children.map do |vertex|
           {
             key: vertex.send(yield),
-            indexes: text.collect.with_index { |c, i| i if c == vertex.char }.compact
+            indexes: text.collect.with_index { |c, i| i if c == vertex.char }
+                         .compact
           }
         end
       end
@@ -105,7 +112,7 @@ module TSS
       end
 
       def backtrace(vertex)
-        result = !vertex.nil? ? [vertex] : []
+        result = vertex.nil? ? [] : [vertex]
         until vertex.parent.nil?
           result << vertex.parent unless vertex.parent.char.nil?
           vertex = vertex.parent

data/lib/tss/tss.rb

@@ -1,9 +1,9 @@
+# frozen_string_literal: true
+
 require 'tss/version'
 require 'tss/trie'
 require 'tss/tries/base'
 require 'tss/tries/full'
-require 'tss/tries/flat'
-require 'tss/tries/ac'
 require 'tss/vertex'
 require 'tss/link'
 ##

data/lib/tss/version.rb

@@ -1,3 +1,5 @@
+# frozen_string_literal: true
+
 module TSS
-  VERSION = '0.1.0.0'.freeze
+  VERSION = '0.1.0.1'
 end

data/lib/tss/vertex.rb

@@ -1,3 +1,5 @@
+# frozen_string_literal: true
+
 # TSS module
 module TSS
   ##
@@ -10,11 +12,13 @@ module TSS
     # Reference to the parent TSS::Vertex
     attr_accessor :parent
     ##
-    # Array of children TSS::Vertex references for nested models(full trie, Aho-Corasick trie)
-    # or as list of nested vertexes of root vertex of flat trie
+    # Array of children TSS::Vertex references for nested models
+    # (full trie, Aho-Corasick trie) or as list of nested vertexes of root
+    # vertex of flat trie
     attr_reader :children
     ##
-    # Array of TSS::Vertex links for flat trie model, also used as suffixes of Aho-Corasick trie
+    # Array of TSS::Vertex links for flat trie model, also used as
+    # suffixes of Aho-Corasick trie
     attr_reader :links
     ##
     # Array of indexes of word in dictionary

data/tss.gemspec

@@ -1,13 +1,10 @@
+# frozen_string_literal: true
+
 lib = File.expand_path('lib', __dir__)
 $LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
-require './lib/tss/version'
+
 require './lib/tss/tss'
-require './lib/tss/trie'
-require './lib/tss/tries/base'
-require './lib/tss/tries/ac'
-require './lib/tss/tries/full'
-require './lib/tss/tries/flat'
-require './lib/tss/vertex'
+
 Gem::Specification.new do |spec|
   spec.name          = 'trie-substring-search'
   spec.version       = TSS::VERSION
@@ -16,12 +13,15 @@ Gem::Specification.new do |spec|
   spec.homepage      = 'https://codenv.top/projects/trie-substring-search'
   spec.summary       = 'Trie based substring search algorithm implementation'
   spec.license       = 'Apache-2.0'
-  spec.description   = <<-DESCRIPTION
+  spec.required_ruby_version = '~> 3.1'
+  spec.description = <<-DESCRIPTION
     This gem provides ruby library with algorithms for trie based
     substring search.
   DESCRIPTION
-  # Prevent pushing this gem to RubyGems.org. To allow pushes either set the 'allowed_push_host'
-  # to allow pushing to a single host or delete this section to allow pushing to any host.
+  # Prevent pushing this gem to RubyGems.org. To allow pushes either set
+  # the 'allowed_push_host'
+  # to allow pushing to a single host or delete this section to allow
+  # pushing to any host.
   if spec.respond_to?(:metadata)
     spec.metadata['allowed_push_host']  = 'https://rubygems.org'
 
@@ -30,27 +30,20 @@ Gem::Specification.new do |spec|
     # spec.metadata['changelog_uri']      = 'https://github.com/sbezugliy/trie-substring-search/changelog.md'
   else
     raise 'RubyGems 2.0 or newer is required to protect against' \
-      'public gem pushes.'
+          'public gem pushes.'
   end
 
   # Specify which files should be added to the gem when it is released.
-  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  # The `git ls-files -z` loads the files in the RubyGem that have
+  # been added into git.
   spec.files = Dir.chdir(File.expand_path(__dir__)) do
-    `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+    `git ls-files -z`.split("\x0").reject do |f|
+      f.match(%r{^(test|spec|features)/})
+    end
   end
   spec.bindir        = 'exe'
   spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
   spec.require_paths = ['lib']
 
-  spec.add_development_dependency 'bundler', '~> 2.0.1'
-  spec.add_development_dependency 'codecov', '~> 0.1'
-  spec.add_development_dependency 'pry', '~> 0.12'
-  spec.add_development_dependency 'rake', '~> 10.0'
-  spec.add_development_dependency 'rspec', '~> 3.0'
-  spec.add_development_dependency 'rspec-benchmark', '~> 0.5.0'
-  spec.add_development_dependency 'rspec-collection_matchers', '~> 1.1.0'
-  spec.add_development_dependency 'rubocop', '~> 0.67.0'
-  spec.add_development_dependency 'rubocop-performance', '~> 1.1.0'
-  spec.add_development_dependency 'simplecov', '~> 0.16.0'
-  spec.add_development_dependency 'simplecov-console', '~> 0.4.0'
+  spec.metadata['rubygems_mfa_required'] = 'true'
 end

metadata

@@ -1,169 +1,15 @@
 --- !ruby/object:Gem::Specification
 name: trie-substring-search
 version: !ruby/object:Gem::Version
-  version: 0.1.0.0
+  version: 0.1.0.1
 platform: ruby
 authors:
 - Sergey Bezugliy
-autorequire: 
+autorequire:
 bindir: exe
 cert_chain: []
-date: 2019-05-11 00:00:00.000000000 Z
-dependencies:
-- !ruby/object:Gem::Dependency
-  name: bundler
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: 2.0.1
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: 2.0.1
-- !ruby/object:Gem::Dependency
-  name: codecov
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '0.1'
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '0.1'
-- !ruby/object:Gem::Dependency
-  name: pry
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '0.12'
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '0.12'
-- !ruby/object:Gem::Dependency
-  name: rake
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '10.0'
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '10.0'
-- !ruby/object:Gem::Dependency
-  name: rspec
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '3.0'
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '3.0'
-- !ruby/object:Gem::Dependency
-  name: rspec-benchmark
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: 0.5.0
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: 0.5.0
-- !ruby/object:Gem::Dependency
-  name: rspec-collection_matchers
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: 1.1.0
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: 1.1.0
-- !ruby/object:Gem::Dependency
-  name: rubocop
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: 0.67.0
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: 0.67.0
-- !ruby/object:Gem::Dependency
-  name: rubocop-performance
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: 1.1.0
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: 1.1.0
-- !ruby/object:Gem::Dependency
-  name: simplecov
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: 0.16.0
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: 0.16.0
-- !ruby/object:Gem::Dependency
-  name: simplecov-console
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: 0.4.0
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: 0.4.0
+date: 2023-02-12 00:00:00.000000000 Z
+dependencies: []
 description: |2
       This gem provides ruby library with algorithms for trie based
       substring search.
@@ -173,22 +19,21 @@ executables: []
 extensions: []
 extra_rdoc_files: []
 files:
+- ".DS_Store"
 - ".drone.yml"
 - ".gitignore"
 - ".rspec"
-- ".travis.yml"
+- ".rubocop.yml"
 - Gemfile
-- Gemfile.lock
 - LICENSE
 - README.md
 - Rakefile
 - bin/console
 - bin/setup
 - lib/tss/link.rb
+- lib/tss/trie-substring-search.code-workspace
 - lib/tss/trie.rb
-- lib/tss/tries/ac.rb
 - lib/tss/tries/base.rb
-- lib/tss/tries/flat.rb
 - lib/tss/tries/full.rb
 - lib/tss/tss.rb
 - lib/tss/version.rb
@@ -201,23 +46,24 @@ metadata:
   allowed_push_host: https://rubygems.org
   homepage_uri: https://codenv.top/projects/trie-substring-search
   source_code_uri: https://github.com/sbezugliy/trie-substring-search
-post_install_message: 
+  rubygems_mfa_required: 'true'
+post_install_message:
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
-  - - ">="
+  - - "~>"
     - !ruby/object:Gem::Version
-      version: '0'
+      version: '3.1'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.0.1
-signing_key: 
+rubygems_version: 3.4.1
+signing_key:
 specification_version: 4
 summary: Trie based substring search algorithm implementation
 test_files: []

data/.travis.yml

@@ -1,7 +0,0 @@
----
-sudo: false
-language: ruby
-cache: bundler
-rvm:
-  - 2.6.1
-before_install: gem install bundler -v 1.17.2

data/Gemfile.lock

@@ -1,95 +0,0 @@
-PATH
-  remote: .
-  specs:
-    trie-substring-search (0.1.0.0)
-
-GEM
-  remote: https://rubygems.org/
-  specs:
-    ansi (1.5.0)
-    ast (2.4.0)
-    benchmark-malloc (0.1.0)
-    benchmark-perf (0.5.0)
-    benchmark-trend (0.3.0)
-    codecov (0.1.14)
-      json
-      simplecov
-      url
-    coderay (1.1.2)
-    diff-lcs (1.3)
-    docile (1.3.1)
-    hirb (0.7.3)
-    jaro_winkler (1.5.2)
-    json (2.2.0)
-    method_source (0.9.2)
-    parallel (1.17.0)
-    parser (2.6.3.0)
-      ast (~> 2.4.0)
-    pry (0.12.2)
-      coderay (~> 1.1.0)
-      method_source (~> 0.9.0)
-    psych (3.1.0)
-    rainbow (3.0.0)
-    rake (10.5.0)
-    rspec (3.8.0)
-      rspec-core (~> 3.8.0)
-      rspec-expectations (~> 3.8.0)
-      rspec-mocks (~> 3.8.0)
-    rspec-benchmark (0.5.0)
-      benchmark-malloc (~> 0.1.0)
-      benchmark-perf (~> 0.5.0)
-      benchmark-trend (~> 0.3.0)
-      rspec (>= 3.0.0, < 4.0.0)
-    rspec-collection_matchers (1.1.3)
-      rspec-expectations (>= 2.99.0.beta1)
-    rspec-core (3.8.0)
-      rspec-support (~> 3.8.0)
-    rspec-expectations (3.8.3)
-      diff-lcs (>= 1.2.0, < 2.0)
-      rspec-support (~> 3.8.0)
-    rspec-mocks (3.8.0)
-      diff-lcs (>= 1.2.0, < 2.0)
-      rspec-support (~> 3.8.0)
-    rspec-support (3.8.0)
-    rubocop (0.67.2)
-      jaro_winkler (~> 1.5.1)
-      parallel (~> 1.10)
-      parser (>= 2.5, != 2.5.1.1)
-      psych (>= 3.1.0)
-      rainbow (>= 2.2.2, < 4.0)
-      ruby-progressbar (~> 1.7)
-      unicode-display_width (>= 1.4.0, < 1.6)
-    rubocop-performance (1.1.0)
-      rubocop (>= 0.67.0)
-    ruby-progressbar (1.10.0)
-    simplecov (0.16.1)
-      docile (~> 1.1)
-      json (>= 1.8, < 3)
-      simplecov-html (~> 0.10.0)
-    simplecov-console (0.4.2)
-      ansi
-      hirb
-      simplecov
-    simplecov-html (0.10.2)
-    unicode-display_width (1.5.0)
-    url (0.3.2)
-
-PLATFORMS
-  ruby
-
-DEPENDENCIES
-  bundler (~> 2.0.1)
-  codecov (~> 0.1)
-  pry (~> 0.12)
-  rake (~> 10.0)
-  rspec (~> 3.0)
-  rspec-benchmark (~> 0.5.0)
-  rspec-collection_matchers (~> 1.1.0)
-  rubocop (~> 0.67.0)
-  rubocop-performance (~> 1.1.0)
-  simplecov (~> 0.16.0)
-  simplecov-console (~> 0.4.0)
-  trie-substring-search!
-
-BUNDLED WITH
-   2.0.1

data/lib/tss/tries/ac.rb

@@ -1,26 +0,0 @@
-module TSS
-  module Tries
-    ##
-    # Aho-Corasick trie class
-    class AC < Base
-      ##
-      # Executes text analyze and returns map occurring words with indexes from dictionary
-
-      def parse
-        raise 'WIP'
-      end
-
-      ##
-      # Returns hash with word and indexes at dictionary
-      def backtrace_to_word
-        raise 'WIP'
-      end
-
-      ##
-      # Adds additional words(chains of vertexes) to the trie object
-      def extend_dictionay
-        raise 'WIP'
-      end
-    end
-  end
-end

data/lib/tss/tries/flat.rb

@@ -1,27 +0,0 @@
-# TSS module
-module TSS
-  module Tries
-    ##
-    # Main class for creating Flat Trie from array of words of dictionary
-    class Flat < Base
-      ##
-      # Executes text analyze and returns map occurring words with indexes from dictionary
-
-      def parse(_text)
-        raise 'WIP'
-      end
-
-      ##
-      # Returns hash with word and indexes at dictionary
-      def backtrace_to_word(_vertex)
-        raise 'WIP'
-      end
-
-      ##
-      # Adds additional words(chains of vertexes) to the trie object
-      def extend_dictionary(_dict)
-        raise 'WIP'
-      end
-    end
-  end
-end