constraint 0.1

data/AUTHORS.TXT

@@ -0,0 +1 @@
+constraint.txt was written by Thomas Link (samul AT web.de)

data/LICENSE.TXT

@@ -0,0 +1,340 @@
+		    GNU GENERAL PUBLIC LICENSE
+		       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.
+                       59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+			    Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+		    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+			    NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+		     END OF TERMS AND CONDITIONS
+
+	    How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Library General
+Public License instead of this License.

data/README.TXT

@@ -0,0 +1,81 @@
+This library provides a way to ensure that object always satisfy a 
+specified set of constraints. An object that can be constrained must be 
+of kind <tt>Constraint::Shell</tt>. Constraints can be added to classes 
+and single objects. It is possible to define methods that handle 
+constraint violations and can make the object fit the demands.
+
+Project::  http://rubyforge.org/projects/constraint/
+Download:: http://rubyforge.org/frs/?group_id=748
+Support::  http://rubyforge.org/forum/?group_id=748
+
+In my experience, a certain type of errors in dynamically typed 
+languages are caused by pushing some wrong object to a collection type 
+of object. What makes this type of error so awkward is that they often 
+result in an exception in some totally different part of your program, 
+which is why it sometimes can be quite hard to track down what is 
+actually causing the problem. The goal of this library is to raise an 
+exception right where such a thing happens. While ruby is sometimes a 
+little bit hesitant in raising exceptions, this library tries to 
+counteract this tendency a little bit.
+
+Be aware that this library introduces yet another level of indirection 
+and yet additional runtime checks what slows things down a little. If 
+you define CONSTRAINT_DISABLE before requiring the library, constraint 
+checks will be deactivated.
+
+
+= Documentation
+
+Constrained classes should inherit from <tt>Constraint::Shell</tt>. The 
+subclass should provide a way for defining new instances (by defining 
+#new_constrained) and redefine #process_constrained_value. The 
+@constrained_value instance variable contains the shell's actual values.
+
+Examples:
+
+    class ConstrainedArray < Constraint::Shell
+        def new_constrained
+            []
+        end
+        
+        def process_constrained_value
+            @constrained_value.collect! {|e| yield e}
+        end
+    end
+
+    class NumericArray < ConstrainedArray
+        or_constraint("Numeric") {|e| e.kind_of?(Numeric)}
+    end
+
+    class EvenNumericArray < NumericArray
+        and_constraint("Even") {|e| e.modulo(2) == 0}
+    end
+
+    class EvenInteger < Constraint::Shell
+        and_constraint("Numeric") {|e| e.kind_of?(Integer)}
+        and_constraint("Even") {|e| e.modulo(2) == 0}
+    end
+
+    enum = EvenInteger.new(2)
+    enum.and_constraint("LT10") {|e| e < 10}
+
+or:
+
+    class DuckPalace < ConstrainedArray
+        and_constraint('Quack') {|e| e.do_you_quack?}
+        and_constraint('Ticket') {|e| e.your_ticket_please == :valid}
+    end
+
+    whiteduckpalace = DuckPalace.new
+    whiteduckpalace.and_constraint('White') {|e| e.colour == 'white'}
+    class << whiteduckpalace
+        def handle_constraint_violation(contraint_name, object)
+            case contraint_name
+            when 'white'
+                return object.paint_me('white') if object.respond_to?(:paint_me)
+            end
+            return super
+        end
+    end
+
+

data/VERSION.TXT

@@ -0,0 +1 @@
+0.1

data/benchmarks/primes.rb

@@ -0,0 +1,70 @@
+#!/usr/bin/env ruby
+# primes.rb
+# @Author:      Thomas Link (samul@web.de)
+# @Website:     http://members.a1.net/t.link/
+# @License:     GPL (see http://www.gnu.org/licenses/gpl.txt)
+# @Created:     09-Jun-2005.
+# @Last Change: 09-Jun-2005.
+# @Revision:    0.30
+
+require 'benchmark'
+# CONSTRAINT_DISABLE = true
+require 'constraint'
+
+# A simple dumb-minded brute force prime finder.
+module Primes
+    class << self
+        include Benchmark
+    end
+    module_function
+
+    class DumbCArray < Constraint::Shell
+        def new_constrained
+            []
+        end
+
+        def process_constrained_value
+            @constrained_value.collect! {|e| yield e}
+        end
+    end
+
+    def find_primes1(max, prs)
+        j = 3
+        while j < max do
+            if prs.each {|i| if (j % i) == 0 then break end}
+                prs << j
+            end
+            j += 2
+        end
+    end
+
+    def find_primes2(max, prs)
+        j = 3
+        while j < max do
+            if prs.each {|i| if (j % i) == 0 then break end}
+                prs = prs + [j]
+            end
+            j += 2
+        end
+    end
+
+    def find_primes(*args)
+        find_primes1(*args)
+        find_primes2(*args)
+    end
+
+    def test(max)
+        bm(6) do |x|
+            x.report('array') {find_primes(max, [2])}
+            x.report('dumb') {find_primes(max, DumbCArray.new([2]))}
+            x.report('opt1') {find_primes(max, Constraint::CArray.new([2]))}
+        end
+    end
+end
+
+
+if __FILE__ == $0
+    arg = ARGV[0]
+    Primes.test(arg ? arg.to_i : 50000)
+end
+

data/lib/constraint.rb

@@ -0,0 +1,371 @@
+# constraint.rb
+# @Author:      Thomas Link (samul AT web.de)
+# @License:     GPL (see http://www.gnu.org/licenses/gpl.txt)
+# @Created:     23-Mai-2005.
+# @Last Change: 09-Jun-2005.
+# @Revision:    607
+
+
+class ConstraintViolation < Exception
+end
+
+
+# If CONSTRAINT_DISABLE is set to true *before* loading this library, 
+# constraint checking is turned off.
+CONSTRAINT_DISABLE = false unless defined?(CONSTRAINT_DISABLE)
+
+
+module Constraint
+    VERSION = '0.1'
+    
+    # The base constraint class. Always evaluates to true.
+    class NilConstraint
+        # shell:: The Shell class containing this constraint
+        # name::  This constraint's name
+        # description:: Optional constraint description
+        # block:: The constraint that must evaluate to true in order for this constraint to succeed
+        def initialize(shell, name, description=nil, &block)
+            @shell       = shell
+            @other       = shell.constraints
+            @name        = name
+            @description = description
+            @this        = block
+        end
+
+        # Return true if +args+ complies with @this constraint.
+        def evaluate(object)
+            begin
+                rv = @this.call(object)
+            rescue Exception => e
+                @shell.log_constraint_exception(e)
+            end
+            begin
+                if @other
+                    return evaluate_control(rv, object)
+                elsif rv
+                    return object
+                else
+                    return evaluate(handle_violation(object))
+                end
+            rescue ConstraintViolation => e
+                raise e
+            end
+        end
+
+        # Delegate to Shell#handle_constraint_violation.
+        def handle_violation(object)
+            return @shell.handle_constraint_violation(@name, object)
+        end
+
+        private
+        # Combine constraints. In the base class, always evaluate to 
+        # true.
+        def evaluate_control(value, object)
+            raise "Subclass responsibility"
+            # value ? object : handle_violation(object)
+        end
+    end
+   
+    class OrConstraint < NilConstraint
+        private
+        # Return true if +value+ or the @other constraint are true.
+        def evaluate_control(value, object)
+            value ? object : @other.evaluate(object)
+        end
+    end
+
+    class AndConstraint < NilConstraint
+        private
+        # Return true if +value+ and the @other constraint are true.
+        def evaluate_control(value, object)
+            return value ? @other.evaluate(object) : handle_violation(object)
+        end
+    end
+
+    module Helper
+        # The current class's/object's head constraint.
+        attr_reader :constraints
+        # A hash of constraint descriptions.
+        attr_reader :descriptions
+       
+        # Define an OrConstraint. If the new constraint succeedes, all 
+        # previous constraints become obsolete.
+        # name::  This constraint's name
+        # description:: Optional constraint description
+        # block:: The constraint that must evaluate to true in order for this constraint to succeed
+        def or_constraint(name, desc=nil, &block)
+            describe_constraint(name, desc)
+            @constraints = OrConstraint.new(self, name, desc, &block)
+        end
+
+        # Define an AndConstraint. This and all previous constraints 
+        # have to succeed.
+        # name::  This constraint's name
+        # description:: Optional constraint description
+        # block:: The constraint that must evaluate to true in order for this constraint to succeed
+        def and_constraint(name, desc=nil, &block)
+            describe_constraint(name, desc)
+            @constraints = AndConstraint.new(self, name, desc, &block)
+        end
+
+        # If $VERBOSE is set, print the exception to $stderr.
+        def log_constraint_exception(exception)
+            if $VERBOSE
+                $stderr.puts exception
+            end
+        end
+
+        # Handle constraint violations. Can be overwritten by subclasses 
+        # in order to rescue the constraint. The return value will 
+        # replace the original object.
+        # name:: The constraint's name that didn't succeed
+        # object:: The object that caused the violation
+        def handle_constraint_violation(name, object)
+            c = @descriptions.collect {|name, desc| desc}.join(', ')
+            raise ConstraintViolation,
+                "#{self.class}: #{object.class} didn't meet constraints (#{c}): #{object.inspect}", 
+                caller[5..-1]
+        end
+
+        private
+        # Copy constraint-related class-local variables from +klass+ to self. 
+        def inherit_constraint(klass)
+            @descriptions = klass.descriptions.dup
+            @constraints  = klass.constraints
+        end
+
+        # Register a constraint description. If no description is 
+        # provided, the +name+ is used.
+        # name:: This constraint's name
+        # desc:: Optional constraint description
+        def describe_constraint(name, desc=nil)
+            @descriptions[name] = (desc || name)
+        end
+    end
+
+    # If CONSTRAINT_DISABLE is set to true *before* loading this library, 
+    # constraint checking is turned off.
+    class Shell
+        # The actual value that is covered by the Shell.
+        attr_reader :constrained_value
+
+        @descriptions = {}
+        @constraints  = nil
+
+        class << self
+            include Helper
+
+            def inherited(subclass)
+                parent = self
+                subclass.class_eval do
+                    inherit_constraint(parent)
+                end
+            end
+
+            # Wrap +methods+ so that all arguments are filtered through 
+            # #check_constraints.
+            # methods:: Method names as symbols
+            def with_all_arguments_constrained(*methods)
+                with_arguments_constrained(*methods) do |checker, *args| 
+                    args.collect {|e| checker.call(e)}
+                end
+            end
+
+            # Wrap +methods+ so that some arguments are filtered through 
+            # #check_constraints. This is useful in two situations:
+            # 
+            #   * if filtering the return value would be inefficient -- 
+            #   e.g. with methods performing trivial Array operations 
+            #   where the return value will comply with the constraints 
+            #   if its argument do.
+            #
+            #   * if the return value of the method call is not an 
+            #   instance of the actual value's class (only then will the 
+            #   value's integrity be checked)
+            # 
+            # See also the notes on Shell#with_constraints.
+            # 
+            # methods:: Method names as symbols
+            # block::   Select the arguments that should be filtered
+
+            def with_arguments_constrained(*methods, &block)
+                unless CONSTRAINT_DISABLE
+                    methods.each do |method|
+                        define_method(method) do |*args|
+                            unless args.empty?
+                                checker = lambda {|a| check_constraints(a)}
+                                args    = block.call(checker, *args)
+                            end
+                            with_constraints(@constrained_value.send(method, *args))
+                        end
+                    end
+                end
+            end
+
+            # Delegate +methods+ to @constrained_value without taking any 
+            # measures.
+            def without_constraints(*methods)
+                methods.each do |method|
+                    define_method(method) do |*args|
+                        with_constraints(@constrained_value.send(method, *args))
+                    end
+                end
+            end
+        end
+
+        include Helper
+        
+        def initialize(core=nil, predecessor=nil)
+            if predecessor
+                @descriptions = predecessor.descriptions
+                @constraints  = predecessor.constraints
+            else
+                @descriptions = self.class.descriptions.dup
+                @constraints  = self.class.constraints
+                @constraints  = @constraints.dup if @constraints
+            end
+            
+            if core
+                @constrained_value = core
+            else
+                @constrained_value = new_constrained
+            end
+
+            unless CONSTRAINT_DISABLE
+                process_constrained_value {|e| check_constraints(e)}
+            end
+        end
+
+        def dup
+            replicate_constraint_shell(super)
+        end
+        
+        def clone
+            replicate_constraint_shell(super)
+        end
+        
+        # Construct a new instance.
+        def new_constrained
+            # nil
+            raise 'Subclass responsibility'
+        end
+       
+        # Filters @constrained_value through the supplied block (usually a 
+        # call to #check_constraints) and collects the output in 
+        # @constrained_value).
+        # block:: The filter
+        def process_constrained_value
+            @constrained_value = yield @constrained_value
+        end
+      
+        if CONSTRAINT_DISABLE
+            def check_constraints(object)
+                object
+            end
+        else
+            # Check if +object+ complies with @constraints.
+            def check_constraints(object)
+                if @constraints
+                    return @constraints.evaluate(object)
+                else
+                    return object
+                end
+            end
+        end
+
+        # Maintain object identity according to the return value of 
+        # +block+. This method can be used when overwriting specific 
+        # methods and if you don't want to use the provided wrapper 
+        # methods (e.g., Shell.with_arguments_constrained).
+        # 
+        # If the return value is of the same kind as @constrained_value 
+        # and if +block+ can't be +trusted+, then the return value is 
+        # filtered through #check_constraints.
+        #
+        # In order to filter the arguments of methods that don't return 
+        # an object of the same kind as @constrained_value, you have to 
+        # define an explicit delegator using 
+        # Shell.with_arguments_constrained and friends.
+        #
+        # new_value:: The result from the method call
+        # [block]:: Optional, called @constrained_value is +new_value+
+        def with_constraints(new_value)
+            if new_value.equal?(@constrained_value)
+                yield if block_given?
+                return self
+            elsif new_value.instance_of?(@constrained_value.class)
+                return self.class.new(new_value, self)
+            else
+                return new_value
+            end
+        end
+
+        if CONSTRAINT_DISABLE
+            def method_missing(method, *args, &block)
+                with_constraints(@constrained_value.send(method, *args, &block))
+            end
+        else
+            # Delegate unknown methods to @constrained_value and filter the 
+            # return value through #check_constraints.
+            #
+            # See also the notes on #with_constraints and 
+            # Shell.with_arguments_constrained.
+            def method_missing(method, *args, &block)
+                # $stderr.puts "Constraint::Shell: Delegate method: #{method}" if $DEBUG
+                with_constraints(@constrained_value.send(method, *args, &block)) do
+                    process_constrained_value {|e| check_constraints(e)}
+                end
+            end
+        end
+
+        # Forward to @constrained_value.
+        def respond_to?(*args)
+            super or @constrained_value.respond_to?(*args)
+        end
+
+        private
+        # Some kind of semi-deep copy.
+        def replicate_constraint_shell(new_instance)
+            cv = @constrained_value.clone
+            new_instance.instance_eval do
+                @constrained_value = cv
+            end
+            new_instance
+        end
+    end
+
+    # This is a simple test wrapper class for Array. This currently 
+    # overwrites only a few methods so that most of the time the return 
+    # value if filtered. As this often is the array itself, this isn't 
+    # very efficient.
+    class CArray < Constraint::Shell
+        def new_constrained
+            []
+        end
+
+        def process_constrained_value
+            @constrained_value.collect! {|e| yield e}
+        end
+
+        with_all_arguments_constrained(:<<, :unshift)
+        with_arguments_constrained(:[]=) do |checker, pos, val|
+            [pos, checker.call(val)]
+        end
+        with_arguments_constrained(:+, :&, :|, :concat) do |checker, args|
+            [args.collect {|e| checker.call(e)}]
+        end
+        without_constraints(:[], :-, :*, :delete_at, :delete_if, :find_all)
+    end
+
+    # This is a simple test wrapper class for Hash.
+    # class CHash < Constraint::Shell
+    #     def new_constrained
+    #         {}
+    #     end
+    # 
+    #     def process_constrained_value
+    #         @constrained_value.each {|key, val| @constrained_value[key] = yield val}
+    #     end
+    # end
+end
+

data/test/tc_contraint.rb

@@ -0,0 +1,124 @@
+#!/usr/bin/env ruby
+# tc_contraint.rb
+# @Author:      Thomas Link (samul@web.de)
+# @Created:     27-M�r-2005.
+# @Last Change: 09-Jun-2005.
+# @Revision:    0.105
+
+require 'test/unit'
+require 'constraint'
+
+
+class NumericArray < Constraint::CArray
+    or_constraint("Numeric") {|e| e.kind_of?(Numeric)}
+end
+
+class NumericArray123 < NumericArray
+    @constructor = lambda {[1,2,3]}
+end
+
+class EvenNumericArray < NumericArray
+    and_constraint("Even") {|e| e.modulo(2) == 0}
+end
+
+class EvenInteger < Constraint::Shell
+    and_constraint("Even") {|e| e.modulo(2) == 0}
+end
+    
+
+class TC_Contraint < Test::Unit::TestCase
+    # def setup
+    # end
+
+    # def teardown
+    # end
+    
+    def test_numarr_new
+        assert_equal([1,2,3], NumericArray.new([1,2,3]).constrained_value)
+        assert_equal([], NumericArray123.new.constrained_value)
+    end
+    
+    def test_numarr
+        numarr = NumericArray.new
+        numarr << 1 << 2
+        assert_equal([1, 2], numarr.constrained_value)
+        assert_equal([1,2,3], (numarr + [3]).constrained_value)
+        assert_same(numarr, numarr << 4)
+        assert_not_same(numarr, numarr + [4])
+        assert_raise(ConstraintViolation) {NumericArray.new(["a",2,3])}
+        assert_raise(ConstraintViolation) {NumericArray.new([2,nil])}
+        assert_raise(ConstraintViolation) {numarr << "a"}
+        assert_equal(true, numarr.respond_to?(:[]))
+        assert_equal(true, numarr.respond_to?(:with_constraints))
+        assert_equal(false, numarr.respond_to?(:inexistent))
+    end
+    
+    def test_enumarr
+        numarr = EvenNumericArray.new
+        numarr << 0 << 2
+        assert_equal(EvenNumericArray, numarr.class)
+        assert_equal([0, 2], numarr.constrained_value)
+        assert_equal([0, 2, 4], (numarr + [4]).constrained_value)
+        assert_same(numarr, numarr << 4)
+        assert_not_same(numarr, numarr + [4])
+        assert_instance_of(EvenNumericArray, numarr + [4])
+        assert_raise(ConstraintViolation) {EvenNumericArray.new([1,2,3])}
+        assert_raise(ConstraintViolation) {EvenNumericArray.new([nil,2])}
+        assert_raise(ConstraintViolation) {numarr.dup << 3}
+        assert_raise(ConstraintViolation) {numarr.dup << "a"}
+        assert_raise(ConstraintViolation) {numarr.dup << nil}
+        assert_raise(ConstraintViolation) {numarr.dup + [1]}
+        assert_raise(ConstraintViolation) {numarr.dup + [[2]]}
+        assert_raise(ConstraintViolation) {numarr.dup[0] = 1}
+        n = numarr.dup
+        assert_nothing_raised {n[0] = 2}
+        assert_equal([2,2,4], n.constrained_value)
+        assert_equal([4], (n - [2]).constrained_value)
+    end
+    
+    def test_evenint
+        enum = EvenInteger.new(2)
+        assert_equal(2, enum.constrained_value)
+        assert_equal(4, (enum + 2).constrained_value)
+        assert_raise(ConstraintViolation) {enum + 1}
+    end
+
+    def test_evenint_lt10
+        enum = EvenInteger.new(2)
+        enum.and_constraint("LT10") {|e| e < 10}
+        assert_equal(2, enum.constrained_value)
+        assert_equal(4, (enum + 2).constrained_value)
+        assert_raise(ConstraintViolation) {enum + 10}
+        enum.or_constraint("GT20") {|e| e > 20}
+        assert_nothing_raised {enum + 30}
+        # should this one raise an exception or not?
+        # assert_raise(ConstraintViolation) {enum + 111}
+        assert_equal(22, (enum + 20).constrained_value)
+        enum = EvenInteger.new(2)
+        assert_nothing_raised {enum + 10}
+    end
+
+    def test_evenint_lt10_rescue
+        enum = EvenInteger.new(2)
+        enum.and_constraint("LT10") {|e| e < 10}
+        assert_raise(ConstraintViolation) {enum + 10}
+        class << enum
+            def handle_constraint_violation(name, object)
+                case name
+                when "LT10"
+                    if object > 10
+                        return 10
+                    else
+                        return 0
+                    end
+                else
+                    return super
+                end
+            end
+        end
+        assert_equal(10, (enum + 20).constrained_value)
+        assert_raise(ConstraintViolation) {enum + 1}
+        assert_nothing_raised {enum + 101}
+    end
+end
+

data/test/ts_constraint.rb

@@ -0,0 +1,4 @@
+#!/usr/bin/env ruby
+
+load 'test/tc_contraint.rb'
+

metadata

@@ -0,0 +1,49 @@
+--- !ruby/object:Gem::Specification 
+rubygems_version: 0.8.10
+specification_version: 1
+name: constraint
+version: !ruby/object:Gem::Version 
+  version: "0.1"
+date: 2005-06-10
+summary: Ensure that objects comply with some constraints
+require_paths: 
+  - lib
+email: samul@web.de?subject=constraint
+homepage: http://constraint.sourceforge.net
+rubyforge_project: 
+description: This library provides a way to define constrained classes in order to  ensure that its instances always satisfy some specified set of constraints.
+autorequire: constraint.rb
+default_executable: 
+bindir: bin
+has_rdoc: true
+required_ruby_version: !ruby/object:Gem::Version::Requirement 
+  requirements: 
+    - 
+      - ">"
+      - !ruby/object:Gem::Version 
+        version: 0.0.0
+  version: 
+platform: ruby
+authors: 
+  - Thomas Link
+files: 
+  - benchmarks/primes.rb
+  - lib/constraint.rb
+  - test/tc_contraint.rb
+  - test/ts_constraint.rb
+  - README.TXT
+  - AUTHORS.TXT
+  - LICENSE.TXT
+  - VERSION.TXT
+test_files: 
+  - test/ts_constraint.rb
+rdoc_options: []
+extra_rdoc_files: 
+  - README.TXT
+  - AUTHORS.TXT
+  - LICENSE.TXT
+  - VERSION.TXT
+executables: []
+extensions: []
+requirements: []
+dependencies: []