opal 0.2.2 → 0.3.0

data/opals/opal/runtime/lib/basic_object.rb

@@ -1,49 +0,0 @@
-# 
-# basic_object.rb
-# vienna
-# 
-# Created by Adam Beynon.
-# Copyright 2010 Adam Beynon.
-#
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to deal
-# in the Software without restriction, including without limitation the rights
-# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-# copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-# 
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-# 
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-# THE SOFTWARE.
-#
-
-class BasicObject
-    
-  def initialize
-    # puts "in basicobject initialize"
-  end
-  
-  def ==(obj)
-    `return #{self} === #{obj} ? #{self}.t : #{self}.f;`
-  end
-  
-  def equal? other
-    
-  end
-  
-  def !()
-    false
-  end
-  
-  def !=(other)
-    `return #{self == other}.r ? #{false} : #{true};`
-  end
-  
-end

data/opals/opal/runtime/lib/class.rb

@@ -1,54 +0,0 @@
-# 
-# class.rb
-# vienna
-# 
-# Created by Adam Beynon.
-# Copyright 2010 Adam Beynon.
-#
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to deal
-# in the Software without restriction, including without limitation the rights
-# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-# copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-# 
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-# 
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-# THE SOFTWARE.
-#
-
-class Class
-  
-  def include(mod)
-    `return #{self}.include(#{mod});`
-  end
-  
-  def extend(mod)
-    `return #{self}.extend(#{mod});`
-  end
-  
-  def allocate
-    `return new #{self}.allocator();`
-  end
-  
-  def self.new(super_class)
-    `return opal.__subclass("", #{super_class});`
-  end
-  
-  def new
-    obj = allocate
-    `#{obj}.$initialize.apply(#{obj}, arguments);`
-    obj
-  end
-  
-  def initialize
-    puts "in Class.new initialize"
-  end
-end

data/opals/opal/runtime/lib/dir.rb

@@ -1,36 +0,0 @@
-# 
-# dir.rb
-# vienna
-# 
-# Created by Adam Beynon.
-# Copyright 2010 Adam Beynon.
-#
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to deal
-# in the Software without restriction, including without limitation the rights
-# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-# copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-# 
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-# 
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-# THE SOFTWARE.
-#
-
-class Dir
-  
-  def self.getwd
-    `return opal.getwd;`
-  end
-  
-  def self.glob(glob)
-    `return opal.glob_files(#{glob});`
-  end
-end

data/opals/opal/runtime/lib/error.rb

@@ -1,49 +0,0 @@
-# 
-# error.rb
-# vienna
-# 
-# Created by Adam Beynon.
-# Copyright 2010 Adam Beynon.
-#
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to deal
-# in the Software without restriction, including without limitation the rights
-# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-# copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-# 
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-# 
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-# THE SOFTWARE.
-#
-
-
-class Exception
-  
-  def message
-    @message
-  end
-  
-  def initialize(message)
-    `if (!#{message}) {
-      #{message} = #{nil};
-    }`
-    @message = message
-  end
-end
-
-
-class RuntimeError < Exception
-  
-end
-
-class StandardError < Exception
-  
-end

data/opals/opal/runtime/lib/false_class.rb

@@ -1,52 +0,0 @@
-# 
-# false_class.rb
-# vienna
-# 
-# Created by Adam Beynon.
-# Copyright 2010 Adam Beynon.
-#
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to deal
-# in the Software without restriction, including without limitation the rights
-# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-# copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-# 
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-# 
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-# THE SOFTWARE.
-#
-
-class FalseClass
-  
-  def inspect
-    "false"
-  end
-  
-  def to_s
-    "false"
-  end
-  
-  def !()
-    true
-  end
-  
-  def &(other)
-    false
-  end
-  
-  def |(other)
-    other ? true : false
-  end
-  
-  def ^(other)
-    other ? true : false
-  end
-end

data/opals/opal/runtime/lib/file.rb

@@ -1,79 +0,0 @@
-# 
-# file.rb
-# vienna
-# 
-# Created by Adam Beynon.
-# Copyright 2010 Adam Beynon.
-#
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to deal
-# in the Software without restriction, including without limitation the rights
-# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-# copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-# 
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-# 
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-# THE SOFTWARE.
-#
-
-class File
-  
-  # class << self
-    
-  # end
-  
-  def self.join(*parts)
-    `return #{parts}.join("/");`
-  end
-  
-  # Returns all components of the filename given in `file_name` except the last
-  # one. The filename must be formed using forward slashed ("/") regardless of
-  # the separator used on the local filesystem.
-  # 
-  # @example
-  #   File.dirname "home/adam/work/ruby.rb"
-  #   # => "/home/adam/work"
-  # 
-  # @param [String] file_name
-  # @return [String]
-  def self.dirname(file_name)
-    `return #{file_name}.substr(0, #{file_name}.lastIndexOf('/'));`
-  end
-  
-  def self.expand_path(path = "")
-    `var start_slash = (#{path}[0] === "/");
-    var parts = #{path}.split("/");
-    var result = [];
-    var part;
-    for (var i = 0; i < parts.length; i++) {
-      part = parts[i];
-      switch (part) {
-        case '..':
-          result.pop();
-          break;
-        case '.':
-          break;
-        case '':
-          break;
-        default:
-          result.push(part);
-      }
-    }
-    
-    if (start_slash) {
-      // if we started with a slash, use that
-      return "/" + result.join("/");
-    } else {
-      // otherwise join with our current working dir
-      return opal.getwd + "/" + result.join("/");
-    }`
-  end
-end

data/opals/opal/runtime/lib/hash.rb

