wordplay 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 2805071a9f07e75892b75599c51c7e92ac7d4b24
+  data.tar.gz: 8d165947bf1fe11d869b689e716520740e0b9656
+SHA512:
+  metadata.gz: eff6179d2cec65fbcfd95dadcb14f54a7c1e0064ccfc15fa5d513b9c13b7861bc0f8c41ae7221d65b7d76429eeaa1cfaf4836ad8187e8ad30c7d9e3e3d4734d0
+  data.tar.gz: fd786a30697dd0506cf66be98be62425390134945897304c37169dcdd93735bab0a2a029175ef5ff218b159ece142bee51c45ce247e45c9c548cdeeb5236ddf3

data/Gemfile

@@ -0,0 +1,3 @@
+source "https://www.rubygems.org"
+
+gemspec

data/LICENSE.txt

@@ -0,0 +1,22 @@
+The following license applies to all files which aren't used verbatim from
+Rails:
+
+Copyright (c) 2015 Michael Boone
+
+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,32 @@
+# Wordplay
+
+Some interesting methods to use on words. Currently can match words with their
+letters in alphabetical or reverse alphabetical order.
+
+The idea came from a story about a boy, who, when asked to put words in
+alphabetical order, ordered the letters of the word instead of the words
+themselves. I was intrigued by "fox" which was already sorted in that manner.
+
+## Example:
+
+```ruby
+require "wordplay"
+
+word = Wordplay.new("fox")
+word.ordered_letters? # true
+
+word = Wordplay.new("loop")
+word.reverse_ordered_letters # pool
+```
+
+There is also an example which loops through `/usr/share/dict/words` to find
+words with their letters sorted. I think my favorite is *bijoux*.
+
+# Contributing
+
+If you have an interesting word method or a bugfix, please submit a pull
+request.
+
+# Contact
+
+[@boonedocks](https://twitter.com/boonedocks) on Twitter

data/Rakefile

@@ -0,0 +1,7 @@
+require "rspec/core/rake_task"
+
+desc "Run the tests by default"
+task default: :spec
+
+desc "Run the tests"
+RSpec::Core::RakeTask.new :spec

data/examples/dictionary_scan.rb

@@ -0,0 +1,30 @@
+require_relative '../lib/wordplay'
+
+SOURCE = '/usr/share/dict/words'
+
+raise "Dictionary not available!" unless File.exists?(SOURCE)
+
+match_count   = 0
+full_count    = 0
+longest_words = [""]
+
+# Loop the source file for words to check
+File.foreach(SOURCE, "\n") do |word|
+  word.strip! # remove the linefeeds
+
+  if word.size > 1 # exclude one-character words
+    if Wordplay.new(word).ordered_letters?
+      puts word
+      match_count += 1
+      longest_words << word if word.size >= longest_words.last.size
+    end
+
+    full_count += 1
+  end
+end
+
+longest = longest_words.last.size
+longest_words.delete_if { |w| w.size < longest }
+
+puts "\nMatching words: #{match_count} out of #{full_count}"
+puts "Longest words: #{longest_words.join(', ')}"

data/lib/wordplay/version.rb

@@ -0,0 +1,3 @@
+class Wordplay
+  VERSION = "0.0.1"
+end

data/lib/wordplay.rb

@@ -0,0 +1,46 @@
+class Wordplay
+  # Public: creates a class instance
+  # word - a String
+  def initialize(word)
+    @word = word.downcase # always work with lowercase
+  end
+
+  # Public: determines if the component letters of the provided word are
+  # in alphabetical order.
+  # E.g.: "fox" has its letters in order, "car" does not.
+  #
+  # Returns a Boolean
+  def ordered_letters?
+    # we could just run `@word == ordered_letters` but this is faster
+    1.upto(@word.length - 1) do |i|
+      return false unless @word[i] >= @word[i - 1]
+    end
+    true
+  end
+
+  # Public: determines if the component letters of the provided word are
+  # in reverse alphabetical order.
+  # E.g.: "pig" has its letters in reverse order, "car" does not.
+  #
+  # Returns a Boolean
+  def reverse_ordered_letters?
+    1.upto(@word.length - 1) do |i|
+      return false unless @word[i] <= @word[i - 1]
+    end
+    true
+  end
+
+  # Public: orders the letters of a word in alphabetical order.
+  #
+  # Returns a String
+  def ordered_letters
+    @word.chars.sort.join
+  end
+
+  # Public: orders the letters of a word in reverse alphabetical order.
+  #
+  # Returns a String
+  def reverse_ordered_letters
+    ordered_letters.reverse
+  end
+end

data/spec/wordplay_spec.rb

@@ -0,0 +1,46 @@
+require "rspec"
+require "wordplay"
+
+describe Wordplay do
+  describe "#ordered_letters?" do
+    it "returns true for words with ordered letters" do
+      %w(a ab bijoux fox nosy tux).each do |word|
+        expect(described_class.new(word).ordered_letters?).to eq(true)
+      end
+    end
+
+    it "returns false for words without ordered letters" do
+      %w(bad car foxhole zigzag).each do |word|
+        expect(described_class.new(word).ordered_letters?).to eq(false)
+      end
+    end
+  end
+
+  describe "#reverse_ordered_letters?" do
+    it "returns true for words with reverse ordered letters" do
+      %w(a fed solid toffee).each do |word|
+        expect(described_class.new(word).reverse_ordered_letters?).to eq(true)
+      end
+    end
+
+    it "returns false for words without reverse ordered letters" do
+      %w(bad car foxhole zigzag).each do |word|
+        expect(described_class.new(word).ordered_letters?).to eq(false)
+      end
+    end
+  end
+
+  describe "#ordered_letters" do
+    it "sorts the letters" do
+      expect(described_class.new("complicated").ordered_letters)
+        .to eq("accdeilmopt")
+    end
+  end
+
+  describe "#reverse_ordered_letters" do
+    it "sorts the letters in reverse" do
+      expect(described_class.new("complicated").reverse_ordered_letters)
+        .to eq("tpomliedcca")
+    end
+  end
+end

metadata

@@ -0,0 +1,71 @@
+--- !ruby/object:Gem::Specification
+name: wordplay
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Mike Boone
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-03-16 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.2'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 3.2.0
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.2'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 3.2.0
+description: Some interesting methods to use on words.
+email: mike@boonedocks.net
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- examples/dictionary_scan.rb
+- lib/wordplay.rb
+- lib/wordplay/version.rb
+- spec/wordplay_spec.rb
+homepage: https://github.com/boone/wordplay
+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.4.5
+signing_key: 
+specification_version: 4
+summary: Methods for words.
+test_files: []