victory 0.0.0 → 0.0.1

data/lib/containers/stack.rb

@@ -0,0 +1,88 @@
+require 'containers/deque'
+# rdoc
+#     A Stack is a container that keeps elements in a last-in first-out (LIFO) order. There are many
+#     uses for stacks, including prefix-infix-postfix conversion and backtracking problems.
+#
+#     This implementation uses a doubly-linked list, guaranteeing O(1) complexity for all operations.
+#
+#
+#     MIT License
+#
+#     Copyright (c) 2009 Kanwei Li
+#
+#     Permission is hereby granted, free of charge, to any person obtaining a copy
+#     of this software and associated documentation files (the "Software"), to deal
+#     in the Software without restriction, including without limitation the rights
+#     to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+#     copies of the Software, and to permit persons to whom the Software is
+#     furnished to do so, subject to the following conditions:
+#
+#     The above copyright notice and this permission notice shall be included in all
+#     copies or substantial portions of the Software.
+#
+#     THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+#     IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+#     FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+#     AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+#     LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+#     OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+#     SOFTWARE.
+class Containers::Stack
+  include Enumerable
+  # Create a new stack. Takes an optional array argument to initialize the stack.
+  #
+  #   s = Containers::Stack.new([1, 2, 3])
+  #   s.pop #=> 3
+  #   s.pop #=> 2
+  def initialize(ary=[])
+    @container = Containers::Deque.new(ary)
+  end
+
+  # Returns the next item from the stack but does not remove it.
+  #
+  #   s = Containers::Stack.new([1, 2, 3])
+  #   s.next #=> 3
+  #   s.size #=> 3
+  def next
+    @container.back
+  end
+
+  # Adds an item to the stack.
+  #
+  #   s = Containers::Stack.new([1])
+  #   s.push(2)
+  #   s.pop #=> 2
+  #   s.pop #=> 1
+  def push(obj)
+    @container.push_back(obj)
+  end
+  alias_method :<<, :push
+
+  # Removes the next item from the stack and returns it.
+  #
+  #   s = Containers::Stack.new([1, 2, 3])
+  #   s.pop #=> 3
+  #   s.size #=> 2
+  def pop
+    @container.pop_back
+  end
+
+  # Return the number of items in the stack.
+  #
+  #   s = Containers::Stack.new([1, 2, 3])
+  #   s.size #=> 3
+  def size
+    @container.size
+  end
+
+  # Returns true if the stack is empty, false otherwise.
+  def empty?
+    @container.empty?
+  end
+
+  # Iterate over the Stack in LIFO order.
+  def each(&block)
+    @container.each_backward(&block)
+  end
+
+end

data/lib/containers/suffix_array.rb

