databoom 0.0.1 → 0.0.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 56a24158e6810822de3fe88accdfa0e31bd94a74f6f143c29f9cf3373ea8b988
-  data.tar.gz: 706ae431b2924a2fd8cee865869c8f0d1df9fc03bf4345b545cb7eb395884896
+  metadata.gz: e1d484cd683188765b294f9f8fd04744b14e847e834c0c422b89c7f90f69773a
+  data.tar.gz: a24495427f1b97bdc54af540e8db8c347fc38f402338218cd3426d2a7a36d72d
 SHA512:
-  metadata.gz: ccd8a684f254cf2ac5bfbfc7d751eca0d91202786140ef3265a6db51f3f7e0d5c5449ef08dd3aabdcf16af99445c734b5e79df0a0525f549478547b5bcf43b91
-  data.tar.gz: 3daf6172065906c3e7c52e6b5d212cf9a5a5160056c3f33514275627884a00697fa586382755bd43ab4b801f11b6af4d62ee565200b09f2a598d20b885b3eaf5
+  metadata.gz: 80918aca1518e362a9af8af4811bd63c6e89832056de34c0b12fb9495414793ca18e648b5efdce5bc85836a865f1dd85b1be0cc2c9b73286336bc267b5e22e4e
+  data.tar.gz: 3ffdfe094197c34b6115087e9331e59b5dcc99323b11832475619f5a0d22ac16e3974c9c0df0fb6f70832225805d6fcd8d00a3b7b27bfafee5a9df62cea6b6a7

data/lib/databoom/avl_tree.rb

@@ -0,0 +1,4 @@
+module Databoom
+  class AvlTree
+  end
+end

data/lib/databoom/balanced_tree.rb

@@ -0,0 +1,4 @@
+module Databoom
+  class BalancedTree
+  end
+end

data/lib/databoom/binary_search_tree.rb

@@ -0,0 +1,4 @@
+module Databoom
+  class BinarySearchTree
+  end
+end

data/lib/databoom/circular_dequeue.rb

@@ -0,0 +1,4 @@
+module Databoom
+  class CircularDequeue
+  end
+end

data/lib/databoom/dequeue.rb

@@ -0,0 +1,4 @@
+module Databoom
+  class Dequeue
+  end
+end

data/lib/databoom/digraph.rb

@@ -0,0 +1,91 @@
+module Databoom
+  class Digraph
+    attr_reader :vertices, :edges
+
+    class Vertex
+      attr_accessor :value, :label
+
+      def initialize(value, label = nil)
+        @value = value
+        @label = label
+      end
+    end
+
+    class Edge
+      attr_accessor :source, :sink, :label
+
+      def initialize(source_vertex, sink_vertex, label)
+        @source = source_vertex
+        @sink   = sink_vertex
+        @label  = label
+      end
+    end
+
+    def initialize
+      @vertices = []
+      @edges = []
+    end
+
+
+    # NOTE: Vertex values are uniq
+    def add_vertex(vertex_value, label = nil)
+      find_vertex(vertex_value) || create_vertex(vertex_value, label)
+    end
+
+    def del_vertex(vertex_value)
+      @vertices.reject! { |iter_vertex| iter_vertex.value == vertex_value }
+    end
+
+    def vertex?(vertex_value)
+      !find_vertex(vertex_value).nil?
+    end
+
+    def edge?(source_vertex_value, sink_vertex_value, label = nil)
+      !find_edge(source_vertex_value, sink_vertex_value, label).nil?
+    end
+
+    # NOTE: label has to be unique. Only one edge with the same source & sink can exist with no label
+    def add_edge(source_value, sink_value, label = nil)
+      find_edge(source_value, sink_value, label) || create_edge(source_value, sink_value, label)
+    end
+
+    def out_edges(vertex_value)
+      return nil unless vertex?(vertex_value)
+
+      @edges.select {|edge| edge.source = find_vertex(vertex_value) }
+    end
+
+    def in_edges(vertex_value)
+      return nil unless vertex?(vertex_value)
+      
+      @edges.select {|edge| edge.sink = find_vertex(vertex_value) }
+    end
+
+    def find_path(origin_value, terminal_value, path = []) 
+      return nil unless vertex?(origin_value) && vertex?(terminal_value)
+      return path if find_vertex(origin_value)
+    end
+
+    private 
+
+    def find_edge(source_value, sink_value, label = nil)
+      @edges.find do |iter_edge|
+        iter_edge.source == find_vertex(source_value) && 
+          iter_edge.sink == find_vertex(sink_value) && 
+          iter_edge.label == label  
+      end
+    end
+
+    def create_edge(source_value, sink_value, label = nil)
+      @edges << Edge.new(find_vertex(source_value), find_vertex(sink_value), label)
+    end
+
+    def find_vertex(vertex_value)
+      @vertices.find { |iter_vertex| iter_vertex.value == vertex_value }
+    end
+
+    def create_vertex(vertex_value, label = nil)
+      @vertices << Vertex.new(vertex_value, label)
+    end
+  end
+end

