ruby-luhn 0.0.2

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: bb4048a369aa49edb7417eae1b80615864a7749bd64ed0101b3da06fa3397644
+  data.tar.gz: 005da7adc844ce4e466b80c3df64e977ca1f818bdded4c1d22e9b8b7d0c76dfa
+SHA512:
+  metadata.gz: 1c2d4edf5a9acd49393980c627d8b00487fb3eb3a7c7ab3908a4eb548fb8ea8c9cb1a5908fbf984e6491b7470bf11ca22d2c8755d1b5d0e01c3a4a4edb7c4fd5
+  data.tar.gz: c2111f39f371c10204ad0e243a97003923a6e6e5cd063e0bf61c871a707fa387468967e245c3e8bbee5774de1789181465ac679057ed4eb316db0f4ec18dfdc4

data/lib/luhn.rb

@@ -0,0 +1,55 @@
+# frozen_string_literal: true
+
+# Implements the Luhn algorithm mod n to generate checksums
+class Luhn
+  class << self
+    # Calculates the checksum of the given number
+    #
+    # @param number [String] the number to calculate the checksum
+    # @param base [Integer] the base used to calculate the checksum
+    # @return [String] the checksum of the given number
+    # @raise [ArgumentError] if the number is not valid in the chosen base
+    def generate(number, base: 10)
+      total = 0
+
+      characters = number.split('')
+      characters.reverse.each_with_index do |character, index|
+        value = parse(character, base)
+
+        # Duplicates only digits on an even position
+        value *= 2 if index.even?
+
+        # Sums digits of number
+        # e.g: if the digit was Z => Z * 2 = 1Y
+        # and we sum 1 + Y = 1 + 34 = 35
+        total += value / base # Sums first digit
+        total += value % base # Sums second digit
+      end
+
+      # Return the value we'd have to sum to the total to have a number divisible by 36
+      (-total % base).to_s(base).upcase
+    end
+
+    # Checks if the last digit of the number is the checksum of the rest
+    #
+    # @param number [String] the number to be checked
+    # @param base [Integer] the base used to calculate the checksum
+    # @return [Boolean] the validity of the checksum
+    # @raise [ArgumentError] if the number is not valid in the chosen base
+    def validate(number, base: 10)
+      number[-1] == generate(number[0...-1], base: base)
+    end
+
+    private
+
+    def parse(digit, base)
+      number = digit.to_i(base)
+
+      if number.zero? && digit != '0'
+        raise ArgumentError, "The number is not a valid base #{base} number"
+      end
+
+      number
+    end
+  end
+end

metadata

@@ -0,0 +1,42 @@
+--- !ruby/object:Gem::Specification
+name: ruby-luhn
+version: !ruby/object:Gem::Version
+  version: 0.0.2
+platform: ruby
+authors:
+- Jorge Leites
+autorequire:
+bindir: bin
+cert_chain: []
+date: 2011-09-29 00:00:00.000000000 Z
+dependencies: []
+description:
+email:
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/luhn.rb
+homepage:
+licenses: []
+metadata: {}
+post_install_message:
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '2.4'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.0.3
+signing_key:
+specification_version: 4
+summary: A lightweight implementation of the Luhn algorithm
+test_files: []