opal 0.10.6 → 0.11.0.rc1

data/lib/opal/source_map.rb

@@ -1,4 +1,4 @@
-# require 'opal'
+# frozen_string_literal: true
 require 'source_map'
 
 module Opal

data/lib/opal/util.rb

@@ -1,3 +1,6 @@
+# frozen_string_literal: true
+require 'open3'
+
 module Opal
   module Util
     extend self
@@ -57,11 +60,8 @@ module Opal
 
     class DigestSourceCommand < Command
       def digest(source)
-        IO.popen("#{command} #{options} #{hide_stderr}", 'r+') do |i|
-          i.puts source
-          i.close_write
-          i.read
-        end
+        out, _, _ = Open3.capture3("#{command} #{options} #{hide_stderr}", stdin_data: source)
+        out
       end
     end
 

data/lib/opal/version.rb

@@ -1,5 +1,6 @@
+# frozen_string_literal: true
 module Opal
   # WHEN RELEASING:
   # Remember to update RUBY_ENGINE_VERSION in opal/corelib/constants.rb too!
-  VERSION = '0.10.6'
+  VERSION = '0.11.0.rc1'
 end

data/lib/tilt/opal.rb

@@ -1,3 +1,4 @@
+# frozen_string_literal: true
 require 'tilt'
 require 'opal/builder'
 require 'opal/config'

data/opal.gemspec

@@ -6,11 +6,11 @@ require 'opal/version'
 Gem::Specification.new do |s|
   s.name         = 'opal'
   s.version      = Opal::VERSION
-  s.author       = 'Adam Beynon'
-  s.email        = 'adam.beynon@gmail.com'
+  s.author       = ['Elia Schito', 'meh.', 'Adam Beynon']
+  s.email        = ['elia@schito.me', 'meh@schizofreni.co']
   s.homepage     = 'http://opalrb.org'
   s.summary      = 'Ruby runtime and core library for JavaScript'
-  s.description  = 'Ruby runtime and core library for JavaScript.'
+  s.description  = %{Opal is a Ruby to JavaScript compiler. It is source-to-source, making it fast as a runtime. Opal includes a compiler (which can be run in any browser), a corelib and runtime implementation. The corelib/runtime is also very small.}
   s.license      = 'MIT'
 
   s.files         = `git ls-files`.split("\n")
@@ -18,12 +18,12 @@ Gem::Specification.new do |s|
   s.test_files    = `git ls-files -- {test,spec,features}/*`.split("\n")
   s.require_paths = ['lib']
 
-  s.required_ruby_version = '>= 1.9.3'
+  s.required_ruby_version = '>= 2.0.0'
 
   s.add_dependency 'sourcemap', '~> 0.1.0'
-  s.add_dependency 'sprockets', '~> 3.1'
   s.add_dependency 'hike', '~> 1.2'
-  s.add_dependency 'tilt', '>= 1.4'
+  s.add_dependency 'ast', '>= 2.3.0'
+  s.add_dependency 'parser', '= 2.3.3.1'
 
   s.add_development_dependency 'mspec', '1.5.20'
   s.add_development_dependency 'rake'
@@ -34,5 +34,6 @@ Gem::Specification.new do |s|
   s.add_development_dependency 'yard', '~> 0.8.7'
   s.add_development_dependency 'rack-test'
   s.add_development_dependency 'opal-minitest'
-  s.add_development_dependency 'coveralls'
+  s.add_development_dependency 'selenium-webdriver'
+  s.add_development_dependency 'benchmark-ips'
 end

data/opal/README.md

@@ -3,7 +3,7 @@
 This is the Opal corelib implementation API documentation.
 The whole corelib is loaded upon `require 'opal'`.
 
