gitlab-triage 0.12.0 → 0.13.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: e43782bbf5e45d1c7699a1eb9ecb0168bc3d5c0744321e4e35e7266a8c557e54
-  data.tar.gz: 9845eea26534334f705fd2832e5c47c646f81bb3b8c1499e2b9f6006daad8284
+  metadata.gz: 587e71e912b7d8906ecbc081b1a07258aa6cfe80643ea34c38314256a97ab503
+  data.tar.gz: a83dc6d31326079c8315d24af259d9015c13bb2d759684831633fd295dd0b8a1
 SHA512:
-  metadata.gz: 9c49e920f42913e5c275f8cc166e6c4a17dc7d1462b613aaf7efc9d2e61bad58338d9d138598c5688eb56864b18882b4aad420d3b03330aa5a7c679690e4daaa
-  data.tar.gz: 753b412633000a762e44bdcf22790d29058ecf09ee1b93dda2cd110da3bc999a2d7a84b5fcea783aaee63e380452a840d29b1bfdb7dab722710f8577b3e08d24
+  metadata.gz: ec66a05c1d691deb9eab031e69062762e492301a09fe27e2c3bf85f876b36459d715d2e6c82b6dd39706e568171643316a7558046347d07bb034740d5e0a4d32
+  data.tar.gz: '0359fe4894503d53ba358687b66854d9153a53177ba04ebbadb9106d6d824ae0ad1bc3c2d570834b3ed81cb3ca90f2dd67555c3758ae7e254e1ca8555a825aa8'

data/.gitlab-ci.yml

@@ -75,15 +75,16 @@ codequality:
 ##################
 ## Triage stage ##
 ##################
-dry-run:bin:gitlab-triage:
+dry-run:gitlab-triage:
   <<: *pull-cache
   stage: triage
   script:
     - bundle exec rake install:local
     - gitlab-triage --help
+    - gitlab-triage --init
     - gitlab-triage --dry-run --debug --token $API_TOKEN --project-id $CI_PROJECT_PATH
 
-dry-run:bin:gitlab-ce:
+dry-run:gitlab-ce:
   <<: *pull-cache
   stage: triage
   script:
@@ -91,12 +92,3 @@ dry-run:bin:gitlab-ce:
     - gitlab-triage --help
     - gitlab-triage --dry-run --debug --token $API_TOKEN --project-id gitlab-org/gitlab-ce
   when: manual
-
-dry-run:gem:gitlab-triage:
-  <<: *pull-cache
-  stage: triage
-  script:
-    - gem install gitlab-triage
-    - gitlab-triage --help
-    - gitlab-triage --dry-run --debug --token $API_TOKEN --project-id $CI_PROJECT_PATH
-  when: manual

data/README.md

@@ -20,7 +20,8 @@ Each policy can declare a number of conditions that must all be satisfied before
 
 ### Defining a policy
 
