range_list_barry 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: b4305219593ab7b1dd9998ed1a9e6211663a3cc38c21afc830e1504ea5b6228b
+  data.tar.gz: e476b3a3549bdbe246bb1562d2f186cede26bb81f0e9ab279597953ee9f7d1f3
+SHA512:
+  metadata.gz: 65050613f0354ac69fc77eae564396fe5f1eef78996095a71138e7b6a2d98765daa2554dc6300972e87c1c40e8cbb9e2684a272eef4c9cb05f868611776d6f27
+  data.tar.gz: e8ab26c327ac65cc37b29856f37dd5ece2758cf69bebe63f88d4de50ea5db8071781e4f1c530905e3eae660cf5dfd17fc4ca469c50bdc92ef0e39fd521ce4977

data/lib/range_list.rb

@@ -0,0 +1,111 @@
+# frozen_string_literal: true
+
+require './lib/range_list/intersection'
+require './lib/range_list/verify_range'
+
+##
+# A pair of integers define a range, for example: [1, 5). This range includes integers: 1, 2, 3, and 4.
+# A range list is an aggregate of these ranges: [1, 5), [10, 11), [100, 201)
+class RangeList
+  attr_reader :range_list
+
+  def initialize
+    @range_list = {}
+  end
+
+  # @param [Array<Integer>] range
+  # @return [Hash] return the sorted hash representation of the range list.
+  def add(range)
+    veryify_range!(range)
+
+    # we need to modify the value in the hash, so disable HashEachMethods cop.
+    # rubocop:disable Style/HashEachMethods
+    @range_list.keys.each do |key|
+      intersection = intersection(range, [key, @range_list[key]])
+      next unless intersection
+
+      # 增加新的range时, 如果有交集, 则需要将交集的range更新为[min, max]
+      min = [key, range[0]].min
+      @range_list[min] = @range_list.delete(key)
+
+      max = [@range_list[min], range[1]].max
+      @range_list[min] = max
+      return remove_overlapped_range
+    end
+    # rubocop:enable Style/HashEachMethods
+
+    # when no intersection, insert to hash
+    insert(range)
+  end
+
+  # rubocop:disable Style/HashEachMethods
+  # rubocop:disable Metrics/AbcSize
+  #
+  # @param [Array<Integer>] range
+  # @return [Hash] return the sorted hash representation of the range list
+  def remove(range)
+    veryify_range!(range)
+
+    @range_list.keys.each do |key|
+      intersection = intersection(range, [key, @range_list[key]])
+      next unless intersection&.max # an intersecion might not has max becuase the range[0] = range[1]
+
+      # 如果intersection.min == key, 则需要删除key, 创建新的hash {intersection.max => @range_list[key]}
+      # 如果intersection.min > key, 则需要删除key, 创建更新hash {key => intersection.min}
+      # 如果value > intersection.max, 则需要创建更新hash {intersection.max => value}
+      @range_list[intersection.max] = @range_list[key] if @range_list[key] > intersection.max
+
+      if intersection.min == key
+        @range_list[intersection.max] = @range_list.delete(key)
+      elsif intersection.min > key
+        @range_list[key] = intersection.min
+      end
+    end
+
+    sorted_range_list
+  end
+  # rubocop:enable Style/HashEachMethods
+  # rubocop:enable Metrics/AbcSize
+
+  ##
+  # Print all the ranges in format: [1, 5) [10, 20)
+  def print
+    str = ''
+    sorted_range_list.each do |key, value|
+      str += "[#{key}, #{value}) " unless key == value
+    end
+    puts str
+  end
+
+  # @return [String] return all the ranges in hash format
+  def inspect
+    sorted_range_list
+  end
+
+  private
+
+  # @params [Array<Integer>] range
+  # insert the range to range_list hash
+  def insert(range)
+    @range_list[range[0]] = range[1]
+    sorted_range_list
+  end
+
+  def sorted_range_list
+    @range_list.sort.to_h.reject { |key, value| key == value }
+  end
+
+  def remove_overlapped_range
+    return sorted_range_list if @range_list.length == 1
+
+    groups = @range_list.sort.map { |key, value| [key, value] }
+
+    # only need to iterate to the second last group, because we know the last group is not overlapped
+    groups[0..-2].each_with_index do |group, i|
+      groups.delete_at(i + 1) if group[1] > groups[i + 1][0]
+    end
+    @range_list = groups.to_h
+
+    sorted_range_list
+  end
+end

metadata

@@ -0,0 +1,43 @@
+--- !ruby/object:Gem::Specification
+name: range_list_barry
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- uooobarry
+autorequire:
+bindir: bin
+cert_chain: []
+date: 2022-06-25 00:00:00.000000000 Z
+dependencies: []
+description: A simple range list gem
+email: huahua.personal@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/range_list.rb
+homepage: https://jihulab.com/UoooBarry/rangelist
+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.3.3
+signing_key:
+specification_version: 4
+summary: Ruby implementation of range list.
+test_files: []