-The `runtime.js` documentation is [available here](runtime.js.html)
+The `runtime.js` documentation is [available here](http://opalrb.org/docs/api/master/corelib/file.RUNTIME.html) (in master)
 
 # Cherry-picking
 

data/opal/corelib/array.rb

@@ -22,34 +22,36 @@ class Array < `Array`
   end
 
   def initialize(size = nil, obj = nil, &block)
-    if `arguments.length > 2`
-      raise ArgumentError, "wrong number of arguments (#{`arguments.length`} for 0..2)"
-    end
-
     %x{
+      if (size > #{Integer::MAX}) {
+        #{raise ArgumentError, "array size too big"}
+      }
+
+      if (arguments.length > 2) {
+        #{raise ArgumentError, "wrong number of arguments (#{`arguments.length`} for 0..2)"}
+      }
+
       if (arguments.length === 0) {
         self.splice(0, self.length);
         return self;
       }
-    }
 
-    if `arguments.length === 1`
-      if Array === size
-        replace(size.to_a)
-        return self
-      elsif size.respond_to? :to_ary
-        replace(size.to_ary)
-        return self
-      end
-    end
+      if (arguments.length === 1) {
+        if (size.$$is_array) {
+          #{replace(size.to_a)}
+          return self;
+        } else if (#{size.respond_to? :to_ary}) {
+          #{replace(size.to_ary)}
+          return self;
+        }
+      }
 
-    size = Opal.coerce_to size, Integer, :to_int
+      size = #{Opal.coerce_to size, Integer, :to_int}
 
-    if `size < 0`
-      raise ArgumentError, "negative array size"
-    end
+      if (size < 0) {
+        #{raise ArgumentError, "negative array size"}
+      }
 
-    %x{
       self.splice(0, self.length);
       var i, value;
 
@@ -159,7 +161,7 @@ class Array < `Array`
     end
 
     return [] if `self.length === 0`
-    return clone.to_a if `other.length === 0`
+    return `self.slice()` if `other.length === 0`
 
     %x{
       var result = [], hash = #{{}}, i, length, item;
@@ -268,72 +270,85 @@ class Array < `Array`
     }
   end
 
-  def [](index, length = undefined)
-    %x{
+  %x{
+    function $array_slice_range(self, index) {
       var size = self.length,
           exclude, from, to, result;
 
-      if (index.$$is_range) {
-        exclude = index.exclude;
-        from    = #{Opal.coerce_to `index.begin`, Integer, :to_int};
-        to      = #{Opal.coerce_to `index.end`, Integer, :to_int};
+      exclude = index.exclude;
+      from    = Opal.Opal.$coerce_to(index.begin, Opal.Integer, 'to_int');
+      to      = Opal.Opal.$coerce_to(index.end, Opal.Integer, 'to_int');
 
-        if (from < 0) {
-          from += size;
-
-          if (from < 0) {
-            return nil;
-          }
-        }
+      if (from < 0) {
+        from += size;
 
-        if (from > size) {
+        if (from < 0) {
           return nil;
         }
+      }
 
-        if (to < 0) {
-          to += size;
+      if (from > size) {
+        return nil;
+      }
 
-          if (to < 0) {
-            return [];
-          }
-        }
+      if (to < 0) {
+        to += size;
 
-        if (!exclude) {
-          to += 1;
+        if (to < 0) {
+          return [];
         }
+      }
 
-        result = self.slice(from, to)
+      if (!exclude) {
+        to += 1;
       }
-      else {
-        index = #{Opal.coerce_to(index, Integer, :to_int)};
 
-        if (index < 0) {
-          index += size;
+      result = self.slice(from, to);
+      return toArraySubclass(result, self.$class());
+    }
 
-          if (index < 0) {
-            return nil;
-          }
-        }
+    function $array_slice_index_length(self, index, length) {
+      var size = self.length,
+          exclude, from, to, result;
 
-        if (length === undefined) {
-          if (index >= size || index < 0) {
-            return nil;
-          }
+      index = Opal.Opal.$coerce_to(index, Opal.Integer, 'to_int');
 
-          return self[index];
+      if (index < 0) {
+        index += size;
+
+        if (index < 0) {
+          return nil;
         }
-        else {
-          length = #{Opal.coerce_to length, Integer, :to_int};
+      }
 
-          if (length < 0 || index > size || index < 0) {
-            return nil;
-          }
+      if (length === undefined) {
+        if (index >= size || index < 0) {
+          return nil;
+        }
+
+        return self[index];
+      }
+      else {
+        length = Opal.Opal.$coerce_to(length, Opal.Integer, 'to_int');
 
-          result = self.slice(index, index + length);
+        if (length < 0 || index > size || index < 0) {
+          return nil;
         }
+
+        result = self.slice(index, index + length);
       }
+      return toArraySubclass(result, self.$class());
+    }
+  }
 
-      return toArraySubclass(result, #{self.class})
+  def [](index, length = undefined)
+    %x{
+      if (index.$$is_range) {
+        return $array_slice_range(self, index);
+      }
+      else {
+        return $array_slice_index_length(self, index, length);
+      }
     }
   end
 
@@ -440,6 +455,14 @@ class Array < `Array`
     end
   end
 
+  def any?
+    if empty?
+      false
+    else
+      super
+    end
+  end
+
   def assoc(object)
     %x{
       for (var i = 0, length = self.length, item; i < length; i++) {
@@ -468,8 +491,8 @@ class Array < `Array`
     }
   end
 
-  def bsearch(&block)
-    return enum_for :bsearch unless block_given?
+  def bsearch_index(&block)
+    return enum_for :bsearch_index unless block_given?
 
     %x{
       var min = 0,
@@ -483,17 +506,17 @@ class Array < `Array`
       while (min < max) {
         mid = min + Math.floor((max - min) / 2);
         val = self[mid];
-        ret = block(val);
+        ret = Opal.yield1(block, val);
 
         if (ret === true) {
-          satisfied = val;
+          satisfied = mid;
           smaller = true;
         }
         else if (ret === false || ret === nil) {
           smaller = false;
         }
         else if (ret.$$is_number) {
-          if (ret === 0) { return val; }
+          if (ret === 0) { return mid; }
           smaller = (ret < 0);
         }
         else {
@@ -507,6 +530,20 @@ class Array < `Array`
     }
   end
 
+  def bsearch(&block)
+    return enum_for :bsearch unless block_given?
+
+    index = bsearch_index(&block)
+
+    %x{
+      if (index != null && index.$$is_number) {
+        return self[index];
+      } else {
+        return index;
+      }
+    }
+  end
+
   def cycle(n = nil, &block)
     return enum_for(:cycle, n) {
       if n == nil
@@ -793,6 +830,22 @@ class Array < `Array`
     self
   end
 
+  def dig(idx, *idxs)
+    item = self[idx]
+
+    %x{
+      if (item === nil || idxs.length === 0) {
+        return item;
+      }
+    }
+
+    unless item.respond_to?(:dig)
+      raise TypeError, "#{item.class} does not have #dig method"
+    end
+
+    item.dig(*idxs)
+  end
+
   def drop(number)
     %x{
       if (number < 0) {
@@ -1096,26 +1149,25 @@ class Array < `Array`
 
   def hash
     %x{
-      var top = (Opal.hash_ids == undefined),
+      var top = (Opal.hash_ids === undefined),
           result = ['A'],
           hash_id = self.$object_id(),
           item, i, key;
 
       try {
         if (top) {
-          Opal.hash_ids = {};
+          Opal.hash_ids = Object.create(null);
         }
 
-        if (Opal.hash_ids.hasOwnProperty(hash_id)) {
+        // return early for recursive structures
+        if (Opal.hash_ids[hash_id]) {
           return 'self';
         }
 
         for (key in Opal.hash_ids) {
-          if (Opal.hash_ids.hasOwnProperty(key)) {
-            item = Opal.hash_ids[key];
-            if (#{eql?(`item`)}) {
-              return 'self';
-            }
+          item = Opal.hash_ids[key];
+          if (#{eql?(`item`)}) {
+            return 'self';
           }
         }
 
@@ -1129,7 +1181,7 @@ class Array < `Array`
         return result.join(',');
       } finally {
         if (top) {
-          delete Opal.hash_ids;
+          Opal.hash_ids = undefined;
         }
       }
     }
@@ -1268,7 +1320,7 @@ class Array < `Array`
           }
         }
 
-        #{raise NoMethodError.new("#{Opal.inspect(`item`)} doesn't respond to #to_str, #to_ary or #to_s", 'to_str')};
+        #{raise NoMethodError.new("#{`Opal.inspect(item)`} doesn't respond to #to_str, #to_ary or #to_s", 'to_str')};
       }
 
       if (sep === nil) {
@@ -1342,7 +1394,9 @@ class Array < `Array`
 
   def permutation(num = undefined, &block)
     unless block_given?
-      return enum_for(:permutation, num){ `descending_factorial(self.length, num === undefined ? self.length : num)` }
+      return enum_for(:permutation, num) {
+        `descending_factorial(self.length, num === undefined ? self.length : num)`
+      }
     end
 
     %x{
@@ -1370,8 +1424,8 @@ class Array < `Array`
       }
       else {
         // this is the general case
-        #{ perm = Array.new(num) }
-        #{ used = Array.new(`self.length`, false) }
+        #{ perm = Array.new(num) };
+        #{ used = Array.new(`self.length`, false) };
 
         permute = function(num, perm, index, used, blk) {
           self = this;
@@ -1583,7 +1637,7 @@ class Array < `Array`
   def reverse_each(&block)
     return enum_for(:reverse_each){self.size} unless block_given?
 
-    reverse.each &block
+    reverse.each(&block)
     self
   end
 
@@ -1861,7 +1915,7 @@ class Array < `Array`
           }
         }
         else {
-          j = Math.floor(Math.random() * i);
+          j = #{rand(`i`)};
         }
 
         tmp = self[--i];