shuffle 0.1.0

data/LICENSE

@@ -0,0 +1,20 @@
+Copyright (c) 2012 Evan Senter
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1 @@
+http://www.youtube.com/watch?v=xFZYJIwfUbo

data/lib/shuffle.rb

@@ -0,0 +1,103 @@
+require "rand"
+
+class Shuffle
+  PREFIXES = {
+    "mono" => 1,
+    "di"   => 2,
+    "tri"  => 3,
+    "quad" => 4
+  }
+  
+  attr_reader :sequence, :rejoin
+  
+  def initialize(sequence)
+    @sequence = if sequence.is_a?(String) && sequence !~ /\s/
+      @rejoin = true
+      sequence.split(//)
+    else
+      sequence
+    end
+  end
+  
+  def shuffle(size)
+    shuffled_sequence = shuffler(size)
+    
+    rejoin ? shuffled_sequence.join : shuffled_sequence
+  end
+  
+  def validate(size)
+    frequency(sequence.each_cons(size)) == frequency(shuffler(size).each_cons(size))
+  end
+  
+  private
+  
+  def shuffler(size)
+    if size == 1
+      sequence.shuffle
+    else
+      edge_hash = shuffle!(edge_list(size))
+      shuffle!(edge_hash) until connected?(last_edge_graph(edge_hash, size), size)
+      construct_from(edge_hash, size)
+    end
+  end
+  
+  def start(size)
+    sequence[0, size - 1]
+  end
+  
+  def terminal(size)
+    sequence[(-(size - 1))..-1]
+  end
+  
+  def edge_list(size)
+    sequence.each_cons(size).inject(Hash.new { |hash, key| hash[key] = [] }) do |hash, subsequence|
+      hash.tap { hash[subsequence[0..-2]] << subsequence }
+    end
+  end
+  
+  def shuffle!(edge_hash)
+    edge_hash.tap { edge_hash.values.map(&:shuffle!) }
+  end
+  
+  def last_edge_graph(edge_hash, size)
+    edge_hash.reject { |token, edges| token == terminal(size) }.values.map(&:last)
+  end
+  
+  def connected?(edges, size)
+    terminal          = terminal(size)
+    vertex_terminates = edges.map { |edge| edge[0..-2] }.inject({}) { |hash, v| hash.tap { hash[v] = false } }
+    queue             = edges.select { |edge| edge[1..-1] == terminal }
+  
+    until queue.empty?
+      edge = queue.pop
+      
+      if vertex_terminates[edge[0..-2]] = vertex_terminates[edge[1..-1]] || edge[1..-1] == terminal
+        queue.push(*edges.select { |queueable_edge| queueable_edge[1..-1] == edge[0..-2] })
+      end
+    end
+  
+    vertex_terminates.values.all?
+  end
+  
+  def construct_from(edge_hash, size)
+    shuffled_sequence = edge_hash[start(size)].shift
+    
+    until edge_hash.values.flatten.empty?
+      shuffled_sequence.concat(edge_hash[shuffled_sequence[-(size - 1)..-1]].shift[-1, 1])
+    end
+    
+    shuffled_sequence
+  end
+  
+  def frequency(array)
+    array.inject(Hash.new { |hash, key| hash[key] = 0 }) { |hash, token| hash.tap { hash[token] += 1 } }
+  end
+  
+  def method_missing(name, *args, &block)
+    if size = PREFIXES[name.to_s.match(/^(\w+)shuffle$/)[1]]
+      shuffle(size.to_i)
+    else
+      super
+    end
+  end
+end

metadata

@@ -0,0 +1,64 @@
+--- !ruby/object:Gem::Specification
+name: shuffle
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+  prerelease: 
+platform: ruby
+authors:
+- Evan Senter
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2012-08-15 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rand
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 0.9.1
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 0.9.1
+description: Simple method to shuffle list while preserving n-mer frequency.
+email: evansenter@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/shuffle.rb
+- LICENSE
+- README.md
+homepage: http://rubygems.org/gems/shuffle
+licenses: []
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.24
+signing_key: 
+specification_version: 3
+summary: n-mer shuffling.
+test_files: []
+has_rdoc: