pretree 0.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: b12f0c90e7b27da6ade9b14e430c1386d6108b53cac874700e403a4332ff7977
+  data.tar.gz: c7c97966a45bc4e0bb37c30f08cd0f6fd442c1a9442d37957e696ba40a3f2430
+SHA512:
+  metadata.gz: 84ebe54d5e3767dc4515fddbf8ecf6aa639b79180629e4e896479d753caab296e0c88a51aff0bde7df04d5df61fdb63654f8298062a38795dc94e1998196fd69
+  data.tar.gz: f98c580d93eae6909934251c04a87377dff3567eb7b3e04a90b447a8df2923434b90fd2838c0caf6f1a457281d0801d24fec2e80f44a8bee02b2d7a3c88bad46

data/lib/file_writer.rb

@@ -0,0 +1,19 @@
+# frozen_string_literal: true
+
+require 'csv'
+
+class CSVWrite
+  def initialize
+    @path = '../data.csv'
+  end
+
+  def write(word)
+    CSV.open(@path, 'a') do |csv|
+      csv << [word]
+    end
+  end
+
+  def read
+    CSV.read(@path)
+  end
+end

data/lib/pretree.rb

@@ -0,0 +1,99 @@
+# frozen_string_literal: true
+
+require_relative 'file_writer'
+
+# Prefix tree (Node class)
+class Node
+  attr_reader :value, :next
+  attr_accessor :word
+
+  def initialize(value)
+    @value = value
+    @word = false
+    @next = []
+  end
+end
+
+# Prefix tree (Trie class)
+class PreTree
+  def initialize
+    @root = Node.new('root')
+    @csv_box = CSVWrite.new
+  end
+  
+  def csv_write(word)
+    @csv_box.write(word)
+  end
+
+  def csv_read
+    @csv_box.read
+  end
+
+  def add_node(character, trie)
+    Node.new(character).tap { |new_node| trie << new_node }
+  end
+
+  def add_character(character, trie)
+    trie.find { |n| n.value == character } || add_node(character, trie)
+  end
+
+  def find_character(character, trie)
+    trie.find { |n| n.value == character }
+  end
+
+  def add_word(word)
+    csv_write(word)
+    letters = word.chars
+    base = @root
+    letters.each { |letter| base = add_character(letter, base.next) }
+    base.word = true
+  end
+
+  def find_word(word)
+    letters = word.chars
+    base = @root
+    word_found = letters.all? { |letter| base = find_character(letter, base.next) }
+    yield word_found, base if block_given?
+    base
+  end
+
+  def find?(word)
+    find_word(word) { |found, base| return found && base.word }
+  end
+
+  def include?(word)
+    find_word(word) { |found| return found }
+  end
+
+  def delete(word)
+    find_word(word) do |found, base|
+      base.word = false if found == true
+    end
+  end
+
+  def list(prefix = nil)
+    return @dictionary if prefix.nil?
+
+    @stack = []
+    @dictionary = []
+    @prefix_stack = []
+    @stack << find_word(prefix)
+    @prefix_stack << prefix.chars.take(prefix.size - 1)
+    return [] unless @stack.first
+
+    empty_stack
+    @dictionary
+  end
+
+  def empty_stack
+    until @stack.empty?
+      node = @stack.pop
+      @prefix_stack.pop and next if node == :guard_node
+
+      @prefix_stack << node.value
+      @stack        << :guard_node
+      @dictionary << @prefix_stack.join if node.word
+      node.next.each { |n| @stack << n }
+    end
+  end
+end

metadata

@@ -0,0 +1,44 @@
+--- !ruby/object:Gem::Specification
+name: pretree
+version: !ruby/object:Gem::Version
+  version: 0.0.0
+platform: ruby
+authors:
+- Tornike Ormotsadze
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2022-05-11 00:00:00.000000000 Z
+dependencies: []
+description: A simple prefix trie gem
+email: tormotsadze@unisens.ge
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/file_writer.rb
+- lib/pretree.rb
+homepage: https://rubygems.org/gems/prefixtree
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.2.3
+signing_key: 
+specification_version: 4
+summary: prefixtree
+test_files: []