rubycas-server 0.7.1.1 → 1.0

data/script/console

@@ -1,10 +0,0 @@
-#!/usr/bin/env ruby
-# File: script/console
-irb = RUBY_PLATFORM =~ /(:?mswin|mingw)/ ? 'irb.bat' : 'irb'
-
-libs =  " -r irb/completion"
-# Perhaps use a console_lib to store any extra methods I may want available in the cosole
-# libs << " -r #{File.dirname(__FILE__) + '/../lib/console_lib/console_logger.rb'}"
-libs <<  " -r #{File.dirname(__FILE__) + '/../lib/rubycas-server.rb'}"
-puts "Loading rubycas-server gem"
-exec "#{irb} #{libs} --simple-prompt"

data/script/destroy

@@ -1,14 +0,0 @@
-#!/usr/bin/env ruby
-APP_ROOT = File.expand_path(File.join(File.dirname(__FILE__), '..'))
-
-begin
-  require 'rubigen'
-rescue LoadError
-  require 'rubygems'
-  require 'rubigen'
-end
-require 'rubigen/scripts/destroy'
-
-ARGV.shift if ['--help', '-h'].include?(ARGV[0])
-RubiGen::Base.use_component_sources! [:rubygems, :newgem, :newgem_theme, :test_unit]
-RubiGen::Scripts::Destroy.new.run(ARGV)

data/script/generate

@@ -1,14 +0,0 @@
-#!/usr/bin/env ruby
-APP_ROOT = File.expand_path(File.join(File.dirname(__FILE__), '..'))
-
-begin
-  require 'rubigen'
-rescue LoadError
-  require 'rubygems'
-  require 'rubigen'
-end
-require 'rubigen/scripts/generate'
-
-ARGV.shift if ['--help', '-h'].include?(ARGV[0])
-RubiGen::Base.use_component_sources! [:rubygems, :newgem, :newgem_theme, :test_unit]
-RubiGen::Scripts::Generate.new.run(ARGV)

data/script/txt2html

