rusby 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 220468d5f249c9e28f702ff82cc05857fec824a3
+  data.tar.gz: ac156b073759a711c1889f0d4cdb39fedc823ff7
+SHA512:
+  metadata.gz: addbb61765e9957e47af6b79f28cbc17597144997e667728f71628d93a80c231e8e3ba0efc1b7806f851c194ab5560540c8de0dba746ad17ae8e4d1ee38e2ae2
+  data.tar.gz: 80795fd42665c369763f4d72ecba264a977ecd3c5cc808e08dc6aef13886770e597f93cbfebc1aaa6fee55a47ee359c7da59c5e7e166d7b412044867923b000e

data/.gitignore

@@ -0,0 +1,3 @@
+.byebug_history
+examples/tmp/rusby
+pkg

data/.travis.yml

@@ -0,0 +1,5 @@
+sudo: false
+language: ruby
+rvm:
+  - 2.2.2
+before_install: gem install bundler -v 1.12.4

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,49 @@
+# Contributor Code of Conduct
+
+As contributors and maintainers of this project, and in the interest of
+fostering an open and welcoming community, we pledge to respect all people who
+contribute through reporting issues, posting feature requests, updating
+documentation, submitting pull requests or patches, and other activities.
+
+We are committed to making participation in this project a harassment-free
+experience for everyone, regardless of level of experience, gender, gender
+identity and expression, sexual orientation, disability, personal appearance,
+body size, race, ethnicity, age, religion, or nationality.
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery
+* Personal attacks
+* Trolling or insulting/derogatory comments
+* Public or private harassment
+* Publishing other's private information, such as physical or electronic
+  addresses, without explicit permission
+* Other unethical or unprofessional conduct
+
+Project maintainers have the right and responsibility to remove, edit, or
+reject comments, commits, code, wiki edits, issues, and other contributions
+that are not aligned to this Code of Conduct, or to ban temporarily or
+permanently any contributor for other behaviors that they deem inappropriate,
+threatening, offensive, or harmful.
+
+By adopting this Code of Conduct, project maintainers commit themselves to
+fairly and consistently applying these principles to every aspect of managing
+this project. Project maintainers who do not follow or enforce the Code of
+Conduct may be permanently removed from the project team.
+
+This code of conduct applies both within project spaces and in public spaces
+when an individual is representing the project or its community.
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported by contacting a project maintainer at akrasnoschekov@gmail.com. All
+complaints will be reviewed and investigated and will result in a response that
+is deemed necessary and appropriate to the circumstances. Maintainers are
+obligated to maintain confidentiality with regard to the reporter of an
+incident.
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage],
+version 1.3.0, available at
+[http://contributor-covenant.org/version/1/3/0/][version]
+
+[homepage]: http://contributor-covenant.org
+[version]: http://contributor-covenant.org/version/1/3/0/

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in rusby.gemspec
+gemspec

data/Gemfile.lock

@@ -0,0 +1,51 @@
+PATH
+  remote: .
+  specs:
+    rusby (0.1.0)
+      colorize
+      ffi
+      hashie
+      method_source
+      parser
+      ruby-prof
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    ast (2.2.0)
+    byebug (9.0.5)
+    colorize (0.7.7)
+    diff-lcs (1.2.5)
+    ffi (1.9.10)
+    hashie (3.4.4)
+    method_source (0.8.2)
+    parser (2.3.1.0)
+      ast (~> 2.2)
+    rake (10.5.0)
+    rspec (3.4.0)
+      rspec-core (~> 3.4.0)
+      rspec-expectations (~> 3.4.0)
+      rspec-mocks (~> 3.4.0)
+    rspec-core (3.4.4)
+      rspec-support (~> 3.4.0)
+    rspec-expectations (3.4.0)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.4.0)
+    rspec-mocks (3.4.1)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.4.0)
+    rspec-support (3.4.1)
+    ruby-prof (0.15.9)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  bundler (~> 1.12)
+  byebug
+  rake (~> 10.0)
+  rspec (~> 3.0)
+  rusby!
+
+BUNDLED WITH
+   1.12.4

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2016 Alexander Krasnoschekov
+
+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.