-Policies are defined in a policy file (by default [.triage-policies.yml](.triage-policies.yml)). The format of the file is [YAML](https://en.wikipedia.org/wiki/YAML).
+Policies are defined in a policy file (by default `./.triage-policies.yml`).
+The format of the file is [YAML](https://en.wikipedia.org/wiki/YAML).
 
 > Note: You can use the [`--init`](#usage) option to add an example [`.triage-policies.yml` file](support/.triage-policies.example.yml) to your project
 
@@ -189,7 +190,64 @@ conditions:
     - feature proposal
 ```
 
-###### Labels over sequences
+###### Labels brace expansion
+
+We could expand the labels by using brace expansion, which is a pattern
+surrounded by using braces: `{}`. For now, we support 2 kinds of brace
+expansion:
+
+1. List: `{ apple, orange }`
+2. Sequence: `{1..4}`
+
+> Note:
+>   - Spaces around the items are ignored.
+>   - Do not rely on the expansion ordering. This is subject to change.
+
+###### List
+
+The name of a label can contain a list of items, written like
+`{ apple, orange }`. For each item, the rule will be duplicated with the new
+label name.
+
+Example:
+
+```yml
+resource_rules:
+  issues:
+    rules:
+      - name: Add missing ~Quality label
+        conditions:
+          labels:
+            - Quality:test-{ gap, infra }
+        actions:
+          labels:
+            - Quality
+```
+
+Which will be expanded into:
+
+```yml
+resource_rules:
+  issues:
+    rules:
+      - name: Add missing ~Quality label
+        conditions:
+          labels:
+            - Quality:test-gap
+        actions:
+          labels:
+            - Quality
+
+      - name: Add missing ~Quality label
+        conditions:
+          labels:
+            - Quality:test-infra
+        actions:
+          labels:
+            - Quality
+```
+
+###### Sequence
 
 The name of a label can contain one or more sequence conditions, written
 like `{0..9}`, which means `0`, `1`, `2`, and so on up to `9`. For each

data/bin/gitlab-triage

@@ -52,12 +52,18 @@ class TriageOptionParser
         end
 
         opts.on('--init', 'Initialize the project with a policy file') do
-          FileUtils.cp('./support/.triage-policies.example.yml', './.triage-policies.yml')
+          example_path =
+            File.expand_path('../support/.triage-policies.example.yml', __dir__)
+
+          FileUtils.cp(example_path, '.triage-policies.yml')
           exit
         end
 
         opts.on('--init-ci', 'Initialize the project with a .gitlab-ci.yml file') do
-          FileUtils.cp('./support/.gitlab-ci.example.yml', './.gitlab-ci.yml')
+          example_path =
+            File.expand_path('../support/.gitlab-ci.example.yml', __dir__)
+
+          FileUtils.cp(example_path, '.gitlab-ci.yml')
           exit
         end
       end

data/lib/gitlab/triage/action/comment.rb

@@ -28,9 +28,9 @@ module Gitlab
 
         def act
           resources.each do |resource|
-            comment = build_comment(resource)
+            comment = build_comment(resource).strip
 
-            perform(resource, comment)
+            perform(resource, comment) unless comment.empty?
           end
         end
 

data/lib/gitlab/triage/api_query_builders/base_query_param_builder.rb

@@ -10,7 +10,7 @@ module Gitlab
         end
 
         def build_param
-          "&#{param_name}=#{param_content}"
+          "&#{param_name}=#{param_content.strip}"
         end
       end
     end

data/lib/gitlab/triage/api_query_builders/multi_query_param_builder.rb

@@ -12,7 +12,7 @@ module Gitlab
         end
 
         def param_content
-          param_contents.join(separator)
+          param_contents.map(&:strip).join(separator)
         end
       end
     end

data/lib/gitlab/triage/engine.rb

@@ -39,6 +39,9 @@ module Gitlab
       def perform
         puts "Performing a dry run.\n\n" if options.dry_run
 
+        puts Gitlab::Triage::UI.header("Triaging the `#{options.project_id}` project", char: '=')
+        puts
+
         resource_rules.each do |type, resource|
           puts Gitlab::Triage::UI.header("Processing rules for #{type}", char: '-')
           puts

data/lib/gitlab/triage/expand_condition/expansion.rb

@@ -0,0 +1,203 @@
+module Gitlab
+  module Triage
+    module ExpandCondition
+      class Expansion
+        # @pattern describes how we're looking for the pattern, and
+        # @compile is a block which should compile the scanned data
+        # into a list of results.
+        #
+        # Please see the comments for #perform to see actual example.
+        def initialize(pattern, &compile)
+          @pattern = pattern
+          @compile = compile
+        end
+
+        # This method will take a list of strings, which contains
+        # some kind of pattern, described by @pattern and expand them
+        # into each possible matches via @compile. For example,
+        # suppose @pattern is:
+        #
+        #     /\{(\d+)\.\.(\d+)\}/
+        #
+        # And @compile is:
+        #
+        #     do |(lower, upper)|
+        #       Integer(lower)..Integer(upper)
+        #     end
+        #
+        # And the input is:
+        #
+        # * a:{0..1}
+        # * b:{2..3}
+        # * c
+        #
+        # The result would be:
+        #
+        # * * a:0
+        #   * b:2
+        #   * c
+        # * * a:0
+        #   * b:3
+        #   * c
+        # * * a:1
+        #   * b:2
+        #   * c
+        # * * a:1
+        #   * b:3
+        #   * c
+        #
+        # We get this by picking the 1st number from the 1st string,
+        # which is 0 from "a:{0..1}", and the 1st number from the
+        # 2nd string, which is 2 from "b:{2..3}", and since the 3rd
+        # string is just a fixed string, we just pick it.
+        #
+        # This way we have the first possible match, that is:
+        #
+        # * a:0
+        # * b:2
+        # * c
+        #
+        # Then we repeat the process by picking the next number for the
+        # next possible match, starting from the least significant
+        # string, which is c, but there's nothing more to pick. Then we
+        # go to the next one, which will be the 2nd string: "b:{2..3}",
+        # and we pick the 2nd number for it: 3. Since we have a new pick,
+        # we have a new possible match:
+        #
+        # * a:0
+        # * b:3
+        # * c
+        #
+        # Again we repeat the process, and 2nd string doesn't have more
+        # choices therefore we need to go to the 1st string now. When
+        # this happens, we'll need to reset the picks from the previous
+        # string, thus 2nd string will go back to 2. The next number for
+        # the 1st string is 1, and then we form the new match:
+        #
+        # * a:1
+        # * b:2
+        # * c
+        #
+        # The next step will be the last match by picking the next number
+        # from the 2nd string again: 3, and we get:
+        #
+        # * a:1
+        # * b:3
+        # * c
+        #
+        # The method will stop here because it had walked through all the
+        # possible combinations. The total number of results is the product
+        # of numbers of sequences.
+        #
+        # Note that a string can contain multiple sequences, and it will
+        # also walk through them one by one. For example, given:
+        #
+        # * a:{0..1}:{2..3}
+        # * c
+        #
+        # We'll get:
+        #
+        # * * a:0:2
+        #   * c
+        # * * a:0:3
+        #   * c
+        # * * a:1:2
+        #   * c
+        # * * a:1:3
+        #   * c
+        def perform(strings)
+          expanded_strings =
+            strings.map(&:strip).map(&method(:expand_patterns))
+
+          product_of_all(expanded_strings)
+        end
+
+        # This method returns the product of list of lists. For example,
+        # giving it [%w[a:0 a:1], %w[b:2 b:3], %w[c]] will return:
+        #
+        # [%w[a:0 b:2 c], %w[a:0 b:3 c], %w[a:1 b:2 c], %w[a:1 b:3 c]]
+        def product_of_all(expanded_strings)
+          expanded_strings.first.product(*expanded_strings.drop(1))
+        end
+
+        # This method expands the string from the sequences. For example,
+        # giving it "a:{0..1}:{2..3}" will return:
+        #
+        # %w[
+        #   a:0:2
+        #   a:0:3
+        #   a:1:2
+        #   a:1:3
+        # ]
+        def expand_patterns(string)
+          expand(string, scan_patterns(string))
+        end
+
+        # This method extracts the sequences from the string. For example,
+        # giving it "a:{0..1}:{2..3}" will return:
+        #
+        # [0..1, 2..3]
+        def scan_patterns(string)
+          string.scan(@pattern).map(&@compile)
+        end
+
+        # This recursive method does the heavy lifting. It substitutes the
+        # sequence patterns in a string with a picked number from the
+        # sequence, and collect all the results. Here's an example:
+        #
+        # expand("a:{0..1}:{2..3}", [0..1, 2..3])
+        #
+        # This means that we want to pick the numbers from the sequences,
+        # and fill them back to the string containing the pattern in the
+        # respective order. We don't care which pattern it is because
+        # the order should have spoken for it. The result will be:
+        #
+        # %w[
+        #   a:0:2
+        #   a:0:3
+        #   a:1:2
+        #   a:1:3
+        # ]
+        #
+        # We start by picking the first sequence, which is 0..1 here. We
+        # want all the possible picks, thus we flat_map on it, substituting
+        # the first pattern with the picked number. This means we get:
+        #
+        # "a:0:{2..3}"
+        #
+        # For the first iteration. Before we jump to the next pick from the
+        # sequence, we recursively do this again on the current string,
+        # which only has one sequence pattern left. It will be called like:
+        #
+        # expand("a:0:{2..3}", [2..3])
+        #
+        # Because we also dropped the first sequence we have already used.
+        # On the next recursive call, we don't have any sequences left,
+        # therefore we just return the current string: "a:0:2".
+        #
+        # Flattening the recursion, it might look like this:
+        #
+        # (0..1).flat_map do |x|
+        #   (2..3).flat_map do |y|
+        #     "a:{0..1}:{2..3}".sub(PATTERN, x.to_s).sub(PATTERN, y.to_s)
+        #   end
+        # end
+        #
+        # So here we could clearly see that we go deep first, substituting
+        # the least significant pattern first, and then go back to the
+        # previous one, until there's nothing more to pick.
+        def expand(string, items)
+          if items.empty?
+            [string]
+          else
+            remainings = items.drop(1)
+
+            items.first.flat_map do |item|
+              expand(string.sub(@pattern, item.to_s), remainings)
+            end
+          end
+        end
+      end
+    end
+  end
+end

data/lib/gitlab/triage/expand_condition/list.rb

@@ -0,0 +1,25 @@
+require_relative 'expansion'
+
+module Gitlab
+  module Triage
+    module ExpandCondition
+      module List
+        PATTERN = /\{.+?,.+?\}/m
+
+        def self.expand(conditions)
+          labels = conditions[:labels]
+
+          return conditions unless labels
+
+          expansion = Expansion.new(PATTERN) do |list|
+            list.gsub(/\{|\}/, '').split(',').map(&:strip)
+          end
+
+          expansion.perform(labels).map do |new_labels|
+            conditions.merge(labels: new_labels)
+          end
+        end
+      end
+    end
+  end
+end

data/lib/gitlab/triage/expand_condition/sequence.rb

@@ -1,15 +1,21 @@
-require_relative 'sequence/expansion'
+require_relative 'expansion'
 
 module Gitlab
   module Triage
     module ExpandCondition
       module Sequence
+        PATTERN = /\{\s*(\d+)\s*\.\.\s*(\d+)\s*\}/
+
         def self.expand(conditions)
           labels = conditions[:labels]
 
           return conditions unless labels
 
-          Expansion.perform(labels).map do |new_labels|
+          expansion = Expansion.new(PATTERN) do |(lower, upper)|
+            Integer(lower)..Integer(upper)
+          end
+
+          expansion.perform(labels).map do |new_labels|
             conditions.merge(labels: new_labels)
           end
         end

data/lib/gitlab/triage/expand_condition.rb

@@ -1,9 +1,11 @@
+require_relative 'expand_condition/list'
 require_relative 'expand_condition/sequence'
 
 module Gitlab
   module Triage
     module ExpandCondition
       PIPELINE = [
+        List,
         Sequence
       ].freeze
 

data/lib/gitlab/triage/version.rb

@@ -1,5 +1,5 @@
 module Gitlab
   module Triage
-    VERSION = '0.12.0'.freeze
+    VERSION = '0.13.0'.freeze
   end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: gitlab-triage
 version: !ruby/object:Gem::Version
-  version: 0.12.0
+  version: 0.13.0
 platform: ruby
 authors:
 - GitLab
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2018-10-30 00:00:00.000000000 Z
+date: 2018-11-12 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: activesupport
@@ -122,7 +122,6 @@ files:
 - ".gitlab/CODEOWNERS"
 - ".gitlab/issue_templates/Policy.md"
 - ".rubocop.yml"
-- ".triage-policies.yml"
 - CONTRIBUTING.md
 - Gemfile
 - Guardfile
@@ -149,8 +148,9 @@ files:
 - lib/gitlab/triage/command_builders/text_content_builder.rb
 - lib/gitlab/triage/engine.rb
 - lib/gitlab/triage/expand_condition.rb
+- lib/gitlab/triage/expand_condition/expansion.rb
+- lib/gitlab/triage/expand_condition/list.rb
 - lib/gitlab/triage/expand_condition/sequence.rb
-- lib/gitlab/triage/expand_condition/sequence/expansion.rb
 - lib/gitlab/triage/filters/assignee_member_conditions_filter.rb
 - lib/gitlab/triage/filters/author_member_conditions_filter.rb
 - lib/gitlab/triage/filters/base_conditions_filter.rb
@@ -199,7 +199,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.7.7
+rubygems_version: 2.7.8
 signing_key: 
 specification_version: 4
 summary: GitLab triage automation project.

data/.triage-policies.yml

@@ -1,218 +0,0 @@
-resource_rules:
-  issues:
-    rules:
-      - name: Mark stale issues with no milestone for closure
-        conditions:
-          date:
-            attribute: updated_at
-            condition: older_than
-            interval_type: months
-            interval: 12
-          milestone:
-            - No Milestone
-          state: opened
-        actions:
-          labels:
-            - awaiting feedback
-            - auto updated
-          mention:
-            - markglenfletcher
-          comment: |
-            Hi {{author}},
-
-            First of all, thank you for raising an issue to help improve the GitLab product. We're sorry about this, but this particular issue has gone unnoticed for quite some time. To establish order in the GitLab-CE Issue Tracker, we must ensure that every issue is correctly labelled and triaged, to get the proper attention.
-
-            This issue will be closed, as it meets the following criteria:
-            * No activity in the past 12 months
-            * No milestone (unscheduled)
-
-            We'd like to ask you to help us out and determine whether this issue should be reopened.
-
-            If this issue is reporting a bug, please can you attempt to reproduce on the latest version of GitLab or GitLab.com, to help us to understand whether the bug still needs our attention.
-
-            If this issue is proposing a new feature, please can you verify whether the feature proposal is still relevant.
-
-            Thanks for your help
-      - name: Mark stale issues for closure
-        conditions:
-          date:
-            attribute: updated_at
-            condition: older_than
-            interval_type: months
-            interval: 3
-          labels:
-            - No Label
-          state: opened
-        actions:
-          labels:
-            - awaiting feedback
-            - auto updated
-          mention:
-            - markglenfletcher
-          comment: |
-            Hi {{author}},
-
-            First of all, thank you for raising an issue to help improve the GitLab product. We're sorry about this, but this particular issue has gone unnoticed for quite some time. To establish order in the GitLab-CE Issue Tracker, we must ensure that every issue is correctly labelled and triaged, to get the proper attention.
-
-            This issue will be closed, as it meets the following criteria:
-            * No activity in the past 3 months
-            * Unlabelled
-
-            We'd like to ask you to help us out and determine whether this issue should be reopened.
-
-            If this issue is reporting a bug, please can you attempt to reproduce on the latest version of GitLab or GitLab.com, to help us to understand whether the bug still needs our attention.
-
-            If this issue is proposing a new feature, please can you verify whether the feature proposal is still relevant.
-
-            Thanks for your help
-      - name: Close non-updated issues
-        conditions:
-          date:
-            attribute: updated_at
-            condition: older_than
-            interval_type: weeks
-            interval: 2
-          labels:
-            - awaiting feedback
-            - auto updated
-          state: opened
-        actions:
-          labels:
-            - auto closed
-          mention:
-            - markglenfletcher
-          status: close
-          comment: |
-            {{author}} Closing this issue down in accordance with our [Issue Triage Policies](https://gitlab.com/gitlab-org/triage). Please reopen the issue if you feel that the issue is still relevant. Thanks!
-      - name: Mark potentially interesting feature proposals
-        conditions:
-          labels:
-            - feature proposal
-          state: opened
-          upvotes:
-            attribute: upvotes
-            condition: greater_than
-            threshold: 10
-          milestone:
-            - No Milestone
-        actions:
-          labels:
-            - auto updated
-            - potential proposal
-      - name: Mark unpopular, old feature proposals for closure
-        conditions:
-          date:
-            attribute: updated_at
-            condition: older_than
-            interval_type: years
-            interval: 1
-          labels:
-            - feature proposal
-          state: opened
-          upvotes:
-            attribute: upvotes
-            condition: less_than
-            threshold: 10
-          milestone:
-            - No Milestone
-        actions:
-          labels:
-            - auto updated
-            - awaiting feedback
-          mention:
-            - markglenfletcher
-          comment: |
-            Hi {{author}},
-
-            First of all, thank you for raising an issue to help improve the GitLab product. This issue was labelled as a ~"feature proposal" in the past. In order to maintain order in the issue tracker, we are starting to close off old, unpopular feature proposals that have not gained many votes since opening.
-
-            This issue will be closed, as it meets the following criteria:
-            * No activity in the past 12 months (last update was {{updated_at}})
-            * Current labels ({{labels}}) include ~"feature proposal"
-            * Unscheduled (not associated with a milestone)
-            * Less than 10 upvotes (currently {{upvotes}} upvotes)
-
-            Thanks for your help and please raise any new feature proposals as a new issue.
-      - name: Mark very popular, unscheduled feature proposals
-        conditions:
-          labels:
-            - feature proposal
-          state: opened
-          milestone:
-            - No Milestone
-          upvotes:
-            attribute: upvotes
-            condition: greater_than
-            threshold: 50
-        actions:
-          labels:
-            - auto updated
-            - popular proposal
-      - name: Mark stale bugs for closure
-        conditions:
-          date:
-            attribute: updated_at
-            condition: older_than
-            interval_type: months
-            interval: 6
-          labels:
-            - bug
-          milestone:
-            - No Milestone
-          state: opened
-        actions:
-          labels:
-            - awaiting feedback
-            - auto updated
-          mention:
-            - markglenfletcher
-          comment: |
-            Hi {{author}},
-
-            First of all, thank you for raising an issue to help improve the GitLab product. We're sorry about this, but this particular issue has gone unnoticed for quite some time. To establish order in the GitLab-CE Issue Tracker, we must ensure that every issue is correctly labelled and triaged, to get the proper attention.
-
-            This issue will be marked for closure, as it meets the following criteria:
-            * Issue is open
-            * No activity in the past 6 months (last update was {{updated_at}})
-            * Current labels ({{labels}}) include ~bug
-            * Unscheduled (no milestone)
-
-            We'd like to ask you to help us out and determine whether this issue should be reopened.
-
-            Because this issue is reporting a bug, please can you attempt to reproduce on the latest version of GitLab or on GitLab.com, to help us to understand whether the bug still needs our attention.
-
-            Thanks for your help
-  merge_requests:
-    rules:
-      - name: Encourage old Community Merge Requests to completion
-        conditions:
-          date:
-            attribute: updated_at
-            condition: older_than
-            interval_type: months
-            interval: 6
-          labels:
-            - Community Contribution
-          state: opened
-        actions:
-          labels:
-            - awaiting feedback
-            - auto updated
-          mention:
-            - rymai
-          comment: |
-            Hi {{author}},
-
-            First of all, thank you for creating a Merge Request to help improve the GitLab product. We are running through old Merge Requests and asking authors to update their Merge Requests
-
-            This Merge Request was chosen, as it meets the following criteria:
-            * Open
-            * No activity in the past 6 months (last update was {{updated_at}})
-            * Current labels ({{labels}}) include ~"Community Contribution"
-
-            We'd like to ask you to help us out and let us know whether:
-            * You would like to continue the work here
-            * You would like us to take on the Merge Request for you
-            * You would like us to close down the Merge Request
-
-            Thanks for your help

data/lib/gitlab/triage/expand_condition/sequence/expansion.rb

@@ -1,187 +0,0 @@
-module Gitlab
-  module Triage
-    module ExpandCondition
-      module Sequence
-        module Expansion
-          PATTERN = /\{(\d+)\.\.(\d+)\}/
-
-          # This method will take a list of strings, which contains the
-          # sequence pattern, and expand them into each possible matches.
-          # For example, suppose the input is:
-          #
-          # * a:{0..1}
-          # * b:{2..3}
-          # * c
-          #
-          # The result would be:
-          #
-          # * * a:0
-          #   * b:2
-          #   * c
-          # * * a:0
-          #   * b:3
-          #   * c
-          # * * a:1
-          #   * b:2
-          #   * c
-          # * * a:1
-          #   * b:3
-          #   * c
-          #
-          # We get this by picking the 1st number from the 1st string,
-          # which is 0 from "a:{0..1}", and the 1st number from the
-          # 2nd string, which is 2 from "b:{2..3}", and since the 3rd
-          # string is just a fixed string, we just pick it.
-          #
-          # This way we have the first possible match, that is:
-          #
-          # * a:0
-          # * b:2
-          # * c
-          #
-          # Then we repeat the process by picking the next number for the
-          # next possible match, starting from the least significant
-          # string, which is c, but there's nothing more to pick. Then we
-          # go to the next one, which will be the 2nd string: "b:{2..3}",
-          # and we pick the 2nd number for it: 3. Since we have a new pick,
-          # we have a new possible match:
-          #
-          # * a:0
-          # * b:3
-          # * c
-          #
-          # Again we repeat the process, and 2nd string doesn't have more
-          # choices therefore we need to go to the 1st string now. When
-          # this happens, we'll need to reset the picks from the previous
-          # string, thus 2nd string will go back to 2. The next number for
-          # the 1st string is 1, and then we form the new match:
-          #
-          # * a:1
-          # * b:2
-          # * c
-          #
-          # The next step will be the last match by picking the next number
-          # from the 2nd string again: 3, and we get:
-          #
-          # * a:1
-          # * b:3
-          # * c
-          #
-          # The method will stop here because it had walked through all the
-          # possible combinations. The total number of results is the product
-          # of numbers of sequences.
-          #
-          # Note that a string can contain multiple sequences, and it will
-          # also walk through them one by one. For example, given:
-          #
-          # * a:{0..1}:{2..3}
-          # * c
-          #
-          # We'll get:
-          #
-          # * * a:0:2
-          #   * c
-          # * * a:0:3
-          #   * c
-          # * * a:1:2
-          #   * c
-          # * * a:1:3
-          #   * c
-          def self.perform(strings)
-            expanded_strings = strings.map(&method(:expand_sequences))
-
-            product_of_all(expanded_strings)
-          end
-
-          # This method returns the product of list of lists. For example,
-          # giving it [%w[a:0 a:1], %w[b:2 b:3], %w[c]] will return:
-          #
-          # [%w[a:0 b:2 c], %w[a:0 b:3 c], %w[a:1 b:2 c], %w[a:1 b:3 c]]
-          def self.product_of_all(expanded_strings)
-            expanded_strings.first.product(*expanded_strings.drop(1))
-          end
-
-          # This method expands the string from the sequences. For example,
-          # giving it "a:{0..1}:{2..3}" will return:
-          #
-          # %w[
-          #   a:0:2
-          #   a:0:3
-          #   a:1:2
-          #   a:1:3
-          # ]
-          def self.expand_sequences(string)
-            expand(string, scan_sequences(string))
-          end
-
-          # This method extracts the sequences from the string. For example,
-          # giving it "a:{0..1}:{2..3}" will return:
-          #
-          # [0..1, 2..3]
-          def self.scan_sequences(string)
-            string.scan(PATTERN).map do |(lower, upper)|
-              Integer(lower)..Integer(upper)
-            end
-          end
-
-          # This recursive method does the heavy lifting. It substitutes the
-          # sequence patterns in a string with a picked number from the
-          # sequence, and collect all the results. Here's an example:
-          #
-          # expand("a:{0..1}:{2..3}", [0..1, 2..3])
-          #
-          # This means that we want to pick the numbers from the sequences,
-          # and fill them back to the string containing the pattern in the
-          # respective order. We don't care which pattern it is because
-          # the order should have spoken for it. The result will be:
-          #
-          # %w[
-          #   a:0:2
-          #   a:0:3
-          #   a:1:2
-          #   a:1:3
-          # ]
-          #
-          # We start by picking the first sequence, which is 0..1 here. We
-          # want all the possible picks, thus we flat_map on it, substituting
-          # the first pattern with the picked number. This means we get:
-          #
-          # "a:0:{2..3}"
-          #
-          # For the first iteration. Before we jump to the next pick from the
-          # sequence, we recursively do this again on the current string,
-          # which only has one sequence pattern left. It will be called like:
-          #
-          # expand("a:0:{2..3}", [2..3])
-          #
-          # Because we also dropped the first sequence we have already used.
-          # On the next recursive call, we don't have any sequences left,
-          # therefore we just return the current string: "a:0:2".
-          #
-          # Flattening the recursion, it might look like this:
-          #
-          # (0..1).flat_map do |x|
-          #   (2..3).flat_map do |y|
-          #     "a:{0..1}:{2..3}".sub(PATTERN, x.to_s).sub(PATTERN, y.to_s)
-          #   end
-          # end
-          #
-          # So here we could clearly see that we go deep first, substituting
-          # the least significant pattern first, and then go back to the
-          # previous one, until there's nothing more to pick.
-          def self.expand(string, sequences)
-            if sequences.empty?
-              [string]
-            else
-              remainings = sequences.drop(1)
-
-              sequences.first.flat_map do |number|
-                expand(string.sub(PATTERN, number.to_s), remainings)
-              end
-            end
-          end
-        end
-      end
-    end
-  end
-end