letter_press_is_not_as_good_as_boggle 1.0.1 → 1.0.2

data/Readme.md

@@ -2,8 +2,10 @@ LetterPressIsNotAsGoodAsBoggle
 ==============================
 
 There's this game called LetterPress, it's sort of like Boggle, but less awesome.
-It's only for the iPhone, but I have a Chocolate 1, so I can't play.
-So... screw your fun!
+But that doesn't mean that _you_ can't be awesome!
+
+![screenshot](https://raw.github.com/JoshCheek/letter_press_is_not_as_good_as_boggle/master/data/screenshot.jpg)
+
 
 Install
 =======
@@ -23,7 +25,7 @@ LetterPressIsNotAsGoodAsBoggle do
            x z u g o
            b i o g f]
 
-  guesses %w[groupie
+  guessed %w[groupie
              hogger]
 
   # get the list of all known words that can be made on the board
@@ -35,7 +37,7 @@ end
 WTF Public License
 ==================
 
-    WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+    DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
                        Version 2, December 2004
 
     Copyright (C) 2012 Josh Cheek <josh.cheek@gmail.com>

data/example.rb

@@ -1,28 +1,16 @@
 require 'letter_press_is_not_as_good_as_boggle'
 
 words = LetterPressIsNotAsGoodAsBoggle do
-  board %w[o y c z i
-           s e m x k
-           z i s v s
-           w e a v o
-           d d f k a]
+  board %w[n x g k o e e s i s v a j f e m l r g f z i a j b]
 
-  guesses %w[kamikaze
-             mocked
-             disavowed
-             kiddies
-             mocked
-             miscoded
-             wifes
-             coveys
-             amazed
-             admixes]
+  guessed %w[averages vagaries lovemaking maligners remixing reimagines generalissimo fragile]
 end
 
 def score(word, targets)
   (targets - word.chars.to_a).size
 end
 
-words.sort_by { |word| [-score(word, %w[z]),
-                        word.size] }
+preferred_chars = %w[g f]
+
+words.sort_by { |word| [-score(word, preferred_chars), word.size] }
      .each    { |word| puts word }

data/lib/letter_press_is_not_as_good_as_boggle.rb

@@ -13,7 +13,7 @@ class LetterPressIsNotAsGoodAsBoggle
   end
 
   def initialize(all_words=LetterPressIsNotAsGoodAsBoggle.all_words, &definition)
-    @guesses = []
+    @guessed = []
     self.searcher = WordList::Searcher.new WordList.new all_words
     instance_eval &definition
   end
@@ -22,9 +22,10 @@ class LetterPressIsNotAsGoodAsBoggle
     self.chars = chars
   end
 
-  def guesses(guesses=[])
-    @guesses = guesses
+  def guessed(guessed=[])
+    @guessed = guessed
   end
+  alias guesses guessed # to maintain backwards compatibility
 
   def words
     @words ||= begin
@@ -32,7 +33,7 @@ class LetterPressIsNotAsGoodAsBoggle
       board_traverser.each_with_recur do |word, char, recurser|
         next unless searcher.has_child? char
         searcher.down_to char do
-          words << word if searcher.on_word? && !@guesses.include?(word)
+          words << word if searcher.on_word? && !@guessed.include?(word)
           recurser.call
         end
       end

data/lib/letter_press_is_not_as_good_as_boggle/version.rb

@@ -1,3 +1,3 @@
 class LetterPressIsNotAsGoodAsBoggle
-  VERSION = '1.0.1'
+  VERSION = '1.0.2'
 end

data/spec/acceptance_spec.rb

@@ -2,14 +2,14 @@ require 'spec_helper'
 
 describe LetterPressIsNotAsGoodAsBoggle do
   specify 'words are returned sorted by length asc and do not include duplicates or previous guesses' do
-    unguessed   = %w[abc ab dac]
-    guessed     = %w[adc dab]
-    nonmatching = %w[x nek]
-    all_words   = unguessed + guessed + nonmatching
+    unguessed_words   = %w[abc ab dac]
+    guessed_words     = %w[adc dab]
+    nonmatching_words = %w[x nek]
+    all_words         = unguessed_words + guessed_words + nonmatching_words
 
     letter_press = LetterPressIsNotAsGoodAsBoggle.new all_words do
       board   %w[a b c d a]
-      guesses guessed
+      guessed guessed_words
     end
 
     letter_press.words.should == %w[ab abc dac]

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: letter_press_is_not_as_good_as_boggle
 version: !ruby/object:Gem::Version
-  version: 1.0.1
+  version: 1.0.2
   prerelease: 
 platform: ruby
 authors:
@@ -9,11 +9,11 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-12-25 00:00:00.000000000 Z
+date: 2013-01-15 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rspec
-  requirement: &70332409008080 !ruby/object:Gem::Requirement
+  requirement: &70349710586500 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ~>
@@ -21,10 +21,10 @@ dependencies:
         version: '2.4'
   type: :development
   prerelease: false
-  version_requirements: *70332409008080
+  version_requirements: *70349710586500
 - !ruby/object:Gem::Dependency
   name: simplecov
-  requirement: &70332409007260 !ruby/object:Gem::Requirement
+  requirement: &70349710586000 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ~>
@@ -32,7 +32,7 @@ dependencies:
         version: 0.7.1
   type: :development
   prerelease: false
-  version_requirements: *70332409007260
+  version_requirements: *70349710586000
 description: Find all known words for a letterpress board (iPhone 5 game that is like
   boggle, but worse)
 email:
@@ -44,6 +44,7 @@ files:
 - .gitignore
 - Gemfile
 - Readme.md
+- data/screenshot.jpg
 - data/word_list
 - example.rb
 - letter_press_is_not_as_good_as_boggle.gemspec