arbol 0.0.2

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 2a728cceb0dceb116c2f6fa8b2925924c20cb884
+  data.tar.gz: 26bb9a7f5dd197a3c97a3ec9442dad7ba33874aa
+SHA512:
+  metadata.gz: ef26b9938d68ca5b33531090ae0c771da1cc305da4ec6a977fc061d085ada4652e33965ace15aa2388e440b580b73d9a86d4bc459c79c862f4177a3f4c736f76
+  data.tar.gz: dc709ab7bfa715079df2fc98b737198d04662e8badc3a3f126b4d44878e8ad7a4fc64b0c21d7c819670744285b9e2cc8e8e5f9f04bda811b61fe5697f33e3a9d

data/bin/arbol

@@ -0,0 +1,25 @@
+#!/usr/bin/env ruby
+
+require 'arbol'
+
+# Arbol::Documentation.new.output_all_documentation
+
+unless ARGV[0]
+  puts "you need to provide an input file" 
+  exit(-1)
+end
+
+unless ARGV[1]
+  puts "you need to provide an output file" 
+  exit(-1)
+end
+
+script_to_file(
+  ino_from_tree(
+    interpret_file(
+      ARGV[0],
+      binding
+    )
+  ),
+  ARGV[1]
+)

data/lib/arbol.rb

@@ -0,0 +1,45 @@
+require 'pp'
+require_relative 'builder.rb'
+require_relative 'dsl.rb'
+require_relative 'documentation.rb'
+
+# now that class_map is created.. import all functions
+Dir.glob("#{File.dirname(__FILE__)}/functions/*.rb").each do |mod|
+  require_relative mod
+end
+
+# interprets a file into an arbol tree structure
+def interpret_file(file_path, scope)
+  if file_path.match(/\.rb$/)
+    return interpret_dsl(File.read(file_path), scope)
+  elsif file_path.match(/\.json$/)
+    return interpret_json(File.read(file_path))
+  end
+end
+
+# creates an ino file from a tree structure.
+def ino_from_tree(tree)
+  pp tree
+  tls, cycle, body = custom_arduino_script_body(tree)
+  # these are resolved inside the ERB
+  tls = tls.join("\n")
+  cycle = cycle.join("\n")
+  body = body.join("\n")
+  integer_scale = 8192
+  pixels = tree[:lamps]
+  pin = tree[:pin]
+  code = Arbol.libs.join("\n\n")
+  ERB.new(
+    IO.read(
+      "#{File.dirname(__FILE__)}/templates/arduino_library.ino.erb"
+    )
+  ).result(binding)
+end
+
+# write the script to file
+def script_to_file(script, path)
+  puts "writing to script file #{path}"
+  File.open(path, 'w') do |f|
+    f.puts(script)
+  end
+end

data/lib/base.rb

