data_structures_rmolinari 0.4.3 → 0.5.0

data/lib/data_structures_rmolinari.rb

@@ -10,73 +10,16 @@ end
 
 # These define classes inside module DataStructuresRMolinari
 require_relative 'data_structures_rmolinari/algorithms'
+
 require_relative 'data_structures_rmolinari/disjoint_union'
 require_relative 'data_structures_rmolinari/c_disjoint_union' # version as a C extension
-require_relative 'data_structures_rmolinari/segment_tree_template'
+
+require_relative 'data_structures_rmolinari/segment_tree'
+
 require_relative 'data_structures_rmolinari/heap'
 require_relative 'data_structures_rmolinari/max_priority_search_tree'
 require_relative 'data_structures_rmolinari/min_priority_search_tree'
 
 module DataStructuresRMolinari
-  ########################################
-  # Concrete instances of Segment Tree
-  #
-  # @todo consider moving these into generic_segment_tree.rb and renaming that file
-
-  # A segment tree that for an array A(0...n) answers questions of the form "what is the maximum value in the subinterval A(i..j)?"
-  # in O(log n) time.
-  class MaxValSegmentTree
-    extend Forwardable
-
-    # Tell the tree that the value at idx has changed
-    def_delegator :@structure, :update_at
-
-    # @param data an object that contains values at integer indices based at 0, via +data[i]+.
-    #   - This will usually be an Array, but it could also be a hash or a proc.
-    def initialize(data)
-      @structure = SegmentTreeTemplate.new(
-        combine:               ->(a, b) { [a, b].max },
-        single_cell_array_val: ->(i) { data[i] },
-        size:                  data.size,
-        identity:              -Shared::INFINITY
-      )
-    end
-
-    # The maximum value in A(i..j).
-    #
-    # The arguments must be integers in 0...(A.size)
-    # @return the largest value in A(i..j) or -Infinity if i > j.
-    def max_on(i, j)
-      @structure.query_on(i, j)
-    end
-  end
-
-  # A segment tree that for an array A(0...n) answers questions of the form "what is the index of the maximal value in the
-  # subinterval A(i..j)?" in O(log n) time.
-  class IndexOfMaxValSegmentTree
-    extend Forwardable
-
-    # Tell the tree that the value at idx has changed
-    def_delegator :@structure, :update_at
-
-    # @param (see MaxValSegmentTree#initialize)
-    def initialize(data)
-      @structure = SegmentTreeTemplate.new(
-        combine:               ->(p1, p2) { p1[1] >= p2[1] ? p1 : p2 },
-        single_cell_array_val: ->(i) { [i, data[i]] },
-        size:                  data.size,
-        identity:              nil
-      )
-    end
-
-    # The index of the maximum value in A(i..j)
-    #
-    # The arguments must be integers in 0...(A.size)
-    # @return (Integer, nil) the index of the largest value in A(i..j) or +nil+ if i > j.
-    #   - If there is more than one entry with that value, return one the indices. There is no guarantee as to which one.
-    #   - Return +nil+ if i > j
-    def index_of_max_val_on(i, j)
-      @structure.query_on(i, j)&.first # discard the value part of the pair, which is a bookkeeping
-    end
-  end
+  # Add things here if needed
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: data_structures_rmolinari
 version: !ruby/object:Gem::Version
-  version: 0.4.3
+  version: 0.5.0
 platform: ruby
 authors:
 - Rory Molinari
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2023-01-27 00:00:00.000000000 Z
+date: 2023-02-03 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: must_be
@@ -79,6 +79,7 @@ email: rorymolinari@gmail.com
 executables: []
 extensions:
 - ext/c_disjoint_union/extconf.rb
+- ext/c_segment_tree_template/extconf.rb
 extra_rdoc_files: []
 files:
 - CHANGELOG.md
@@ -86,12 +87,17 @@ files:
 - Rakefile
 - ext/c_disjoint_union/disjoint_union.c
 - ext/c_disjoint_union/extconf.rb
+- ext/c_segment_tree_template/extconf.rb
+- ext/c_segment_tree_template/segment_tree_template.c
+- ext/shared.c
 - lib/data_structures_rmolinari.rb
 - lib/data_structures_rmolinari/algorithms.rb
+- lib/data_structures_rmolinari/c_segment_tree_template_impl.rb
 - lib/data_structures_rmolinari/disjoint_union.rb
 - lib/data_structures_rmolinari/heap.rb
 - lib/data_structures_rmolinari/max_priority_search_tree.rb
 - lib/data_structures_rmolinari/min_priority_search_tree.rb
+- lib/data_structures_rmolinari/segment_tree.rb
 - lib/data_structures_rmolinari/segment_tree_template.rb
 - lib/data_structures_rmolinari/shared.rb
 homepage: https://github.com/rmolinari/data_structures