@@ -1,82 +0,0 @@
-#!/usr/bin/env ruby
-
-GEM_NAME = 'rubycas-server' # what ppl will type to install your gem
-RUBYFORGE_PROJECT = 'rubycas-server'
-
-require 'rubygems'
-begin
-  require 'newgem'
-  require 'rubyforge'
-rescue LoadError
-  puts "\n\nGenerating the website requires the newgem RubyGem"
-  puts "Install: gem install newgem\n\n"
-  exit(1)
-end
-require 'redcloth'
-require 'syntax/convertors/html'
-require 'erb'
-require File.dirname(__FILE__) + "/../lib/#{GEM_NAME}/version.rb"
-
-version  = CASServer::VERSION::STRING
-download = "http://rubyforge.org/projects/#{RUBYFORGE_PROJECT}"
-
-def rubyforge_project_id
-  RubyForge.new.autoconfig["group_ids"][RUBYFORGE_PROJECT]
-end
-
-class Fixnum
-  def ordinal
-    # teens
-    return 'th' if (10..19).include?(self % 100)
-    # others
-    case self % 10
-    when 1: return 'st'
-    when 2: return 'nd'
-    when 3: return 'rd'
-    else    return 'th'
-    end
-  end
-end
-
-class Time
-  def pretty
-    return "#{mday}#{mday.ordinal} #{strftime('%B')} #{year}"
-  end
-end
-
-def convert_syntax(syntax, source)
-  return Syntax::Convertors::HTML.for_syntax(syntax).convert(source).gsub(%r!^<pre>|</pre>$!,'')
-end
-
-if ARGV.length >= 1
-  src, template = ARGV
-  template ||= File.join(File.dirname(__FILE__), '/../website/template.html.erb')
-else
-  puts("Usage: #{File.split($0).last} source.txt [template.html.erb] > output.html")
-  exit!
-end
-
-template = ERB.new(File.open(template).read)
-
-title = nil
-body = nil
-File.open(src) do |fsrc|
-  title_text = fsrc.readline
-  body_text_template = fsrc.read
-  body_text = ERB.new(body_text_template).result(binding)
-  syntax_items = []
-  body_text.gsub!(%r!<(pre|code)[^>]*?syntax=['"]([^'"]+)[^>]*>(.*?)</\1>!m){
-    ident = syntax_items.length
-    element, syntax, source = $1, $2, $3
-    syntax_items << "<#{element} class='syntax'>#{convert_syntax(syntax, source)}</#{element}>"
-    "syntax-temp-#{ident}"
-  }
-  title = RedCloth.new(title_text).to_html.gsub(%r!<.*?>!,'').strip
-  body = RedCloth.new(body_text).to_html
-  body.gsub!(%r!(?:<pre><code>)?syntax-temp-(\d+)(?:</code></pre>)?!){ syntax_items[$1.to_i] }
-end
-stat = File.stat(src)
-created = stat.ctime
-modified = stat.mtime
-
-$stdout << template.result(binding)

data/tasks/deployment.rake

@@ -1,34 +0,0 @@
-desc 'Release the website and new gem version'
-task :deploy => [:check_version, :website, :release] do
-  puts "Remember to create SVN tag:"
-  puts "svn copy svn+ssh://#{rubyforge_username}@rubyforge.org/var/svn/#{PATH}/trunk " +
-    "svn+ssh://#{rubyforge_username}@rubyforge.org/var/svn/#{PATH}/tags/REL-#{VERS} "
-  puts "Suggested comment:"
-  puts "Tagging release #{CHANGES}"
-end
-
-desc 'Runs tasks website_generate and install_gem as a local deployment of the gem'
-task :local_deploy => [:website_generate, :install_gem]
-
-task :check_version do
-  unless ENV['VERSION']
-    puts 'Must pass a VERSION=x.y.z release version'
-    exit
-  end
-  unless ENV['VERSION'] == VERS
-    puts "Please update your version.rb to match the release version, currently #{VERS}"
-    exit
-  end
-end
-
-desc 'Install the package as a gem, without generating documentation(ri/rdoc)'
-task :install_gem_no_doc => [:clean, :package] do
-  sh "#{'sudo ' unless Hoe::WINDOZE }gem install pkg/*.gem --no-rdoc --no-ri"
-end
-
-namespace :manifest do
-  desc 'Recreate Manifest.txt to include ALL files'
-  task :refresh do
-    `rake check_manifest | patch -p0 > Manifest.txt`
-  end
-end

data/tasks/environment.rake

@@ -1,7 +0,0 @@
-task :ruby_env do
-  RUBY_APP = if RUBY_PLATFORM =~ /java/
-    "jruby"
-  else
-    "ruby"
-  end unless defined? RUBY_APP
-end

data/tasks/website.rake

@@ -1,17 +0,0 @@
-desc 'Generate website files'
-task :website_generate => :ruby_env do
-  (Dir['website/**/*.txt'] - Dir['website/version*.txt']).each do |txt|
-    sh %{ #{RUBY_APP} script/txt2html #{txt} > #{txt.gsub(/txt$/,'html')} }
-  end
-end
-
-desc 'Upload website files to rubyforge'
-task :website_upload do
-  host = "#{rubyforge_username}@rubyforge.org"
-  remote_dir = "/var/www/gforge-projects/#{PATH}/"
-  local_dir = 'website'
-  sh %{rsync -aCv #{local_dir}/ #{host}:#{remote_dir}}
-end
-
-desc 'Generate and upload website files'
-task :website => [:website_generate, :website_upload, :publish_docs]

data/vendor/isaac_0.9.1/LICENSE

@@ -1,26 +0,0 @@
-Copyright (c) 2004 - 2005 Kirk Haines (khaines@enigo.com)
-
-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.
-
-For details about the ISAAC algorithm itself, see:
-
-http://burtleburtle.net/bob/rand/isaac.html
-
-
-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/vendor/isaac_0.9.1/README

@@ -1,78 +0,0 @@
-Crypt::ISAAC README
-============
-
-ISAAC is a cryptographically secure PRNG for generating high quality random
-numbers.  Detailed information about the algorithm can be found at:
-
-http://burtleburtle.net/bob/rand/isaac.html
-
-This is a pure Ruby implementation of the algorithm.  It is reasonably fast for
-a pure Ruby implementation.  On an 800Mhz PIII computer running Ruby 1.8.2,
-and while the machine is also serving as general desktop, the library seems to
-consistently generate between 15000 and 16000 random numbers per second.
-
-Ruby uses the Mersenne Twister as its PRNG, and while this the Twister is
-a fast PRNG that produces highly random numbers, it is not strong for
-cryptographic purposes, nor is it suitable when one needs multiple
-independent streams of random numbers.  Crypt::ISAAC is suitable for either
-purpose.
-
-
-Requirements
-------------
-
-  * Ruby 1.8 (should also run on 1.6.x)
-
-
-Install
--------
-
-  If you have never installed Crypt::ISAAC, you may run the testsuite
-  to confirm that it works with:
-
-    # ruby setup.rb test
-
-  If you already have a version of Crypt::ISAAC installed, but want to
-  confirm this one before installing, run the test suite manually as
-  follows:
-
-    # ruby test/TC_ISAAC.rb local
-
-  When you are ready to install Crypt::ISAAC, type:
-
-    # ruby setup.rb install
-
-  This one step will install Crypt::ISAAC in your Ruby SITELIB.  To test
-  the library after installation:
-
-    # ruby setup.rb test
-
-Usage
------
-
-require 'crypt/ISAAC'
-
-rng = Crypt::ISAAC.new
-
-r1 = rng.rand() # returns a floating point between 0 and 1
-r2 = rnd.rand(1000) # returns an integer between 0 and 999
-
-rand() should work identically to the Kernel.rand().
-
-Enjoy it.  Let me know if you find anything that can be improved or that
-needs to be fixed.
-
-
-License
--------
-
-The Crypt::ISAAC library is licensed with an MIT style licence.
-See the LICENSE file for details.  As for the ISAAC algorithm itself,
-see:
-
-http://burtleburtle.net/bob/rand/isaac.html
-
-
-
-Kirk Haines
-khaines@enigo.com

data/vendor/isaac_0.9.1/TODO

@@ -1,3 +0,0 @@
-*	Add a C version of the ISAAC algorithm and make it possible to install
-	the pure Ruby version and/or a version using a C extension for better
-	performance.

data/vendor/isaac_0.9.1/VERSIONS

@@ -1,3 +0,0 @@
-* 0.9		Initial public release.  Pure Ruby.
-* 0.9.1		Update to tweak a couple things and reorganize project struct.
-		Now uses a Package based installer, or can be installed as a gem.

data/vendor/isaac_0.9.1/crypt/ISAAC.rb

@@ -1,171 +0,0 @@
-module Crypt
-
-	# ISAAC is a fast, strong random number generator.  Details on the
-	# algorithm can be found here: http://burtleburtle.net/bob/rand/isaac.html
-	# This provides a consistent and capable algorithm for producing
-	# independent streams of quality random numbers.
-
-	class ISAAC
-
-		attr_accessor :randrsl, :randcnt
-		attr_accessor :mm, :aa, :bb, :cc
-
-		# When a Crypt::ISAAC object is created, it needs to be seeded for
-		# random number generation.  If the system has a /dev/urandom file,
-		# that will be used to do the seeding by default.  If false is explictly
-		# passed when creating the object, it will instead use /dev/random to
-		# generate its seeds.  Be warned that this may make for SLOW
-		# initialization.
-		# If the requested source (/dev/urandom or /dev/random) do not exist,
-		# the system will fall back to a simplistic initialization mechanism
-		# using the builtin Mersenne Twister PRNG.
-
-		def initialize(noblock = true)
-			@mm = []
-			@randrsl = []
-			# Best initialization of the generator would be by pulling
-			# numbers from /dev/random.
-			rnd_source = noblock ? '/dev/urandom' : '/dev/random'
-			if (FileTest.exist? rnd_source)
-				File.open(rnd_source,'r') do |r|
-					256.times do |t|
-						z = r.read(4)
-						x = z.unpack('V')[0]
-						@randrsl[t] = x
-					end
-				end
-			else
-				# If urandom isn't available, the standard Ruby PRNG makes an
-				# adequate fallback.
-				256.times do |t|
-					@randrsl[t] = Kernel.rand(4294967295)
-				end
-			end
-			randinit(true)
-			nil
-		end
-
-		# Works just like the standard rand() function.  If called with an
-		# integer argument, rand() will return positive random number in
-		# the range of 0 to (argument - 1).  If called without an integer
-		# argument, rand() returns a positive floating point number less than 1.
-  
-		def rand(*num)
-			if (@randcnt == 1)
-				isaac
-				@randcnt = 256
-			end
-			@randcnt -= 1
-			if num[0].to_i > 0
-				@randrsl[@randcnt].modulo(num[0])
-			else
-				".#{@randrsl[@randcnt]}".to_f
-			end
-		end
-
-		def isaac
-			i = 0
-			x = 0
-			y = 0
-
-			@cc += 1
-			@bb += @cc
-			@bb & 0xffffffff
-
-			while (i < 256) do 
-				x = @mm[i]
-				@aa = (@mm[(i + 128) & 255] + (@aa^(@aa << 13)) ) & 0xffffffff
-				@mm[i] = y = (@mm[(x>>2)&255] + @aa + @bb ) & 0xffffffff
-				@randrsl[i] = @bb = (@mm[(y>>10)&255] + x ) & 0xffffffff
-				i += 1
-
-				x = @mm[i]
-				@aa = (@mm[(i+128)&255] + (@aa^(0x03ffffff & (@aa >> 6))) ) & 0xffffffff
-				@mm[i] = y = (@mm[(x>>2)&255] + @aa + @bb ) & 0xffffffff
-				@randrsl[i] = @bb = (@mm[(y>>10)&255] + x ) & 0xffffffff
-				i += 1
-
-				x = @mm[i]
-				@aa = (@mm[(i + 128)&255] + (@aa^(@aa << 2)) ) & 0xffffffff
-				@mm[i] = y = (@mm[(x>>2)&255] + @aa + @bb ) & 0xffffffff
-				@randrsl[i] = @bb = (@mm[(y>>10)&255] + x ) & 0xffffffff
-				i += 1
-
-				x = @mm[i]
-				@aa = (@mm[(i+128)&255] + (@aa^(0x0000ffff & (@aa >> 16))) ) & 0xffffffff
-				@mm[i] = y = (@mm[(x>>2)&255] + @aa + @bb ) & 0xffffffff
-				@randrsl[i] = @bb = (@mm[(y>>10)&255] + x ) & 0xffffffff
-				i += 1
-			end
-		end
-
-		def randinit(flag)
-			i = 0
-			a = 0
-			b = 0
-			c = 0
-			d = 0
-			e = 0
-			f = 0
-			g = 0
-			@aa = @bb = @cc = 0
-			a = b = c = d = e = f = g = h = 0x9e3779b9
-
-			while (i < 4) do
-				a ^= b<<1; d += a; b += c
-				b ^= 0x3fffffff & (c>>2); e += b; c += d
-				c ^= d << 8; f += c; d += e
-				d ^= 0x0000ffff & (e >> 16); g += d; e += f
-				e ^= f << 10; h += e; f += g
-				f ^= 0x0fffffff & (g >> 4); a += f; g += h
-				g ^= h << 8; b += g; h += a
-				h ^= 0x007fffff & (a >> 9); c += h; a += b
-				i += 1
-			end
-
-			i = 0
-			while (i < 256) do
-				if (flag)
-					a+=@randrsl[i  ].to_i; b+=@randrsl[i+1].to_i;
-					c+=@randrsl[i+2]; d+=@randrsl[i+3];
-					e+=@randrsl[i+4]; f+=@randrsl[i+5];
-					g+=@randrsl[i+6]; h+=@randrsl[i+7];
-				end
-
-				a^=b<<11; d+=a; b+=c;
-				b^=0x3fffffff & (c>>2);  e+=b; c+=d;
-				c^=d<<8;  f+=c; d+=e;
-				d^=0x0000ffff & (e>>16); g+=d; e+=f;
-				e^=f<<10; h+=e; f+=g;
-				f^=0x0fffffff & (g>>4);  a+=f; g+=h;
-				g^=h<<8;  b+=g; h+=a;
-				h^=0x007fffff & (a>>9);  c+=h; a+=b;
-				@mm[i]=a;@mm[i+1]=b; @mm[i+2]=c; @mm[i+3]=d;
-				@mm[i+4]=e; @mm[i+5]=f; @mm[i+6]=g; @mm[i+7]=h;
-				i += 8
-			end
-
-			if flag
-				i = 0
-				while (i < 256)
-					a+=@mm[i  ]; b+=@mm[i+1]; c+=@mm[i+2]; d+=@mm[i+3];
-					e+=@mm[i+4]; f+=@mm[i+5]; g+=@mm[i+6]; h+=@mm[i+7];
-					a^=b<<11; d+=a; b+=c;
-					b^=0x3fffffff & (c>>2);  e+=b; c+=d;
-					c^=d<<8;  f+=c; d+=e;
-					d^=0x0000ffff & (e>>16); g+=d; e+=f;
-					e^=f<<10; h+=e; f+=g;
-					f^=0x0fffffff & (g>>4);  a+=f; g+=h;
-					g^=h<<8;  b+=g; h+=a;
-					h^=0x007fffff & (a>>9);  c+=h; a+=b;
-					@mm[i  ]=a; @mm[i+1]=b; @mm[i+2]=c; @mm[i+3]=d;
-					@mm[i+4]=e; @mm[i+5]=f; @mm[i+6]=g; @mm[i+7]=h;
-					i += 8
-				end
-			end
-
-  		isaac()
-   		@randcnt=256;        # /* prepare to use the first set of results */
-		end
-	end
-end