dither 0.2.0.rc4 → 0.2.0.rc5

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: c7e321420a2ba706f3f24e8e3d2191da27fce614
-  data.tar.gz: 094b5152e0d320355a6e465210ecd9c267f0c6f8
+  metadata.gz: 1b89c1351cf61afc147849279c2ade1e8775e790
+  data.tar.gz: 6981167c11357bbb08893a777f025a60dc61d267
 SHA512:
-  metadata.gz: 06c79a55ca5dcfbef0a287120bebf8aa6b558f079a6ba08551c2786abd5b15bf7b95059ec231a71dcbca736c514a6a5a29e0ce24d57c94c9210ebe280ffbe7b1
-  data.tar.gz: 456b3f07542dbb81a580910b7468ff2f39cc48b422e0704defcf8473c84cf7edf0676920b79b54aab72e176100afee574a2f55ba9c335e216f85477d6ebd8d70
+  metadata.gz: 1a16ca2e817c805d52b2c5480e380a7021ffcb4d88116fa50a0580fa681319e70e8919c3048b367939a7770fd7a39ae408604a5ac87483e023ce3e6c6991bece
+  data.tar.gz: 1584706a3366471444bd61ab035b4ac5b277dc1268150141b1dcd755511082a815c23a211d5d9c2fe38c5563cb2be69f599f4c7f8c6aeb070b79ba70aceab2ca

data/dither.gemspec

@@ -24,7 +24,7 @@ Gem::Specification.new do |s|
   if RUBY_PLATFORM =~ /java/
     s.platform = "java"
     # compile dither-java on jdk 8
-    files << "lib/dither-0.1.3.jar"
+    files << "lib/dither-0.1.4.jar"
     files << "lib/choco-solver-3.3.1-with-dependencies.jar"
 	else
 		s.add_dependency "ffi", "~> 1.0"

data/ext/dither/simple_constraint_handler.cc

