alphabetify 0.0.2

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: f945579ca579d011d6db680716a94ce28724e7d0
+  data.tar.gz: 5f0b9186f00f6d71f92492da302b4fc724c2fc6c
+SHA512:
+  metadata.gz: 6fc8d04bd54edbea30d623bc8161fca935490c81ed56cc04b14b4a2f51c4b10f05b5509cc5796bf05143698352b4fc566f6c91bd7c785649d1f20d420f3f1d5b
+  data.tar.gz: e7985f20ac9ebbdd21b1880eb4e95ab443c715adcc22e0ace5adbc25b663cfc07b1f09743ec51aab36bb947f40e1251e3c73d194c38cc311912f63b5b6647af5

data/lib/alphabetify.rb

@@ -0,0 +1,63 @@
+class Alphabetify
+  ###############################################################################################################
+  #
+  # Alphabetify.rb
+  # Generates sequential alphabetic hashes
+  # 
+  # Author: Todd Resudek - toddresudek@gmail.com | github: sprsmpl
+  # 
+  # Description:
+  # Taking an existing alphabetic hash (of any length), will return the next hash in sequence.
+  # If all characters in hash are rolled over, will append a new char (increase the length by 1.)
+  # eg. 'ZZZZ' -> 'AAAAA'
+  # eg. 'AAAZ' -> 'AABA'
+  #
+  # Seed the first hash - whatever length you'd like to start with - to begin.
+  #
+  # Usage: Alphabetify.generate_hash('THELASTHASHUSED')
+  #
+  ###############################################################################################################  
+  HASH_CHARS = ('A'..'Z').to_a
+  
+  def self.generate_hash(str)
+    complete = false
+    new_hash = ''
+    str.chars.reverse.each do |ch|
+      #check this char for a rollover, if it does not need a rollver, exit
+      unless complete
+        #replace this char with the next char
+        next_char, rollover = get_next_char(ch)
+        new_hash << next_char
+      else
+        #keep this char
+        new_hash << ch
+      end
+      complete = true unless rollover
+    end
+    #need to add another character to the end if all letters rollover
+    if !complete
+      new_hash.reverse! << HASH_CHARS.first
+    end
+    new_hash.reverse
+  end
+  
+  private
+  
+  def self.get_next_char(char)
+    unless char == HASH_CHARS.last
+      return [char.next,false]
+    else
+      return [HASH_CHARS.first,true]
+    end     
+  end
+  
+  def self.leading_chars(current_hash)
+    last_char = current_hash.slice!(-1)    
+    [current_hash,last_char]
+  end
+  
+  def self.rollover
+    new_last_char, needs_rollover = next_char(last_char)
+  end
+  
+end

metadata

@@ -0,0 +1,49 @@
+--- !ruby/object:Gem::Specification
+name: alphabetify
+version: !ruby/object:Gem::Version
+  version: 0.0.2
+platform: ruby
+authors:
+- Todd Resudek
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-11-17 00:00:00.000000000 Z
+dependencies: []
+description: |-
+  Taking an existing alphabetic hash (of any length), will return the next hash in sequence.
+                    If all characters in hash are rolled over, will append a new char (increase the length by 1.)
+                    eg. 'ZZZZ' -> 'AAAAA'
+                    eg. 'AAAZ' -> 'AABA'
+email: toddresudek@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/alphabetify.rb
+homepage: http://rubygems.org/gems/alphabetify
+licenses:
+- Apache-2.0
+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.4.4
+signing_key: 
+specification_version: 4
+summary: Create unique alphabetical hashes
+test_files: []
+has_rdoc: