node-marshal 0.2.1 → 0.2.2

data/test/test_obfuscator.rb

@@ -1,36 +1,36 @@
-require_relative '../lib/node-marshal.rb'
-require 'test/unit'
-
-# Test node-marshal obfuscator abilities
-class TestObfuscator < Test::Unit::TestCase
-	def test_sym_replace
-		# Create the node and find all new symbols
-		symlog = SymbolsLogger.new
-		node = NodeMarshal.new(:srcfile, 'lifegame.rb')
-		our_symbols = symlog.new_symbols.map(&:to_s)
-		node.to_hash
-		# Try to exclude symbols used in attr_reader and attr_writer constructions
-		our_symbols = node.get_safe_symbols(our_symbols)
-		# Prepare hash table for replacement
-		reptbl = node.get_aliases_table(our_symbols)
-		life_game_name = reptbl["LifeGame"]
-		grid_name = reptbl["Grid"]
-		make_step_name = reptbl["make_step!"].to_sym
-		cfg_glider_gun_name = reptbl["cfg_glider_gun!"].to_sym
-		# Replace symbols
-		puts "----- Symbols replacement table"
-		puts reptbl.to_s
-		puts "-------------------------------"
-		node.replace_symbols(reptbl)
-		# Rebuild node, save it to the file and reload it
-		node = node.rebuild
-		File.open('life.bin', 'wb') {|fp| fp << node.to_bin};
-		node.compile.eval
-		# Execute the node
-		grid_class = Object.const_get(life_game_name).const_get(grid_name)
-		g = grid_class.new(25, 80)
-		g.send(cfg_glider_gun_name)
-		75.times {g.send(make_step_name)}
-		puts g.to_ascii
-	end
-end
+require_relative '../lib/node-marshal.rb'
+require 'test/unit'
+
+# Test node-marshal obfuscator abilities
+class TestObfuscator < Test::Unit::TestCase
+	def test_sym_replace
+		# Create the node and find all new symbols
+		symlog = SymbolsLogger.new
+		node = NodeMarshal.new(:srcfile, 'lifegame.rb')
+		our_symbols = symlog.new_symbols.map(&:to_s)
+		node.to_hash
+		# Try to exclude symbols used in attr_reader and attr_writer constructions
+		our_symbols = node.get_safe_symbols(our_symbols)
+		# Prepare hash table for replacement
+		reptbl = node.get_aliases_table(our_symbols)
+		life_game_name = reptbl["LifeGame"]
+		grid_name = reptbl["Grid"]
+		make_step_name = reptbl["make_step!"].to_sym
+		cfg_glider_gun_name = reptbl["cfg_glider_gun!"].to_sym
+		# Replace symbols
+		puts "----- Symbols replacement table"
+		puts reptbl.to_s
+		puts "-------------------------------"
+		node.replace_symbols(reptbl)
+		# Rebuild node, save it to the file and reload it
+		node = node.rebuild
+		File.open('life.bin', 'wb') {|fp| fp << node.to_bin};
+		node.compile.eval
+		# Execute the node
+		grid_class = Object.const_get(life_game_name).const_get(grid_name)
+		g = grid_class.new(25, 80)
+		g.send(cfg_glider_gun_name)
+		75.times {g.send(make_step_name)}
+		puts g.to_ascii
+	end
+end

data/test/test_qcall.rb