@@ -0,0 +1,92 @@
+# frozen_string_literal: true
+
+# rdoc
+#     A suffix array enables fast substring search of a given string. An array of all possible substrings
+#     is constructed and stored, and a binary search is then done to find a desired substring among those
+#     stored. While more storage (and thus memory) is needed to create the SuffixArray, the advantage is
+#     that substrings can be found in O(m log n) time, where m is the length of the substring to search for
+#     and n is the total number of substrings.
+#
+#         
+#     MIT License
+#
+#     Copyright (c) 2009 Kanwei Li 
+#     
+#     Permission is hereby granted, free of charge, to any person obtaining a copy
+#     of this software and associated documentation files (the "Software"), to deal
+#     in the Software without restriction, including without limitation the rights
+#     to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+#     copies of the Software, and to permit persons to whom the Software is
+#     furnished to do so, subject to the following conditions:
+#     
+#     The above copyright notice and this permission notice shall be included in all
+#     copies or substantial portions of the Software.
+#     
+#     THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+#     IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+#     FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+#     AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+#     LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+#     OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+#     SOFTWARE.
+class Containers::SuffixArray
+  # Creates a new SuffixArray with a given string. Object of any class implementing a #to_s method can
+  # be passed in, such as integers.
+  #
+  # Complexity: O(n^2 log n)
+  #
+  #   s_array = Containers::SuffixArray("abracadabra")
+  #   s_array["abra"] #=> true
+  #
+  #   number = Containers::SuffixArray(1234567)
+  #   number[1] #=> true
+  #   number[13] #=> false 
+  def initialize(string)
+    string = string.to_s
+    raise ArgumentError, 'SuffixArray needs to be initialized with a non-empty string' if string.empty?
+    @original_string = string
+    @suffixes = []
+    string.length.times do |i|
+      @suffixes << string[i..-1]
+    end
+
+    # Sort the suffixes in ascending order
+    @suffixes.sort! { |x, y| x <=> y }
+  end
+  
+  # Returns true if the substring occurs in the string, false otherwise.
+  #
+  # Complexity: O(m + log n)
+  #
+  #   s_array = Containers::SuffixArray.new("abracadabra")
+  #   s_array.has_substring?("a") #=> true
+  #   s_array.has_substring?("abra") #=> true
+  #   s_array.has_substring?("abracadabra") #=> true
+  #   s_array.has_substring?("acadabra") #=> true
+  #   s_array.has_substring?("adabra") #=> true
+  #   s_array.has_substring?("bra") #=> true
+  #   s_array.has_substring?("bracadabra") #=> true
+  #   s_array.has_substring?("cadabra") #=> true
+  #   s_array.has_substring?("dabra") #=> true
+  #   s_array.has_substring?("ra") #=> true
+  #   s_array.has_substring?("racadabra") #=> true
+  #   s_array.has_substring?("nope") #=> false
+  def has_substring?(substring)
+    substring = substring.to_s
+    return false if substring.empty?
+    substring_length = substring.length-1
+    l = 0
+    r = @suffixes.size-1
+    while(l <= r)
+      mid = (l + r) / 2
+      suffix = @suffixes[mid][0..substring_length]
+      case substring <=> suffix
+      when 0 then return true
+      when 1 then l = mid + 1
+      when -1 then r = mid - 1
+      end
+    end
+    false
+  end
+  alias [] has_substring?
+end

data/lib/containers/trie.rb

