h8 0.2.5 → 0.3.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: d638cb92726ca7b7e5cf94306a606c428b7aa7d1
-  data.tar.gz: be70554d03f25f31871996b9db620554ff3e24e9
+  metadata.gz: 38c8f3b25b694cb718a7be51eb9ad7cdb3796d7a
+  data.tar.gz: 548f468f6a4dec9f63bd5de2fe6eff950a51b5b2
 SHA512:
-  metadata.gz: a31f32aa2c9c13a557908cba8153a2da1d4b3389f234d28ecc56883642df838669b07fab2fcad0f55cd7d5210f244bea2629134f27099e42a58d913970fe2044
-  data.tar.gz: 08ae8c723f45d2a3382edeac01e06c124c1bde60d2ae9bfb53032578fd21611e2620b9502a62b78a26d351d22132a6f66d670fdc8c74a96ddf4477a063cb4779
+  metadata.gz: 63ab563ae77b67b5b2a89e545e350736a6fc34a0ff22b7a74d796ce102c8bf98486c71201712e42275b0dbe1901f7473367cc772cb504da1fe0b99cb793dbaa6
+  data.tar.gz: d6a50a1bb8f933027f920fcca11be972922d6744ea95174409e99431a3255d1af34519d2d751b2cc51ecfadd0804cc6e153e1635c15b9eaa32ad4f56ed3f69c0

data/.gitignore

@@ -29,3 +29,4 @@ mkmf.log
 .*swo
 **/node_modules
 test.js
+benchmark/*.out

data/benchmark/README.md

@@ -0,0 +1,19 @@
+The most interesting benchmark is the classic knightsmove task. For 5 repitions 7x7 board on my i7
+it gives:
+
+    hybrid8/benchmark$ ruby knightsmove.rb
+    coffee	: 3.970693
+    ruby	: 13.152436 scaled: 65.76218
+    total	: 13.152677
+
+In other words, coffee and ruby rub in parallel (I have many cores) and coffee is roughly
+*17 times faster* than ruby.
+
+Moreover, if you run optimized C++ version, you'll have:
+
+    hybrid8/benchmark$ g++ -O3 --std=c++11 km.cpp && ./a.out
+    C++: 7.00417
+
+which is, in turn, *1.76 times slower than coffeescript!*
+
+The results are very inspiring, as for me.

data/benchmark/km.cpp

@@ -0,0 +1,141 @@
+#include <iostream>
+#include <iomanip>
+#include <vector>
+
+using namespace std;
+
+struct Point {
+    int row;
+    int col;
+};
+
+ostream& operator << (ostream& os, const Point& p) {
+    os << "[" << p.row << "," << p.col << "]";
+    return os;
+}
+
+/**
+ Smallest and fastest 2d array implementation. No checks. Nothing ;)
+ */
+template<class T>
+class Array2 {
+public:
+    Array2(unsigned rows,unsigned cols)
+    : rows_(rows), cols_(cols), data_(new T[rows*cols])
+    {
+    }
+
+    T& at(unsigned row, unsigned col) {
+        return data_[row*cols_ + col];
+    }
+
+    template<class P>
+    T& at(const P& p) {
+        return at(p.row, p.col);
+    }
+
+    const T& at(unsigned row, unsigned col) const {
+        return data_[row*cols_ + col];
+    }
+
+    void fill(const T& value) {
+        for( unsigned i=0; i<rows_*cols_; i++)
+            data_[i] = value;
+    }
+
+    unsigned rows() const { return rows_; }
+    unsigned cols() const { return cols_; }
+
+    ~Array2() {
+        delete data_;
+    }
+
+private:
+    Array2(const Array2&& copy) {}
+
+    unsigned rows_, cols_;
+    T* data_;
+};
+
+template <class T>
+ostream& operator <<(ostream& os,const Array2<T>& arr) {
+    for( unsigned i=0; i<arr.rows(); i++ ) {
+        for( unsigned j=0; j<arr.cols(); j++ ) {
+            os << setw(3) << arr.at(i,j);
+        }
+        os << endl;
+    }
+    return os;
+}
+
+static Point move_shifts[] = { {-2, +1}, {-1, +2}, {+1, +2}, {+2, +1}, {+2, -1}, {+1, -2}, {-1, -2},  {-2, -1} };
+static unsigned move_count = 8;
+
+class KM {
+public:
+    KM(unsigned rank)
+    : rank_(rank), board_(rank, rank)
+    {
+    }
+
+    bool solve() {
+        board_.fill(0);
+        depth_ = 0;
+        goal_ = rank_*rank_;
+        return step( {0, 0} );
+    }
+
+    const Array2<unsigned>& board() const { return board_; }
+private:
+
+    bool step(const Point& p) {
+        board_.at(p) = ++depth_;
+        if( depth_ >= goal_ )
+            return true;
+        for( Point m: moves(p) ) {
+            if( step(m) )
+                return true;
+        }
+        board_.at(p) = 0;
+        depth_--;
+        return false;
+    }
+
+    vector<Point> moves(const Point& pos) {
+        vector<Point> mm;
+        for( unsigned i=0; i<move_count; i++ ) {
+            // Optimizing the bottleneck:
+            const Point& m = move_shifts[i];
+            int r = pos.row + m.row;
+            if( r >= 0 && r < rank_ ) {
+                int c = pos.col + m.col;
+                if( c >= 0 && c < rank_ && board_.at(r,c) == 0 ) {
+                    mm.push_back({r,c});
+                }
+            }
+        }
+        return mm;
+    }
+
+    unsigned rank_, depth_, goal_;
+    Array2<unsigned> board_;
+};
+
+template<class S>
+void timing(const S& name,int repetitions, const std::function<void(void)>& block) {
+    clock_t start = clock();
+    while( repetitions-- > 0) {
+        block();
+    }
+    cout << name << ": " << ((clock() - start)/((double)CLOCKS_PER_SEC)) << endl;
+}
+
+int main(int argc, char** argv) {
+    cout << "starting\n";
+    timing( "C++", 5, [] {
+        KM km(7);
+        km.solve();
+//        cout << km.board() << endl;
+    });
+}
+

data/benchmark/knightsmove.coffee

@@ -4,11 +4,11 @@ pad = (n, len) ->
   res = ' '+res while res.length < len
   res
 
-shifts = [[-2, +1], [-1, +2], [+1, +2], [+2, +1], [+2, -1], [-2, -1]]
+shifts = [[-2, +1], [-1, +2], [+1, +2], [+2, +1], [+2, -1], [+1, -2], [-1, -2], [-2, -1]]
 
 class Solver
 
-  constructor: (@n, @left_free) ->
+  constructor: (@n) ->
     @nn = @n * @n
     @n2 = @n + @n
     @desk = []
@@ -19,7 +19,7 @@ class Solver
 
   solve: (r, c) ->
     @desk[r][c] = ++@depth
-    return true if @depth + @left_free >= @nn
+    return true if @depth >= @nn
     for [r1, c1] in @moves(r, c)
       return true if @solve(r1, c1)
     @desk[r][c] = 0
@@ -49,12 +49,12 @@ timing = (name, cb) ->
   console.log("#{name}: #{(new Date().getTime() - start)/1000}")
   res
 
-result = timing 'KN h8', ->
- new Solver(7, 3).toString()
-console.log result
+#result = timing 'KN h8', ->
+# new Solver(7, 3).toString()
+#console.log result
 
 
 
-# return (n, left) ->
-  # new Solver(n, left).toString()
+return (n, left) ->
+  new Solver(n, left).toString()
 

data/benchmark/{knigthsmove.rb → knightsmove.rb}

@@ -2,10 +2,9 @@ require './tools'
 
 class Solver
 
-  def initialize rank, leave_free=0
+  def initialize rank
     @n, @nn     = rank, rank*rank
     @n2         = @n+@n
-    @leave_free = leave_free
     @desk       = []
     @n.times { @desk << [0] * @n }
     @depth = 0
@@ -14,7 +13,7 @@ class Solver
 
   def solve r, c
     @desk[r][c] = (@depth+=1)
-    return true if @depth == @nn-@leave_free
+    return true if @depth >= @nn
     moves(r, c) { |r1, c1|
       return true if solve(r1, c1)
     }
@@ -23,7 +22,7 @@ class Solver
     false
   end
 