@@ -1,52 +1,52 @@
-# encoding: UTF-8
-require_relative '../lib/node-marshal.rb'
-require 'test/unit'
-
-
-# This unit tests Ruby 2.3 &. safe navigation operator
-class TestQCALL < Test::Unit::TestCase
-	def test_qcall
-		qcall_program = %q{
-class Account
-	def initialize(owner_name, owner_address)
-		@owner_name = owner_name
-		@owner_info = (owner_address.nil?) ? nil : OwnerInfo.new(owner_address);
-	end
-	def owner_name
-		@owner_name
-	end
-	def owner_info
-		@owner_info
-	end
-end
-class OwnerInfo
-	def initialize(address)
-		@address = address
-	end
-	def address
-		@address
-	end
-end
-a = Account.new("Owner", "Moscow");
-puts "'#{a&.owner_name}'"
-puts "'#{a&.owner_info&.address}'"
-b = Account.new("Owner", nil);
-puts "'#{b&.owner_name}'"
-puts "'#{b&.owner_info&.address}'"
-[a&.owner_name, a&.owner_info&.address, b&.owner_name, b&.owner_info&.address]
-}
-		ver = RUBY_VERSION
-		ver = (ver[0] + ver[2] + ver[4]).to_i
-		if ver >= 230
-			node = NodeMarshal.new(:srcmemory, qcall_program)
-			node.show_offsets = true
-			bindump =  node.to_bin
-			node = NodeMarshal.new(:binmemory, bindump)
-			res_node = node.compile.eval
-			res_text = eval(qcall_program)
-			assert_equal(res_text, res_node)
-		else
-			assert_equal(false, true, "Ruby 2.3 or higher is required for &. operator test")
-		end
-	end
-end
+# encoding: UTF-8
+require_relative '../lib/node-marshal.rb'
+require 'test/unit'
+
+
+# This unit tests Ruby 2.3 &. safe navigation operator
+class TestQCALL < Test::Unit::TestCase
+	def test_qcall
+		qcall_program = %q{
+class Account
+	def initialize(owner_name, owner_address)
+		@owner_name = owner_name
+		@owner_info = (owner_address.nil?) ? nil : OwnerInfo.new(owner_address);
+	end
+	def owner_name
+		@owner_name
+	end
+	def owner_info
+		@owner_info
+	end
+end
+class OwnerInfo
+	def initialize(address)
+		@address = address
+	end
+	def address
+		@address
+	end
+end
+a = Account.new("Owner", "Moscow");
+puts "'#{a&.owner_name}'"
+puts "'#{a&.owner_info&.address}'"
+b = Account.new("Owner", nil);
+puts "'#{b&.owner_name}'"
+puts "'#{b&.owner_info&.address}'"
+[a&.owner_name, a&.owner_info&.address, b&.owner_name, b&.owner_info&.address]
+}
+		ver = RUBY_VERSION
+		ver = (ver[0] + ver[2] + ver[4]).to_i
+		if ver >= 230
+			node = NodeMarshal.new(:srcmemory, qcall_program)
+			node.show_offsets = true
+			bindump =  node.to_bin
+			node = NodeMarshal.new(:binmemory, bindump)
+			res_node = node.compile.eval
+			res_text = eval(qcall_program)
+			assert_equal(res_text, res_node)
+		else
+			assert_equal(false, true, "Ruby 2.3 or higher is required for &. operator test")
+		end
+	end
+end

data/test/tinytet.rb