@@ -12,7 +12,7 @@
 
 namespace dither {
 
-  SimpleConstraintHandler::SimpleConstraintHandler(std::vector<dval>& ranges, std::vector<std::vector<dval>>& pconstraints) : params(ranges) {
+  SimpleConstraintHandler::SimpleConstraintHandler(std::vector<dval>& ranges, std::vector<std::vector<dval>>& pconstraints) : params(ranges), scratch(ranges.size(), -1) {
     for(auto it = pconstraints.cbegin(); it != pconstraints.cend(); ++it) {
       std::vector<std::pair<std::size_t, dval>> constraint;
       std::size_t i = 0;
@@ -27,6 +27,14 @@ namespace dither {
   }
 
   bool SimpleConstraintHandler::violate_constraints(const dtest_case &test_case) {
+    if(violate_constraints_(test_case)) {
+      return true;
+    }
+    std::copy(test_case.cbegin(), test_case.cend(), scratch.begin());
+    return !ground(scratch);
+  }
+
+  inline bool SimpleConstraintHandler::violate_constraints_(const dtest_case &test_case) {
     for(auto constraint = constraints.cbegin(); constraint != constraints.cend(); ++constraint) {
       if(violate_constraint(test_case, *constraint)) {
         return true;
@@ -46,32 +54,14 @@ namespace dither {
   }
 
   bool SimpleConstraintHandler::violate_constraints(const std::vector<param> &test_case) {
-    for(auto constraint = constraints.cbegin(); constraint != constraints.cend(); ++constraint) {
-      if(violate_constraint(test_case, *constraint)) {
-        return true;
-      }
-    }
-    return false;
-  }
-
-  inline bool SimpleConstraintHandler::violate_constraint(const std::vector<param>& test_case, const std::vector<std::pair<std::size_t, dval>>& constraint) {
-    if(test_case.size() < constraint.size()) {
-      return false;
-    }
-
-    std::size_t count = 0;
-    for(auto it = constraint.cbegin(); it != constraint.cend(); ++it) {
-      for(auto iit = test_case.cbegin(); iit != test_case.cend(); ++iit) {
-        if((*iit).first == (*it).first && (*iit).second == (*it).second) {
-          count++;
-          break;
-        }
-      }
+    std::fill(scratch.begin(), scratch.end(), -1);
+    for(auto p : test_case) {
+      scratch[p.first] = p.second;
     }
-    if(count == constraint.size()) {
+    if(violate_constraints_(scratch)) {
       return true;
     }
-    return false;
+    return !ground(scratch);
   }
 
   bool SimpleConstraintHandler::ground(dtest_case &test_case) {
@@ -84,9 +74,6 @@ namespace dither {
         indexes.push_back(i);
       }
     }
-    if(indexes.size() == 0) {
-      return true;
-    }
     std::vector<dval> bound_values(indexes.size(), -1);
     i = 0;
 
@@ -95,7 +82,7 @@ LOOP:while(i < indexes.size()) {
        const dval max = params[indexes[i]];
        for(dval value = bound_values[i] + 1; value <= max; value++) {
          test_case[indexes[i]] = value;
-         if(violate_constraints(test_case)) {
+         if(violate_constraints_(test_case)) {
            continue;
          }
          bound_values[i] = value;

data/ext/dither/simple_constraint_handler.h

@@ -22,9 +22,10 @@ namespace dither {
     protected:
       std::vector<std::vector<std::pair<std::size_t, dval>>> constraints;
       std::vector<dval> params;
+      std::vector<dval> scratch;
 
       inline bool violate_constraint(const dtest_case& test_case, const std::vector<std::pair<std::size_t, dval>>& constraint);
-      inline bool violate_constraint(const std::vector<param>& test_case, const std::vector<std::pair<std::size_t, dval>>& constraint);
+      inline bool violate_constraints_(const dtest_case &test_case);
 
     public:
       SimpleConstraintHandler(std::vector<dval>& ranges, std::vector<std::vector<dval>>& pconstraints);

data/lib/dither/version.rb

@@ -1,4 +1,4 @@
 
 module Dither
-  VERSION = '0.2.0.rc4'
+  VERSION = '0.2.0.rc5'
 end

data/lib/dither.rb

@@ -62,7 +62,7 @@ module Dither
         end
         arr = Array.new(params.size)
         (0...params.size).each do |i|
-          arr[i] = params[i].find(test_case[i]).first
+          arr[i] = params[i].find_index(test_case[i])
         end
         tested_scratch.write_array_of_int(arr)
         Dither::API.dither_ipog_add_previously_tested(pointer, tested_scratch, params.size)
@@ -97,7 +97,7 @@ require 'dither/graph'
 if RUBY_PLATFORM =~ /java/
   require 'java'
   require 'choco-solver-3.3.1-with-dependencies.jar'
-  require 'dither-0.1.3.jar'
+  require 'dither-0.1.4.jar'
 
   require 'dither/java_ext/dither'
 else

data/spec/dither/dither_spec.rb

@@ -63,7 +63,7 @@ describe Dither do
   end
 
   it 'can compute 3-way ipog with constraints' do
-    params = [(0...2).to_a, (0...2).to_a, (0..3).to_a]
+    params = [[:a, :b], (0...2).to_a, (0..3).to_a]
     results = Dither.ipog(params, :t => 3,
                        :constraints => [
                          {0 => 0,
@@ -71,16 +71,16 @@ describe Dither do
                          {0 => 0,
                           1 => 1,
                           2 => 0}],
-                        :previously_tested => [[0, 0, 0]]
+                        :previously_tested => [[:a, 0, 0]]
                       )
     results.each do |result|
-      expect(result[0] == 0 && result[1] == 1 && result[2] == 0).to be false
+      expect(result[0] == :a && result[1] == 1 && result[2] == 0).to be false
     end
     results.each do |result|
-      expect(result[0] == 0 && result[1] == 2).to be false
+      expect(result[0] == :a && result[1] == 2).to be false
     end
     results.each do |result|
-      expect(result[0] == 0 && result[1] == 0 && result[2] == 0).to be false
+      expect(result[0] == :a && result[1] == 0 && result[2] == 0).to be false
     end
   end
 

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: dither
 version: !ruby/object:Gem::Version
-  version: 0.2.0.rc4
+  version: 0.2.0.rc5
 platform: ruby
 authors:
 - Jason Gowan
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-12-10 00:00:00.000000000 Z
+date: 2015-12-11 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rspec
@@ -140,7 +140,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: 1.3.1
 requirements: []
 rubyforge_project: dither
-rubygems_version: 2.2.0
+rubygems_version: 2.4.5.1
 signing_key: 
 specification_version: 4
 summary: Collection of test generation strategies