data/README.md

@@ -0,0 +1,64 @@
+## About
+
+**Rusby** is a *Ruby* to *Rust* transpiler for simple performance-oriented methods.
+
+Computations in plain Ruby are painfully slow.
+Almost all internal methods in of Ruby are implemented in C, thus achieving acceptable performance on e.g. [Array#sort](https://github.com/ruby/ruby/blob/trunk/array.c).
+
+On the other hand extension of ruby code with C or other low-level language functions is not to say hard... but at least is tricky. **Rusby** allows to write simple methods in plain ruby and convert them to rust with zero modifications.
+
+Just mark method with `rusby!` and you are ready to rust :/
+
+![Quicksort example](https://raw.githubusercontent.com/rambler-digital-solutions/rusby/master/doc/img1.png)
+
+---
+
+N.B. It's a research project, so at least test for edge cases (e.g. overflows) before production usage.
+
+Transpilation was tested only on cases in `./examples` directory.
+
+---
+
+## How it works?
+
+1. You prefix your method definition with `!rusby`.
+1. Native Ruby method is ran for the first time.
+1. Its arguments types and return type are recorded.
+1. These data along with source code of the method (as AST tree) are passed to the Rusby::Builder.
+1. Rusby::Builder calls Rusby::Rust, which recursively generates rust code based on AST tree (Rusby::Generators::\*).
+1. Few hacks are applied along the way, see Rusby::Preprocessor, Rusby::Postrocessor.
+1. Generated Rust code is dumped to file into `./lib` Dir
+1. Rust code is prettified and compiled into dynamic lib.
+1. At last we have ruby method and rust counterpart linked via [FFI](https://github.com/ffi/ffi).
+1. Benchmark them and find the fastest one.
+1. Link the winner into the source class.
+1. Profit.
+
+## Features
+- In-place ruby/rust method swapping based on benchmarks
+- Recursive calls transpiling
+- Nested functions transpiling
+- Limited string operations support
+- Integer matrix manipulation support
+
+## Quickstart
+```
+brew install rust # or similar
+cd examples
+bundle
+ruby run_examples.rb
+```
+
+## Tests
+```
+rake spec
+```
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/rusby. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](http://contributor-covenant.org) code of conduct.
+
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).

data/Rakefile

@@ -0,0 +1,12 @@
+require 'rspec/core/rake_task'
+require 'bundler/gem_tasks'
+
+RSpec::Core::RakeTask.new(:spec) do |task|
+  task.rspec_opts = [
+    '--color',
+    '--require',
+    'spec_helper'
+  ]
+end
+
+task :default => :spec

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "rusby"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/examples/Gemfile

@@ -0,0 +1,3 @@
+source 'https://rubygems.org'
+
+gem 'rusby', path: '..'

data/examples/Gemfile.lock

@@ -0,0 +1,31 @@
+PATH
+  remote: ..
+  specs:
+    rusby (0.1.0)
+      colorize
+      ffi
+      hashie
+      method_source
+      parser
+      ruby-prof
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    ast (2.2.0)
+    colorize (0.7.7)
+    ffi (1.9.10)
+    hashie (3.4.4)
+    method_source (0.8.2)
+    parser (2.3.1.0)
+      ast (~> 2.2)
+    ruby-prof (0.15.9)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  rusby!
+
+BUNDLED WITH
+   1.12.4

data/examples/fanatic_greeter.rb

@@ -0,0 +1,8 @@
+class FanaticGreeter
+  extend Rusby::Core
+
+  rusby!
+  def greet(name)
+    "Hello, #{name}!"
+  end
+end

data/examples/fanatic_pluser.rb

@@ -0,0 +1,8 @@
+class FanaticPluser
+  extend Rusby::Core
+
+  rusby!
+  def plusplus(number)
+    number + 1
+  end
+end

data/examples/levenshtein_distance.rb

@@ -0,0 +1,31 @@
+class LevenshteinDistance
+  extend Rusby::Core
+
+  rusby!
+  def distance(s, t)
+    m = s.length
+    n = t.length
+
+    return m if n == 0
+    return n if m == 0
+    d = Array.new(m + 1) { Array.new(n + 1) }
+
+    (0..m).each { |i| d[i][0] = i }
+    (0..n).each { |j| d[0][j] = j }
+
+    (1..n).each do |j|
+      (1..m).each do |i|
+        d[i][j] = if s[i - 1] == t[j - 1]     # adjust index into string
+                    d[i - 1][j - 1]           # no operation required
+                  else
+                    deletion = d[i - 1][j] + 1
+                    insertion = d[i][j - 1] + 1
+                    substitution = d[i - 1][j - 1] + 1
+                    op = deletion < insertion ? deletion : insertion
+                    op < substitution ? op : substitution
+                  end
+      end
+    end
+    return d[m][n]
+  end
+end

data/examples/quicksort.rb

@@ -0,0 +1,32 @@
+class Quicksort
+  extend Rusby::Core
+
+  rusby!
+  def quicksort(a, lo, hi)
+    return a unless lo < hi
+    pivot = partition(a, lo, hi)
+    quicksort(a, lo, pivot)
+    quicksort(a, pivot + 1, hi)
+    a
+  end
+
+  private
+
+  def partition(a, lo, hi)
+    pivot = a[lo]
+    i = lo - 1
+    j = hi + 1
+    loop do
+      begin
+        i += 1
+      end while a[i] < pivot
+
+      begin
+        j -= 1
+      end while a[j] > pivot
+
+      return j if i >= j
+      a[i], a[j] = [a[j], a[i]]
+    end
+  end
+end

data/examples/run_examples.rb

@@ -0,0 +1,38 @@
+require 'rubygems'
+require 'bundler/setup'
+
+Bundler.require
+require "./fanatic_pluser"
+require "./fanatic_greeter"
+require "./quicksort"
+require "./levenshtein_distance"
+require "./weighted_random"
+
+pluser = FanaticPluser.new
+2.times do |i|
+  puts "== #{i + 1} - #{pluser.plusplus(77)}"
+end
+
+greeter = FanaticGreeter.new
+2.times do |_i|
+  puts greeter.greet('Fred')
+end
+
+sorter = Quicksort.new
+a = (1..50).map { |_i| rand(100_000) }
+2.times do |i|
+  puts "=> #{i + 1} time method is being called".colorize(:light_black)
+  puts "== #{i + 1} - #{sorter.quicksort(a.clone, 0, a.size - 1)}"
+end
+
+measurer = LevenshteinDistance.new
+params = %w(unimaginatively incomprehensibilities)
+2.times do |i|
+  puts "#{i + 1}: #{measurer.distance(*params)}"
+end
+
+randomizer = WeightedRandom.new
+weights = (1..1000).map { rand(1000).to_f }
+2.times do |i|
+  puts "#{i + 1}: #{randomizer.pick(weights, rand())}"
+end

data/examples/weighted_random.rb

@@ -0,0 +1,22 @@
+class WeightedRandom
+  extend Rusby::Core
+
+  rusby!
+  def pick(weights, seed)
+    sum = 0.0
+    left_bounds = []
+    right_bounds = []
+    weights.each do |item|
+      left_bounds << sum
+      sum = sum + item
+      right_bounds << sum
+    end
+    number = seed * sum
+    weights.each_with_index do |_, i|
+      if (number >= left_bounds[i] && number < right_bounds[i])
+        return i
+      end
+    end
+    return -1
+  end
+end