br-utils 0.1.0 → 0.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 23f897e35167135baa4eeb00f625bdd6f69656b86ce6ca62229f2dcd4a718f94
-  data.tar.gz: 1737c2f0bc7a3799ee6a3c87d8bf065a27b992eefe4fe4907be0c0f92536bc5e
+  metadata.gz: 7410285ed2d94f3143069921599888b0c3c4055be41f25454e32e4e8f61a38f3
+  data.tar.gz: 4e6fb1f71012f46622c7a3e4dc78bf26eaa7ac864d7122f1c1ece3bc912bb94e
 SHA512:
-  metadata.gz: d8e78d62b1b1c5173d2eed7088c55dfe3e7934d3faf0d6f527e654242228900fcebb29ac6fe84d5023a779292453d57a22f1ba954aa979c768b515ba5ac94c4e
-  data.tar.gz: 6978c693525a310ec21fac4a00c76128fe374bc0aed83c5a897f2a62dabc57578be80dafee3be11cab72bcd106749cc966d53518caa26477568c229ebcdde994
+  metadata.gz: 2f3644c35d9e2332c02efefe4736ca7b0faab1c342edd5390ff706ba03b1773f7f52680e233010643de5a4077b6b55c5e246228a1485094427587a32cbc595ef
+  data.tar.gz: 7d6813dd96f7b6f0db6953c014ecb9609a33e95666ccee310deab668767c7fe92c677c7b6b669661a629fcd056316b670831e131864f90d942fbc178c56bc79b

data/.github/workflows/ci.yml

@@ -0,0 +1,27 @@
+name: CI
+
+on:
+  push:
+    branches: [master]
+  pull_request:
+    branches: [master]
+
+jobs:
+  test:
+    runs-on: ubuntu-latest
+    strategy:
+      fail-fast: false
+      matrix:
+        ruby: ['3.1', '3.2', '3.3', '3.4']
+
+    steps:
+      - uses: actions/checkout@v4
+
+      - name: Set up Ruby ${{ matrix.ruby }}
+        uses: ruby/setup-ruby@v1
+        with:
+          ruby-version: ${{ matrix.ruby }}
+          bundler-cache: true
+
+      - name: Run tests
+        run: bundle exec rake spec

data/lib/brazilian-utils/cep-utils.rb

@@ -57,9 +57,12 @@ module BrazilianUtils
     :cep,
     :logradouro,
     :complemento,
+    :unidade,
     :bairro,
     :localidade,
     :uf,
+    :estado,
+    :regiao,
     :ibge,
     :gia,
     :ddd,
@@ -203,9 +206,12 @@ module BrazilianUtils
           cep: data['cep'],
           logradouro: data['logradouro'],
           complemento: data['complemento'],
+          unidade: data['unidade'],
           bairro: data['bairro'],
           localidade: data['localidade'],
           uf: data['uf'],
+          estado: data['estado'],
+          regiao: data['regiao'],
           ibge: data['ibge'],
           gia: data['gia'],
           ddd: data['ddd'],
@@ -294,9 +300,12 @@ module BrazilianUtils
             cep: address_data['cep'],
             logradouro: address_data['logradouro'],
             complemento: address_data['complemento'],
+            unidade: address_data['unidade'],
             bairro: address_data['bairro'],
             localidade: address_data['localidade'],
             uf: address_data['uf'],
+            estado: address_data['estado'],
+            regiao: address_data['regiao'],
             ibge: address_data['ibge'],
             gia: address_data['gia'],
             ddd: address_data['ddd'],

data/lib/brazilian-utils/cnh-utils.rb

@@ -32,41 +32,41 @@ module BrazilianUtils
       first_verificator = digits[9]
       second_verificator = digits[10]
 
-      # Check the 10th digit
-      return false unless check_first_verificator(digits, first_verificator)
+      # Check the 10th digit; keep the raw remainder (0-10), since the
+      # decrement applied to the 11th digit depends on whether the *pre-cap*
+      # remainder overflowed (>9), not on the printed digit (always 0-9).
+      first_rest = calculate_first_rest(digits)
+      expected_first = first_rest > 9 ? 0 : first_rest
+      return false unless expected_first == first_verificator
 
       # Check the 11th digit
