ds 0.0.4 → 0.0.6

metadata

@@ -1,72 +1,112 @@
 --- !ruby/object:Gem::Specification
 name: ds
 version: !ruby/object:Gem::Version
-  version: 0.0.4
-  prerelease: 
+  version: 0.0.6
 platform: ruby
 authors:
 - knife
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-06-16 00:00:00.000000000 Z
-dependencies: []
-description: Data structures (lists,stacks, trees, heaps, graphs..) in pure Ruby.
+date: 2016-05-30 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  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: rake
+  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: minitest
+  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: Data structures (lists, stacks, trees, heaps, graphs..) in pure Ruby.
 email:
 - satre@o2.pl
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
-- .gitignore
+- ".gitignore"
+- ".rubocop.yml"
+- ".rubocop_todo.yml"
+- ".travis.yml"
 - Gemfile
 - README.rdoc
 - Rakefile
 - ds.gemspec
 - lib/ds.rb
-- lib/ds/ext/array_x.rb
-- lib/ds/graphs/digraph.rb
-- lib/ds/graphs/edge.rb
-- lib/ds/graphs/graph.rb
-- lib/ds/graphs/graph_as_matrix.rb
-- lib/ds/graphs/graph_as_tri_matrix.rb
-- lib/ds/lists/cyclic_list.rb
+- lib/ds/arrays/array_2d.rb
+- lib/ds/arrays/expandable_array.rb
+- lib/ds/arrays/heap_store.rb
+- lib/ds/arrays/tri_matrix.rb
 - lib/ds/lists/list.rb
 - lib/ds/lists/list_element.rb
-- lib/ds/lists/ring.rb
-- lib/ds/matrixes/array_2d.rb
-- lib/ds/matrixes/expandable_array.rb
-- lib/ds/matrixes/tri_matrix.rb
 - lib/ds/pair.rb
 - lib/ds/queues/priority_queue.rb
-- lib/ds/queues/queue.rb
-- lib/ds/sets/ordered_set.rb
+- lib/ds/queues/simple_queue.rb
+- lib/ds/sets/indexed_set.rb
 - lib/ds/stacks/stack.rb
 - lib/ds/trees/binary_heap.rb
-- lib/ds/trees/binary_search_tree.rb
 - lib/ds/trees/binary_tree.rb
-- lib/ds/trees/complete_binary_tree.rb
+- lib/ds/trees/red_black_tree.rb
+- lib/ds/trees/red_black_tree/node.rb
 - lib/ds/trees/tree.rb
 - lib/ds/trees/tree_walker.rb
 - lib/ds/trees/trie.rb
+- lib/ds/trees/trie/node.rb
 - lib/ds/version.rb
 - test/help.rb
+- test/performance/binary_heap_performance_test.rb
+- test/performance/list_performance_test.rb
+- test/performance/priority_queue_performance.rb
+- test/performance/rbt_performance_test.rb
+- test/performance/simple_queue_performance_test.rb
+- test/performance/stack_test.rb
 - test/test_array2d.rb
-- test/test_array_x.rb
 - test/test_binary_heap.rb
-- test/test_binary_search_tree.rb
 - test/test_binary_tree.rb
-- test/test_complete_binary_tree.rb
-- test/test_digraph.rb
 - test/test_expandable_array.rb
-- test/test_graph.rb
+- test/test_heap_store.rb
+- test/test_indexed_set.rb
 - test/test_list.rb
 - test/test_list_element.rb
-- test/test_ordered_set.rb
 - test/test_pair.rb
 - test/test_priority_queue.rb
 - test/test_queue.rb
-- test/test_ring.rb
+- test/test_red_black_tree.rb
 - test/test_stack.rb
 - test/test_tree.rb
 - test/test_tree_walker.rb
@@ -74,26 +114,31 @@ files:
 - test/test_trie.rb
 homepage: ''
 licenses: []
+metadata: {}
 post_install_message: 
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
 rubyforge_project: ds
-rubygems_version: 1.8.25
+rubygems_version: 2.4.5.1
 signing_key: 
-specification_version: 3
+specification_version: 4
 summary: Some common data structures.
-test_files: []
+test_files:
+- test/performance/binary_heap_performance_test.rb
+- test/performance/list_performance_test.rb
+- test/performance/priority_queue_performance.rb
+- test/performance/rbt_performance_test.rb
+- test/performance/simple_queue_performance_test.rb
+- test/performance/stack_test.rb

data/lib/ds/ext/array_x.rb

@@ -1,35 +0,0 @@
-module DS
-  module ArrayX
-
-    #Checks if array is already sorted.
-    def sorted?(order=:any)
-      return true if size < 2
-      
-      if size == 2
-        return false if self[0] > self[1] and order == :asc
-        return false if self[0] < self[1] and order == :desc
-      else
-        case order
-        when :asc
-          (size-2).times{ |i| return false if self[i] > self[i+1] }
-        when :desc
-          (size-2).times{ |i| return false if self[i] < self[i+1] }
-        else
-          return (self[0] < self[1])? sorted?(:asc) : sorted?(:desc) 
-        end
-      end
-
-      true
-    end
-
-    #Checks if array has duplicates.
-    def duplications?
-      size != uniq.size 
-    end
-
-    #Returns array tail.
-    def tail
-      self[1..-1]
-    end
-  end
-end

data/lib/ds/graphs/digraph.rb

@@ -1,20 +0,0 @@
-module DS
-  class Digraph < Graph
-
-    def self.create(args)
-      new(args,:matrix)
-    end
-
-
-    #Returns number of incoming edges to given vertex.
-    def in_degree x
-      @g.degree x, :in
-    end
-
-    #Returns number of outcoming edges to given vertex.
-    def out_degree x
-      @g.degree x, :out
-    end
-
-  end
-end