@@ -1,791 +0,0 @@
-# 
-# hash.rb
-# vienna
-# 
-# Created by Adam Beynon.
-# Copyright 2010 Adam Beynon.
-#
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to deal
-# in the Software without restriction, including without limitation the rights
-# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-# copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-# 
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-# 
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-# THE SOFTWARE.
-#
-
-# A {Hash} is a collection of key-value pairs. It is similar to an {Array}, 
-# except that indexing is done via arbitrary keys of any object type, not an
-# integer index. Hashes enumerate their values in the order that the 
-# corresponding keys were inserted. 
-# 
-# Hashes have a default value that is returned when accessing keys that do not
-# exist in the hash. By default, that value is `nil`.
-class Hash
-  
-  # Creates a new hash populated with the given objects. Equivalent to the 
-  # literal `{ key => value, ... }`. 
-  # 
-  # @example
-  #   Hash["a", 100, "b", 200]
-  #   # => {"a" =>100, "b"=>200}
-  # 
-  # @return [Hash]
-  def self.[](*all)
-    `return vnH.apply(#{self}, #{all});`
-  end
-  
-  # Equality - Two hashes are equal if they each contain the same number of keys
-  # and if each key-value pair is equal to (according to {Object#==}) the
-  # corresponding elements in the other hash.
-  # 
-  # @example
-  #   h1 = {"a" => 1, "c" => 2}
-  #   h2 = {7 => 35, "c" => 2, "a" => 1}
-  #   h3 = {"a" => 1, "c" => 2, 7 => 35}
-  #   h4 = {"a" => 1, "d" => 2, "f" => 35}
-  #   h1 == h2
-  #   # => false
-  #   h2 == h3
-  #   # => true
-  #   h3 == h4
-  #   # => false
-  # 
-  # @param [Hash] other another hash to comapre
-  # @return [Boolean]
-  def ==(other)
-    `if (#{self} === #{other}) return #{true};
-    if (!(#{other}.info & #{self}.TH)) return #{false}
-    if (#{self}.__keys__.length !== #{other}.__keys__.length) return #{false};
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      var key = #{self}.__keys__[i].hash();
-      if (!(#{self}.__assocs__[key]['$=='](#{other}.__assocs__[key]).r)) return #{false};
-    }`
-    true
-  end
-  
-  alias_method :eql?, :==
-  
-  # Element Reference - retrieves the `value` object corresponding to the `key`
-  # object. If not found, returns the default value.
-  # 
-  # @example
-  #   h = {"a" => 100, "b" => 200}
-  #   h["a"]
-  #   # => 100
-  #   h["c"]
-  #   # => nil
-  # 
-  # @param [Object] key key to look for
-  # @return [Object] result or default value
-  def [](key)
-    `return #{self}.hash_fetch(#{key});`
-  end
-  
-  # Element Assignment - Associates the value give by `value` with the key given
-  # by `key`. `key` should not have its value changed while it is in use as a
-  # key.
-  # 
-  # @example
-  #   h = {"a" => 100, "b" => 200}
-  #   h["a"] = 9
-  #   # => 9
-  #   h["c"] = 4
-  #   # => 4
-  #   h
-  #   # => {"a" => 9, "b" => 200, "c" => 4}
-  # 
-  # @param [Object] key key for hash
-  # @param [Object] value value for key
-  # @return [Object] returns the value
-  def []=(key, value)
-    `return #{self}.hash_store(#{key}, #{value});`
-  end
-  
-  alias_method :store, :[]=
-  
-  # Searches through the hash comparing `obj` with the key using ==. Returns the
-  # key-value pair (two elements array) or nil if no match is found. See
-  # {Array#assoc}.
-  # 
-  # @example
-  #   h = { "a" => [1, 2, 3], "b" => [4, 5, 6] }
-  #   h["a"]
-  #   # => ["a", [1, 2, 3]]
-  #   h["c"]
-  #   # => nil
-  # 
-  # @param [Object] obj key to search for
-  # @return [Array<Object, Object>, nil] result or nil
-  def assoc(obj)
-    `var key;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      if (key['$=='](#{obj}).r) {
-        return [key, #{self}.__assocs__[key.hash()]];
-      }
-    }`
-    nil
-  end
-  
-  # Removes all key-value pairs from `self`.
-  # 
-  # @example
-  #   h = { "a" => [1, 2, 3], "b" => [4, 5, 6] }
-  #   h.clear
-  #   # => {}
-  # 
-  # @return [Hash] returns receiver
-  def clear
-    `#{self}.__keys__ = [];
-    #{self}.__assocs__ = {};`
-    self
-  end
-  
-  # Returns the default value, the value that would be returned by hsh[key] if
-  # key did not exist in hsh.
-  # 
-  # @example
-  #   h = Hash.new          # => {}
-  #   h.default             # => nil
-  #   h.default(2)          # => nil
-  # 
-  #   h = Hash.new 'cat'    # => {}
-  #   h.default             # => 'cat'
-  #   h.default(2)          # => 'cat'
-  # 
-  # @todo Using block as default does not currently work
-  # 
-  # @param [Object] key to check with
-  # @return [Object] returns default
-  def default(key = nil)
-    `return #{self}.__default__;`
-  end
-  
-  # Sets the default value, the value returned for a key that does not exist in
-  # the hash. It is not possible to set the default to a {Proc} that will be
-  # executed on each key lookup.
-  # 
-  # @example
-  #   h = { "a" => 100, "b" => 200 }
-  #   h.default = "Go fish"
-  #   h['a']
-  #   # => 100
-  #   h['z']
-  #   # => "Go fish"
-  # 
-  # @param [Object] obj the new default
-  # @return [Object] returns the default value
-  def default=(obj)
-    `return #{self}.__default__ = #{obj};`
-  end
-  
-  # Deletes and returns a key-value pair from `self` whose key is equal to
-  # `key`. If the key is not found, returns the default value. If the optional
-  # code block is given and the key is not found, pass in the key and return
-  # the result of `block`.
-  # 
-  # @todo Use with block functionality not yet implemented.
-  # 
-  # @example
-  #   h = { "a" => 100,  "b" => 200}
-  #   h.delete("a")
-  #   # => 100
-  #   h.delete("z")
-  #   # => nil
-  # 
-  # @param [Object] key to delete
-  # @return [Object] returns value or default value
-  def delete(key)
-    `return #{self}.hash_delete(#{key});`
-  end
-  
-  # Deletes every key-pair value from `self` for which block evaluates to   
-  # `true`.
-  # 
-  # If no block is given, an enumerator is returned instead.
-  # 
-  # @todo Enumerator functionality not yet implemented.
-  # 
-  # @example
-  #   h = { "a" => 100, "b" => 200, "c" => 300 }
-  #   h.delete_if { |key, value| key >= "b" }
-  #   # => { "a" => 100 }
-  # 
-  # @return [Hash] returns receiver
-  def delete_if(&block)
-    `var key, value;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      value = #{self}.__assocs__[key.hash()];
-      if (#{block}.apply(#{block}.__self__, [key, value]).r) {
-        #{self}.hash_delete(key);
-        i--;
-      };
-    }`
-    self
-  end
-  
-  # Calls `block` once for each key in `self`, passing the key-value pair as
-  # parameters.
-  # 
-  # If no block is given, an enumerator is returned instead.
-  # 
-  # @todo Enumerator functionality not yet implemented.
-  # 
-  # @example
-  #   h = { "a" => 100, "b" => 200 }
-  #   h.each { |k, v| puts "#{k} is #{v}" }
-  #   # => "a is 100"
-  #   # => "b is 200"
-  # 
-  # @return [Hash] returns reciever
-  def each(&block)
-    `var key, value;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      value = #{self}.__assocs__[key.hash()];
-      #{block}.apply(#{block}.__self__, [key, value]);
-    }`
-    self
-  end
-  
-  alias_method :each_pair, :each
-  
-  # Calls block once for each key in `self`, passing key as a parameter.
-  # 
-  # @example
-  #   h = { "a" => 100, "b" => 200 }
-  #   h.each_key { |key| puts key }
-  #   # => "a"
-  #   # => "b"
-  # 
-  # @return [Hash] returns receiver
-  def each_key(&block)
-    `var key;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      #{block}.apply(#{block}.__self__, [key]);
-    }`
-    self
-  end
-  
-  # Calls `block` once for each key in `hsh`, passing the value as a parameter.
-  # 
-  # @example
-  #   h = { "a" => 100, "b" => 200 }
-  #   h.each_value { |value| puts value }
-  #   # => 100
-  #   # => 200
-  # 
-  # @return [Hash] returns receiver
-  def each_value(&block)
-    `var key, value;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      value = #{self}.__assocs__[key.hash()];
-      #{block}.apply(#{block}.__self__, [value]);
-    }`
-    self
-  end
-  
-  # Returns true if `self` contains no key-value pairs.
-  # 
-  # @example
-  #   {}.empty?
-  #   # => true
-  # 
-  # @return [Boolean]
-  def empty?
-    `return #{self}.__keys__.length == 0 ? #{true} : #{false};`
-  end
-  
-  # Returns a value from the hash for the given key. If the key can't be found,
-  # there are several options: With no other arguments, it will raise an
-  # KeyError exception; if `default` is given, then that will be returned; if 
-  # the optional code block is specified, then that will be run and its result
-  # returned.
-  # 
-  # @example
-  #   h = { "a" => 100, "b" => 200 }
-  #   h.fetch("a")
-  #   # => 100
-  #   h.fetch("z", "Go fish")
-  #   # => "Go fish"
-  #   h.fetch("z") { |el| "Go fish, #{el}" }
-  #   # => "Go fish, z"
-  #   h.fetch("z")
-  #   # => (opal):2: in `fetch`: key not found (KeyError)
-  # 
-  # @param [Object] key the key to lookup
-  # @param [Object] defaults the default value to return
-  # @return [Object] value from hash
-  def fetch(key, defaults)
-    `var value = #{self}.__assocs__[#{key}.hash()];
-    if (value !== undefined) {
-      return value;
-    } else if (#{defaults} === undefined) {
-      throw "KeyError: key not found";
-    } else if (#{defaults}.info & #{self}.TP) {
-      return #{defaults}.apply(#{defaults}.__self__, [#{key}]);
-    } else {
-      return #{defaults};
-    }`
-  end
-  
-  # Returns a new array that is a one-dimensional flattening of this hash. That
-  # is, for every key or value that is an array, extract its elements into the
-  # new array. Unlike {Array#flatten}, this method does not flatten recursively
-  # by default. The optional `level` argument determines the level of 
-  # recursion to flatten.
-  # 
-  # @example
-  #   a = { 1 => "one", 2 => [2, "two"], 3 => "three" }
-  #   a.flatten
-  #   # => [1, "one", 2, [2, "two"], 3, "three"]
-  #   a.flatten(2)
-  #   # => [1, "one", 2, 2, "two", 3, "three"]
-  # 
-  # @param [Number] level the level to flatten until
-  # @return [Array] flattened hash
-  def flatten(level = 1)
-    `var result = [], key, value;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      value = #{self}.__assocs__[key.hash()];
-      result.push(key);
-      if (value.info & #{self}.TA) {
-        if (#{level} == 1) {
-          result.push(value);
-        } else {
-          var temp = value.$flatten(#{level} - 1);
-          result = result.concat(temp);
-        }
-      } else {
-        result.push(value);
-      }
-    }
-    return result;`
-  end
-  
-  # Returns `true` if the given `key` is present in `self`.
-  # 
-  # @example
-  #   h = { "a" => 100, "b" => 200 }
-  #   h.has_key? "a"
-  #   # => true
-  #   h.has_key? "b"
-  #   # => false
-  # 
-  # @param [Object] key the key to check for
-  # @return [Boolean]
-  def has_key?(key)
-    `return #{self}.__assocs__.hasOwnProperty(#{key}.hash()) ? #{true} : #{false};`
-  end
-  
-  alias_method :include?, :has_key?
-  alias_method :key?, :has_key?
-  alias_method :member?, :has_key?
-  
-  # Returns `true` if the given `value` is present for some key in `self`.
-  # 
-  # @example
-  #   h = { "a" => 100,  "b" => 200 }
-  #   h.has_value?(100)
-  #   # => true
-  #   h.has_value?(200)
-  #   # => false
-  # 
-  # @param [Object] value the value to check for
-  # @return [Boolean]
-  def has_value?(value)
-    `var key, val;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      val = #{self}.__assocs__[key.hash()];
-      if (value['$=='](val).r) {
-        return #{true};
-      };
-    }`
-    false
-  end
-  
-  alias_method :value?, :has_value?
-  
-  # Replaces the contents of `self` with the contents of `other_hash`.
-  # 
-  # @example
-  #   h = { "a" => 100, "b" => 200 }
-  #   h.replace({ "c" => 200, "d" => 300 })
-  #   # => { "c" => 200, "d" => 300 }
-  # 
-  # @param [Hash] other_hash hash for contents
-  # @return [Hash] returns receiver
-  def replace(other_hash)
-    `#{self}.__keys__ = [];
-    #{self}.__assocs__ = {};
-    for (var i = 0; i < #{other_hash}.__keys__.length; i++) {
-      key = #{other_hash}.__keys__[i];
-      val = #{other_hash}.__assocs__[key.hash()];
-      #{self}.hash_store(key, val)
-    }`
-    self
-  end
-  
-  # Returns the contents of this hash as a string.
-  # 
-  # @example
-  #   h = { "a" => 100, "b" => 200 }
-  #   # => "{ \"a\" => 100, \"b\" => 200 }"
-  # 
-  # @return [String]
-  def inspect
-    `var result = ['{'], key, value;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      value = #{self}.__assocs__[key.hash()];
-      if (i > 0) result.push(', ');
-      result.push(key.$inspect());
-      result.push('=>');
-      result.push(value.$inspect());
-    }
-    result.push('}');
-    return result.join('');`
-  end
-  
-  alias_method :to_s, :inspect
-  
-  # Returns a new hash created by using `self`'s values as keys, and the keys as
-  # values.
-  # 
-  # @example
-  #   h  = { "n" => 100, "m" => 100, "y" => 300, "d" => 200, "a" => 0 }
-  #   h.invert
-  #   # => { 0 => "a", 100 => "m", 200 => "d", 300 => "y" }
-  # 
-  # @return [Hash] inverted hash
-  def invert
-    `var res = vnH();
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      value = #{self}.__assocs__[key.hash()];
-      res.hash_store(value, key);
-    }
-    return res;`
-  end
-  
-  # Deletes every key-value pair from `self` for which block evaluates to 
-  # `false`.
-  # 
-  # If no block is given, an enumerator is returned instead.
-  # 
-  # @todo Enumerator functionality is not yet implemented.
-  # 
-  # @example
-  #   h = { "a" => 100, "b" => 200, "c" => 300 }
-  #   h.keep_if { |key, value| key == "b" }
-  #   # => { "b" => 200 }
-  # 
-  # @return [Hash] returns receiver
-  def keep_if(&block)
-    `var key, value;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      value = #{self}.__assocs__[key.hash()];
-      if (!#{block}.apply(#{block}.__self__, [key, value]).r) {
-        #{self}.hash_delete(key);
-        i--;
-      };
-    }`
-    self
-  end
-  
-  # Returns the key for a given value. If not found, returns `nil`.
-  # 
-  # @example
-  #   h = { "a" => 100, "b" => 200 }
-  #   h.key(200)
-  #   # => "b"
-  #   h.key(300)
-  #   # => nil
-  # 
-  # @param [Object] value to check for
-  # @return [Object] key or nil
-  def key(value)
-    `var key, val;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      val = #{self}.__assocs__[key.hash()];
-      if (value['$=='](val).r) {
-        return key;
-      };
-    }`
-    nil
-  end
-  
-  # Returns a new array populated with the keys from this hash. See also
-  # {Hash#values}.
-  # 
-  # @example
-  #   h = { "a" => 100, "b" => 200, "c" => 300 }
-  #   h.keys
-  #   # => ["a", "b", "c"]
-  # 
-  # @return [Array] keys
-  def keys
-    `return #{self}.__keys__.slice();`
-  end
-  
-  # Returns the number of key-value pairs in the hash.
-  # 
-  # @example
-  #   h = { "a" => 100, "b" => 200 }
-  #   h.length
-  #   # => 2
-  #   h.delete "a"
-  #   h.length
-  #   # => 1
-  # 
-  # @return [Number] length
-  def length
-    `return #{self}.__keys__.length;`
-  end
-  
-  alias_method :size, :length
-  
-  # Returns a new hash containing the contents of `other_hash` and the contents
-  # of `self`. If no block is specified, the value for entries with duplicate
-  # keys will be that of `other_hash`. Otherwise the value for each duplicate
-  # key is determined by calling the block with the key, its value in `self` and
-  # its valye in `other_hash`.
-  # 
-  # @todo Block functionality not yet implemented.
-  # 
-  # @example
-  #   h = { "a" => 100, "b" => 200 }
-  #   h2 = { "b" => 300, "c" => 400 }
-  #   h.merge(h2)
-  #   # => { "a" => 100, "b" => 300, "c" => 400 }
-  #   h
-  #   # => { "a" => 100, "b" => 200 }
-  # 
-  # @param [Hash] other_hash hash to merge
-  # @return [Hash] returns new hash with merged contents
-  def merge(other_hash)
-    `var result = vnH(), key, val;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      val = #{self}.__assocs__[key.hash()];
-      result.hash_store(key, val)
-    }
-    for (var i = 0; i < #{other_hash}.__keys__.length; i++) {
-      key = #{other_hash}.__keys__[i];
-      val = #{other_hash}.__assocs__[key.hash()];
-      result.hash_store(key, val)
-    }
-    return result;`
-  end
-  
-  # Adds the contents of `other_hash` to `self`. If no block is specified,
-  # entries with duplicate keys are overwritten with the values from
-  # `other_hash`, otherwise the value of each duplicate key is determined by
-  # calling the block with the key, its value in `self` and its value in
-  # `other_hash`.
-  # 
-  # @todo Block functionality not yet implemented.
-  # 
-  # @example
-  #   h = { "a" => 100, "b" => 200 }
-  #   h2 = { "b" => 300, "c" => 400 }
-  #   h.merge!(h2)
-  #   # => { "a" => 100, "b" => 300, "c" => 400 }
-  #   h
-  #   # => { "a" => 100, "b" => 300, "c" => 400 }
-  # 
-  # @param [Hash] other_hash hash to merge
-  # @return [Hash] returns receiver
-  def merge!(other_hash)
-    `var key, val;
-    for (var i = 0; i < #{other_hash}.__keys__.length; i++) {
-      key = #{other_hash}.__keys__[i];
-      val = #{other_hash}.__assocs__[key.hash()];
-      #{self}.hash_store(key, val)
-    }
-    return #{self};`
-  end
-  
-  alias_method :update, :merge!
-  
-  # Searches through the hash comapring obj with the value using ==. Returns the
-  # first key-value pair (two-element array) that matches. See also 
-  # {Array#rassoc}.
-  # 
-  # @example
-  #   a = { 1 => "one", 2 => "two", 3 => "three" }
-  #   a.rassoc "two"
-  #   # => [2, "two"]
-  #   a.rassoc "four"
-  #   # => nil
-  # 
-  # @param [Object] obj object to check
-  # @return [Array]
-  def rassoc(obj)
-    `var key, val;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      val = #{self}.__assocs__[key.hash()];
-      if (val['$=='](#{obj}).r) {
-        return [key, val];
-      }
-    }`
-    nil
-  end
-  
-  # Same as {Hash#delete_if}, but it works on (and returns) a copy of the hash.
-  # 
-  # @return [Hash]
-  def reject(&block)
-    `var result = vnH(), key, value;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      value = #{self}.__assocs__[key.hash()];
-      if (!#{block}.apply(#{block}.__self__, [key, value]).r) {
-        result.hash_store(key, value);
-      };
-    }
-    return result;`
-  end
-  
-  # Equivalent to {Hash#delete_if}, but returns `nil` if no changes were made.
-  # 
-  # @return [Hash]
-  def reject!(&block)
-    `var key, value, size = #{self}.__keys__.length;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      value = #{self}.__assocs__[key.hash()];
-      if (#{block}.apply(#{block}.__self__, [key, value]).r) {
-        #{self}.hash_delete(key);
-        i--;
-      };
-    }
-    return #{self}.__keys__.length == size ? #{nil} : #{self}`
-  end
-  
-  # Returns a new hash consisting of entries for which the block returns `true`.
-  # 
-  # @todo Need to implement Enumerator functionality (when no block given).
-  # 
-  # @example
-  #   h = { :a => 100, :b => 200, :c => 300 }
-  #   h.select { |k, v| k > "a" }
-  #   # => { :b => 200, :c => 300 }
-  #   h.select { |k, v| v < 200 }
-  #   # => { :a => 100 }
-  # 
-  # @return [Hash]
-  def select(&block)
-    `var result = vnH(), key, value;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      value = #{self}.__assocs__[key.hash()];
-      if (#{block}.apply(#{block}.__self__, [key, value]).r) {
-        result.hash_store(key, value);
-      };
-    }
-    return result;`
-  end
-  
-  # Equivalent to {Hash#keep_if}, but returns `nil` if no changes were made.
-  # 
-  # @return [Hash, nil]
-  def select!(&block)
-    `var key, value, size = #{self}.__keys__.length;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      value = #{self}.__assocs__[key.hash()];
-      if (!#{block}.apply(#{block}.__self__, [key, value]).r) {
-        #{self}.hash_delete(key);
-        i--;
-      };
-    }
-    return #{self}.__keys__.length == size ? #{nil} : #{self}`
-  end
-  
-  # Removes a key-value pair from `self` and returns it as the two-item array, 
-  # [key, value], or returns the hash's default value if the hash is empty.
-  # 
-  # @example
-  #   h = { :a => 1, :b => 2}
-  #   h.shift
-  #   # => [:a, 1]
-  #   h
-  #   # => {:b => 1}
-  #   {}.shift
-  #   # => nil
-  # 
-  # @return [Array, Object] array or default value
-  def shift
-    `var key, value;
-    if (#{self}.__keys__.length > 0) {
-      key = #{self}.__keys__[0];
-      value = #{self}.__assocs__[key.hash()];
-      #{self}.hash_delete(key);
-      return [key, value];
-    } else {
-      return #{self}.__default__;
-    }`
-  end
-  
-  # Convert `self` to a nested array of `[key, value]` arrays.
-  # 
-  # @example
-  #   h = { :a => 1, :b => 2, :c => 3 }
-  #   h.to_a
-  #   # => [[:a, 1], [:b, 2], [:c, 3]]
-  # 
-  # @return [Array]
-  def to_a
-    `var result = [], key, value;
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      key = #{self}.__keys__[i];
-      value = #{self}.__assocs__[key.hash()];
-      result.push([key, value]);
-    }
-    return result;`
-  end
-  
-  # Returns self.
-  # 
-  # @return [Hash] self
-  def to_hash
-    self
-  end
-  
-  # Returns a new array populated with the values from `self`.
-  # 
-  # @example
-  #   h = { :a => 1, :b => 2 }
-  #   h.values
-  #   # => [1, 2]
-  # 
-  # @return [Array]
-  def values
-    `var result = [];
-    for (var i = 0; i < #{self}.__keys__.length; i++) {
-      result.push(#{self}.__assocs__[#{self}.__keys__[i].hash()]);
-    }
-    return result;`
-  end
-
-end