-      check_second_verificator(digits, second_verificator, first_verificator)
+      check_second_verificator(digits, second_verificator, first_rest)
     end
 
-    # Generates the first verification digit and uses it to verify the 10th digit of the CNH
+    # Computes the raw remainder used to derive the CNH's first verification digit.
     #
     # @param digits [Array<Integer>] Array of CNH digits
-    # @param first_verificator [Integer] The first verification digit (10th digit)
-    # @return [Boolean] true if the first verificator is valid
+    # @return [Integer] The remainder (0-10) before capping to a single printable digit
     #
     # @private
-    def self.check_first_verificator(digits, first_verificator)
+    def self.calculate_first_rest(digits)
       sum = 0
       9.times do |i|
         sum += digits[i] * (9 - i)
       end
 
-      sum = sum % 11
-      result = sum > 9 ? 0 : sum
-
-      result == first_verificator
+      sum % 11
     end
 
     # Generates the second verification digit and uses it to verify the 11th digit of the CNH
     #
     # @param digits [Array<Integer>] Array of CNH digits
     # @param second_verificator [Integer] The second verification digit (11th digit)
-    # @param first_verificator [Integer] The first verification digit (10th digit)
+    # @param first_rest [Integer] The raw remainder (0-10) used to compute the 10th digit
     # @return [Boolean] true if the second verificator is valid
     #
     # @private
-    def self.check_second_verificator(digits, second_verificator, first_verificator)
+    def self.check_second_verificator(digits, second_verificator, first_rest)
       sum = 0
       9.times do |i|
         sum += digits[i] * (i + 1)
@@ -74,7 +74,7 @@ module BrazilianUtils
 
       result = sum % 11
 
-      if first_verificator > 9
+      if first_rest > 9
         result = (result - 2).negative? ? result + 9 : result - 2
       end
 
@@ -83,6 +83,6 @@ module BrazilianUtils
       result == second_verificator
     end
 
-    private_class_method :check_first_verificator, :check_second_verificator
+    private_class_method :calculate_first_rest, :check_second_verificator
   end
 end

data/lib/brazilian-utils/cnpj-utils.rb

@@ -170,7 +170,7 @@ module BrazilianUtils
       (position - 8).downto(2) { |w| weights << w }
       9.downto(2) { |w| weights << w }
 
-      val = cnpj.chars.zip(weights).sum do |digit, weight|
+      val = cnpj.chars.first(position - 1).zip(weights).sum do |digit, weight|
         digit.to_i * weight
       end % 11
 

data/lib/brazilian-utils/cpf-utils.rb

@@ -161,7 +161,7 @@ module BrazilianUtils
     #
     # @private
     def self.hashdigit(cpf, position)
-      val = cpf.chars.zip(position.downto(2)).sum do |digit, weight|
+      val = cpf.chars.first(position - 1).zip(position.downto(2)).sum do |digit, weight|
         digit.to_i * weight
       end % 11
 

data/lib/brazilian-utils/currency-utils.rb

@@ -42,7 +42,7 @@ module BrazilianUtils
     #
     # @example
     #   convert_real_to_text(1523.45)
-    #   #=> "Mil, quinhentos e vinte e três reais e quarenta e cinco centavos"
+    #   #=> "Mil quinhentos e vinte e três reais e quarenta e cinco centavos"
     #
     #   convert_real_to_text(1.00)
     #   #=> "Um real"
@@ -72,7 +72,10 @@ module BrazilianUtils
       if reais > 0
         reais_text = number_to_words(reais)
         currency_text = reais == 1 ? 'real' : 'reais'
-        conector = reais_text.match?(/lhão|lhões$/) ? 'de ' : ''
+        # "de" only applies when the text ends in "milhão(ões)"/"bilhão(ões)"/...
+        # on its own (e.g. "um milhão de reais"), not when it's followed by
+        # more words (e.g. "um milhão e um reais", no "de").
+        conector = reais_text.match?(/lhão$|lhões$/) ? 'de ' : ''
         parts << "#{reais_text} #{conector}#{currency_text}"
       end
       
@@ -104,8 +107,9 @@ module BrazilianUtils
     #
     # @private
     def self.number_to_words(number)
+      number = number.to_i.abs
       return 'zero' if number.zero?