data/lib/ds/graphs/edge.rb

@@ -1,15 +0,0 @@
-module DS
-  class Edge
-
-    attr_accessor :from, :to, :weight
-    
-    #Create new edge.
-    def initialize(from,to,weight=1)
-      @from =  from
-      @to  =  to
-      @weight = weight
-    end
-
-  end
-end
-

data/lib/ds/graphs/graph.rb

@@ -1,111 +0,0 @@
-module DS
-  class Graph
-
-    Infinity = 1 << 64
-
-    #Create new graph from array of edges. Second parameter determines
-    #graph internal implementation: :list (Adjency List), :tri_matrix (Triangular
-    #Matrix), :matrix (Matrix).
-    def initialize(edges,store = :matrix)
-      case store
-      when :matrix
-        @g = GraphAsMatrix.new(edges)
-      when :tri_matrix
-        @g = GraphAsTriMatrix.new(edges)
-      end
-    end
-
-    #Create new graph from array of edges. Internally graph will be represented
-    #by Triangular Matrix.
-    def self.create(edges)
-      new(edges,:tri_matrix) 
-    end
-
-    #Adds new edge to graph.
-    def add(x,y,weight=1)
-      e = Edge.new(x,y,weight)
-      add_edges([e])
-    end
-
-    #Adds new edges to graph.
-    def add_edges(edges)
-      @g.add_edges(edges)
-    end
-    
-
-    #Removes conection between vertex x and y.
-    def remove(x,y)
-      @g.remove(x,y) 
-    end
-
-    #Returns all neighbors for given vertex.
-    def neighbors v
-      @g.neighbors v
-    end
-
-    #Returns vertex degree.
-    def degree x
-      @g.degree x
-    end
-
-    #Checks if two elements are connected.
-    def edge? x,y
-      @g.edge? x,y
-    end
-
-    #Returns Edge(x,y) if exist.
-    def get_edge x, y
-      @g.get_edge x,y
-    end
-
-    def vertex_size
-      @g.vertex_size
-    end
-
-    def each_vertex &block
-      @g.each_vertex &block
-    end
-
-    def each_edge &block
-      @g.each_edge &block
-    end
-
-
-    def bfs s
-      colors = {}
-      parents =  {}
-      res = []
-      d = {}
-      q = Queue.new
-
-      @g.each_vertex do |v|
-        colors[v] = :white
-        parents[v] = nil
-        d[v] = Infinity
-      end
-
-      colors[s] = :white
-      parents[s] = nil
-      d[s] = 0
-
-      q.enqueue s
-
-      while !q.empty?
-        u = q.dequeue 
-        @g.neighbors(u).each do |v|
-          if colors[v] === :white
-            colors[v] = :grey
-            d[v] = d[u] + 1
-            parents[v] = u
-            q.enqueue v
-          end
-        end
-        colors[u] = :black
-        res << u
-      end
-      res
-    end
-
-    
-  end
-end

data/lib/ds/graphs/graph_as_matrix.rb

@@ -1,113 +0,0 @@
-module DS
-  class GraphAsMatrix
-
-    def initialize(edges)
-      @store = Array2D.new
-      @max = 0
-
-      @map = OrderedSet.new #maps objects to matrix indexes.
-
-      add_edges(edges)
-    end
-
-    #Adds new edges to graph.
-    def add_edges(edges)
-      for e in edges
-        x = @map.push e.from
-        y = @map.push e.to
-
-        @store[x,y] = e.weight
-
-        @max = [@max, x, y].max
-      end
-    end
-
-    #Returns all neighbors for given vertex.
-    def neighbors(v)
-      n = []
-      vertexes = @map.to_a
-      v = @map.index(v)
-
-      0.upto @max do |i|
-        n << vertexes[i] if @store[v,i] > 0
-      end
-      n
-    end
-
-    #Removes conection between vertex x and y.
-    def remove(x,y)
-      v1 = @map.index(x)
-      v2 = @map.index(y)
-
-      vertexes = @map.to_a
-
-      @store[v1,v2] = 0
-      if (degree vertexes[@max]) == 0
-        @max -= 1
-      end
-    end
-
-    #Returns Edge(x,y) if exist.
-    def get_edge x,y
-      s = @map.index x
-      t = @map.index y
-      if @store[s,t] > 0
-        Edge.new(x, y, @store[s,t])
-      else
-        nil
-      end
-    end
-
-    #Checks if two elements are connected.
-    def edge? x,y
-      v1 = @map.index(x)
-      v2 = @map.index(y)
-      @store[v1,v2] > 0
-    end
-    
-    #Returns vertex counter.
-    def vertex_size
-      @map.size
-    end
-
-
-    #Returns vertex degree. Second parameter determines direction - :in incoming
-    #edges, :out - outcoming edges, :all - incoming and outcoming edges.
-    def degree(x,direction=:all)
-      x = @map.index(x)
-      sum_in = 0
-      sum_out = 0
-      0.upto @max do |i|
-        sum_in += 1 if @store[i,x] and @store[i,x] > 0
-        sum_out += 1 if @store[x,i]  and @store[x,i] > 0
-      end
-
-      case direction
-      when :all
-        sum_in+sum_out
-      when :in
-        sum_in
-      when :out
-        sum_out
-      end
-    end
-
-
-    #Vertex iterator
-    def each_vertex
-      vertexes = @map.to_a
-      (0..@max).each {|v| yield vertexes[v]}
-    end
-
-    #Edge iterator
-    def each_edge
-      vertexes = @map.to_a
-      for v0 in 0..@max
-        for v1 in 0..v0-1
-          yield Edge.new(vertexes[v0],vertexes[v1],@store[v0,v1]) if @store[v0,v1] > 0
-        end    
-      end    
-    end
-
-  end
-end