@@ -0,0 +1,204 @@
+# rdoc
+#     A Trie is a data structure that stores key value pairs in a tree-like fashion. It allows
+#     O(m) lookup speed, where m is the length of the key searched, and has no chance of collisions,
+#     unlike hash tables. Because of its nature, search misses are quickly detected.
+#
+#     Tries are often used for longest prefix algorithms, wildcard matching, and can be used to
+#     implement a radix sort.
+#
+#     This implemention is based on a Ternary Search Tree.
+#
+#
+#     MIT License
+#
+#     Copyright (c) 2009 Kanwei Li
+#
+#     Permission is hereby granted, free of charge, to any person obtaining a copy
+#     of this software and associated documentation files (the "Software"), to deal
+#     in the Software without restriction, including without limitation the rights
+#     to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+#     copies of the Software, and to permit persons to whom the Software is
+#     furnished to do so, subject to the following conditions:
+#
+#     The above copyright notice and this permission notice shall be included in all
+#     copies or substantial portions of the Software.
+#
+#     THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+#     IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+#     FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+#     AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+#     LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+#     OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+#     SOFTWARE.
+class Containers::Trie
+  # Create a new, empty Trie.
+  #
+  #   t = Containers::Trie.new
+  #   t["hello"] = "world"
+  #   t["hello"] #=> "world"
+  def initialize
+    @root = nil
+  end
+
+  # Adds a key, value pair to the Trie, and returns the value if successful. The to_s method is
+  # called on the parameter to turn it into a string.
+  #
+  # Complexity: O(m)
+  #
+  #   t = Containers::Trie.new
+  #   t["hello"] = "world"
+  #   t.push("hello", "world") # does the same thing
+  #   t["hello"] #=> "world"
+  #   t[1] = 1
+  #   t[1] #=> 1
+  def push(key, value)
+    key = key.to_s
+    return nil if key.empty?
+    @root = push_recursive(@root, key, 0, value)
+    value
+  end
+  alias_method :[]=, :push
+
+  # Returns true if the key is contained in the Trie.
+  #
+  # Complexity: O(m) worst case
+  #
+  def has_key?(key)
+    key = key.to_s
+    return false if key.empty?
+    !(get_recursive(@root, key, 0).nil?)
+  end
+
+  # Returns the value of the desired key, or nil if the key doesn't exist.
+  #
+  # Complexity: O(m) worst case
+  #
+  #   t = Containers::Trie.new
+  #   t.get("hello") = "world"
+  #   t.get("non-existant") #=> nil
+  def get(key)
+    key = key.to_s
+    return nil if key.empty?
+    node = get_recursive(@root, key, 0)
+    node ? node.last : nil
+  end
+  alias_method :[], :get
+
+  # Returns the longest key that has a prefix in common with the parameter string. If
+  # no match is found, the blank string "" is returned.
+  #
+  # Complexity: O(m) worst case
+  #
+  #   t = Containers::Trie.new
+  #   t.push("Hello", "World")
+  #   t.push("Hello, brother", "World")
+  #   t.push("Hello, bob", "World")
+  #   t.longest_prefix("Hello, brandon") #=> "Hello"
+  #   t.longest_prefix("Hel") #=> ""
+  #   t.longest_prefix("Hello") #=> "Hello"
+  def longest_prefix(string)
+    string = string.to_s
+    return nil if string.empty?
+    len = prefix_recursive(@root, string, 0)
+    string[0...len]
+  end
+
+  # Returns a sorted array containing strings that match the parameter string. The wildcard
+  # characters that match any character are '*' and '.' If no match is found, an empty
+  # array is returned.
+  #
+  # Complexity: O(n) worst case
+  #
+  #   t = Containers::Trie.new
+  #   t.push("Hello", "World")
+  #   t.push("Hilly", "World")
+  #   t.push("Hello, bob", "World")
+  #   t.wildcard("H*ll.") #=> ["Hello", "Hilly"]
+  #   t.wildcard("Hel") #=> []
+  def wildcard(string)
+    string = string.to_s
+    return nil if string.empty?
+    ary = []
+    ary << wildcard_recursive(@root, string, 0, "")
+    ary.flatten.compact.sort
+  end
+
+  class Node # :nodoc: all
+    attr_accessor :left, :mid, :right, :char, :value, :end
+
+    def initialize(char, value)
+      @char = char
+      @value = value
+      @left = @mid = @right = nil
+      @end = false
+    end
+
+    def last?
+      @end == true
+    end
+  end
+
+  def wildcard_recursive(node, string, index, prefix)
+    return nil if node.nil? || index == string.length
+    arr = []
+    char = string[index]
+    if (char.chr == "*" || char.chr == "." || char < node.char)
+      arr << wildcard_recursive(node.left, string, index, prefix)
+    end
+    if (char.chr == "*" || char.chr == "." || char > node.char)
+      arr << wildcard_recursive(node.right, string, index, prefix)
+    end
+    if (char.chr == "*" || char.chr == "." || char == node.char)
+      arr << "#{prefix}#{node.char.chr}" if node.last?
+      arr << wildcard_recursive(node.mid, string, index+1, prefix + node.char.chr)
+    end
+    arr
+  end
+
+  def prefix_recursive(node, string, index)
+    return 0 if node.nil? || index == string.length
+    len = 0
+    rec_len = 0
+    char = string[index]
+    if (char < node.char)
+      rec_len = prefix_recursive(node.left, string, index)
+    elsif (char > node.char)
+      rec_len = prefix_recursive(node.right, string, index)
+    else
+      len = index+1 if node.last?
+      rec_len = prefix_recursive(node.mid, string, index+1)
+    end
+    len > rec_len ? len : rec_len
+  end
+
+  def push_recursive(node, string, index, value)
+    char = string[index]
+    node = Node.new(char, value) if node.nil?
+    if (char < node.char)
+      node.left = push_recursive(node.left, string, index, value)
+    elsif (char > node.char)
+      node.right = push_recursive(node.right, string, index, value)
+    elsif (index < string.length-1) # We're not at the end of the input string; add next char
+      node.mid = push_recursive(node.mid, string, index+1, value)
+    else
+      node.end = true
+      node.value = value
+    end
+    node
+  end
+
+  # Returns [char, value] if found
+  def get_recursive(node, string, index)
+    return nil if node.nil?
+    char = string[index]
+    if (char < node.char)
+      return get_recursive(node.left, string, index)
+    elsif (char > node.char)
+      return get_recursive(node.right, string, index)
+    elsif (index < string.length-1) # We're not at the end of the input string; add next char
+      return get_recursive(node.mid, string, index+1)
+    else
+      return node.last? ? [node.char, node.value] : nil
+    end
+  end
+end