-      
+
       # Scale names
       scales = [
         '',
@@ -115,7 +119,7 @@ module BrazilianUtils
         'trilhão',
         'quadrilhão'
       ]
-      
+
       scales_plural = [
         '',
         'mil',
@@ -124,49 +128,47 @@ module BrazilianUtils
         'trilhões',
         'quadrilhões'
       ]
-      
-      # Break number into groups of 3 digits
+
+      # Break number into groups of 3 digits, lowest order first
+      # (groups[0] is units-hundreds, groups[1] is thousands, ...)
       groups = []
       temp = number
       while temp > 0
         groups << temp % 1000
         temp /= 1000
       end
-      
-      result = []
+
+      parts = []
       groups.each_with_index do |group, index|
         next if group.zero?
-        
+
         group_text = convert_group(group)
         scale_name = group == 1 ? scales[index] : scales_plural[index]
-        
-        if scale_name.empty?
-          result << group_text
-        elsif index == 1 # "mil" doesn't need number before if it's exactly 1000
-          if group == 1
-            result << scale_name
-          else
-            result << "#{group_text} #{scale_name}"
-          end
-        else
-          result << "#{group_text} #{scale_name}"
-        end
-      end
-      
-      # Join with "e" where appropriate
-      if result.length > 1
-        last = result.pop
-        result_text = result.reverse.join(', ')
-        
-        # Check if we need "e" before the last part
-        if number % 1000 < 100 && number % 1000 > 0
-          "#{result_text} e #{last}"
-        else
-          "#{result_text}, #{last}"
-        end
-      else
-        result.first || 'zero'
+
+        parts << if scale_name.empty?
+                   group_text
+                 elsif index == 1 && group == 1 # "mil" doesn't need "um" before it
+                   scale_name
+                 else
+                   "#{group_text} #{scale_name}"
+                 end
       end
+
+      # parts was built lowest-order group first; the spoken form reads
+      # highest order first (e.g. "mil duzentos e trinta e quatro", not
+      # "duzentos e trinta e quatro, mil").
+      parts.reverse!
+      return parts.first if parts.length == 1
+
+      # The lowest-order non-zero group (spoken last) gets an "e" in front
+      # when it reads as a single small/round term: below 100, or an exact
+      # multiple of 100 (e.g. "mil e quatrocentos", "mil e um"); otherwise
+      # groups are simply concatenated with a space, no comma
+      # (Manual de Redação da Presidência: "mil duzentos e cinquenta reais").
+      final_group = groups.find { |g| !g.zero? }
+      last = parts.pop
+      separator = (final_group < 100 || (final_group % 100).zero?) ? ' e ' : ' '
+      "#{parts.join(' ')}#{separator}#{last}"
     end
 
     # Converts a group of 3 digits (0-999) to words.

data/lib/brazilian-utils/date-utils.rb

@@ -38,6 +38,13 @@ module BrazilianUtils
       [12, 25] => 'Natal'
     }.freeze
 