@@ -0,0 +1,397 @@
+require 'securerandom'
+require 'tsort'
+
+class TsortableHash < Hash
+  include TSort
+  alias tsort_each_node each_key
+  def tsort_each_child(node, &block)
+    fetch(node).each(&block)
+  end
+end
+
+class ArbolHash < Hash
+  def +(y)
+    h = ArbolHash.new
+    h[:type] = 'add'
+    h[:op1] = self.to_h
+    h[:op2] = resolve(y)
+    h
+  end
+
+  def -(y)
+    h = ArbolHash.new
+    h[:type] = 'minus'
+    h[:op1] = self.to_h
+    h[:op2] = resolve(y)
+    h
+  end
+  
+  def *(y)
+    h = ArbolHash.new
+    h[:type] = 'times'
+    h[:op1] = self.to_h
+    h[:op2] = resolve(y)
+    h
+  end
+
+  def /(y)
+    h = ArbolHash.new
+    h[:type] = 'divide'
+    h[:op1] = self.to_h
+    h[:op2] = resolve(y)
+    h
+  end
+
+  def %(y)
+    h = ArbolHash.new
+    h[:type] = 'modulo'
+    h[:op1] = self.to_h
+    h[:op2] = resolve(y)
+    h
+  end
+  
+  def >(y)
+    h = ArbolHash.new
+    h[:type] = 'greater_than'
+    h[:left] = self.to_h
+    h[:right] = resolve(y)
+    h
+  end
+  
+  def >=(y)
+    h = ArbolHash.new
+    h[:type] = 'greater_than_equals'
+    h[:left] = self.to_h
+    h[:right] = resolve(y)
+    h
+  end
+
+  def <(y)
+    h = ArbolHash.new
+    h[:type] = 'less_than'
+    h[:left] = self.to_h
+    h[:right] = resolve(y)
+    h
+  end
+  
+  def <=(y)
+    h = ArbolHash.new
+    h[:type] = 'less_than_equals'
+    h[:left] = self.to_h
+    h[:right] = resolve(y)
+    h
+  end 
+end
+
+module RefineBasics
+  refine Integer do
+    def +(y)
+      h = ArbolHash.new
+      h[:type] = 'add'
+      h[:op1] = resolve(self.to_i)
+      h[:op2] = resolve(y)
+      h
+    end
+  
+    def -(y)
+      h = ArbolHash.new
+      h[:type] = 'minus'
+      h[:op1] = resolve(self.to_i)
+      h[:op2] = resolve(y)
+      h
+    end
+    
+    def *(y)
+      h = ArbolHash.new
+      h[:type] = 'times'
+      h[:op1] = resolve(self.to_i)
+      h[:op2] = resolve(y)
+      h
+    end
+  
+    def /(y)
+      h = ArbolHash.new
+      h[:type] = 'divide'
+      h[:op1] = resolve(self.to_i)
+      h[:op2] = resolve(y)
+      h
+    end
+  
+    def %(y)
+      h = ArbolHash.new
+      h[:type] = 'modulo'
+      h[:op1] = resolve(self.to_i)
+      h[:op2] = resolve(y)
+      h
+    end
+
+    def >(y)
+      h = ArbolHash.new
+      h[:type] = 'greater_than'
+      h[:left] = self.to_i
+      h[:right] = resolve(y)
+      h
+    end
+    
+    def >=(y)
+      h = ArbolHash.new
+      h[:type] = 'greater_than_equals'
+      h[:left] = self.to_i
+      h[:right] = resolve(y)
+      h
+    end
+  
+    def <(y)
+      h = ArbolHash.new
+      h[:type] = 'less_than'
+      h[:left] = self.to_i
+      h[:right] = resolve(y)
+      h
+    end
+    
+    def <=(y)
+      h = ArbolHash.new
+      h[:type] = 'less_than_equals'
+      h[:left] = self.to_i
+      h[:right] = resolve(y)
+      h
+    end 
+  end
+
+  refine Float do
+    def +(y)
+      h = ArbolHash.new
+      h[:type] = 'add'
+      h[:op1] = resolve(self.to_f)
+      h[:op2] = resolve(y)
+      h
+    end
+  
+    def -(y)
+      h = ArbolHash.new
+      h[:type] = 'minus'
+      h[:op1] = resolve(self.to_f)
+      h[:op2] = resolve(y)
+      h
+    end
+    
+    def *(y)
+      h = ArbolHash.new
+      h[:type] = 'times'
+      h[:op1] = resolve(self.to_f)
+      h[:op2] = resolve(y)
+      h
+    end
+  
+    def /(y)
+      h = ArbolHash.new
+      h[:type] = 'divide'
+      h[:op1] = resolve(self.to_f)
+      h[:op2] = resolve(y)
+      h
+    end
+  
+    def %(y)
+      h = ArbolHash.new
+      h[:type] = 'modulo'
+      h[:op1] = resolve(self.to_f)
+      h[:op2] = resolve(y)
+      h
+    end
+  
+    def >(y)
+      h = ArbolHash.new
+      h[:type] = 'greater_than'
+      h[:left] = self.to_f
+      h[:right] = resolve(y)
+      h
+    end
+    
+    def >=(y)
+      h = ArbolHash.new
+      h[:type] = 'greater_than_equals'
+      h[:left] = self.to_f
+      h[:right] = resolve(y)
+      h
+    end
+  
+    def <(y)
+      h = ArbolHash.new
+      h[:type] = 'less_than'
+      h[:left] = self.to_f
+      h[:right] = resolve(y)
+      h
+    end
+    
+    def <=(y)
+      h = ArbolHash.new
+      h[:type] = 'less_than_equals'
+      h[:left] = self.to_f
+      h[:right] = resolve(y)
+      h
+    end 
+  end
+
+  refine Array do
+    def +(y)
+      h = ArbolHash.new
+      h[:type] = 'add'
+      h[:op1] = resolve(self.to_a)
+      h[:op2] = resolve(y)
+      h
+    end
+  
+    def -(y)
+      h = ArbolHash.new
+      h[:type] = 'minus'
+      h[:op1] = resolve(self.to_a)
+      h[:op2] = resolve(y)
+      h
+    end
+    
+    def *(y)
+      h = ArbolHash.new
+      h[:type] = 'times'
+      h[:op1] = resolve(self.to_a)
+      h[:op2] = resolve(y)
+      h
+    end
+  
+    def /(y)
+      h = ArbolHash.new
+      h[:type] = 'divide'
+      h[:op1] = resolve(self.to_a)
+      h[:op2] = resolve(y)
+      h
+    end
+  
+    def %(y)
+      h = ArbolHash.new
+      h[:type] = 'modulo'
+      h[:op1] = resolve(self.to_a)
+      h[:op2] = resolve(y)
+      h
+    end
+
+    def >(y)
+      h = ArbolHash.new
+      h[:type] = 'greater_than'
+      h[:left] = self.to_a
+      h[:right] = resolve(y)
+      h
+    end
+    
+    def >=(y)
+      h = ArbolHash.new
+      h[:type] = 'greater_than_equals'
+      h[:left] = self.to_a
+      h[:right] = resolve(y)
+      h
+    end
+  
+    def <(y)
+      h = ArbolHash.new
+      h[:type] = 'less_than'
+      h[:left] = self.to_a
+      h[:right] = resolve(y)
+      h
+    end
+    
+    def <=(y)
+      h = ArbolHash.new
+      h[:type] = 'less_than_equals'
+      h[:left] = self.to_a
+      h[:right] = resolve(y)
+      h
+    end 
+  end
+end
+
+class Base
+  attr_accessor :name
+  attr_accessor :frame_optimized
+  
+  def initialize(params)
+    @frame_optimized = true # default
+    @name = "#{self.class}_#{SecureRandom.uuid.to_s.gsub('-','')}"
+    param_keys.each do |k|
+      self.send("#{k.to_sym}=", params[k])
+    end
+    buildit
+  end
+
+  def buildit
+    param_keys.each do |k|
+      # puts "resolving #{k}"
+      self.send("#{k.to_sym}=", builder(self.send("#{k.to_s}")))
+      # puts "#{k} resolved"
+    end
+  end
+
+  def param_keys
+    []
+  end
+
+  def depends_on
+    return [] if param_keys == []
+    param_keys.map { |k| self.send("#{k}").name }
+  end
+
+  def arduino_code
+    []
+  end
+  
+  def resolve_frame_optimized
+    # first resolve the children
+    param_keys.each do |k|
+      self.send("#{k}").resolve_frame_optimized
+    end
+    
+    # check to see if any of the children can not be optimized
+    param_keys.each do |k|
+      # if so... mark self as false
+      if self.send("#{k}").frame_optimized == false
+        @frame_optimized = false
+      end
+    end
+  end
+  
+  # only executed once per cycle
+  def cycle_level_arduino_code
+    []
+  end
+  
+  # code to be executed in the top level scope.
+  # used for constant declaration
+  def top_level_scope_arduino_code
+    []
+  end
+
+  def append_tsortable(tsortable)
+    tsortable[@name] = depends_on
+    param_keys.each do |k|
+      self.send("#{k}").append_tsortable(tsortable)
+    end
+  end
+
+  def add_arduino_code(ir)
+    ir[@name] = arduino_code
+    param_keys.each do |k|
+      self.send("#{k}").add_arduino_code(ir)
+    end
+  end
+
+  def add_cycle_level_scope(ir)
+    ir[@name] = cycle_level_arduino_code
+    param_keys.each do |k|
+      self.send("#{k}").add_cycle_level_scope(ir)
+    end
+  end
+  
+  def add_top_level_scope(ir)
+    ir[@name] = top_level_scope_code
+    param_keys.each do |k|
+      self.send("#{k}").add_top_level_scope(ir)
+    end
+  end
+end