-  @@shifts = [[-2, +1], [-1, +2], [+1, +2], [+2, +1], [+2, -1], [-2, -1]]
+  @@shifts = [[-2, +1], [-1, +2], [+1, +2], [+2, +1], [+2, -1], [+1, -2], [-1, -2], [-2, -1]]
 
   def moves r, c
     @@shifts.each { |sr, sc|
@@ -52,13 +51,13 @@ end
 
 cs = js_context.eval coffee(:knightsmove)
 
-N, L = 7, 3
+N = 7
 
 res1 = res2 = 0
 timing('total') {
   tt = []
-  tt << Thread.start { timing('ruby') { res1 = Solver.new(N, L).to_s } }
-  tt << Thread.start { timing('coffee') { res2 = cs.call(N, L) } }
+  tt << Thread.start { timing('ruby', 1, 5) { res1 = Solver.new(N).to_s } }
+  tt << Thread.start { timing('coffee', 5) { res2 = cs.call(N) } }
   tt.each &:join
 }
 
@@ -68,4 +67,4 @@ if res1 != res2
   puts "Coffee:\n#{res2}"
 end
 
-puts res1
+# puts res1

data/benchmark/tools.rb

@@ -1,17 +1,29 @@
 require 'h8'
 
-def timing name
+def timing name, repetitions = 1, scale = 1
   s = Time.now
-  yield
-  puts "#{name}\t: #{Time.now - s}"
+  repetitions.times { yield }
+  t = Time.now - s
+  if scale != 1
+    puts "#{name}\t: #{t} scaled: #{t*scale}"
+  else
+    puts "#{name}\t: #{t}"
+  end
 rescue
   puts "*** #{$!}"
   raise
 end
 
+class Console
+  def log *args
+    puts args.join(' ')
+  end
+end
+
 def js_context
   cxt         = H8::Context.new
   cxt[:print] = -> (*args) { puts args.join(' ') }
+  cxt[:console] = Console
   cxt
 end
 

data/ext/h8/h8.cpp

@@ -7,7 +7,7 @@
 #include <ruby/thread.h>
 #include "ruby_gate.h"
 
-void h8::JsError::raise() {
+void h8::JsError::raise() const {
 	if (has_js_exception) {
 		VALUE ruby_exception;
 		{
@@ -39,7 +39,11 @@ void h8::JsError::raise() {
 	}
 }
 
-void h8::JsTimeoutError::raise() {
+const char* h8::JsError::what() const noexcept {
+	return reason;
+}
+
+void h8::JsTimeoutError::raise() const {
 	rb_raise(js_timeout_exception, "timeout expired");
 }
 
@@ -52,6 +56,8 @@ Local<Value> h8::H8::gateObject(VALUE ruby_value) {
 		} else
 			return gate->value();
 	}
+	if( ruby_value == Rundefined )
+		return v8::Undefined(isolate);
 	// Generic Ruby object
 	RubyGate *gate = new RubyGate(this, ruby_value);
 	return gate->handle(isolate);

data/ext/h8/h8.h

@@ -20,6 +20,8 @@ extern VALUE Rundefined;
 extern ID id_is_a;
 extern ID id_safe_call;
 
+VALUE protect_ruby(const std::function<VALUE()> &block);
+
 namespace h8 {
 
 /// Allocate ruby H8::Context class (wrapper for h8::H8), ruby utility function
@@ -50,7 +52,7 @@ public:
 	/**
 	 * Call it with a proper exception class and be careful - after this call no code will be executed!
 	 */
-	virtual void raise();
+	virtual void raise() const;
 
 	Local<Message> message() const;
 
@@ -58,7 +60,9 @@ public:
 
 	Local<Value> stacktrace() const;
 
-	virtual ~JsError() noexcept {
+	virtual const char* what() const noexcept;
+
+	virtual ~JsError() {
 		_message.Reset();
 		_exception.Reset();
 	}
@@ -75,7 +79,7 @@ public:
 	JsTimeoutError(H8* h8) :
 			JsError(h8, NULL) {
 	}
-	virtual void raise();
+	virtual void raise() const;
 };
 
 class H8 {
@@ -91,12 +95,9 @@ public:
 
 	public:
 		Scope(H8* cxt) :
-				locker(cxt->getIsolate()),
-				handle_scope(cxt->getIsolate()),
-				isolate_scope(cxt->getIsolate()),
-				context_scope(cxt->getContext()),
-				rcontext(cxt)
-		{
+				locker(cxt->getIsolate()), handle_scope(cxt->getIsolate()), isolate_scope(
+						cxt->getIsolate()), context_scope(cxt->getContext()), rcontext(
+						cxt) {
 		}
 	};
 
@@ -125,9 +126,11 @@ public:
 	 * 				 to this value, JsTimeoutError will be thrown if exceeded
 	 * \return the value returned by the script.
 	 */
-	Handle<Value> eval(const char* script_utf, unsigned max_ms = 0,const char* script_name=NULL);
+	Handle<Value> eval(const char* script_utf, unsigned max_ms = 0,
+			const char* script_name = NULL);
 
-	VALUE eval_to_ruby(const char* script_utf, int timeout = 0,const char* script_name=NULL) {
+	VALUE eval_to_ruby(const char* script_utf, int timeout = 0,
+			const char* script_name = NULL) {
 		// TODO: throw ruby exception on error
 		return to_ruby(eval(script_utf, timeout, script_name));
 	}
@@ -161,7 +164,8 @@ public:
 
 	void gc() {
 //		puts("H8 GC");
-		while(!isolate->IdleNotification(500)) {}
+		while (!isolate->IdleNotification(500)) {
+		}
 	}
 
 	Local<Value> to_js(VALUE ruby_value) {
@@ -176,6 +180,10 @@ public:
 			return v8::Undefined(isolate);
 		case T_NIL:
 			return v8::Null(isolate);
+		case T_TRUE:
+			return v8::True(isolate);
+		case T_FALSE:
+			return v8::False(isolate);
 		case T_ARRAY:
 		case T_HASH:
 		case T_DATA:
@@ -202,15 +210,21 @@ public:
 
 	void ruby_mark_gc() const;
 
-	bool isGvlReleased() const noexcept { return gvl_released; }
+	bool isGvlReleased() const noexcept {
+		return gvl_released;
+	}
 
-	void setGvlReleased(bool state) noexcept { gvl_released = state; }
+	void setGvlReleased(bool state) noexcept {
+		gvl_released = state;
+	}
 
 	void setInterrupted() {
 		rb_interrupted = true;
 	}
 
-	bool isInterrupted() const { return rb_interrupted; }
+	bool isInterrupted() const {
+		return rb_interrupted;
+	}
 
 	virtual ~H8();
 
@@ -244,7 +258,7 @@ inline h8::JsError::JsError(H8* h8, Local<Message> message,
 		Local<Value> exception) :
 		h8(h8), _message(h8->getIsolate(), message), _exception(
 				h8->getIsolate(), exception), has_js_exception(true), reason(
-				NULL) {
+		NULL) {
 }
 
 inline Local<Message> h8::JsError::message() const {

data/ext/h8/js_catcher.cpp

@@ -15,11 +15,10 @@ JsCatcher::JsCatcher(H8* h8) : h8(h8), v8::TryCatch(h8->getIsolate()) {}
 void JsCatcher::throwIfCaught() {
 	if( HasCaught() ) {
 		if( h8->isInterrupted() ) {
-			puts("INTERRUPTED!");
 			throw JsError(h8, "interrupted");
 		}
-		if( !CanContinue() && HasTerminated() ) {
-//		if( HasTerminated() ) {
+//		if( !CanContinue() && HasTerminated() ) {
+		if( HasTerminated() ) {
 			throw JsTimeoutError(h8);
 		}
 		throw JsError(h8, Message(), Exception());

data/ext/h8/js_gate.h

@@ -263,6 +263,12 @@ VALUE h8::JsGate::to_ruby(H8* h8, const Handle<T>& value) {
 	if( v->IsUndefined()) {
 		return Rundefined;
 	}
+	if( v->IsTrue() ) {
+		return Qtrue;
+	}
+	if( v->IsFalse() ) {
+		return Qfalse;
+	}
 	if( v->IsNull() ) {
 		return Qnil;
 	}

data/ext/h8/main.cpp

@@ -21,7 +21,12 @@ VALUE protect_ruby(const std::function<VALUE()> &block) {
 	try {
 		return block();
 	} catch (JsError& e) {
-		e.raise();
+		try {
+			e.raise();
+		}
+		catch(...) {
+			rb_raise(js_exception, "error while converting JS exception (pls report a bug)");
+		}
 	} catch (...) {
 		rb_raise(rb_eStandardError, "unknown error in JS");
 	}
@@ -126,13 +131,14 @@ inline H8* rc(VALUE self) {
 	return prcxt;
 }
 
-static VALUE context_eval(VALUE self, VALUE script,VALUE timeout,VALUE script_name_ruby) {
+static VALUE context_eval(VALUE self, VALUE script, VALUE timeout,
+		VALUE script_name_ruby) {
 	return protect_ruby([&] {
-		H8* cxt = rc(self);//		v8::Locker l(cxt->getIsolate());
-		H8::Scope s(cxt);
-		const char* script_name = script_name_ruby != Qnil ? StringValueCStr(script_name_ruby) : NULL;
-		return cxt->eval_to_ruby(StringValueCStr(script), FIX2INT(timeout), script_name);
-	});
+		H8* cxt = rc(self); //		v8::Locker l(cxt->getIsolate());
+			H8::Scope s(cxt);
+			const char* script_name = script_name_ruby != Qnil ? StringValueCStr(script_name_ruby) : NULL;
+			return cxt->eval_to_ruby(StringValueCStr(script), FIX2INT(timeout), script_name);
+		});
 }
 
 static VALUE context_set_var(VALUE self, VALUE name, VALUE value) {
@@ -185,7 +191,8 @@ void Init_h8(void) {
 	rb_define_method(context_class, "_eval", (ruby_method) context_eval, 3);
 	rb_define_method(context_class, "_set_var", (ruby_method) context_set_var,
 			2);
-	rb_define_method(context_class, "javascript_gc", (ruby_method) context_force_gc, 0);
+	rb_define_method(context_class, "javascript_gc",
+			(ruby_method) context_force_gc, 0);
 
 	value_class = rb_define_class_under(h8, "Value", rb_cObject);
 	rb_define_alloc_func(value_class, rvalue_alloc);
@@ -214,7 +221,8 @@ void Init_h8(void) {
 
 	h8_exception = rb_define_class_under(h8, "Error", rb_eStandardError);
 	js_exception = rb_define_class_under(h8, "JsError", h8_exception);
-	js_timeout_exception = rb_define_class_under(h8, "TimeoutError", js_exception);
+	js_timeout_exception = rb_define_class_under(h8, "TimeoutError",
+			js_exception);
 
 	VALUE u_class = rb_define_class_under(h8, "UndefinedClass", rb_cObject);
 	Rundefined = rb_funcall(u_class, rb_intern("instance"), 0);

data/ext/h8/object_wrap.h

@@ -111,7 +111,7 @@ protected:
 private:
 	static void WeakCallback(
 			const v8::WeakCallbackData<v8::Object, ObjectWrap>& data) {
-		puts("WEAK CALLBACK!!");
+//		puts("WEAK CALLBACK!!");
 		v8::Isolate* isolate = data.GetIsolate();
 		v8::HandleScope scope(isolate);
 		ObjectWrap* wrap = data.GetParameter();

data/ext/h8/ruby_gate.cpp

@@ -106,14 +106,30 @@ void h8::RubyGate::rescued_call(VALUE rb_args, VALUE (*call)(VALUE),
 		const std::function<void(VALUE)> &block) {
 	VALUE res;
 	{
-		Unlocker u(context->getIsolate());
 		last_ruby_error = Qnil;
 		VALUE me = Data_Wrap_Struct(ruby_gate_class, 0, 0, this);
+		Unlocker u(context->getIsolate());
 		res = rb_rescue((ruby_method) (call), rb_args,
 				(ruby_method) (rescue_callback), me);
 	}
-	if (last_ruby_error == Qnil)
-		block(res);
+
+	if (last_ruby_error == Qnil) {
+		// This could be removed later, as normally here shouldn't be any
+		// exceptions...
+		try {
+			block(res);
+		}
+		catch(JsError& e) {
+			Local<v8::Object> error = v8::Exception::Error(
+					context->js(e.what())).As<v8::Object>();
+			context->getIsolate()->ThrowException(error);
+		}
+		catch(...) {
+			Local<v8::Object> error = v8::Exception::Error(
+					context->js("unknown exception (inner bug)")).As<v8::Object>();
+			context->getIsolate()->ThrowException(error);
+		}
+	}
 	else
 		throw_js();
 }

data/lib/h8/context.rb

@@ -59,7 +59,7 @@ module H8
     end
 
     # Secure gate for JS to securely access ruby class properties (methods with no args)
-    # and methods. This class implements security policy! Overriding this method could
+    # and methods. This class implements security policy. Overriding this method could
     # breach security and provide full access to ruby object trees.
     #
     # It has very complex logic so the security model update should be done somehow
@@ -68,7 +68,8 @@ module H8
       method = method.to_sym
       begin
         m = instance.public_method(method)
-        if m.owner == instance.class
+        owner = m.owner
+        if owner != Object.class && owner != Kernel && owner != BasicObject.class
           return m.call(*args) if method[0] == '[' || method[-1] == '='
           if m.arity != 0
             return -> (*args) { m.call *args }

data/lib/h8/version.rb

@@ -1,3 +1,3 @@
 module H8
-  VERSION = "0.2.5"
+  VERSION = "0.3.0"
 end

data/spec/ruby_gate_spec.rb

@@ -60,13 +60,25 @@ describe 'ruby gate' do
     GC.start
   end
 
-  it 'should convert nil' do
+  it 'should convert nil, true, false and undefined' do
     cxt      = H8::Context.new
+    value = false
     cxt[:fn] = -> {
-      nil
+      [nil, true, false, value, H8::Undefined]
     }
-    cxt.eval('fn();').should == nil
-    cxt.eval('""+fn()').should == 'null'
+    cxt.eval('true').should == true
+    cxt.eval('fn();').should == [nil, true, false, false, H8::Undefined]
+    cxt.eval('""+fn()[0]').should == 'null'
+    # cxt.eval("fn().join(',').toString()").should == ',true,false,false,undefined'
+    expect(cxt.eval("(fn()[4] == undefined).toString()")).to eql 'true'
+    expect(cxt.eval("(fn()[0] == undefined).toString()")).to eql 'true'
+    cxt.eval("(fn()[1])").should == true
+    cxt.eval("(fn()[2])").should == false
+    cxt.eval("(fn()[3])").should == false
+    cxt.eval("(fn()[4])").should == H8::Undefined
+    cxt.eval("(fn()[0])").should == nil
+    cxt.eval('true').inspect.should == 'true'
+    cxt.eval('false').inspect.should == 'false'
   end
 
   it 'should convert strings to native string' do
@@ -173,7 +185,7 @@ describe 'ruby gate' do
   context 'accessing ruby code' do
     class Base
       def base
-        raise "It should not be called"
+        'base called'
       end
 
       attr_accessor :do_throw
@@ -227,8 +239,14 @@ describe 'ruby gate' do
       cxt[:foo] = Test.new
       cxt.eval('foo.ro').should == 'readonly'
       cxt.eval('foo.rw').should == 'not initialized'
-      cxt.eval('foo.base').should == H8::Undefined
+      cxt.eval('foo.base').should == 'base called'
       cxt.eval('foo.send').should == H8::Undefined
+      cxt.eval('foo.freeze').should == H8::Undefined
+      cxt.eval('foo.dup').should == H8::Undefined
+      cxt.eval('foo.eval').should == H8::Undefined
+      cxt.eval('foo.extend').should == H8::Undefined
+      cxt.eval('foo.instance_variable_get').should == H8::Undefined
+      cxt.eval('foo.object_id').should == H8::Undefined
       cxt.eval('foo.prot_method').should == H8::Undefined
       cxt.eval('foo.priv_method').should == H8::Undefined
       cxt.eval('foo.test_args').should be_kind_of(Proc)
@@ -243,7 +261,7 @@ describe 'ruby gate' do
       cxt.eval('foo.rw').should == 'hello'
     end
 
-    context 'no interceptors' do
+    context 'do interceptors' do
       class Test2 < Base
         attr :ro
         attr_accessor :rw
@@ -275,7 +293,7 @@ describe 'ruby gate' do
         cxt[:foo] = Test2.new
         cxt.eval('foo.ro').should == 'readonly'
         cxt.eval('foo.rw').should == 'not initialized'
-        cxt.eval('foo.base').should == H8::Undefined
+        cxt.eval('foo.base').should == 'base called'
         cxt.eval('foo.send').should == H8::Undefined
         cxt.eval('foo.prot_method').should == H8::Undefined
         cxt.eval('foo.priv_method').should == H8::Undefined

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: h8
 version: !ruby/object:Gem::Version
-  version: 0.2.5
+  version: 0.3.0
 platform: ruby
 authors:
 - sergeych
@@ -98,9 +98,11 @@ files:
 - LICENSE.txt
 - README.md
 - Rakefile
+- benchmark/README.md
 - benchmark/big.txt
+- benchmark/km.cpp
 - benchmark/knightsmove.coffee
-- benchmark/knigthsmove.rb
+- benchmark/knightsmove.rb
 - benchmark/process_text.coffee
 - benchmark/text_process.rb
 - benchmark/tools.rb