data/lib/databoom/doubly_linked_list.rb

@@ -0,0 +1,10 @@
+module Databoom
+  class DoublyLinkedList
+    class Node
+      attr_accessor :previous, :next
+    end
+
+    def initialize
+    end
+  end
+end

data/lib/databoom/linked_list.rb

@@ -2,26 +2,13 @@ module Databoom
   class LinkedList
     attr_accessor :head
 
-    def initialize
-      @head = Node.new("*")
-    end
-
-    def append(value)
-      @head.append(value)
-    end
-    
-    def append_after(find_node, nodeval)
-      after_node = find(find_node)
-      return append(nodeval) unless after_node
-    end
-
-    def find(value)
-      @head&.find(value)
-    end
-
     class Node
       attr_accessor :value, :npointer
 
+      def inspect(buffer = String.new)
+        @npointer&.inspect(buffer += "#{value} -> ") || buffer + value
+      end
+
       def find(value)
         return self if @value == value
         return nil unless @npointer
@@ -39,5 +26,26 @@ module Databoom
         @npointer = Node.new(nodeval)
       end
     end
+
+    def initialize
+      @head = Node.new("*")
+    end
+
+    def append(value)
+      @head.append(value)
+    end
+
+    def append_after(find_node, nodeval)
+      after_node = find(find_node)
+      return append(nodeval) unless after_node
+    end
+
+    def find(value)
+      @head&.find(value)
+    end
+
+    def inspect
+      @head&.inspect 
+    end
   end
 end

data/lib/databoom/lru_cache.rb

@@ -0,0 +1,4 @@
+module Databoom
+  class LruCache
+  end
+end

data/lib/databoom/queue.rb

@@ -0,0 +1,4 @@
+module Databoom
+  class Queue
+  end
+end

data/lib/databoom/stack.rb

@@ -0,0 +1,14 @@
+require 'forwardable'
+
+module Databoom
+  class Stack
+    extend Forwardable
+    def initialize; @mem = []; end
+    def pop; [@mem.pop, @mem]; end
+
+    def_delegator   :@mem, :push
+    def_delegator   :@mem, :pop, :pop!
+    def_delegator   :@mem, :last, :peek
+    def_delegators  :@mem, :size, :inspect
+  end
+end

data/lib/databoom/trie.rb

@@ -0,0 +1,4 @@
+module Databoom
+  class Trie
+  end
+end

data/lib/databoom.rb

@@ -1,3 +1,15 @@
 module Databoom
   require_relative "databoom/linked_list"
+  require_relative "databoom/doubly_linked_list"
+  require_relative "databoom/doubly_linked_list"
+  require_relative "databoom/avl_tree"
+  require_relative "databoom/balanced_tree"
+  require_relative "databoom/binary_search_tree"
+  require_relative "databoom/circular_dequeue"
+  require_relative "databoom/dequeue"
+  require_relative "databoom/digraph"
+  require_relative "databoom/lru_cache"
+  require_relative "databoom/stack"
+  require_relative "databoom/queue"
+  require_relative "databoom/trie"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: databoom
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.2
 platform: ruby
 authors:
 - Sreedev Kodichath
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2021-12-07 00:00:00.000000000 Z
+date: 2021-12-10 00:00:00.000000000 Z
 dependencies: []
 description:
 email: sreedevpadmakumar@gmail.com
@@ -17,7 +17,18 @@ extensions: []
 extra_rdoc_files: []
 files:
 - lib/databoom.rb
+- lib/databoom/avl_tree.rb
+- lib/databoom/balanced_tree.rb
+- lib/databoom/binary_search_tree.rb
+- lib/databoom/circular_dequeue.rb
+- lib/databoom/dequeue.rb
+- lib/databoom/digraph.rb
+- lib/databoom/doubly_linked_list.rb
 - lib/databoom/linked_list.rb
+- lib/databoom/lru_cache.rb
+- lib/databoom/queue.rb
+- lib/databoom/stack.rb
+- lib/databoom/trie.rb
 homepage: https://github.com/sreedevk/databoom
 licenses:
 - MIT