rubyqc 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 9ff877141825f4a8516b956d216de5dcae3a9ae9
+  data.tar.gz: 0284ea73671c159c38a5a8c6249e477159666c1f
+SHA512:
+  metadata.gz: a0e49da081b1af4fc05e43be982395ba6fe0521013589c0e244b148873ab2ba7eb7ca3fecf9515ff6454f75c27b5ef9c14998df181c40659830bf8f0b2979273
+  data.tar.gz: c4427a5669c4c7d9c7085e562c6d4f1d1aa4ef833513ac893f9fbd9d3efdb7beee07bc5da82de126252c39bdd75b593ce2875c30d8dcad1ab9f2ad181cd37290

data/.gitignore

@@ -0,0 +1 @@
+/pkg/

data/.gitmodules

@@ -0,0 +1,3 @@
+[submodule "task"]
+	path = task
+	url = git://github.com/godfat/gemgem.git

data/.travis.yml

@@ -0,0 +1,9 @@
+before_install: 'git submodule update --init'
+script: 'ruby -r bundler/setup -S rake test'
+
+rvm:
+  - 1.9.3
+  - 2.0.0
+  - 2.1.0
+  - rbx
+  - jruby

data/Gemfile

@@ -0,0 +1,11 @@
+
+source 'https://rubygems.org'
+
+gemspec
+
+gem 'rake'
+gem 'bacon'
+
+platform :rbx do
+  gem 'rubysl-singleton' # used in rake
+end

data/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

data/README.md

