== SYNOPSIS: require 'rubygems' require 'google_query' # See how you get spanked by the pound GoogleQuery::Currency.get 'AUD to GBP' => 1 U.S. dollar = 0.490484599 British pounds # Get population in Melbourne GoogleQuery::Population.get 'melbourne' => Population: 3,850,000 (Est.) (2nd) # Get the current time in London GoogleQuery::Time.get 'london' => 2:26 PM on Monday, July 30 # On the command line: bens-pb:~ ben$ gpop melbourne

Google Apps Single Sign-on (SSO) support.

A class of ranks in the board game Go

Gossamer is a web framework that emphasizes the use of distributed, independent resources. With Gossamer, you construct websites out of a network of lightweight objects that manage particular resources. Resources can utilize other resources through fault-tolerant, loosely coupled RESTful[http://en.wikipedia.org/wiki/Representational_State_Transfer] communications. Resource brokers manage the resource objects, storing them in a distributed cache (eg, <tt>memcache</tt>). Resources can easily serve their content in multiple formats, such as HTML, Atom, and RDF. Gossamer is intended to be a useful platform for aggregators, mashups, web services, implementing the semantic web, and other applications that depend on external network resources rather than internal databases.

Library to broadcast messages to multiple destinations + scripts that use it

== FEATURES/PROBLEMS: * Partial string matching * The algorithm is not particularly performant == SYNOPSIS: require 'goto_string' s = %w(goto_string is a small library that implements a substring matching and ranking algorithm. The matching and ranking is similar to that found in Quicksilver or TextMate) GotoString::Matcher.match('string', s) #=> [["goto_string", "goto_string", 0.679259259259259, [["string", 5]]], ["substring", "substring", 0.461481481481481, [["s", 0], ["tring", 4]]]] An array is returned which contains one entry for each match. Matches are ordered by rank. Each match is itself an array, containing the following elements: [ "original candidate", "matched string", rank, [["substring_1", offset], ["substring_2", offset], ... ] ] You can optionally pass a block to the match method which will get each candidate passed to it. The return value of the block is what will be used for matching. This is so you can pass in arrays of complex objects as candidates: GotoString::Matcher.match( "goto", Project.find(:all) ) do |p| p.name end The resulting matches will contain a reference to the matched string (the project name) as well as the project (the original candidate) == REQUIREMENTS: * None

Working with OmniGraffle documents, including support for Rails integration tests.

Graphviz wrapper for Ruby. This can be used as a common library, a rails plugin and a command line tool. == FEATURES/PROBLEMS: GraphvizR is graphviz adapter for Ruby, and it can: * generate a graphviz dot file, * generate an image file by means of utilizing graphviz, * interprete rdot file and generate an image file, * and, generate a graph image file in rails application as a rails plugin. == SYNOPSYS: === Command Line: bin/graphviz_r sample/record.rdot === In Your Code: This ruby code: gvr = GraphvizR.new 'sample' gvr.graph [:label => 'example', :size => '1.5, 2.5'] gvr.beta [:shape => :box] gvr.alpha >> gvr.beta (gvr.beta >> gvr.delta) [:label => 'label1'] gvr.delta >> gvr.gamma gvr.to_dot replies the dot code: digraph sample { graph [label = "example", size = "1.5, 2.5"]; beta [shape = box]; alpha -> beta; beta -> delta [label = "label1"]; delta -> gamma; } To know more detail, please see test/test_graphviz_r.rb === On Rails : <b>use _render :rdot_ in controller</b> def show_graph render :rdot do graph [:size => '1.5, 2.5'] node [:shape => :record] node1 [:label => "<p_left> left|<p_center>center|<p_right> right"] node2 [:label => "left|center|right"] node1 >> node2 node1(:p_left) >> node2 node2 >> node1(:p_center) (node2 >> node1(:p_right)) [:label => 'record'] end end <b>use rdot view template</b> class RdotGenController < ApplicationController def index @label1 = "<p_left> left|<p_center>center|<p_right> right" @label2 = "left|center|right" end end # view/rdot_gen/index.rdot graph [:size => '1.5, 2.5'] node [:shape => :record] node1 [:label => @label1] node2 [:label => @label2] node1 >> node2 node1(:p_left) >> node2 node2 >> node1(:p_center) (node2 >> node1(:p_right)) [:label => 'record'] == DEPENDENCIES: * Graphviz (http://www.graphviz.org) == TODO: == INSTALL: * sudo gem install graphviz_r * if you want to use this in ruby on rails * script/plugin install http://technohippy.net/svn/repos/graphviz_r/trunk/vendor/plugins/rdot == LICENSE: (The MIT License)

The (GitHub) REpo Manager grabs repos and stores them according to my conventions.

The Grepper class greps through files, and returns a result set of Grepper::Result objects. Each Result object represents the matches found in a single file. The Result contains a set of Grepper::Match objects. Each Match object represents a line (the line that matched) and before- and after-context arrays. If no before or after lines were requested, those context values will be nil. To use, you prepare a Grepper object; call <tt>run</tt> on it; and walk through the result set. This distribution comes with the Grepper::Formatter class, which is built on top of Grepper and provides fairly canonical-looking output by walking through Grepper objects. (See <tt>lib/formatter.rb</tt>.) Meanwhile, here are the details.

Easy floatable grid structures for Rails. Don't have too much data to display but still need to fill up that screen? Why don't you present your data in a grid of boxes. Provided you color them right, boxes are very easy to the eyes because the mind understands its structure. Add to that custom coloring, (e.g. each controller can have its own color) background images and clickable boxes and you have a navigation that is not only great looking, but is also very easy to use on touchpad-enabled devices such as an iPad. This is what it looks like: https://github.com/cmdjohnson/gridomatic/blob/master/screenshots/overview.png

* A regex based parser that processes the ITunes Music Library.xml file and generates a sqlite3 database for additional data mining. Also generates treemaps from data parsed.

* A regex based parser that processes the ITunes Music Library.xml file and generates a sqlite3 database for additional data mining.

== DESCRIPTION: Wrapper library for myID.net's Group ID API == FEATURES/PROBLEMS: * TBD == SYNOPSIS: require 'group_open_id' # Initialize a client GroupOpenID::Client.app_key = 'your_application_key' client = GroupOpenID::Client.new('user_open_id_url', 'user_key') group_id = GroupOpenID::URI.new('http://ruby.myid.net', client) # Get the membership location puts group_id.membership_location # => 'http://some.url/' # Get member lists puts group_id.members # => array of GroupOpenID::Member # Determine where a given open_id is the member of a group id puts group_id.member?('http://deepblue.myid.net') # => true

Easy configuration of Growl + Autotest

A ruby library which allows you to send Growl notifications.

== FEATURES/PROBLEMS: == SYNOPSIS: * gtdfiles --process C:\GTD * gtdfiles --simulate --process C:\GTD * gtdfiles --reset C:\GTD == REQUIREMENTS:

- Why? I was using RMagick and loving it, but it was eating up huge amounts of memory. A simple script like this... Magick::read("image.jpg") do |f| f.write("manipulated.jpg") end ...would use over 100 Megs of Ram. On my local machine this wasn't a problem, but on my hosting server the ruby apps would crash because of their 100 Meg memory limit.

The gem to ease of some git actions on multi-modules project with separate repository per module. Can be used to check status or existence of commits within modules not pushed yet, also to pull all repositories at once.

The gem to ease of some git actions on multi-modules project with separate repository per module. Can be used to check status or existence of commits within modules not pushed yet, also to pull all repositories at once.