+    # Lei 14.759/2023 made November 20th (Dia Nacional de Zumbi e da
+    # Consciência Negra) a national holiday starting in 2024; before that it
+    # was only a holiday in the states/cities that already had their own law
+    # for it (some of which are still listed in STATE_HOLIDAYS below).
+    NATIONAL_CONSCIENCIA_NEGRA_MONTH_DAY = [11, 20].freeze
+    NATIONAL_CONSCIENCIA_NEGRA_EFFECTIVE_YEAR = 2024
+
     # State-specific holidays (fixed dates)
     STATE_HOLIDAYS = {
       'AC' => { [1, 23] => 'Dia do Evangélico', [6, 15] => 'Aniversário do Acre', [9, 5] => 'Dia da Amazônia', [11, 17] => 'Assinatura do Tratado de Petrópolis' },
@@ -112,6 +119,10 @@ module BrazilianUtils
       # Check national holidays
       return true if NATIONAL_HOLIDAYS.key?(month_day)
 
+      if month_day == NATIONAL_CONSCIENCIA_NEGRA_MONTH_DAY && date.year >= NATIONAL_CONSCIENCIA_NEGRA_EFFECTIVE_YEAR
+        return true
+      end
+
       # Check state holidays if UF is provided
       if uf
         state_uf = uf.to_s.upcase
@@ -138,6 +149,7 @@ module BrazilianUtils
     #   convert_date_to_text("15/03/2024")  #=> "Quinze de março de dois mil e vinte e quatro"
     #   convert_date_to_text("invalid")     #=> nil
     def self.convert_date_to_text(date)
+      return nil unless date.is_a?(String)
       return nil unless DATE_REGEX.match?(date)
 
       begin

data/lib/brazilian-utils/email-utils.rb

@@ -1,14 +1,25 @@
 module BrazilianUtils
   module EmailUtils
-    # Email validation pattern based on RFC 5322
-    # This pattern validates:
-    # - Email must not start with a dot
-    # - Local part (before @): alphanumeric, dots, underscores, percent, plus, minus
-    # - @ symbol required
-    # - Domain part: alphanumeric, dots, hyphens
-    # - Dot separator required
-    # - TLD: at least 2 alphabetic characters
-    EMAIL_PATTERN = /\A(?![.])[a-zA-Z0-9._%+-]+@[a-zA-Z0-9.-]+\.[a-zA-Z]{2,}\z/.freeze
+    # Email validation pattern based on RFC 5322/RFC 1035.
+    #
+    # This is stricter than brutils/python's reference regex
+    # (`^(?![.])[a-zA-Z0-9._%+-]+@[a-zA-Z0-9.-]+\.[a-zA-Z]{2,}$`), which lets
+    # through addresses with a leading/trailing/doubled dot in the local
+    # part, or a domain label starting/ending with a hyphen. Each dot-joined
+    # segment is validated on its own:
+    # - Local part: one or more non-empty segments (letters, digits,
+    #   `._%+-`) joined by single dots - no leading/trailing/consecutive dot
+    # - Domain labels: alphanumeric, may contain internal hyphens, but must
+    #   not start or end with one (RFC 1035 "preferred name syntax")
+    # - TLD: at least 2 letters, no digits or hyphens
+    EMAIL_PATTERN = %r{
+      \A
+      [a-zA-Z0-9_%+-]+ (?: \. [a-zA-Z0-9_%+-]+ )*                # local part
+      @
+      (?: [a-zA-Z0-9] (?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])? \. )+   # domain labels
+      [a-zA-Z]{2,63}                                             # TLD
+      \z
+    }x.freeze
 
     # Checks if a string corresponds to a valid email address.
     #

data/lib/brazilian-utils/legal-nature-utils.rb

@@ -39,7 +39,7 @@ module BrazilianUtils
       '2046' => 'Sociedade Anônima Aberta',
       '2054' => 'Sociedade Anônima Fechada',
       '2062' => 'Sociedade Empresária Limitada',
-      '2070' => 'Sociedade Empresária em Nome Coletivo',
+      '2076' => 'Sociedade Empresária em Nome Coletivo',
       '2089' => 'Sociedade Empresária em Comandita Simples',
       '2097' => 'Sociedade Empresária em Comandita por Ações',
       '2100' => 'Sociedade Mercantil de Capital e Indústria (extinta pelo NCC/2002)',
@@ -177,7 +177,7 @@ module BrazilianUtils
     #   #=> "Sociedade Empresária Limitada"
     #
     #   all_codes.size
-    #   #=> 64 (total number of codes in the official table)
+    #   #=> 60 (total number of codes in the official table)
     def self.list_all
       LEGAL_NATURE.dup
     end

data/lib/brazilian-utils/legal-process-utils.rb

@@ -177,7 +177,9 @@ module BrazilianUtils
 
     # Calculates the checksum (verification digits) for a legal process ID.
     #
-    # The checksum is calculated as: 97 - ((basenum * 100) % 97), padded to 2 digits.
+    # The checksum is calculated as: 98 - ((basenum * 100) % 97), padded to 2 digits.
+    # This is the ISO 7064 MOD 97-10 check digit used by CNJ Resolution 65/2008,
+    # art. 1º, § 2º.
     #
     # @param basenum [Integer] The base number for checksum calculation
     #   (without the verification digits)
@@ -186,7 +188,7 @@ module BrazilianUtils
     #
     # @private
     def self.checksum(basenum)
-      result = 97 - ((basenum * 100) % 97)
+      result = 98 - ((basenum * 100) % 97)
       result.to_s.rjust(2, '0')
     end
 

data/lib/brazilian-utils/license-plate-utils.rb