data/lib/containers/tuple.rb

@@ -0,0 +1,20 @@
+class Tuple
+  @elements = []
+  def self.[](*elements)
+    new(elements)
+  end
+
+  def initialize(elements)
+    @elements = elements
+  end
+
+  def [](idx)
+    @elements[idx]
+  end
+
+  def to_a
+    @elements.to_a
+  end
+end
+
+T = Tuple

data/lib/victory/version.rb

@@ -1,3 +1,3 @@
 module Victory
-  VERSION = "0.0.0"
+  VERSION = "0.0.1"
 end

data/lib/victory.rb

@@ -1,7 +1,14 @@
 require "victory/version"
-require "victory/victory"
+require 'require_all'
 
 module Victory
   class Error < StandardError; end
   # Your code goes here...
 end
+
+module Algorithms; end
+module Containers; end
+
+require 'XORList'
+
+require_all 'lib/**/*rb'

data/victory.gemspec

@@ -9,7 +9,7 @@ Gem::Specification.new do |spec|
   spec.authors       = ['Arnold Szederjesi']
   spec.email         = ['szederjesiarnold@gmail.com']
 
-  spec.summary       = 'A gem providing all useful algorithms and data structures for contests'
+  spec.summary       = 'A gem providing all useful algorithms and data structures for programming contests'
   spec.license       = 'MIT'
 
   # Specify which files should be added to the gem when it is released.
@@ -19,11 +19,20 @@ Gem::Specification.new do |spec|
   end
   spec.bindir        = 'exe'
   spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
-  spec.require_paths = ['lib']
-  spec.extensions    = ['ext/victory/extconf.rb']
+  spec.require_paths = ['lib', 'ext']
+  spec.extensions    = [
+    'ext/algorithms/string/extconf.rb',
+    'ext/containers/bst/extconf.rb',
+    'ext/containers/deque/extconf.rb',
+    'ext/containers/rbtree_map/extconf.rb',
+    'ext/containers/splaytree_map/extconf.rb',
+    'ext/containers/xor_list/extconf.rb'
+  ]
 
   spec.add_development_dependency 'bundler', '~> 1.17'
   spec.add_development_dependency 'minitest', '~> 5.0'
   spec.add_development_dependency 'rake', '~> 10.0'
   spec.add_development_dependency 'rake-compiler'
+  spec.add_development_dependency 'require_all'
+  spec.add_development_dependency 'rspec'
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: victory
 version: !ruby/object:Gem::Version
-  version: 0.0.0
+  version: 0.0.1
 platform: ruby
 authors:
 - Arnold Szederjesi
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2019-03-08 00:00:00.000000000 Z
+date: 2019-03-13 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -66,20 +66,48 @@ dependencies:
     - - ">="
       - !ruby/object:Gem::Version
         version: '0'
+- !ruby/object:Gem::Dependency
+  name: require_all
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
 description: 
 email:
 - szederjesiarnold@gmail.com
 executables: []
 extensions:
-- ext/victory/extconf.rb
+- ext/algorithms/string/extconf.rb
+- ext/containers/bst/extconf.rb
+- ext/containers/deque/extconf.rb
+- ext/containers/rbtree_map/extconf.rb
+- ext/containers/splaytree_map/extconf.rb
+- ext/containers/xor_list/extconf.rb
 extra_rdoc_files: []
 files:
 - ".gitignore"