@@ -0,0 +1,226 @@
+# RubyQC [![Build Status](https://secure.travis-ci.org/godfat/rubyqc.png?branch=master)](http://travis-ci.org/godfat/rubyqc)
+
+by Lin Jen-Shin ([godfat](http://godfat.org))
+
+## LINKS:
+
+* [github](https://github.com/godfat/rubyqc)
+* [rubygems](https://rubygems.org/gems/rubyqc)
+* [rdoc](http://rdoc.info/github/godfat/rubyqc)
+
+## DESCRIPTION:
+
+RubyQC -- A conceptual [QuickCheck][] library for Ruby.
+
+It's not a faithful port since Hsakell is totally different than Ruby.
+However it's still benefit to use some of the ideas behind QuickCheck,
+and we could also use RubyQC for generating arbitrary objects.
+
+[QuickCheck]: http://en.wikipedia.org/wiki/QuickCheck
+
+## WHY?
+
+How do we make sure our programs work as expected?
+Taking it to the extreme, of course we prove it formally.
+We have [Agda][] for Haskell people, or [Coq][] for OCaml people.
+
+However, in most cases we don't really care if they are
+100% correct. Do we care PRNGs are really random
+in games? Some people might care, we don't. Can we
+prove halting problem? Of course not, but we do need
+termination check at times.
+
+For most cases, an army of tests is far good enough.
+Usually we write scenario based tests. We first assume
+things, and then do things, finally verify results. This is
+quite simple, but cannot really cover most of the inputs
+without great effort.
+
+QuickCheck took another approach. Instead of writing
+scenario, we think about what properties do our programs,
+or functions have, giving a range of inputs. Suppose
+we want to test the reverse function, instead of testing
+against a fixed set of lists and verify a fixed set of results,
+we think about what properties does reverse have.
+
+For example, if we reverse and reverse a list, the result
+should be equal to the original list. With QuickCheck, it
+could then generate arbitrary random lists to the property
+function you just wrote, and verify if the property holds.
+By default, it would generate 100 test cases.
+
+This approach would force you think more about the
+precondition and postcondition, eliminating unusual
+corner cases you might never think of, and force you
+think what are the functions we're really writing. We
+could also raise the number of test cases by configuring
+it and raise our level of confidence about correctness.
+
+[Agda]: http://en.wikipedia.org/wiki/Agda_%28programming_language%29
+[Coq]: http://en.wikipedia.org/wiki/Coq
+
+## DESIGN:
+
+* Testing framework agnostic
+* Therefore RubyQC could be treated as an arbitrary object generator library
+* Think about [combinator][]
+* Self hosted (Test RubyQC with RubyQC!)
+
+[combinator]: http://en.wikipedia.org/wiki/Combinator_library
+
+## REQUIREMENTS:
+
+* Tested with MRI (official CRuby) 2.0.0, 2.1.0, Rubinius and JRuby.
+
+## INSTALLATION:
+
+    gem install rubyqc
+
+## SYNOPSIS:
+
+Here's a quick example using [Bacon][]. We check if `Array#sort` has the
+property that the front elements of the result array would be `<=` than
+the rear elements of the result array for all arrays.
+
+``` ruby
+require 'bacon'
+require 'rubyqc'
+
+Bacon.summary_on_exit
+include RubyQC::API
+
+describe Array do
+  describe 'sort' do
+    should 'Any front elements should be <= any rear elements' do
+      check([Fixnum]*100).times(10) do |array|
+        array.sort.each_cons(2).each{ |x, y| x.should <= y }
+      end
+    end
+  end
+end
+```
+
+[Bacon]: https://github.com/chneukirchen/bacon
+
+Basically, `RubyQC::API.check` would merely take the arguments and
+generate the instances via `rubyqc` method. Here the generated array
+could be viewed as `([Fixnum]*100).rubyqc`, meaning that we want an
+array which contains 100 random instances of Fixnum.
+
+As you can see, here actually `rubyqc` is an instance method of Array,
+and it would recursively call `rubyqc` for all elements of the array,
+and collect the results. Here's the definition of `Array#rubyqc`:
+
+``` ruby
+class Array
+  def rubyqc
+    map(&:rubyqc)
+  end
+end
+```
+
+And `Fixnum.rubyqc` is a Fixnum's singleton method which is defined as
+follows:
+
+``` ruby
+class Fixnum
+  def self.rubyqc
+    rand(RubyQC::FixnumMin..RubyQC::FixnumMax)
+  end
+end
+```
+
+You get the idea. See next section for the list of built-in generators.
+
+### Kernel
+
+The very default generator would simply return the instance itself.
+So if there's no generator defined for a given class or instance, it
+would merely take `self`.
+
+``` ruby
+true.rubyqc # true
+```
+
+### Class
+
+This default generator for classes would simply return a new instance via
+`new` method. This could fail if the `initialize` method for the particular
+class does not take zero argument.
+
+``` ruby
+Object.rubyqc # kind_of?(Object)
+```
+
+### Fixnum, Bignum, and Integer
+
+This would give you a random integer. Fixnum and Bignum would guarantee to
+give you the particular class, whereas Integer would give you either a Fixnum
+or Bignum.
+
+``` ruby
+Fixnum.rubyqc # kind_of?(Fixnum)
+```
+
+### array
+
+We also have instance level generator, which was used in the first example.
+The array instance generator would recursively call `rubyqc` for all elements
+of the array, and collect the results.
+
+``` ruby
+[Fixnum, Fixnum].rubyqc # [kind_of?(Fixnum), kind_of?(Fixnum)]
+```
+
+### hash
+
+This also applies to hashes which would do the same thing as arrays for the
+values, keeping the key.
+
+``` ruby
+{:fixnum => Fixnum}.rubyqc # {:fixnum => kind_of?(Fixnum)}
+```
+
+### range
+
+Fixnum would actually give a very large or very small (negative) number in
+most cases. If you want to have a number with specific range, use a range
+object to specific the range.
+
+``` ruby
+(1..6).rubyqc # within?(1..6)
+```
+
+Granted that this is actually the same as using `rand(1..6)`, but for
+combinators we need to have a unified interface.
+
+### Define your own generator
+
+Just define `rubyqc` method for your classes or instances. This weird name
+was simply chosen to avoid name conflicting since we don't have [typeclass][]
+in Ruby, and it's quite natural to open and insert new methods into classes
+in Ruby.
+
+[typeclass]: http://learnyouahaskell.com/types-and-typeclasses
+
+## CONTRIBUTORS:
+
+* Lin Jen-Shin (@godfat)
+
+## LICENSE:
+
+Apache License 2.0
+
+Copyright (c) 2014, Lin Jen-Shin (godfat)
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+<http://www.apache.org/licenses/LICENSE-2.0>
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.

data/Rakefile

@@ -0,0 +1,13 @@
+
+begin
+  require "#{dir = File.dirname(__FILE__)}/task/gemgem"
+rescue LoadError
+  sh 'git submodule update --init'
+  exec Gem.ruby, '-S', $PROGRAM_NAME, *ARGV
+end
+
+Gemgem.init(dir) do |s|
+  require 'rubyqc/version'
+  s.name    = 'rubyqc'
+  s.version = RubyQC::VERSION
+end

data/lib/rubyqc.rb

@@ -0,0 +1,16 @@
+
+require 'rubyqc/prelude'
+require 'rubyqc/modifier'
+
+module RubyQC
+  module API
+    module_function
+    def check *args, &block
+      RubyQC::Modifier.new(args, &block)
+    end
+
+    def one_of *args
+      args.sample
+    end
+  end
+end

data/lib/rubyqc/modifier.rb

@@ -0,0 +1,21 @@
+
+module RubyQC
+  class Modifier
+    def initialize args, &block
+      @args  = args
+      @times = 10
+      run(&block)
+    end
+
+    def times t, &block
+      @times = t
+      run(&block)
+    end
+
+    def run
+      @times.times{
+        yield(*@args.map(&:rubyqc))
+      } if block_given?
+    end
+  end
+end

data/lib/rubyqc/prelude.rb

@@ -0,0 +1,263 @@
+
+module RubyQC
+  FixnumMax = 2 ** (0.size * 8 - 2) - 1
+  FixnumMin = - FixnumMax - 1
+  FixnumSuc = FixnumMax + 1
+  BignumMax = FixnumMax * 10
+  BignumMin = FixnumMin * 10
+end
+
+###
+### default implementation
+###
+
+module Kernel
+  def rubyqc
+    self
+  end
+end
+
+class Class
+  def rubyqc
+    new
+  end
+end
+
+###
+### class level implementation
+###
+
+class NilClass
+  def self.rubyqc
+    nil
+  end
+end
+
+class TrueClass
+  def self.rubyqc
+    true
+  end
+end
+
+class FalseClass
+  def self.rubyqc
+    false
+  end
+end
+
+class Proc
+  def self.rubyqc
+    lambda{ Class.rubyqc.rubyqc }
+  end
+end
+
+class Method
+  def self.rubyqc
+    obj = Class.rubyqc.rubyqc
+    obj.method(obj.methods.sample)
+  end
+end
+
+class UnboundMethod
+  def self.rubyqc
+    klass = Class.rubyqc
+    klass.instance_method(klass.instance_methods.sample)
+  end
+end
+
+# TODO
+class Binding
+  def self.rubyqc
+    binding
+  end
+end
+
+# TODO
+class Symbol
+  def self.rubyqc
+    String.rubyqc.to_sym
+  end
+end
+
+class Encoding
+  def self.rubyqc
+    list.sample
+  end
+end
+
+# TODO
+class Dir
+  def self.rubyqc
+    Dir.open(__dir__)
+  end
+end
+
+class File
+  def self.rubyqc
+    File.open(__FILE__)
+  end
+end
+
+class IO
+  def self.rubyqc
+    pipe.sample
+  end
+end
+
+# TODO
+class String
+  def self.rubyqc
+    /.*/.rubyqc
+  end
+end
+
+class Regexp
+  def self.rubyqc
+    new(String.rubyqc)
+  end
+end
+
+class MatchData
+  def self.rubyqc
+    String.rubyqc.match(Regexp.rubyqc)
+  end
+end
+
+class Class
+  def self.rubyqc
+    Object.constants.map{ |name|
+      unless [:Class, :BasicObject, :Data,
+              :Config, :RubyVM, :TracePoint].include?(name)
+        const_get(name)
+      end
+    }.select{ |const| const.kind_of?(Class) }.sample
+  end
+end
+
+# TODO: why?
+# class Object
+#   def self.rubyqc
+#     Class.rubyqc.rubyqc
+#   end
+# end
+
+class Fixnum
+  def self.rubyqc
+    (RubyQC::FixnumMin..RubyQC::FixnumMax).rubyqc
+  end
+end
+
+class Bignum
+  def self.rubyqc
+    case (0..1).rubyqc
+    when 0
+      (RubyQC::BignumMin...RubyQC::FixnumMin).rubyqc
+    when 1
+      (RubyQC::FixnumSuc...RubyQC::BignumMax).rubyqc
+    else
+      raise "huh?"
+    end
+  end
+end
+
+class Integer
+  def self.rubyqc
+    [Bignum, Fixnum].sample.rubyqc
+  end
+end
+
+class Complex
+  def self.rubyqc
+    Fixnum.rubyqc + Fixnum.rubyqc.i
+  end
+end
+
+class Rational
+  def self.rubyqc
+    Rational(Fixnum.rubyqc, Fixnum.rubyqc)
+  end
+end
+
+class Range
+  def self.rubyqc
+    new(*[Fixnum.rubyqc, Fixnum.rubyqc].sort)
+  end
+end
+
+class Enumerator
+  def self.rubyqc
+    Array.rubyqc.to_enum
+  end
+end
+
+# TODO
+class Float
+  def self.rubyqc
+    rand
+  end
+end
+
+class Thread::SizedQueue
+  def self.rubyqc
+    new(rand(0..100))
+  end
+end
+
+class Fiber
+  def self.rubyqc
+    new(&Proc.rubyqc)
+  end
+end
+
+class Thread
+  def self.rubyqc
+    new(&Proc.rubyqc)
+  end
+end
+
+class SignalException
+  def self.rubyqc
+    new(rand(0..32))
+  end
+end
+
+class SystemCallError
+  def self.rubyqc
+    new(rand(1..106))
+  end
+end
+
+class Struct
+  def self.rubyqc
+    new(Symbol.rubyqc)
+  end
+end
+
+###
+### instance level implementation
+###
+
+class Array
+  def rubyqc
+    map(&:rubyqc)
+  end
+end
+
+class Hash
+  def rubyqc
+    inject({}){ |r, (k, v)| r[k] = v.rubyqc; r }
+  end
+end
+
+class Range
+  def rubyqc
+    rand(self.begin..self.end)
+  end
+end
+
+# TODO
+class Regexp
+  def rubyqc
+    'rubyqc...'
+  end
+end

data/lib/rubyqc/test.rb

@@ -0,0 +1,67 @@
+
+require 'bacon'
+require 'rubyqc'
+
+Bacon.summary_on_exit
+include RubyQC::API
+
+module Kernel
+  def eq? rhs
+    self == rhs
+  end
+end
+
+class Should
+  def self.rubyqc
+    new(Class.rubyqc.rubyqc)
+  end
+end
+
+def verify_generated generated, spec
+  if spec.empty?
+    generated.should.eq spec
+  else
+    case spec
+    when Array
+      verify_array(generated, spec)
+    when Hash
+      verify_hash(generated, spec)
+    else
+      verify_other(generated, spec)
+    end
+  end
+end
+
+def verify_array generated, spec
+  generated.zip(spec).each do |(instance, expected)|
+    case expected
+    when Array
+      verify_array(instance, expected)
+    when Hash
+      verify_hash(instance, expected)
+    else
+      verify_other(instance, expected)
+    end
+  end
+end
+
+def verify_hash generated, spec
+  generated.each do |key, instance|
+    case expected = spec[key]
+    when Array
+      verify_array(instance, expected)
+    when Hash
+      verify_hash(instance, expected)
+    else
+      verify_other(instance, expected)
+    end
+  end
+end
+
+def verify_other generated, spec
+  if spec.kind_of?(Class)
+    generated.should.kind_of spec
+  else
+    generated.should.eq      spec
+  end
+end

data/lib/rubyqc/version.rb

@@ -0,0 +1,4 @@
+
+module RubyQC
+  VERSION = '0.0.1'
+end

data/rubyqc.gemspec

@@ -0,0 +1,41 @@
+# -*- encoding: utf-8 -*-
+# stub: rubyqc 0.0.1 ruby lib
+
+Gem::Specification.new do |s|
+  s.name = "rubyqc"
+  s.version = "0.0.1"
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
+  s.require_paths = ["lib"]
+  s.authors = ["Lin Jen-Shin (godfat)"]
+  s.date = "2014-01-30"
+  s.description = "RubyQC -- A conceptual [QuickCheck][] library for Ruby.\n\nIt's not a faithful port since Hsakell is totally different than Ruby.\nHowever it's still benefit to use some of the ideas behind QuickCheck,\nand we could also use RubyQC for generating arbitrary objects.\n\n[QuickCheck]: http://en.wikipedia.org/wiki/QuickCheck"
+  s.email = ["godfat (XD) godfat.org"]
+  s.files = [
+  ".gitignore",
+  ".gitmodules",
+  ".travis.yml",
+  "Gemfile",
+  "LICENSE",
+  "README.md",
+  "Rakefile",
+  "lib/rubyqc.rb",
+  "lib/rubyqc/modifier.rb",
+  "lib/rubyqc/prelude.rb",
+  "lib/rubyqc/test.rb",
+  "lib/rubyqc/version.rb",
+  "rubyqc.gemspec",
+  "task/README.md",
+  "task/gemgem.rb",
+  "test/test_api.rb",
+  "test/test_kind_of.rb",
+  "test/test_readme.rb"]
+  s.homepage = "https://github.com/godfat/rubyqc"
+  s.licenses = ["Apache License 2.0"]
+  s.rubygems_version = "2.2.1"
+  s.summary = "RubyQC -- A conceptual [QuickCheck][] library for Ruby."
+  s.test_files = [
+  "test/test_api.rb",
+  "test/test_kind_of.rb",
+  "test/test_readme.rb"]
+end

data/task/README.md

@@ -0,0 +1,54 @@
+# Gemgem
+
+## DESCRIPTION:
+
+Provided tasks:
+
+    rake clean        # Remove ignored files
+    rake gem:build    # Build gem
+    rake gem:install  # Install gem
+    rake gem:release  # Release gem
+    rake gem:spec     # Generate gemspec
+    rake test         # Run tests in memory
+
+## REQUIREMENTS:
+
+* Tested with MRI (official CRuby) 1.9.3, 2.0.0, Rubinius and JRuby.
+
+## INSTALLATION:
+
+    git submodule add git://github.com/godfat/gemgem.git task
+
+And in Rakefile:
+
+``` ruby
+begin
+  require "#{dir = File.dirname(__FILE__)}/task/gemgem"
+rescue LoadError
+  sh 'git submodule update --init'
+  exec Gem.ruby, '-S', $PROGRAM_NAME, *ARGV
+end
+
+Gemgem.init(dir) do |s|
+  s.name    = 'your-gem'
+  s.version = '0.1.0'
+end
+```
+
+## LICENSE:
+
+Apache License 2.0
+
+Copyright (c) 2011-2013, Lin Jen-Shin (godfat)
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+<http://www.apache.org/licenses/LICENSE-2.0>
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.

data/task/gemgem.rb

@@ -0,0 +1,262 @@
+
+module Gemgem
+  class << self
+    attr_accessor :dir, :spec, :spec_create
+  end
+
+  module_function
+  def gem_tag    ; "#{spec.name}-#{spec.version}"     ; end
+  def gem_path   ; "#{pkg_dir}/#{gem_tag}.gem"        ; end
+  def spec_path  ; "#{dir}/#{spec.name}.gemspec"      ; end
+  def pkg_dir    ; "#{dir}/pkg"                       ; end
+  def escaped_dir; @escaped_dir ||= Regexp.escape(dir); end
+
+  def init dir, &block
+    self.dir = dir
+    $LOAD_PATH.unshift("#{dir}/lib")
+    ENV['RUBYLIB'] = "#{dir}/lib:#{ENV['RUBYLIB']}"
+    ENV['PATH']    = "#{dir}/bin:#{ENV['PATH']}"
+    self.spec_create = block
+  end
+
+  def create
+    spec = Gem::Specification.new do |s|
+      s.authors     = ['Lin Jen-Shin (godfat)']
+      s.email       = ['godfat (XD) godfat.org']
+
+      s.description = description.join
+      s.summary     = description.first
+      s.license     = readme['LICENSE'].sub(/.+\n\n/, '').lines.first.strip
+
+      s.date        = Time.now.strftime('%Y-%m-%d')
+      s.files       = gem_files
+      s.test_files  = test_files
+      s.executables = bin_files
+    end
+    spec_create.call(spec)
+    spec.homepage = "https://github.com/godfat/#{spec.name}"
+    self.spec = spec
+  end
+
+  def write
+    File.open(spec_path, 'w'){ |f| f << split_lines(spec.to_ruby) }
+  end
+
+  def split_lines ruby
+    ruby.gsub(/(.+?)\s*=\s*\[(.+?)\]/){ |s|
+      if $2.index(',')
+        "#{$1} = [\n  #{$2.split(',').map(&:strip).join(",\n  ")}]"
+      else
+        s
+      end
+    }
+  end
+
+  def strip_path path
+    strip_home_path(strip_cwd_path(path))
+  end
+
+  def strip_home_path path
+    path.sub(ENV['HOME'], '~')
+  end
+
+  def strip_cwd_path path
+    path.sub(Dir.pwd, '.')
+  end
+
+  def git *args
+    `git --git-dir=#{dir}/.git #{args.join(' ')}`
+  end
+
+  def sh_git *args
+    Rake.sh('git', "--git-dir=#{dir}/.git", *args)
+  end
+
+  def sh_gem *args
+    Rake.sh(Gem.ruby, '-S', 'gem', *args)
+  end
+
+  def glob path=dir
+    Dir.glob("#{path}/**/*", File::FNM_DOTMATCH)
+  end
+
+  def readme
+    @readme ||=
+      if (path = "#{Gemgem.dir}/README.md") && File.exist?(path)
+        ps = "##{File.read(path)}".
+             scan(/((#+)[^\n]+\n\n.+?(?=(\n\n\2[^#\n]+\n)|\Z))/m).map(&:first)
+        ps.inject('HEADER' => ps.first){ |r, s, i|
+          r[s[/\w+/]] = s
+          r
+        }
+      else
+        {}
+      end
+  end
+
+  def description
+    # JRuby String#lines is returning an enumerator
+    @description ||= (readme['DESCRIPTION']||'').sub(/.+\n\n/, '').lines.to_a
+  end
+
+  def all_files
+    @all_files ||= fold_files(glob).sort
+  end
+
+  def fold_files files
+    files.inject([]){ |r, path|
+      if File.file?(path) && path !~ %r{/\.git(/|$)}  &&
+         (rpath = path[%r{^#{escaped_dir}/(.*$)}, 1])
+        r << rpath
+      elsif File.symlink?(path) # walk into symlinks...
+        r.concat(fold_files(glob(File.expand_path(path,
+                                                  File.readlink(path)))))
+      else
+        r
+      end
+    }
+  end
+
+  def gem_files
+    @gem_files ||= all_files.reject{ |f|
+      f =~ ignored_pattern && !git_files.include?(f)
+    }
+  end
+
+  def test_files
+    @test_files ||= gem_files.grep(%r{^test/(.+?/)*test_.+?\.rb$})
+  end
+
+  def bin_files
+    @bin_files ||= gem_files.grep(%r{^bin/}).map{ |f| File.basename(f) }
+  end
+
+  def git_files
+    @git_files ||= if File.exist?("#{dir}/.git")
+                     git('ls-files').split("\n")
+                   else
+                     []
+                   end
+  end
+
+  def ignored_files
+    @ignored_files ||= all_files.grep(ignored_pattern)
+  end
+
+  def ignored_pattern
+    @ignored_pattern ||= if gitignore.empty?
+                           /^$/
+                         else
+                           Regexp.new(expand_patterns(gitignore).join('|'))
+                         end
+  end
+
+  def expand_patterns pathes
+    # http://git-scm.com/docs/gitignore
+    pathes.flat_map{ |path|
+      # we didn't implement negative pattern for now
+      Regexp.escape(path).sub(%r{^/}, '^').gsub(/\\\*/, '[^/]*')
+    }
+  end
+
+  def gitignore
+    @gitignore ||= if File.exist?(path = "#{dir}/.gitignore")
+                     File.read(path).lines.
+                       reject{ |l| l == /^\s*(#|\s+$)/ }.map(&:strip)
+                   else
+                     []
+                   end
+  end
+end
+
+namespace :gem do
+
+desc 'Install gem'
+task :install => [:build] do
+  Gemgem.sh_gem('install', Gemgem.gem_path)
+end
+
+desc 'Build gem'
+task :build => [:spec] do
+  require 'fileutils'
+  require 'rubygems/package'
+  gem = nil
+  Dir.chdir(Gemgem.dir) do
+    gem = Gem::Package.build(Gem::Specification.load(Gemgem.spec_path))
+    FileUtils.mkdir_p(Gemgem.pkg_dir)
+    FileUtils.mv(gem, Gemgem.pkg_dir) # gem is relative path, but might be ok
+  end
+  puts "\e[35mGem built: \e[33m" \
+       "#{Gemgem.strip_path("#{Gemgem.pkg_dir}/#{gem}")}\e[0m"
+end
+
+desc 'Generate gemspec'
+task :spec do
+  Gemgem.create
+  Gemgem.write
+end
+
+desc 'Release gem'
+task :release => [:spec, :check, :build] do
+  Gemgem.module_eval do
+    sh_git('tag', Gemgem.gem_tag)
+    sh_git('push')
+    sh_git('push', '--tags')
+    sh_gem('push', Gemgem.gem_path)
+  end
+end
+
+task :check do
+  ver = Gemgem.spec.version.to_s
+
+  if ENV['VERSION'].nil?
+    puts("\e[35mExpected "                                  \
+         "\e[33mVERSION\e[35m=\e[33m#{ver}\e[0m")
+    exit(1)
+
+  elsif ENV['VERSION'] != ver
+    puts("\e[35mExpected \e[33mVERSION\e[35m=\e[33m#{ver} " \
+         "\e[35mbut got\n         "                         \
+         "\e[33mVERSION\e[35m=\e[33m#{ENV['VERSION']}\e[0m")
+    exit(2)
+  end
+end
+
+end # of gem namespace
+
+desc 'Run tests'
+task :test do
+  next if Gemgem.test_files.empty?
+
+  require 'bacon'
+  Bacon.extend(Bacon::TestUnitOutput)
+  Bacon.summary_on_exit
+  Gemgem.test_files.each{ |file| require "#{Gemgem.dir}/#{file[0..-4]}" }
+end
+
+desc 'Trash ignored files'
+task :clean => ['gem:spec'] do
+  next if Gemgem.ignored_files.empty?
+
+  require 'fileutils'
+  trash = File.expand_path("~/.Trash/#{Gemgem.spec.name}")
+  puts "Move the following files into:" \
+       " \e[35m#{Gemgem.strip_path(trash)}\e[33m"
+
+  Gemgem.ignored_files.each do |file|
+    from = "#{Gemgem.dir}/#{file}"
+    to   = "#{trash}/#{File.dirname(file)}"
+    puts Gemgem.strip_path(from)
+
+    FileUtils.mkdir_p(to)
+    FileUtils.mv(from, to)
+  end
+
+  print "\e[0m"
+end
+
+task :default do
+  # Is there a reliable way to do this in the current process?
+  # It failed miserably before between Rake versions...
+  exec "#{Gem.ruby} -S #{$PROGRAM_NAME} -f #{Rake.application.rakefile} -T"
+end

data/test/test_api.rb

@@ -0,0 +1,12 @@
+
+require 'rubyqc/test'
+
+describe RubyQC::API do
+  should 'one_of' do
+    check([Class]*5) do |klasses|
+      check(one_of(*klasses)) do |obj|
+        klasses.find{ |klass| obj.kind_of?(klass) }.should.not.nil
+      end
+    end
+  end
+end

data/test/test_kind_of.rb

@@ -0,0 +1,22 @@
+
+require 'rubyqc/test'
+
+describe 'kind_of' do
+  [Fixnum, Bignum, Array, Integer, Class].each do |klass|
+    should klass.name do
+      check(klass){ |obj| obj.should.kind_of(klass) }
+    end
+  end
+
+  [[], [Fixnum], [Fixnum, Array],
+   {}, {:a => 0}, {'b' => 1}, {2 => Integer},
+   {nil => [Fixnum]}, {true => {false => [Bignum]}}
+  ].each do |spec|
+
+    should spec.inspect do
+      check(spec) do |generated|
+        verify_generated(generated, spec)
+      end
+    end
+  end
+end

data/test/test_readme.rb

@@ -0,0 +1,12 @@
+
+require 'rubyqc/test'
+
+describe Array do
+  describe 'sort' do
+    should 'Any front elements should be <= any rear elements' do
+      check([Fixnum]*100).times(10) do |array|
+        array.sort.each_cons(2).each{ |x, y| x.should <= y }
+      end
+    end
+  end
+end

metadata

@@ -0,0 +1,72 @@
+--- !ruby/object:Gem::Specification
+name: rubyqc
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Lin Jen-Shin (godfat)
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-01-30 00:00:00.000000000 Z
+dependencies: []
+description: |-
+  RubyQC -- A conceptual [QuickCheck][] library for Ruby.
+
+  It's not a faithful port since Hsakell is totally different than Ruby.
+  However it's still benefit to use some of the ideas behind QuickCheck,
+  and we could also use RubyQC for generating arbitrary objects.
+
+  [QuickCheck]: http://en.wikipedia.org/wiki/QuickCheck
+email:
+- godfat (XD) godfat.org
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".gitmodules"
+- ".travis.yml"
+- Gemfile
+- LICENSE
+- README.md
+- Rakefile
+- lib/rubyqc.rb
+- lib/rubyqc/modifier.rb
+- lib/rubyqc/prelude.rb
+- lib/rubyqc/test.rb
+- lib/rubyqc/version.rb
+- rubyqc.gemspec
+- task/README.md
+- task/gemgem.rb
+- test/test_api.rb
+- test/test_kind_of.rb
+- test/test_readme.rb
+homepage: https://github.com/godfat/rubyqc
+licenses:
+- Apache License 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.2.1
+signing_key: 
+specification_version: 4
+summary: RubyQC -- A conceptual [QuickCheck][] library for Ruby.
+test_files:
+- test/test_api.rb
+- test/test_kind_of.rb
+- test/test_readme.rb