@@ -36,9 +36,11 @@ module BrazilianUtils
     #   convert_to_mercosul("ABC4*67")
     #   #=> nil
     def self.convert_to_mercosul(license_plate)
-      return nil unless valid_old_format?(license_plate)
+      return nil unless license_plate.is_a?(String)
 
       clean = remove_symbols(license_plate).upcase
+      return nil unless valid_old_format?(clean)
+
       chars = clean.chars
       
       # Convert the 5th character (index 4) - the first digit after the letters
@@ -223,6 +225,8 @@ module BrazilianUtils
     #   generate('invalid')
     #   #=> nil
     def self.generate(format = 'LLLNLNN')
+      return nil unless format.is_a?(String)
+
       format_upper = format.upcase
 
       return nil unless ['LLLNLNN', 'LLLNNNN'].include?(format_upper)

data/lib/brazilian-utils/phone-utils.rb

@@ -181,9 +181,17 @@ module BrazilianUtils
     def self.remove_international_dialing_code(phone_number)
       return '' unless phone_number.is_a?(String)
 
-      # Check if pattern matches and length (without spaces) is > 11
-      if INTERNATIONAL_CODE_PATTERN.match?(phone_number) && phone_number.gsub(' ', '').length > 11
-        phone_number.sub('55', '')
+      # Only touch a "clean" digit string (with an optional leading '+') that
+      # is longer than 11 digits; anything with spaces/hyphens/etc. is left
+      # alone rather than partially stripped.
+      digits_part = phone_number.sub(/\A\+/, '')
+
+      if INTERNATIONAL_CODE_PATTERN.match?(phone_number) &&
+         digits_part.match?(/\A\d+\z/) && digits_part.length > 11
+        # Anchor to the start so only the leading "+55"/"55" is stripped
+        # (a plain #sub would also drop the '+' and could hit an unrelated
+        # "55" further into the number, e.g. an RS-state "55" DDD).
+        phone_number.sub(/\A\+?55/, '')
       else
         phone_number
       end

data/lib/brazilian-utils/voter-id-utils.rb

@@ -13,13 +13,11 @@ module BrazilianUtils
       'AP' => '25', 'RR' => '26', 'TO' => '27', 'ZZ' => '28'
     }.freeze
 
-    module_function
-
     # Check if a Brazilian voter ID number is valid.
     #
     # @param voter_id [String] The voter ID to validate
     # @return [Boolean] true if valid, false otherwise
-    def is_valid_voter_id(voter_id)
+    def self.is_valid_voter_id(voter_id)
       # Ensure voter_id is a string with only digits and valid length
       return false unless voter_id.is_a?(String)
       return false unless voter_id.match?(/^\d+$/)
@@ -44,27 +42,37 @@ module BrazilianUtils
       true
     end
 
-    # Alias for is_valid_voter_id
-    alias valid_voter_id? is_valid_voter_id
+    class << self
+      # Alias for is_valid_voter_id
+      alias valid_voter_id? is_valid_voter_id
+    end
 
     # Format a voter ID for display with visual spaces.
     #
     # @param voter_id [String] The voter ID to format
     # @return [String, nil] Formatted voter ID or nil if invalid
-    def format_voter_id(voter_id)
+    def self.format_voter_id(voter_id)
       return nil unless is_valid_voter_id(voter_id)
 
-      "#{voter_id[0..3]} #{voter_id[4..7]} #{voter_id[8..9]} #{voter_id[10..11]}"
+      # The 13-digit SP/MG variant has an extra sequential digit; grouping it
+      # as 4+4+2+2 (like the 12-digit case) silently drops the last digit.
+      if voter_id.length == 13
+        "#{voter_id[0..3]} #{voter_id[4..7]} #{voter_id[8]} #{voter_id[9..10]} #{voter_id[11..12]}"
+      else
+        "#{voter_id[0..3]} #{voter_id[4..7]} #{voter_id[8..9]} #{voter_id[10..11]}"
+      end
     end
 
-    # Alias for format_voter_id
-    alias format format_voter_id
+    class << self
+      # Alias for format_voter_id
+      alias format format_voter_id
+    end
 
     # Generate a random valid Brazilian voter ID.
     #
     # @param federative_union [String] The UF code (e.g., "SP", "MG", "ZZ")
     # @return [String, nil] A valid voter ID or nil if UF is invalid
