rhodes-framework 1.0.0

data/.gitignore

@@ -0,0 +1,2 @@
+pkg
+doc

data/History.txt

@@ -0,0 +1,37 @@
+== 0.2.6 2009-01-29
+ * changed signature of url_for, link_to, and redirect
+
+== 0.2.5 2009-01-28
+ * erb labels are now humanized
+
+== 0.2.4 2009-01-27
+ * added show.erb to model generator [#164]
+ * base source_adapter should include user_id on sync
+
+== 0.2.3 2009-01-26
+ * added newgem dependency
+
+== 0.2.2 2009-01-23
+ * fixed bug in layout.erb template
+
+== 0.2.1 2009-01-20
+ * adding new layout framework to generator [#45]
+
+== 0.2.0 2009-01-07
+ * releasing 0.2 version of gem
+ * fixed sqlite3-ruby 1.2.4 dependency [#147]
+ * fixed broken rspec tests [#148]
+
+== 0.1.3 2008-12-11
+ * Updated source_adapter generator to have base class
+ * fixed #50, removed dependency on Find library
+
+== 0.1.2 2008-12-09
+ * Added rhogen source <MySourceAdapter>
+
+== 0.1.1 2008-11-18
+ * Fixed template application name
+
+== 0.1.0 2008-11-18
+ * 1 major enhancement:
+ * Initial release

data/Manifest.txt

@@ -0,0 +1,66 @@
+.gitignore
+History.txt
+Manifest.txt
+README.rdoc
+Rakefile
+lib/ServeME.rb
+lib/TestServe.rb
+lib/bsearch.rb
+lib/builtinME.rb
+lib/date.rb
+lib/date/format.rb
+lib/dateME.rb
+lib/erb.rb
+lib/find.rb
+lib/rational.rb
+lib/rationalME.rb
+lib/rho.rb
+lib/rho/render.rb
+lib/rho/rho.rb
+lib/rho/rhoapplication.rb
+lib/rho/rhocontact.rb
+lib/rho/rhocontroller.rb
+lib/rho/rhofsconnector.rb
+lib/rho/rhosupport.rb
+lib/rho/rhoviewhelpers.rb
+lib/rhodes-framework.rb
+lib/rhodes.rb
+lib/rhoframework.rb
+lib/rhofsconnector.rb
+lib/rhom.rb
+lib/rhom/rhom.rb
+lib/rhom/rhom_db_adapter.rb
+lib/rhom/rhom_db_adapterME.rb
+lib/rhom/rhom_object.rb
+lib/rhom/rhom_object_factory.rb
+lib/rhom/rhom_source.rb
+lib/singleton.rb
+lib/time.rb
+lib/version.rb
+res/sqlite3/constants.rb
+res/sqlite3/database.rb
+res/sqlite3/driver/dl/api.rb
+res/sqlite3/driver/dl/driver.rb
+res/sqlite3/driver/native/driver.rb
+res/sqlite3/errors.rb
+res/sqlite3/pragmas.rb
+res/sqlite3/resultset.rb
+res/sqlite3/sqlite3_api.rb
+res/sqlite3/statement.rb
+res/sqlite3/translator.rb
+res/sqlite3/value.rb
+res/sqlite3/version.rb
+rhodes-framework.gemspec
+rhodes.gemspec
+spec/app_manifest.txt
+spec/configs/account.rb
+spec/configs/case.rb
+spec/configs/employee.rb
+spec/rho_controller_spec.rb
+spec/rho_spec.rb
+spec/rhom_object_factory_spec.rb
+spec/rhom_spec.rb
+spec/spec.opts
+spec/spec_helper.rb
+spec/stubs.rb
+spec/syncdbtest.sqlite

data/README.rdoc

@@ -0,0 +1,2 @@
+= rhodes framework
+ * See rhodes/README.rdoc for more information

data/Rakefile

@@ -0,0 +1,50 @@
+%w[rubygems rake rake/clean fileutils newgem].each { |f| require f }
+$:.unshift(File.join(File.dirname(__FILE__), 'lib'))
+require 'lib/version.rb'
+require 'rhodes-build'
+
+task :default => [:spec]
+
+# Generate all the Rake tasks
+# Run 'rake -T' to see list of generated tasks (from gem root directory)
+$hoe = Hoe.new('rhodes-framework', RhodesFramework::VERSION) do |p|
+  p.developer('Rhomobile Dev', 'dev@rhomobile.com')
+  p.changes              = p.paragraphs_of("../History.txt", 0..1).join("\n\n")  if File.exists? "../History.txt"
+  #p.post_install_message = 'PostInstall.txt' # TODO remove if post-install message not required
+  p.rubyforge_name       = p.name # TODO this is default value
+  p.extra_deps         = [
+    ['sqlite3-ruby','= 1.2.3'],
+    ['rcov'],
+    ['rspec'],
+    ['diff-lcs'],
+    ['extlib'],
+    ['newgem'],
+    ['activesupport']
+  ]
+  
+  p.clean_globs |= %w[**/.DS_Store tmp *.log]
+  path = (p.rubyforge_name == p.name) ? p.rubyforge_name : "\#{p.rubyforge_name}/\#{p.name}"
+  p.remote_rdoc_dir = File.join(path.gsub(/^#{p.rubyforge_name}\/?/,''), 'rdoc')
+  p.rsync_args = '-av --delete --ignore-errors'
+  p.test_globs = ''
+  p.summary = "rhodes-framework #{RhodesFramework::VERSION}"
+  
+end
+
+require 'newgem/tasks' # load /tasks/*.rake
+# remove test task TODO: why does this run anyway?
+Rake.application.remove_task(:test)
+Dir['tasks/**/*.rake'].each { |t| load t }
+
+desc "Run the specs under spec"
+Spec::Rake::SpecTask.new do |t|
+  t.spec_opts = ['--options', "spec/spec.opts"]
+  t.spec_files = FileList['spec/**/*_spec.rb']
+  t.rcov = true
+  t.rcov_opts = ['--include',
+                 '"lib/rhom/*,lib/rho/*"',
+                 '-x',
+                 'spec,gems,sqlite3/*,lib/date.rb,lib/rational.rb,lib/time.rb,lib/find.rb,config.rb,lib/erb.rb,lib/singleton.rb,lib/pairparser.rb',
+                 '--text-report',
+                 '--html']
+end

data/lib/ServeME.rb

@@ -0,0 +1,7 @@
+begin
+	require 'rho'
+	puts 'RHO loaded'
+	Rho::RHO.new
+rescue Exception => e
+	puts e.message
+end

data/lib/TestServe.rb

@@ -0,0 +1,9 @@
+require 'rho'
+puts 'RHO loaded'
+r = Rho::RHO.new
+req = Hash.new
+req['application']="Rhosugar"
+req['model'] = 'Account'
+req['request-method']='GET'
+puts r.serve(req)
+

data/lib/bsearch.rb

@@ -0,0 +1,120 @@
+#
+# Ruby/Bsearch - a binary search library for Ruby.
+#
+# Copyright (C) 2001 Satoru Takabayashi <satoru@namazu.org>
+#     All rights reserved.
+#     This is free software with ABSOLUTELY NO WARRANTY.
+#
+# You can redistribute it and/or modify it under the terms of
+# the Ruby's licence.
+#
+# Example:
+#
+#  % irb -r ./bsearch.rb
+#  >> %w(a b c c c d e f).bsearch_first {|x| x <=> "c"}
+#  => 2
+#  >> %w(a b c c c d e f).bsearch_last {|x| x <=> "c"}
+#  => 4
+#  >> %w(a b c e f).bsearch_first {|x| x <=> "c"}
+#  => 2
+#  >> %w(a b e f).bsearch_first {|x| x <=> "c"}
+#  => nil
+#  >> %w(a b e f).bsearch_last {|x| x <=> "c"}
+#  => nil
+#  >> %w(a b e f).bsearch_lower_boundary {|x| x <=> "c"}
+#  => 2
+#  >> %w(a b e f).bsearch_upper_boundary {|x| x <=> "c"}
+#  => 2
+#  >> %w(a b c c c d e f).bsearch_range {|x| x <=> "c"}
+#  => 2...5
+#  >> %w(a b c d e f).bsearch_range {|x| x <=> "c"}
+#  => 2...3
+#  >> %w(a b d e f).bsearch_range {|x| x <=> "c"}
+#  => 2...2
+
+module Bsearch
+  VERSION = '1.5'
+end
+
+class Array
+  #
+  # The binary search algorithm is extracted from Jon Bentley's
+  # Programming Pearls 2nd ed. p.93
+  #
+
+  #
+  # Return the lower boundary. (inside)
+  #
+  def bsearch_lower_boundary (range = 0 ... self.length, &block)
+    lower  = range.first() -1
+    upper = if range.exclude_end? then range.last else range.last + 1 end
+    while lower + 1 != upper
+      mid = ((lower + upper) / 2).to_i # for working with mathn.rb (Rational)
+      if yield(self[mid]) < 0
+	lower = mid
+      else
+	upper = mid
+      end
+    end
+    return upper
+  end
+
+  #
+  # This method searches the FIRST occurrence which satisfies a
+  # condition given by a block in binary fashion and return the
+  # index of the first occurrence. Return nil if not found.
+  #
+  def bsearch_first (range = 0 ... self.length, &block)
+    boundary = bsearch_lower_boundary(range, &block)
+    if boundary >= self.length || yield(self[boundary]) != 0
+      return nil
+    else
+      return boundary
+    end
+  end
+
+  alias bsearch bsearch_first
+
+  #
+  # Return the upper boundary. (outside)
+  #
+  def bsearch_upper_boundary (range = 0 ... self.length, &block)
+    lower  = range.first() -1
+    upper = if range.exclude_end? then range.last else range.last + 1 end
+    while lower + 1 != upper
+      mid = ((lower + upper) / 2).to_i # for working with mathn.rb (Rational)
+      if yield(self[mid]) <= 0
+	lower = mid
+      else
+	upper = mid
+      end
+    end
+    return lower + 1 # outside of the matching range.
+  end
+
+  #
+  # This method searches the LAST occurrence which satisfies a
+  # condition given by a block in binary fashion and return the
+  # index of the last occurrence. Return nil if not found.
+  #
+  def bsearch_last (range = 0 ... self.length, &block)
+    # `- 1' for canceling `lower + 1' in bsearch_upper_boundary.
+    boundary = bsearch_upper_boundary(range, &block) - 1
+
+    if (boundary <= -1 || yield(self[boundary]) != 0)
+      return nil
+    else
+      return boundary
+    end
+  end
+
+  #
+  # Return the search result as a Range object.
+  #
+  def bsearch_range (range = 0 ... self.length, &block)
+    lower = bsearch_lower_boundary(range, &block)
+    upper = bsearch_upper_boundary(range, &block)
+    return lower ... upper
+  end
+end
+