-- ".idea/encodings.xml"
-- ".idea/misc.xml"
-- ".idea/modules.xml"
-- ".idea/victory.iml"
-- ".idea/workspace.xml"
 - ".rubocop.yml"
 - ".travis.yml"
 - CODE_OF_CONDUCT.md
@@ -87,11 +115,42 @@ files:
 - LICENSE.txt
 - README.md
 - Rakefile
+- USAGE.md
 - bin/console
 - bin/setup
-- ext/victory/extconf.rb
-- ext/victory/victory.c
-- ext/victory/victory.h
+- ext/algorithms/string/LICENSE.md
+- ext/algorithms/string/extconf.rb
+- ext/algorithms/string/string.c
+- ext/containers/bst/LICENSE.md
+- ext/containers/bst/bst.c
+- ext/containers/bst/extconf.rb
+- ext/containers/deque/LICENSE.md
+- ext/containers/deque/deque.c
+- ext/containers/deque/extconf.rb
+- ext/containers/rbtree_map/LICENSE.md
+- ext/containers/rbtree_map/extconf.rb
+- ext/containers/rbtree_map/rbtree.c
+- ext/containers/splaytree_map/LICENSE.md
+- ext/containers/splaytree_map/extconf.rb
+- ext/containers/splaytree_map/splaytree.c
+- ext/containers/xor_list/extconf.rb
+- ext/containers/xor_list/xor_list.c
+- lib/algorithms/search.rb
+- lib/algorithms/sort.rb
+- lib/algorithms/string.rb
+- lib/containers/deque.rb
+- lib/containers/heap.rb
+- lib/containers/kd_tree.rb
+- lib/containers/list.rb
+- lib/containers/prefix_tree.rb
+- lib/containers/priority_queue.rb
+- lib/containers/queue.rb
+- lib/containers/rb_tree_map.rb
+- lib/containers/splay_tree_map.rb
+- lib/containers/stack.rb
+- lib/containers/suffix_array.rb
+- lib/containers/trie.rb
+- lib/containers/tuple.rb
 - lib/victory.rb
 - lib/victory/version.rb
 - victory.gemspec
@@ -103,6 +162,7 @@ post_install_message:
 rdoc_options: []
 require_paths:
 - lib
+- ext
 required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
@@ -117,5 +177,6 @@ requirements: []
 rubygems_version: 3.0.1
 signing_key: 
 specification_version: 4
-summary: A gem providing all useful algorithms and data structures for contests
+summary: A gem providing all useful algorithms and data structures for programming
+  contests
 test_files: []

data/.idea/encodings.xml

@@ -1,4 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<project version="4">
-  <component name="Encoding" addBOMForNewFiles="with NO BOM" />
-</project>

data/.idea/misc.xml

@@ -1,7 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<project version="4">
-  <component name="JavaScriptSettings">
-    <option name="languageLevel" value="ES6" />
-  </component>
-  <component name="ProjectRootManager" version="2" project-jdk-name="RVM: ruby-2.6.0" project-jdk-type="RUBY_SDK" />
-</project>

data/.idea/modules.xml

@@ -1,8 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<project version="4">
-  <component name="ProjectModuleManager">
-    <modules>
-      <module fileurl="file://$PROJECT_DIR$/.idea/victory.iml" filepath="$PROJECT_DIR$/.idea/victory.iml" />
-    </modules>
-  </component>
-</project>

data/.idea/victory.iml

@@ -1,13 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<module type="RUBY_MODULE" version="4">
-  <component name="ModuleRunConfigurationManager">
-    <shared />
-  </component>
-  <component name="NewModuleRootManager">
-    <content url="file://$MODULE_DIR$" />
-    <orderEntry type="inheritedJdk" />
-    <orderEntry type="sourceFolder" forTests="false" />
-    <orderEntry type="library" scope="PROVIDED" name="bundler (v1.17.2, RVM: ruby-2.6.0) [gem]" level="application" />
-    <orderEntry type="library" scope="PROVIDED" name="minitest (v5.11.3, RVM: ruby-2.6.0) [gem]" level="application" />
-  </component>
-</module>