-    def generate(federative_union = 'ZZ')
+    def self.generate(federative_union = 'ZZ')
       federative_union = federative_union.upcase
       return nil unless UF_CODES.key?(federative_union)
 
@@ -72,7 +80,9 @@ module BrazilianUtils
       return nil unless is_federative_union_valid?(uf_number)
 
       # Generate random 8-digit sequential number
-      sequential_number = format('%08d', rand(0..99_999_999))
+      # (uses rjust, not Kernel#format, since `format` is aliased to
+      # format_voter_id on this module's singleton class below)
+      sequential_number = rand(0..99_999_999).to_s.rjust(8, '0')
 
       # Calculate verification digits
       vd1 = calculate_vd1(sequential_number, uf_number)
@@ -81,11 +91,12 @@ module BrazilianUtils
       "#{sequential_number}#{uf_number}#{vd1}#{vd2}"
     end
 
-    private
+    # PRIVATE METHODS
+    #################
 
     # Check if the length of the voter ID is valid.
     # Typically 12 digits, but can be 13 for SP and MG (edge case).
-    def is_length_valid?(voter_id)
+    def self.is_length_valid?(voter_id)
       return true if voter_id.length == 12
 
       # Edge case: SP and MG can have 13 digits
@@ -94,22 +105,22 @@ module BrazilianUtils
     end
 
     # Extract the sequential number (first 8 digits).
-    def get_sequential_number(voter_id)
+    def self.get_sequential_number(voter_id)
       voter_id[0..7]
     end
 
     # Extract the federative union (2 digits before last 2 digits).
-    def get_federative_union(voter_id)
+    def self.get_federative_union(voter_id)
       voter_id[-4..-3]
     end
 
     # Extract the verifying digits (last 2 digits).
-    def get_verifying_digits(voter_id)
+    def self.get_verifying_digits(voter_id)
       voter_id[-2..-1]
     end
 
     # Check if the federative union is valid (between '01' and '28').
-    def is_federative_union_valid?(federative_union)
+    def self.is_federative_union_valid?(federative_union)
       num = federative_union.to_i
       num >= 1 && num <= 28
     end
@@ -119,7 +130,7 @@ module BrazilianUtils
     # @param sequential_number [String] First 8 digits
     # @param federative_union [String] 2-digit UF code
     # @return [Integer] The first verification digit
-    def calculate_vd1(sequential_number, federative_union)
+    def self.calculate_vd1(sequential_number, federative_union)
       # Weights: 2, 3, 4, 5, 6, 7, 8, 9
       weights = (2..9).to_a
 
@@ -144,7 +155,7 @@ module BrazilianUtils
     # @param federative_union [String] 2-digit UF code
     # @param vd1 [Integer] First verification digit
     # @return [Integer] The second verification digit
-    def calculate_vd2(federative_union, vd1)
+    def self.calculate_vd2(federative_union, vd1)
       # Weights: 7, 8, 9
       sum = (federative_union[0].to_i * 7) +
             (federative_union[1].to_i * 8) +
@@ -161,5 +172,9 @@ module BrazilianUtils
 
       vd2
     end
+
+    private_class_method :is_length_valid?, :get_sequential_number, :get_federative_union,
+                          :get_verifying_digits, :is_federative_union_valid?, :calculate_vd1,
+                          :calculate_vd2
   end
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: br-utils
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.1.1
 platform: ruby
 authors:
 - Alex Rocha
@@ -10,6 +10,20 @@ bindir: bin
 cert_chain: []
 date: 1980-01-02 00:00:00.000000000 Z
 dependencies:
+- !ruby/object:Gem::Dependency
+  name: bigdecimal
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: bundler
   requirement: !ruby/object:Gem::Requirement
@@ -61,9 +75,9 @@ executables: []
 extensions: []
 extra_rdoc_files: []
 files:
+- ".github/workflows/ci.yml"
 - ".gitignore"
 - ".rspec"
-- ".travis.yml"
 - Gemfile
 - LICENSE.txt
 - README.md

data/.travis.yml

@@ -1,5 +0,0 @@
-sudo: false
-language: ruby
-rvm:
-  - 2.3.0
-before_install: gem install bundler -v 1.12.5