luhnmod10 1.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: bdb5e3f3b12dff7f6e25beeb204d1f71358aed7f
+  data.tar.gz: dd2727953d8d92121d461e86aec8217c7d79c405
+SHA512:
+  metadata.gz: 8d073d9107765f0f30d12e36b088851d53231c57706e5348dbcefc066139a7b1c6aaebe7de984aa6f132a6a28d722c6bcab4f05dc601e75cc2f4f2c13e11a22c
+  data.tar.gz: 08767c2d54ca5d34195d1d72c745274f1bb5dea0628488863fe3873dcdcd94671acf61df340c82d1db6768648dc6512a911ec5ce8f7667b02c0738631912507c

data/lib/luhnmod10.rb

@@ -0,0 +1,25 @@
+module Luhnmod10
+  def self.valid?(number)
+    checksum = 0
+
+    number_len = number.length
+
+    i = number_len - 1
+    while i >= 0 do
+      n = number[i].to_i
+      checksum += n
+      i -= 2
+    end
+
+    i = number_len - 2
+    while i >= 0 do
+      n = number[i].to_i
+      n *= 2
+      n -= 9 if n > 9
+      checksum += n
+      i -= 2
+    end
+
+    checksum%10 == 0
+  end
+end

metadata

@@ -0,0 +1,44 @@
+--- !ruby/object:Gem::Specification
+name: luhnmod10
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+platform: ruby
+authors:
+- Leigh McCulloch
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2016-07-26 00:00:00.000000000 Z
+dependencies: []
+description: A simple fast implementation of the Luhn algorithm.
+email: 
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/luhnmod10.rb
+homepage: 
+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: []
+rubyforge_project: 
+rubygems_version: 2.5.1
+signing_key: 
+specification_version: 4
+summary: A simple fast implementation of the Luhn algorithm.
+test_files: []