v0.13.0 Release: Ruby Version Upgrade Part #1 (#71)

* Ruby version upgrade to v3.1

Author: abhinav-nain

.github/workflows/build.yml

@@ -7,7 +7,7 @@ jobs:
     runs-on: ubuntu-latest
     strategy:
       matrix:
-        ruby: ['2.5', '2.6', '2.7']
+        ruby: ['3.1','3.2','3.3']
     name: Test ruby v${{ matrix.ruby }} support
     steps:
     - uses: actions/checkout@v1
@@ -17,7 +17,7 @@ jobs:
         ruby-version: ${{ matrix.ruby }}
     - name: Build with dependencies
       run: |
-        gem install bundler -v 2.1
+        gem install bundler -v 2.5.14
         bundle install
     - name: Test with rspec
       run: |

.rubocop.yml

@@ -1,5 +1,5 @@
 AllCops:
-  TargetRubyVersion: 2.4
+  TargetRubyVersion: 3.1
 
 Style/Documentation:
   Enabled: false

Dockerfile

@@ -1,4 +1,4 @@
-FROM ruby:2.5-alpine
+FROM ruby:3.1
 
 RUN mkdir -p /usr/src/app
 WORKDIR /usr/src/app

lib/vrt.rb

@@ -81,7 +81,7 @@ def all_matching_categories(categories)
   def find_node(vrt_id:, preferred_version: nil, max_depth: 'variant', version: nil) # rubocop:disable Lint/UnusedMethodArgument
     new_version = preferred_version || current_version
     if get_map(version: new_version).valid?(vrt_id)
-      get_map(version: new_version).find_node(vrt_id, max_depth: max_depth)
+      get_map(version: new_version).find_node(vrt_id, max_depth:)
     elsif deprecated_node?(vrt_id)
       find_deprecated_node(vrt_id, preferred_version, max_depth)
     else

lib/vrt/cross_version_mapping.rb

@@ -32,14 +32,14 @@ def latest_version_for_deprecated_node(vrt_id)
     def find_deprecated_node(vrt_id, new_version = nil, max_depth = 'variant')
       version = latest_version_for_deprecated_node(vrt_id)
       node_id = deprecated_node_json[vrt_id][new_version] || deprecated_node_json[vrt_id][version]
-      new_node = VRT::Map.new(new_version).find_node(node_id, max_depth: max_depth)
+      new_node = VRT::Map.new(new_version).find_node(node_id, max_depth:)
       new_node.nil? ? find_deprecated_node(node_id, new_version, max_depth) : new_node
     end
 
     def find_valid_parent_node(vrt_id, new_version, max_depth)
       new_map = VRT::Map.new(new_version)
       if new_map.valid?(vrt_id)
-        new_map.find_node(vrt_id, max_depth: max_depth)
+        new_map.find_node(vrt_id, max_depth:)
       else
         parent = vrt_id.split('.')[0..-2].join('.')
         return nil if parent.empty?

lib/vrt/map.rb

@@ -18,7 +18,7 @@ def initialize(version = nil)
     end
 
     def find_node(string, max_depth: 'variant')
-      @_found_nodes[string + max_depth] ||= walk_node_tree(string, max_depth: max_depth)
+      @_found_nodes[string + max_depth] ||= walk_node_tree(string, max_depth:)
     end
 
     def valid?(vrt_id)
@@ -52,7 +52,7 @@ def construct_lineage(string, max_depth)
       return unless valid_identifier?(string)
 
       lineage = ''
-      walk_node_tree(string, max_depth: max_depth) do |ids, node, level|
+      walk_node_tree(string, max_depth:) do |ids, node, level|
         return unless node
 
         lineage += node.name

lib/vrt/mapping.rb

@@ -13,6 +13,8 @@ def initialize(scheme, subdirectory = nil)
     # returns the most specific value provided in the mapping file for the given vrt id
     #
     # if no mapping file exists for the given version, the mapping file for the earliest version available will be used
+    # rubocop:disable Metrics/CyclomaticComplexity
+    # rubocop:disable Metrics/PerceivedComplexity
     def get(id_list, version)
       # update the vrt id to the first version we have a mapping file for
       unless @mappings.key?(version)
@@ -29,15 +31,17 @@ def get(id_list, version)
         # { remediation_advice: { remediation_advice: '...', references: [...] } }
         keys.each_with_object({}) do |key, acc|
           acc[key.to_sym] = get_key(
-            id_list: id_list,
-            mapping: mapping,
-            key: key
+            id_list:,
+            mapping:,
+            key:
           ) || default&.dig(key)
         end
       else
-        get_key(id_list: id_list, mapping: mapping, key: @scheme) || default
+        get_key(id_list:, mapping:, key: @scheme) || default
       end
     end
+    # rubocop:enable Metrics/CyclomaticComplexity
+    # rubocop:enable Metrics/PerceivedComplexity
 
     private
 
@@ -74,7 +78,7 @@ def key_by_id(mapping)
       if mapping.is_a?(Array) && mapping.first.is_a?(Hash) && mapping.first.key?('id')
         mapping.each_with_object({}) { |entry, acc| acc[entry['id'].to_sym] = key_by_id(entry) }
       elsif mapping.is_a?(Hash)
-        mapping.each_with_object({}) { |(key, value), acc| acc[key] = key_by_id(value) }
+        mapping.transform_values { |value| key_by_id(value) }
       else
         mapping
       end

lib/vrt/node.rb

@@ -24,11 +24,11 @@ def construct_vrt_id
     end
 
     def mappings
-      Hash[VRT.mappings.map { |name, map| [name, map.get(id_list, @version)] }]
+      VRT.mappings.transform_values { |map| map.get(id_list, @version) }
     end
 
     def third_party_links
-      Hash[VRT.third_party_links.map { |name, map| [name, map.get(id_list, @version)] }]
+      VRT.third_party_links.transform_values { |map| map.get(id_list, @version) }
     end
 
     def id_list

lib/vrt/third_party_links.rb

@@ -27,7 +27,7 @@ def load_mappings
 
     # For flat third party links ther is no hierarchical step up
     def get_key(id_list:, mapping:, key: nil) # rubocop:disable Lint/UnusedMethodArgument
-      mapping.dig(id_list.join('.'))
+      mapping[id_list.join('.')]
     end
   end
 end

spec/vrt_spec.rb

@@ -69,9 +69,9 @@
   describe '#find_node' do
     subject(:found_node) do
       described_class.find_node(
-        vrt_id: vrt_id,
+        vrt_id:,
         preferred_version: new_version,
-        max_depth: max_depth
+        max_depth:
       )
     end