@@ -1,79 +1,79 @@
-#!/usr/bin/ruby
-# Simple TETRIS game for Ruby 1.9.x that uses CURSES library
-# (C) 2013 Alexey Voskov
-require "curses"
-include Curses
-# TETRIS figure
-class Figure
-	attr_accessor :mat, :x, :y, :rot
-	FIGURES = [0x0F00,0x0660,0x0270,0x0170,0x0470,0x0360,0x0C60] # Line, square, T, L, L, Z, Z
-	def initialize
-		fig = FIGURES[rand(6).round]
-		rf = ->bf{Array.new(4) {|y| Array.new(4) {|x| (1 << bf.(x,y)) & fig }}}
-		@mat = [rf.(->x,y{3-x+y*4}), rf.(->x,y{3-y+(3-x)*4}), 
-			rf.(->x,y{x+(3-y)*4}), rf.(->x,y{y+x*4})]
-		@x, @y, @rot = 5, 0, 0 # Figure position
-	end
-	def each_pos &block
-		(0..3).each {|y| (0..3).each {|x| block.(y,x) if @mat[@rot][y][x] > 0}}
-	end
-	# Test the possibility of move and move if possible
-	def move!(op, unop, scr)
-		self.each_pos {|y,x| scr.brick!(y+@y,x+@x,GameField::COL_EMPTY) }
-		op.(self)
-		unop.(self) if !(ans = scr.place?self)
-		self.each_pos {|y,x| scr.brick!(y+@y,x+@x,GameField::COL_BRICK) }
-		refresh
-		ans
-	end
-end
-# TETRIS game fields
-class GameField
-	WIDTH, HEIGHT, BRICK_WIDTH, COL_EMPTY, COL_WALL, COL_BRICK = 16, 26, 2, 0, 1, 2
-	def initialize # Initialize and show the game fields
-		@m = Array.new(HEIGHT+2) {[0,0,1,Array.new(WIDTH-6){0},1,0,0].flatten}
-		(2..WIDTH-3).each {|i| @m[HEIGHT-1][i] = COL_WALL}
-		lines!
-	end
-	def brick!(y,x,c) # Show the brick on the screen
-		@m[y][x] = c.to_i
-		return nil if y-3 <= 0
-		setpos(y-3,x*BRICK_WIDTH)
-		addstr([". ", "**", "[]"][c])
-	end
-	def place?(fig) # Check if the figure can be placed
-		fig.each_pos {|y,x| return false if @m[y+fig.y][x+fig.x] > 0}
-		return true
-	end
-	def lines! # Erase full lines from the screen
-		while (ind = @m[0..HEIGHT-2].index {|s| s[3..WIDTH-4].index(COL_EMPTY) == nil}) != nil
-			(ind-1).step(0,-1) {|i| @m[i+1] = @m[i]}
-			@m[0] = @m[HEIGHT+1].dup
-		end
-		(0..HEIGHT-1).each {|y| (2..WIDTH-3).each {|x| brick!(y,x,@m[y][x])}} # Update the screen (field + borders) 	
-	end
-end
-# Initialize the console and program data
-init_screen; clear; noecho; stdscr.keypad(true)
-fig, scr, speed = Figure.new, GameField.new, 1
-# Keyboard control thread
-keythread = Thread.new { loop {
-	case getch
-		when Key::LEFT then fig.move!(->f{f.x -=1}, ->f{f.x +=1}, scr)
-		when Key::RIGHT then fig.move!(->f{f.x +=1}, ->f{f.x -=1}, scr)
-		when Key::UP then fig.move!(->f{f.rot = (f.rot+1)%4}, ->f{f.rot = (f.rot+3)%4},scr)
-		when Key::DOWN  then speed = 0.05 # Delay for fast falling
-	end
-}}
-# Game main loop (new figure creation + falling)
-begin
-	fig, speed = Figure.new, 0.5 # Figure and delay for its normal falling
-	sleep(speed) while fig.move!(->f{f.y +=1}, ->f{f.y -=1}, scr)
-	scr.lines! 
-end until fig.y == 0
-# Finish the game
-keythread.kill
-setpos(GameField::HEIGHT/2,GameField::WIDTH-4)
-addstr("GAME OVER!")
-getch
-close_screen
+#!/usr/bin/ruby
+# Simple TETRIS game for Ruby 1.9.x that uses CURSES library
+# (C) 2013 Alexey Voskov
+require "curses"
+include Curses
+# TETRIS figure
+class Figure
+	attr_accessor :mat, :x, :y, :rot
+	FIGURES = [0x0F00,0x0660,0x0270,0x0170,0x0470,0x0360,0x0C60] # Line, square, T, L, L, Z, Z
+	def initialize
+		fig = FIGURES[rand(6).round]
+		rf = ->bf{Array.new(4) {|y| Array.new(4) {|x| (1 << bf.(x,y)) & fig }}}
+		@mat = [rf.(->x,y{3-x+y*4}), rf.(->x,y{3-y+(3-x)*4}), 
+			rf.(->x,y{x+(3-y)*4}), rf.(->x,y{y+x*4})]
+		@x, @y, @rot = 5, 0, 0 # Figure position
+	end
+	def each_pos &block
+		(0..3).each {|y| (0..3).each {|x| block.(y,x) if @mat[@rot][y][x] > 0}}
+	end
+	# Test the possibility of move and move if possible
+	def move!(op, unop, scr)
+		self.each_pos {|y,x| scr.brick!(y+@y,x+@x,GameField::COL_EMPTY) }
+		op.(self)
+		unop.(self) if !(ans = scr.place?self)
+		self.each_pos {|y,x| scr.brick!(y+@y,x+@x,GameField::COL_BRICK) }
+		refresh
+		ans
+	end
+end
+# TETRIS game fields
+class GameField
+	WIDTH, HEIGHT, BRICK_WIDTH, COL_EMPTY, COL_WALL, COL_BRICK = 16, 26, 2, 0, 1, 2
+	def initialize # Initialize and show the game fields
+		@m = Array.new(HEIGHT+2) {[0,0,1,Array.new(WIDTH-6){0},1,0,0].flatten}
+		(2..WIDTH-3).each {|i| @m[HEIGHT-1][i] = COL_WALL}
+		lines!
+	end
+	def brick!(y,x,c) # Show the brick on the screen
+		@m[y][x] = c.to_i
+		return nil if y-3 <= 0
+		setpos(y-3,x*BRICK_WIDTH)
+		addstr([". ", "**", "[]"][c])
+	end
+	def place?(fig) # Check if the figure can be placed
+		fig.each_pos {|y,x| return false if @m[y+fig.y][x+fig.x] > 0}
+		return true
+	end
+	def lines! # Erase full lines from the screen
+		while (ind = @m[0..HEIGHT-2].index {|s| s[3..WIDTH-4].index(COL_EMPTY) == nil}) != nil
+			(ind-1).step(0,-1) {|i| @m[i+1] = @m[i]}
+			@m[0] = @m[HEIGHT+1].dup
+		end
+		(0..HEIGHT-1).each {|y| (2..WIDTH-3).each {|x| brick!(y,x,@m[y][x])}} # Update the screen (field + borders) 	
+	end
+end
+# Initialize the console and program data
+init_screen; clear; noecho; stdscr.keypad(true)
+fig, scr, speed = Figure.new, GameField.new, 1
+# Keyboard control thread
+keythread = Thread.new { loop {
+	case getch
+		when Key::LEFT then fig.move!(->f{f.x -=1}, ->f{f.x +=1}, scr)
+		when Key::RIGHT then fig.move!(->f{f.x +=1}, ->f{f.x -=1}, scr)
+		when Key::UP then fig.move!(->f{f.rot = (f.rot+1)%4}, ->f{f.rot = (f.rot+3)%4},scr)
+		when Key::DOWN  then speed = 0.05 # Delay for fast falling
+	end
+}}
+# Game main loop (new figure creation + falling)
+begin
+	fig, speed = Figure.new, 0.5 # Figure and delay for its normal falling
+	sleep(speed) while fig.move!(->f{f.y +=1}, ->f{f.y -=1}, scr)
+	scr.lines! 
+end until fig.y == 0
+# Finish the game
+keythread.kill
+setpos(GameField::HEIGHT/2,GameField::WIDTH-4)
+addstr("GAME OVER!")
+getch
+close_screen

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: node-marshal
 version: !ruby/object:Gem::Version
-  version: 0.2.1
+  version: 0.2.2
 platform: ruby
 authors:
 - Alexey Voskov
@@ -9,7 +9,7 @@ autorequire:
 bindir:
 - bin
 cert_chain: []
-date: 2016-03-16 00:00:00.000000000 Z
+date: 2017-05-01 00:00:00.000000000 Z
 dependencies: []
 description: "This gem is designed for transformation of Ruby source code (eiher in
   the form of files or strings) to the \nRuby nodes (syntax trees) used by Ruby MRI
@@ -43,6 +43,7 @@ files:
 - test/test_base.rb
 - test/test_complex.rb
 - test/test_lifegame.rb
+- test/test_namedarg.rb
 - test/test_obfuscator.rb
 - test/test_qcall.rb
 - test/tinytet.rb
@@ -68,7 +69,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.5.1
+rubygems_version: 2.5.2
 signing_key: 
 specification_version: 4
 summary: Transforms Ruby sources to binary nodes (trees) that can be saved and loaded